Computing with rewrite systems

Research output: Contribution to journalArticlepeer-review

Abstract

Term-rewriting systems, that is, sets of directed equations, provide a paradigm of computation with particularly simple syntax and semantics. Rewrite systems may be used for straightforward computation by simplifying terms. We show how, in addition, restricted forms of the Knuth-Bendix "completion" procedure may be used to interpret logic programs written as a set of equivalence-preserving rewrite rules. We discuss verification issues and also illustrate the use of the full completion procedure to synthesize rewrite programs from specifications.

Original languageEnglish
Pages (from-to)122-157
Number of pages36
JournalInformation and control
Volume65
Issue number2-3
DOIs
StatePublished - 1985
Externally publishedYes

Fingerprint

Dive into the research topics of 'Computing with rewrite systems'. Together they form a unique fingerprint.

Cite this