Constructor equivalent term rewriting systems
From MaRDI portal
Recommendations
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- A refinement of strong sequentiality for term rewriting with constructors
- Efficient simulation of forward-branching systems with constructor systems
- Strong and NV-sequentiality of constructor systems
- On the correspondence between two classes of reduction systems
Cites work
- scientific article; zbMATH DE number 4074466 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- A refinement of strong sequentiality for term rewriting with constructors
- Bounded, strongly sequential and forward-branching term rewriting systems
- Classes of equational programs that compile into efficient machine code
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- On the correspondence between two classes of reduction systems
- Sequentiality in orthogonal term rewriting systems
Cited in
(8)- On the correspondence between two classes of reduction systems
- Implementing first-order rewriting with constructor systems
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- Strongly sequential and inductively sequential term rewriting systems
- scientific article; zbMATH DE number 7455704 (Why is no real title available?)
- Strong and NV-sequentiality of constructor systems
- On constructor rewrite systems and the lambda calculus
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
This page was built for publication: Constructor equivalent term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689634)
