Strong and NV-sequentiality of constructor systems
From MaRDI portal
Recommendations
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- Transforming strongly sequential rewrite systems with constructors for efficient parallel execution
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Constructor equivalent term rewriting systems
- Efficient simulation of forward-branching systems with constructor systems
Cites work
- scientific article; zbMATH DE number 108369 (Why is no real title available?)
- scientific article; zbMATH DE number 599028 (Why is no real title available?)
- scientific article; zbMATH DE number 1380890 (Why is no real title available?)
- scientific article; zbMATH DE number 1889386 (Why is no real title available?)
- scientific article; zbMATH DE number 1405630 (Why is no real title available?)
- Bounded, strongly sequential and forward-branching term rewriting systems
- Classes of equational programs that compile into efficient machine code
- Context-sensitive rewriting strategies
- Decidable approximations of term rewriting systems
- Decidable call by need computations in term rewriting (extended abstract)
- Maude: specification and programming in rewriting logic
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Root-neededness and approximations of neededness
- Sequentiality in orthogonal term rewriting systems
- Sequentiality, monadic second-order logic and tree automata.
- Strongly sequential and inductively sequential term rewriting systems
Cited in
(2)
This page was built for publication: Strong and NV-sequentiality of constructor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029079)
