6 search results - page 1 / 2 » aaip 2009 |
AAIP
2009
13 years 10 months ago
2009
We use generic programming techniques to generate well-typed lambda terms. We encode well-typed terms by generalized algebraic datatypes (GADTs) and existential types. The Spine a...
AAIP
2009
13 years 7 months ago
2009
Given an appropriate domain specific language (DSL), it is possible to describe the relationship between Haskell data types and many generic functions, typically type-class instan...
AAIP
2009
13 years 7 months ago
2009
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 inp...
AAIP
2009
13 years 10 months ago
2009
This paper describes our efforts and solutions in porting our IP system IGOR 2 from the termrewriting language MAUDE to HASKELL. We describe how, for our purpose necessary feature...
AAIP
2009
13 years 10 months ago
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...