Boris Düdder

Learn More
A framework for composition synthesis is provided in which metalanguage combinators are supported and the execution of synthesized programs can be staged into composition-time code generation (stage 1) and run-time execution (stage 2). By extending composition synthesis to encompass both object language (L1) and metalanguage (L2) combinators, composition(More)
We present Combinatory Logic Synthesizer (CL)S, a type-based tool to automatically compose larger systems from repositories of components. We overview its underlying theory, combinatory logic with intersection types, and exemplify its application to synthesis. We describe features and architecture of the tool and our plans for its ongoing and future(More)
We study an assignment system of intersection types for a lambda-calculus with records and a record-merge operator, where types are preserved both under subject reduction and expansion. The calculus is expressive enough to naturally represent mixins as functions over recursively defined classes, whose fixed points, the objects, are recursive records. In(More)
A B S T R A C T Bounded combinatory logic with intersection types has recently been proposed as a foundation for composition synthesis from software repositories. In such a framework, the algorithmic core in synthesis consists of a type inhabitation algorithm. Since the inhabitation problem is exponential, engineering the theoretical inhabitation algorithm(More)
We describe ongoing work on a framework for automatic composition synthesis from a repository of software components. This work is based on combinatory logic with intersection types. The idea is that components are modeled as typed combinators, and an algorithm for inhabitation — is there a combinatory term e with type τ relative to an environment Γ? — can(More)