Synthesizing LISP-programs from algebraic specifications

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 contained in 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.<>