Mixin Composition Synthesis based on Intersection Types

TY - JOUR

T1 - Mixin Composition Synthesis based on Intersection Types

AU - Bessai, Jan

AU - Chen, Tzu-Chun

AU - Dudenhefner, Andrej

AU - Duedder, Boris

AU - de'Liguoro, Ugo

AU - Rehof, Jacob

PY - 2018/2/27

Y1 - 2018/2/27

N2 - We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over classes, are expressed as terms in a lambda calculus with records. Intersection types with records and record-merge are used to assign meaningful types to these terms without resorting to recursive types. Second, typed terms are translated to a repository of typed combinators. We show a relation between record types with record-merge and intersection types with constructors. This relation is used to prove soundness and partial completeness of the translation with respect to mixin composition synthesis. Furthermore, we demonstrate how a translated repository and goal type can be used as input to an existing framework for composition synthesis in bounded combinatory logic via type inhabitation. The computed result is a class typed by the goal type and generated by a mixin composition applied to an existing class.

AB - We present a method for synthesizing compositions of mixins using type inhabitation in intersection types. First, recursively defined classes and mixins, which are functions over classes, are expressed as terms in a lambda calculus with records. Intersection types with records and record-merge are used to assign meaningful types to these terms without resorting to recursive types. Second, typed terms are translated to a repository of typed combinators. We show a relation between record types with record-merge and intersection types with constructors. This relation is used to prove soundness and partial completeness of the translation with respect to mixin composition synthesis. Furthermore, we demonstrate how a translated repository and goal type can be used as input to an existing framework for composition synthesis in bounded combinatory logic via type inhabitation. The computed result is a class typed by the goal type and generated by a mixin composition applied to an existing class.

UR - http://www.scopus.com/inward/record.url?scp=85055795381&partnerID=8YFLogxK

U2 - 10.23638/LMCS-14(1:18)2018

DO - 10.23638/LMCS-14(1:18)2018

M3 - Journal article

SN - 1860-5974

VL - 14

SP - 1

EP - 37

JO - Logical Methods in Computer Science

JF - Logical Methods in Computer Science

IS - 1

M1 - 18

ER -