Sciweavers

AAIP
2009
13 years 2 months ago
Deriving a Relationship from a Single Example
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...
Neil Mitchell
AAIP
2009
13 years 2 months ago
Synthesis of Functions Using Generic Programming
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...
Pieter W. M. Koopman, Rinus Plasmeijer
AAIP
2009
13 years 5 months ago
Automated Method Induction: Functional Goes Object Oriented
The development of software engineering has had a great deal of benefits for the development of software. Along with it came a whole new paradigm of the way software is designed a...
Thomas Hieber, Martin Hofmann 0008
AAIP
2009
13 years 5 months ago
Porting IgorII from Maude to Haskell
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...
Martin Hofmann 0008, Emanuel Kitzelmann, Ute Schmi...
AAIP
2009
13 years 5 months ago
Enumerating Well-Typed Terms Generically
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...
Alexey Rodriguez Yakushev, Johan Jeuring
AAIP
2009
13 years 5 months ago
Incremental Learning in Inductive Programming
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 ...
Robert Henderson