Implementing first-order rewriting with constructor systems

DOI10.1016/0304-3975(88)90109-0zbMath0659.68048OpenAlexW2011986039MaRDI QIDQ1112601

S. H. Smith

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

canonical systemsfunctional programmingterm rewriting systemsconstructor

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Combinatory logic and lambda calculus (03B40)

Related Items

Full abstraction and limiting completeness in equational languages ⋮ Transformations and confluence for rewrite systems ⋮ Remarks on Thatte's transformation of term rewriting systems

Uses Software

• Miranda

Cites Work

• Unnamed Item
• On the correspondence between two classes of reduction systems
• A refinement of strong sequentiality for term rewriting with constructors
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Programming with Equations
• A new implementation technique for applicative languages