Chew's theorem revisited: Uniquely normalizing property of nonlinear term rewriting systems

DOI10.1007/3-540-56279-6_84MaRDI QIDQ4246736zbMATH OpenFDO

Authors Mizuhito Ogawa

Publication date 15 June 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56279-6_84

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Grammars and rewriting systems (68Q42)

Recommendations

• Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
• Unique normal forms for nonlinear term rewriting systems: Root overlaps
• Conditional linearization
• On the modularity of normal forms in rewriting
• On the Normalization and Unique Normalization Properties of Term Rewrite Systems

Cited in

(4)

• On the Normalization and Unique Normalization Properties of Term Rewrite Systems
• Unique normal forms for nonlinear term rewriting systems: Root overlaps
• Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem
• Conditional linearization

This page was built for publication: Chew's theorem revisited: Uniquely normalizing property of nonlinear term rewriting systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4246736)