{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:16Z","timestamp":1753894396411,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We study encodings of the lambda-calculus into the pi-calculus in the\nunexplored case of calculi with non-determinism and failures. On the sequential\nside, we consider lambdafail, a new non-deterministic calculus in which\nintersection types control resources (terms); on the concurrent side, we\nconsider spi, a pi-calculus in which non-determinism and failure rest upon a\nCurry-Howard correspondence between linear logic and session types. We present\na typed encoding of lambdafail into spi and establish its correctness. Our\nencoding precisely explains the interplay of non-deterministic and fail-prone\nevaluation in lambdafail via typed processes in spi. In particular, it shows\nhow failures in sequential evaluation (absence\/excess of resources) can be\nneatly codified as interaction protocols.<\/jats:p>","DOI":"10.46298\/lmcs-19(4:1)2023","type":"journal-article","created":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T07:25:12Z","timestamp":1696922712000},"source":"Crossref","is-referenced-by-count":0,"title":["Non-Deterministic Functions as Non-Deterministic Processes (Extended Version)"],"prefix":"10.46298","volume":"Volume 19, Issue 4","author":[{"given":"Joseph W. N.","family":"Paulus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Nantes-Sobrinho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2023,10,10]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/lmcs.episciences.org\/12383\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/lmcs.episciences.org\/12383\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T07:25:12Z","timestamp":1696922712000},"score":1,"resource":{"primary":{"URL":"http:\/\/lmcs.episciences.org\/8812"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,10]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(4:1)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2104.14759v5","asserted-by":"subject"},{"id-type":"arxiv","id":"2104.14759v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2104.14759v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2104.14759","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2104.14759","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2023,10,10]]},"article-number":"8812"}}