Using Inhabitation in Bounded Combinatory Logic with Intersection Types for Composition Synthesis
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 combinat...
Main Authors: | Boris Düdder, Oliver Garbe, Moritz Martens, Jakob Rehof, Paweł Urzyczyn |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2013-07-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1307.8203v1 |
Similar Items
-
Mixin Composition Synthesis based on Intersection Types
by: Jan Bessai, et al.
Published: (2018-02-01) -
The Algebraic Intersection Type Unification Problem
by: Andrej Dudenhefner, et al.
Published: (2017-08-01) -
Semantics for Combinatory Logic With Intersection Types
by: Silvia Ghilezan, et al.
Published: (2022-07-01) -
On the Mints Hierarchy in First-Order Intuitionistic Logic
by: Aleksy Schubert, et al.
Published: (2017-04-01) -
Inhabitation for Non-idempotent Intersection Types
by: Antonio Bucciarelli, et al.
Published: (2018-08-01)