#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2012

2017

- This year (1)
- Last 5 years (19)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Boris Düdder, Moritz Martens, Jakob Rehof, Pawel Urzyczyn
- CSL
- 2012

In combinatory logic one usually assumes a fixed set of basic combinators (axiom schemes), usually K and S. In this setting the set of provable formulas (inhabited types) is Pspacecomplete in simple types and undecidable in intersection types. When arbitrary sets of axiom schemes are considered, the inhabitation problem is undecidable even in simple types… (More)

- Boris Düdder, Moritz Martens, Jakob Rehof
- Software Engineering & Management
- 2014

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)

- Boris Düdder, Moritz Martens, Jakob Rehof
- TLCA
- 2013

Type matching problems occur in a number of contexts, including library search, component composition, and inhabitation. We consider the intersection type matching problem under the standard notion of subtyping for intersection types: Given intersection types τ and σ, where σ is a constant type, does there exist a type substitution S such that S(τ) is a… (More)

- Jan Bessai, Andrej Dudenhefner, Boris Düdder, Moritz Martens, Jakob Rehof
- ISoLA
- 2014

We present Combinatory Logic Synthesizer (CL)S, a typebased 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 recordmerge 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)

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 with… (More)

- Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof, Pawel Urzyczyn
- ITRS
- 2012

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)

- Boris Düdder
- 2014

The BCD type system of intersection types has been introduced by Barendregt, Coppo and Dezani in [1]. It is derived from a filter lambda model in order to characterize exactly the strongly normalizing terms. Formally, intersection types over variables α ∈ V σ, τ, ρ ::= α | σ → τ | σ ∩ τ | ω are related by the least preorder ≤ closed under the rules σ ≤ ω, ω… (More)

- Boris Düdder, George T. Heineman, Jakob Rehof
- ISoLA
- 2016