{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:37:53Z","timestamp":1753889873779,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2018,8,3]],"date-time":"2018-08-03T00:00:00Z","timestamp":1533254400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,8,3]],"date-time":"2018-08-03T00:00:00Z","timestamp":1533254400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2018,8,3]],"date-time":"2018-08-03T00:00:00Z","timestamp":1533254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"accepted":{"date-parts":[[2025,3,31]]},"abstract":"<jats:p>The inhabitation problem for intersection types in the lambda-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the strongly normalizing lambda-terms. We prove the decidability of the inhabitation problem for all the systems considered, by providing sound and complete inhabitation algorithms for them.<\/jats:p>","DOI":"10.23638\/lmcs-14(3:7)2018","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:35:31Z","timestamp":1743701731000},"source":"Crossref","is-referenced-by-count":1,"title":["Inhabitation for Non-idempotent Intersection Types"],"prefix":"10.23638","volume":"Volume 14, Issue 3","author":[{"given":"Antonio","family":"Bucciarelli","sequence":"first","affiliation":[]},{"given":"Delia","family":"Kesner","sequence":"additional","affiliation":[]},{"given":"Simona Ronchi","family":"Della Rocca","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2018,8,3]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/arxiv.org\/pdf\/1712.03829v5","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/arxiv.org\/pdf\/1712.03829v5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T17:35:31Z","timestamp":1743701731000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/4139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,3]]},"references-count":0,"URL":"https:\/\/doi.org\/10.23638\/lmcs-14(3:7)2018","relation":{"has-preprint":[{"id-type":"arxiv","id":"1712.03829v3","asserted-by":"subject"},{"id-type":"arxiv","id":"1712.03829v2","asserted-by":"subject"},{"id-type":"arxiv","id":"1712.03829v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"1712.03829","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1712.03829","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2018,8,3]]},"article-number":"4139"}}