Implementing term rewrite languages in DACTL

DOI10.1016/0304-3975(90)90036-HzbMath0698.68013MaRDI QIDQ912591

Richard Kennaway

Publication date: 1990

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

zbMATH Keywords

functional languagesgraph rewritingtranslationimplementationDactlevaluation strategy

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) Thue and Post systems, etc. (03D03)

Related Items (4)

Term graph rewriting and garbage collection using opfibrations ⋮ Properties of a first-order functional language with sharing ⋮ DACTL ⋮ On Term-Graph Rewrite Strategies

Uses Software

• CLEAN

Cites Work

• Conditional rewrite rules: Confluence and termination
• LEAN: An intermediate language based on graph rewriting
• Can programming be liberated from the von Neumann style?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Implementing term rewrite languages in DACTL