Constructor equivalent term rewriting systems are strongly sequential: A direct proof

DOI10.1016/0020-0190(94)00122-7zbMath0823.68048OpenAlexW1995788030MaRDI QIDQ1338780

Bruno Salinier, Irène Durand

Publication date: 20 November 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00122-7

zbMATH Keywords

term rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items

Constructor equivalent term rewriting systems

Cites Work

• Unnamed Item
• Constructor equivalent term rewriting systems
• On the correspondence between two classes of reduction systems
• Sequentiality in orthogonal term rewriting systems
• Classes of equational programs that compile into efficient machine code