Affordable Access

Access to the full text

Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis

Authors
  • Düdder, Boris
  • Garbe, Oliver
  • Martens, Moritz
  • Rehof, Jakob
  • Urzyczyn, Paweł
Type
Published Article
Publication Date
Jul 30, 2013
Submission Date
Jul 30, 2013
Identifiers
DOI: 10.4204/EPTCS.121.2
Source
arXiv
License
Yellow
External links

Abstract

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 {\textemdash} is there a combinatory term e with type tau relative to an environment Gamma? {\textemdash} can be used to synthesize compositions. Here, Gamma represents the repository in the form of typed combinators, tau specifies the synthesis goal, and e is the synthesized program. We illustrate our approach by examples, including an application to synthesis from GUI-components.

Report this publication

Statistics

Seen <100 times