Infinite normal forms for non-linear term rewriting systems

DOI10.1016/0304-3975(94)00244-6zbMath0872.68076OpenAlexW2004273699MaRDI QIDQ672235

Monica Nesi, Paola Inverardi

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

zbMATH Keywords

nonorthogonal term rewriting systemsnonterminating rewrite relations

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding observational congruence of finite-state CCS expressions by rewriting
• A rewriting strategy to verify observational congruence
• Fundamental properties of infinite trees
• Rewrite, rewrite, rewrite, rewrite, rewrite, \dots
• A complete axiomatisation for observational congruence of finite-state behaviours
• Branching time and abstraction in bisimulation semantics
• Transfinite reductions in orthogonal term rewriting systems
• Rational rewriting