{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:36:57Z","timestamp":1753889817892,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,10,10]],"date-time":"2012-10-10T00:00:00Z","timestamp":1349827200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We study the semantics of a resource-sensitive extension of the lambda\ncalculus in a canonical reflexive object of a category of sets and relations, a\nrelational version of Scott's original model of the pure lambda calculus. This\ncalculus is related to Boudol's resource calculus and is derived from Ehrhard\nand Regnier's differential extension of Linear Logic and of the lambda\ncalculus. We extend it with new constructions, to be understood as implementing\na very simple exception mechanism, and with a \"must\" parallel composition.\nThese new operations allow to associate a context of this calculus with any\npoint of the model and to prove full abstraction for the finite sub-calculus\nwhere ordinary lambda calculus application is not allowed. The result is then\nextended to the full calculus by means of a Taylor Expansion formula. As an\nintermediate result we prove that the exception mechanism is not essential in\nthe finite sub-calculus.<\/jats:p>","DOI":"10.2168\/lmcs-8(4:3)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:21:33Z","timestamp":1385731293000},"source":"Crossref","is-referenced-by-count":2,"title":["Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion"],"prefix":"10.46298","volume":"Volume 8, Issue 4","author":[{"given":"Thomas","family":"Ehrhard","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Bucciarelli","sequence":"additional","affiliation":[]},{"given":"Alberto","family":"Carraro","sequence":"additional","affiliation":[]},{"given":"Giulio","family":"Manzonetto","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2012,10,10]]},"reference":[{"key":"728:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1047\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1047\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:02:04Z","timestamp":1681243324000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1047"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,10]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(4:3)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1209.2890","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1209.2890","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,10,10]]},"article-number":"1047"}}