Systematic Synthesis of Functions
Pieter Koopman, Rinus Plasmeijer · Intellect Books · 2005
In this paper we introduce a new technique to synthesize functions matching a given set of input output pairs.Using techniques similar to defunctionalisation one can specify the abstract syntax tree of the candidate functions at a high level of abstrac tion.We use the test system Gvst for the systematic synthesis of candidate functions and the selection of functions matching the given condition.The generation of can didate functions is controlled by the types representing them.Instances are generated by a generic algorithm that can be tailored to specific needs.This yields a very flexi ble system to synthesize clear primitive recursive function definitions efficiently.