Constructor equivalent term rewriting systems

DOI10.1016/0020-0190(93)90236-3zbMath0780.68078OpenAlexW2010129996MaRDI QIDQ689634

Bruno Salinier, Irène Durand

Publication date: 15 November 1993

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

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90236-3

zbMATH Keywords

constructor systemequational programming

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• On the correspondence between two classes of reduction systems
• A refinement of strong sequentiality for term rewriting with constructors
• Sequentiality in orthogonal term rewriting systems
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof
• Bounded, strongly sequential and forward-branching term rewriting systems
• Classes of equational programs that compile into efficient machine code

This page was built for publication: Constructor equivalent term rewriting systems