Synthesizing data structure transformations from input-output examples
Citations Over TimeTop 1% of 2015 papers
Abstract
We present a method for example-guided synthesis of functional programs over recursive data structures. Given a set of input-output examples, our method synthesizes a program in a functional language with higher-order combinators like map and fold. The synthesized program is guaranteed to be the simplest program in the language to fit the examples. Our approach combines three technical ideas: inductive generalization, deduction, and enumerative search. First, we generalize the input-output examples into hypotheses about the structure of the target program. For each hypothesis, we use deduction to infer new input/output examples for the missing subexpressions. This leads to a new subproblem where the goal is to synthesize expressions within each hypothesis. Since not every hypothesis can be realized into a program that fits the examples, we use a combination of best-first enumeration and deduction to search for a hypothesis that meets our needs. We have implemented our method in a tool called λ2, and we evaluate this tool on a large set of synthesis problems involving lists, trees, and nested data structures. The experiments demonstrate the scalability and broad scope of λ2. A highlight is the synthesis of a program believed to be the world's earliest functional pearl.
Related Papers
- → Haskell Programming with Nested Types: A Principled Approach(2009)6 cited
- → Detecting sharing of partial applications in functional programs(1987)29 cited
- Strategic polymorphism requires just two combinators(2002)
- → New families of combinators for efficient list manipulation(1994)
- An abstraction algorithm for combinatory reduction systems(1987)