A refinement of strong sequentiality for term rewriting with constructors

DOI10.1016/0890-5401(87)90050-2zbMath0628.68033OpenAlexW2064305670MaRDI QIDQ1093366

B. George

Publication date: 1987

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/26861

zbMATH Keywords

term rewriting systemsstrong sequentialityconstructor systemleft sequentialityredex selection algorithmsequential system

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items

Transforming strongly sequential rewrite systems with constructors for efficient parallel execution ⋮ Open problems in rewriting ⋮ Optimal normalization in orthogonal term rewriting systems ⋮ Implementing first-order rewriting with constructor systems ⋮ Full abstraction and limiting completeness in equational languages ⋮ Sequentiality in orthogonal term rewriting systems ⋮ Constructor equivalent term rewriting systems ⋮ Compact Normalisation Trace via Lazy Rewriting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the correspondence between two classes of reduction systems
• Implementation of an interpreter for abstract equations
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• A new implementation technique for applicative languages
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: A refinement of strong sequentiality for term rewriting with constructors