Infinite normal forms for non-linear term rewriting systems
From MaRDI portal
Publication:672235
DOI10.1016/0304-3975(94)00244-6zbMATH Open0872.68076OpenAlexW2004273699MaRDI QIDQ672235FDOQ672235
Authors: P. Inverardi, Monica Nesi 
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00244-6
Recommendations
Cites Work
- Title not available (Why is that?)
- Fundamental properties of infinite trees
- Branching time and abstraction in bisimulation semantics
- Title not available (Why is that?)
- A complete axiomatisation for observational congruence of finite-state behaviours
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
- Rational rewriting
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transfinite reductions in orthogonal term rewriting systems
- Deciding observational congruence of finite-state CCS expressions by rewriting
- A rewriting strategy to verify observational congruence
Cited In (7)
- Title not available (Why is that?)
- Normalization of Infinite Terms
- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
- Infinite terms and infinite rewritings
- Lifting infinite normal form definitions from term rewriting to term graph rewriting
- Title not available (Why is that?)
- Unique normal forms for nonlinear term rewriting systems: Root overlaps
This page was built for publication: Infinite normal forms for non-linear term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672235)
