TY - JOUR
T1 - Computing with rewrite systems
AU - Dershowitz, Nachum
N1 - Funding Information:
* This research was supported in part by the National Science Foundation under Grant MCS-83-07755 and by The Aerospace Corporation. It was in part pursued while the author was at Bar-Ilan University, on leave from the University of Illinois, and in part while at The Aerospace Corporation. This paper is a revision of "Equations as programming language," presented at the Fourth Jerusalem Conference on Information Technology (May 1984).
PY - 1985
Y1 - 1985
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0022065057&partnerID=8YFLogxK
U2 - 10.1016/S0019-9958(85)80003-6
DO - 10.1016/S0019-9958(85)80003-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0022065057
SN - 0019-9958
VL - 65
SP - 122
EP - 157
JO - Information and control
JF - Information and control
IS - 2-3
ER -