Strongly sequential and inductively sequential term rewriting systems

DOI10.1016/S0020-0190(98)00016-7zbMath1339.68136MaRDI QIDQ293294

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

zbMATH Keywords

term rewritingdeclarative programmingdefinitional treesneedednessstrong sequentiality

Mathematics Subject Classification ID

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

Related Items (9)

A Needed Rewriting Strategy for Data-Structures with Pointers ⋮ Unnamed Item ⋮ Evaluation strategies for functional logic programming ⋮ Lazy productivity via termination ⋮ Strong and NV-sequentiality of constructor systems ⋮ Evaluation Strategies for Functional Logic Programming ⋮ Reduction Strategies for Declarative Programming ⋮ Lazy Rewriting and Context-Sensitive Rewriting ⋮ Context-sensitive rewriting strategies

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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly sequential and inductively sequential term rewriting systems