{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:27:25Z","timestamp":1772242045033,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T00:00:00Z","timestamp":1519689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T00:00:00Z","timestamp":1519689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,2,27]],"date-time":"2018-02-27T00:00:00Z","timestamp":1519689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["617805"],"award-info":[{"award-number":["617805"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.23638\/lmcs-14(1:18)2018","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:35:46Z","timestamp":1743687346000},"source":"Crossref","is-referenced-by-count":0,"title":["Mixin Composition Synthesis based on Intersection Types"],"prefix":"10.23638","volume":"Volume 14, Issue 1","author":[{"given":"Jan","family":"Bessai","sequence":"first","affiliation":[]},{"given":"Tzu-Chun","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Andrej","family":"Dudenhefner","sequence":"additional","affiliation":[]},{"given":"Boris","family":"D\u00fcdder","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"de'Liguoro","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Rehof","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2018,2,27]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1712.06906v2","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1712.06906v2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T13:35:46Z","timestamp":1743687346000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,27]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-14(1:18)2018","relation":{"has-preprint":[{"id-type":"arxiv","id":"1712.06906v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1712.06906","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1712.06906","asserted-by":"subject"}],"is-cited-by":[{"id-type":"doi","id":"10.4204\/EPTCS.284.2","asserted-by":"object"},{"id-type":"doi","id":"10.4204\/EPTCS.301.7","asserted-by":"object"},{"id-type":"doi","id":"10.4204\/EPTCS.293.6","asserted-by":"object"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,27]]},"article-number":"4160"}}