Abstract

This paper presents a system for searching for desired small functional programs by just generating a sequence of type-correct programs in a systematic and exhaustive manner and evaluating them. The main goal of this line of research is to ease functional programming, along with the subgoal to provide an axis to evaluate heuristic approaches to program synthesis such as genetic programming by telling the best performance possible by exhaustive search algorithms. While our previous approach to that goal used combinatory expressions in order to simplify the synthesis process, which led to redundant combinator expressions with complex types, this time we use de Bruijn lambda expressions and enjoy improved results. 1

Citations

54	Inductive functional programming using incremental program transformation - Olsson - 1995
49	Typing Haskell in Haskell - Jones - 1999
32	The calculational fusion system HYLO - Onoue, Hu, et al. - 1997
29	Generalizing generalized tries - Hinze
14	Director strings as combinators - Kennaway, Sleep - 1988
10	Combinators for breadth-first search - Spivey
10	Polymorphism and genetic programming - Yu - 2001
10	PolyGP: A polymorphic genetic programming system in haskell - Yu, Clack - 1998
7	A new formula for the execution of categorical combinators - Lins - 1986
6	R.: A functional shell that dynamically combines compiled code - Weelden, Plasmeijer - 2003
3	of brute-force search in strongly-typed inductive functional programming automation - Power - 2004