Synthesis of Functions Using Generic Programming
by
Pieter Koopman
,
Rinus Plasmeijer
BibTeX
@MISC{Koopman_synthesisof,
author = {Pieter Koopman and Rinus Plasmeijer},
title = {Synthesis of Functions Using Generic Programming},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper describes a very flexible way to synthesize functions matching a given predicate. This can be used to find general recursive functions or λ-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 programming. This paper illustrates that our approach works well in some challenging examples. 1
Citations
| 318 | Watch What I Do: Programming by Demonstration - Cypher, Halbert, et al. - 1993 |
| 252 | QuickCheck: a lightweight tool for random testing of Haskell programs - Claessen, Hughes - 2000 |
| 200 | Introduction to functional programming using Haskell - Bird - 1998 |
| 17 | Systematic search for lambda expressions - Katayama |
| 17 | Concurrent Clean Language Report (version 2.0 - Eekelen, Plasmeijer - 2001 |
| 5 | Efficient exhaustive generation of functional programs using monte-carlo search with iterative deepening - Katayama |
| 4 | Fully Automatic Testing with Functions as Specifications, volume 4164 - Koopman, Plasmeijer |
| 3 | A Methodology for Synthesis of Recursive Functional Programs - Banerjee - 1987 |
| 3 | Systematic synthesis of functions - Koopman, Plasmeijer - 2006 |
| 2 | Generic Functional Programming - Alimarine - 2005 |
| 1 | Incrementtal learning in inductive programming - Henderson - 2009 |
| 1 | Systematic synthesis of λ-terms - Koopman, Plasmeijer - 2007 |
