Jan Bessai ; Tzu-Chun Chen ; Andrej Dudenhefner ; Boris Düdder ; Ugo de'Liguoro et al. - Mixin Composition Synthesis based on Intersection Types

lmcs:4160 - Logical Methods in Computer Science, February 27, 2018, Volume 14, Issue 1 - https://doi.org/10.23638/LMCS-14(1:18)2018
Mixin Composition Synthesis based on Intersection TypesArticle

Authors: Jan Bessai ; Tzu-Chun Chen ; Andrej Dudenhefner ; Boris Düdder ; Ugo de'Liguoro ; Jakob Rehof

    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.

    Volume: Volume 14, Issue 1
    Published on: February 27, 2018
    Accepted on: December 21, 2017
    Submitted on: December 21, 2017
    Keywords: Computer Science - Logic in Computer Science,F.4.1
      Source : OpenAIRE Graph
    • Lightweight Verification of Software; Funder: European Commission; Code: 617805

    3 Documents citing this article

    Consultation statistics

    This page has been seen 1517 times.
    This article's PDF has been downloaded 661 times.