2026-08-10T22:31:13Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5156 2024-03-06T10:36:10Z ddc:004 open_access

Mixin Composition Synthesis Based on Intersection Types Bessai, Jan Dudenhefner, Andrej Düdder, Boris Chen, Tzu-Chun de’Liguoro, Ugo Rehof, Jakob Record Calculus Combinatory Logic Type Inhabitation Mixin Intersection Type 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 corresponds to a mixin composition typed by the goal type. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jan Bessai and Andrej Dudenhefner and Boris Düdder and Tzu-Chun Chen and Ugo de’Liguoro and Jakob Rehof 2015 Is Part Of LIPIcs, Volume 38, 13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TLCA.2015.76 urn:nbn:de:0030-drops-51563 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TLCA.2015.76 eng https://creativecommons.org/licenses/by/3.0/legalcode