Strong and NV-sequentiality of constructor systems
From MaRDI portal
Publication:1029079
DOI10.1016/J.IPL.2003.11.006zbMATH Open1176.68097OpenAlexW1964852933MaRDI QIDQ1029079FDOQ1029079
Authors: Salvador Lucas 
Publication date: 9 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2003.11.006
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
- Maude: specification and programming in rewriting logic
- Title not available (Why is that?)
- Sequentiality in orthogonal term rewriting systems
- Bounded, strongly sequential and forward-branching term rewriting systems
- Strongly sequential and inductively sequential term rewriting systems
- Root-neededness and approximations of neededness
- NV-Sequentiality: A Decidable Condition for Call-by-Need Computations in Term-Rewriting Systems
- Title not available (Why is that?)
- Classes of equational programs that compile into efficient machine code
- Decidable approximations of term rewriting systems
- Decidable call by need computations in term rewriting (extended abstract)
- Title not available (Why is that?)
- Context-sensitive rewriting strategies
- Title not available (Why is that?)
- Sequentiality, monadic second-order logic and tree automata.
- Title not available (Why is that?)
Cited In (2)
Uses Software
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)
