{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:19Z","timestamp":1761610399296,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6419,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1996]]},"DOI":"10.1016\/s1571-0661(05)80402-5","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"40-60","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Reversible, Irreversible and Optimal \u03bb-machines"],"prefix":"10.1016","volume":"3","author":[{"given":"Vincent","family":"Danos","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Regnier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80402-5_BIB1","doi-asserted-by":"crossref","unstructured":"Martin Abadi, Georges Gonthier, and Jean-Jacques L\u00e9vy. The geometry of optimal lambda reduction. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages, pages 15\u201326, 1992.","DOI":"10.1145\/143165.143172"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB2","unstructured":"Andrea Asperti, Vincent Danos, Cosimo Laneve, and Laurent Regnier. Paths in the lambda-calculus. In Proceedings of the 9th Symposium on Logic in Computer-Science. IEEE Computer Society Press, 1994."},{"key":"10.1016\/S1571-0661(05)80402-5_BIB3","series-title":"Th\u00e8se de doctorat, Universit\u00e9 Paris 7","article-title":"Une Application de la Logique Lin\u00e9aire \u00e0 l'\u00c9tude des Processus de Normalisation (principalement du \u03bb-calcul)","author":"Danos","year":"1990"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB4","series-title":"Proceeding of the 11th Symposium on Logic in Computer Science","article-title":"Games semantics and abstract machines","author":"Danos","year":"1996"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/BF01622878","article-title":"The structure of multiplicatives","volume":"28","author":"Danos","year":"1989","journal-title":"Archive for Mathematical Logic"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB6","unstructured":"Vincent Danos and Laurent Regnier. Local and asynchronous beta-reduction. In Proceedings of the 8th Symposium on Logic in Computer Science. IEEE Computer Society Press, 1993."},{"key":"10.1016\/S1571-0661(05)80402-5_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Jean-Yves Girard","year":"1987","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB8","unstructured":"Jean-Yves Girard. Geometry of interaction I: an interpretation of system F. In Ferro & al., editor, Proceedings of A.S.L. Meetings. North-Holland, 1988."},{"key":"10.1016\/S1571-0661(05)80402-5_BIB9","doi-asserted-by":"crossref","unstructured":"Jean-Yves Girard. Geometry of interaction II: Deadlock free algorithms. In Martin-L\u00f6f & Mints, editor, Proceedings of COLOG'88, volume 417 of Lecture Notes in Computer Science, pages 76-93. Springer-Verlag, 1988.","DOI":"10.1007\/3-540-52335-9_49"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB10","series-title":"Nuovi problemi della logica e della filosofia della scienza, CLUEB","article-title":"Quantifiers in linear logic II","author":"Jean-Yves Girard","year":"1991"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB11","series-title":"Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series.","article-title":"Geometry of interaction III: acommodating the additives","author":"Girard","year":"1995"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB12","series-title":"Advances in Linear Logic, volume 222 of London Mathematical Society Lecture Note Series","first-page":"225","article-title":"From proof-nets to interaction nets","author":"Lafont","year":"1995"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB13","doi-asserted-by":"crossref","unstructured":"Ian Mackie. The geometry of implementation. In Proceedings of the 22th ACM Symposium on Principles of Programming Languages, 1995.","DOI":"10.1145\/199448.199483"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB14","series-title":"Th\u00e8se de doctorat, Universit\u00e9 Paris 7","article-title":"Lambda-Calcul et R\u00e9seaux","author":"Regnier","year":"1992"},{"key":"10.1016\/S1571-0661(05)80402-5_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(94)90012-4","article-title":"Une \u00e9quivalence sur les lambda-termes","volume":"126","author":"Regnier","year":"1994","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804025?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804025?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:50Z","timestamp":1761610130000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":15,"alternative-id":["S1571066105804025"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80402-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Reversible, Irreversible and Optimal \u03bb-machines","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80402-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}