Strongly sequential and inductively sequential term rewriting systems

DOI10.1016/S0020-0190(98)00016-7MaRDI QIDQ293294zbMATH OpenFDO

Authors Michael Hanus, Salvador Lucas, Aart Middeldorp

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

zbMATH Keywords

term rewritingdeclarative programmingdefinitional treesneedednessstrong sequentiality

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42)

Recommendations

• Inductively Sequential Term-Graph Rewrite Systems
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof
• scientific article; zbMATH DE number 2090086
• Sequentiality in orthogonal term rewriting systems
• Constructor equivalent term rewriting systems

Cites work

• scientific article; zbMATH DE number 4037157 (Why is no real title available?)
• scientific article; zbMATH DE number 599028 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• A needed narrowing strategy
• Bounded, strongly sequential and forward-branching term rewriting systems
• Classes of equational programs that compile into efficient machine code
• Sequentiality in orthogonal term rewriting systems

Cited in

(18)

• Sequentiality in orthogonal term rewriting systems
• scientific article; zbMATH DE number 2087241 (Why is no real title available?)
• Lazy rewriting and context-sensitive rewriting
• Lazy productivity via termination
• Functional and Logic Programming
• A refinement of strong sequentiality for term rewriting with constructors
• Strong and NV-sequentiality of constructor systems
• Evaluation strategies for functional logic programming
• Bounded, strongly sequential and forward-branching term rewriting systems
• A Needed Rewriting Strategy for Data-Structures with Pointers
• Inductively Sequential Term-Graph Rewrite Systems
• Semantics and strong sequentiality of priority term rewriting systems
• Reduction strategies for declarative programming
• Evaluation strategies for functional logic programming
• Semantics and strong sequentially of priority term rewriting systems
• Constructor equivalent term rewriting systems are strongly sequential: A direct proof
• Needed computations shortcutting needed steps
• 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)