A refinement of strong sequentiality for term rewriting with constructors
The paper introduces a refined version of strong sequentiality for term rewriting systems, and this version is called left sequentiality. The difference is that left sequentiality is based on possible rather than arbitrary sequences of reductions. The results of the paper indicate that the left and strong sequentiality coincide when considered as properties of admissible sets of left-hand sides for systems of equations, but that left sequentiality is more general when applied to individual terms. It is shown that, improving on Huet and Levy's result, there is no redex selection algorithm which is safe for all systems based on a set of left- hand sides if that set is not left sequential.
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Sequentiality in orthogonal term rewriting systems
- Strongly sequential and inductively sequential term rewriting systems
- Programming in equational logic: Beyond strong sequentiality
- A Machine-Oriented Logic Based on the Resolution Principle
- A new implementation technique for applicative languages
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- scientific article; zbMATH DE number 3679159 (Why is no real title available?)
- scientific article; zbMATH DE number 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 3566181 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Implementation of an interpreter for abstract equations
- On the correspondence between two classes of reduction systems
- Implementing first-order rewriting with constructor systems
- Full abstraction and limiting completeness in equational languages
- Sequentiality in orthogonal term rewriting systems
- Semantics and strong sequentiality of priority term rewriting systems
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- Bounded, strongly sequential and forward-branching term rewriting systems
- Compact normalisation trace via lazy rewriting
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
- Open problems in rewriting
- Optimal normalization in orthogonal term rewriting systems
- Semantics and strong sequentially of priority term rewriting systems
- Constructor equivalent term rewriting systems
This page was built for publication: A refinement of strong sequentiality for term rewriting with constructors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1093366)