Strongly sequential and inductively sequential term rewriting systems

DOI10.1016/S0020-0190(98)00016-7zbMATH Open1339.68136MaRDI QIDQ293294FDOQ293294

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

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

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)

Cites Work

• Title not available (Why is that?)
• Sequentiality in orthogonal term rewriting systems
• Bounded, strongly sequential and forward-branching term rewriting systems
• A needed narrowing strategy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classes of equational programs that compile into efficient machine code

Cited In (18)

• A refinement of strong sequentiality for term rewriting with constructors
• 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
• Inductively Sequential Term-Graph Rewrite Systems
• Lazy rewriting and context-sensitive rewriting
• Functional and Logic Programming
• 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)