Strongly sequential and inductively sequential term rewriting systems
From MaRDI portal
Publication:293294
DOI10.1016/S0020-0190(98)00016-7zbMATH Open1339.68136MaRDI QIDQ293294FDOQ293294
Aart Middeldorp, Michael Hanus, Salvador Lucas
Publication date: 9 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098000167?np=y
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)
Cites Work
- Sequentiality in orthogonal term rewriting systems
- Bounded, strongly sequential and forward-branching term rewriting systems
- A needed narrowing strategy
- Classes of equational programs that compile into efficient machine code
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- Lazy productivity via termination
- Title not available (Why is that?)
- Reduction strategies for declarative programming
- Semantics and strong sequentially of priority term rewriting systems
- Title not available (Why is that?)
- Evaluation strategies for functional logic programming
- A Needed Rewriting Strategy for Data-Structures with Pointers
- Semantics and strong sequentiality of priority term rewriting systems
- Sequentiality in orthogonal term rewriting systems
- Strong and NV-sequentiality of constructor systems
- Bounded, strongly sequential and forward-branching term rewriting systems
- Lazy rewriting and context-sensitive rewriting
- Evaluation strategies for functional logic programming
- Context-sensitive rewriting strategies
This page was built for publication: Strongly sequential and inductively sequential term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293294)
