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

DOI10.1016/0020-0190(94)00122-7MaRDI QIDQ1338780zbMATH OpenOpenAlexFDO

Authors Irène Durand, Bruno Salinier

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)

Recommendations

• Constructor equivalent term rewriting systems
• Strongly sequential and inductively sequential term rewriting systems
• Sequentiality in orthogonal term rewriting systems
• Efficient simulation of forward-branching systems with constructor systems
• A refinement of strong sequentiality for term rewriting with constructors

Cites work

• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• Classes of equational programs that compile into efficient machine code
• Constructor equivalent term rewriting systems
• On the correspondence between two classes of reduction systems
• Sequentiality in orthogonal term rewriting systems

Cited in

(8)

• A refinement of strong sequentiality for term rewriting with constructors
• Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
• Strong and NV-sequentiality of constructor systems
• Implementing first-order rewriting with constructor systems
• Constructor equivalent term rewriting systems
• scientific article; zbMATH DE number 2090086 (Why is no real title available?)
• Strongly sequential and inductively sequential term rewriting systems
• On the correspondence between two classes of reduction systems

This page was built for publication: Constructor equivalent term rewriting systems are strongly sequential: A direct proof

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