Synthesis of Functions Using Generic Programming

Abstract

A b stra c t. This paper describes a very flexible way to synthesize func tions matching a given predicate. This can be used to find general re cursive functions or A-terms obeying an input-output behavior specified by a number of examples. Generating complex algorithms from just a small number of simple input-output pairs is the goal of inductive pro gramming. This paper illustrates that our approach works well in some challenging examples.