Transformational Synthesis of LISP Programs

The same results, though directly aimed at program synthesis, were obtained simultaneously, but independently, by [Manna and Waldinger 79]. However, their DEDALUS system (the DEDuctive Algorithm Ur-Synthesizer, which is the successor 

The 15-year SAFE project [Balzer 85] at the Information Sciences Institute of the University of Southern California aimed at transformational synthesis from specifications written in the GIST language. Some of the used transformation rules are explained by [London and Feather 82]. Ways of mechanizing the application of transformation rules are embodied by the GLITTER sub-system of [Fickas 85]. 

The role of domain knowledge codified as transformation rules has been advocated in the context of the PHINIX system [Barstow 84b, 85] at Schlumberger-Doll Research. 

---