On the correspondence between two classes of reduction systems
From MaRDI portal
Recommendations
- Constructor equivalent term rewriting systems
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- scientific article; zbMATH DE number 4045104
- Efficient simulation of forward-branching systems with constructor systems
- Implementing first-order rewriting with constructor systems
Cites work
- scientific article; zbMATH DE number 3664336 (Why is no real title available?)
- A Machine-Oriented Logic Based on the Resolution Principle
- Abstract Implementations and Their Correctness Proofs
- Computing in systems described by equations
- Implementation of an interpreter for abstract equations
- Initial Algebra Semantics and Continuous Algebras
- Tree-Manipulating Systems and Church-Rosser Theorems
Cited in
(10)- Constructor equivalent term rewriting systems
- Implementing first-order rewriting with constructor systems
- A refinement of strong sequentiality for term rewriting with constructors
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- Reducible systems and embedding procedures in the canonical formalism
- Remarks on Thatte's transformation of term rewriting systems
- Interaction systems II: The practice of optimal reductions
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
- Inductive proofs by specification transformations
- Transformations and confluence for rewrite systems
This page was built for publication: On the correspondence between two classes of reduction systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059392)
