DocumentCode
2838849
Title
Synthesizing LISP-programs from algebraic specifications
Author
Avenhaus, J. ; Muller, Johannes
Author_Institution
Dept. of Comput. Sci., Kaiserslautern Univ., Germany
fYear
1989
fDate
22-24 Nov 1989
Firstpage
1040
Lastpage
1046
Abstract
A program synthesis approach based on rewriting techniques is presented. A set E of equations is taken as a specification S for a program and E is transformed into a uniquely terminating set R of rewrite rules using a Knuth-Bendix completion procedure plus special inference rules. If a specific subset P⊆R completely defines the function to be synthesized and R is consistent with S, then P serves as a (functional) rewrite program. Viewing P as an intermediate code, the rewrite rules can be compiled into LISP-code
Keywords
LISP; formal specification; programming; rewriting systems; Knuth-Bendix completion procedure; LISP-code; LISP-programs; algebraic specifications; intermediate code; program synthesis approach; rewrite program; rewrite rules; rewriting techniques; special inference rules; uniquely terminating set; Artificial intelligence; Computational modeling; Computer science; Computer simulation; Equations; Transforms;
fLanguage
English
Publisher
ieee
Conference_Titel
TENCON '89. Fourth IEEE Region 10 International Conference
Conference_Location
Bombay
Type
conf
DOI
10.1109/TENCON.1989.177108
Filename
177108
Link To Document