A Theoretical Foundation of Program Synthesis by Equivalent Transformation.pdfVIP

A Theoretical Foundation of Program Synthesis by Equivalent Transformation Extended Abstract Kiyoshi Akama
and Hidekatsu Koike  and Hiroshi Mabuchi 
Hokkaido University Kita Nishi Kitaku Sapp oro Japan akamacimshokudaiacjp  Hokkaido University Kita Nishi Kitaku Sapp oro Japan kokecimshokudaiacjp  Iwate Prefectural University Sugo Takizawa Iwate Japan mabusoftiwatepuacjp Abstract Equivalent transformation ET is useful for synthesis and transformation of programs However it is not so clear what seman tics should b e preserved in synthesis and transformation of programs in logic and functional programming which come from the disagreement of computation mo dels inference or evaluation and equivalent transfor mation To overcome the diculty we adopt a new computation mo del called equivalent transformation mo del where equivalent transformation is used not only for program synthesis but also for computation We develop a simple and general foundation for computation and program synthesis and prove the correctness of ETbased program synthesis Intro duction Equivalent transformation is one of the most imp ortant metho ds for program synthesis and transformation For instance in logic programming a predi cate denition consisting of rst order formulas or denite clauses is transformed equivalently into a more ecient logic program ie a set of denite clauses by using unfolding folding goal replacement and other transformations In functional programming a function denition is transformed equivalently into a more ecient functional program by using unfolding fold