{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:47Z","timestamp":1759638407551},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)90263-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"111-137","source":"Crossref","is-referenced-by-count":23,"title":["Head linear reduction and pure proof net extraction"],"prefix":"10.1016","volume":"135","author":[{"given":"G.F.","family":"Mascari","sequence":"first","affiliation":[]},{"given":"M.","family":"Pedicini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90263-1_BIB1","series-title":"Research Report","article-title":"Explicit substitutions","author":"Abadi","year":"1990"},{"key":"10.1016\/0304-3975(94)90263-1_BIB2","article-title":"Logic Programming with Sequent Calculus: a Linear logic Approach","volume":"Vol. 475","author":"Andreoli","year":"1990"},{"key":"10.1016\/0304-3975(94)90263-1_BIB3","series-title":"The Lambda Calculus, its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/0304-3975(94)90263-1_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0304-3975(94)00104-9","article-title":"On the \u03c0-calculus and linear logic","volume":"135","author":"Bellin","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90263-1_BIB5","volume":"262","author":"Benton","year":"1992"},{"key":"10.1016\/0304-3975(94)90263-1_BIB6","volume":"696","author":"B\u00f6hm","year":"1968"},{"key":"10.1016\/0304-3975(94)90263-1_BIB7","series-title":"Proc. 3rd Italian Conf. on Theoretical Computer Science","article-title":"Dynamic Graphs, an alternative way to compute \u03bb terms (summarized version)","author":"Danos","year":"1990"},{"key":"10.1016\/0304-3975(94)90263-1_BIB8","series-title":"Th\u00e8se de doctorat","article-title":"Une application de la logique lin\u00e9aire \u00e0 l'\u00e9tude des processue de normalisation et principalement du Lambda-calcul","author":"Danos","year":"1990"},{"key":"10.1016\/0304-3975(94)90263-1_BIB9","series-title":"Draft Paper","article-title":"Systemes de reseaux multiplicatifs signes","author":"Duquesne","year":"1991"},{"key":"10.1016\/0304-3975(94)90263-1_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90263-1_BIB11","series-title":"On the unity of logic","author":"Girard","year":"1991"},{"key":"10.1016\/0304-3975(94)90263-1_BIB12","author":"Gonthier","year":"1991","journal-title":"The geometry of optimal \u03bb-reduction"},{"key":"10.1016\/0304-3975(94)90263-1_BIB13","series-title":"Lambda-calcul, Types et Mod\u00e8les","author":"Krivine","year":"1990"},{"key":"10.1016\/0304-3975(94)90263-1_BIB14","doi-asserted-by":"crossref","DOI":"10.1145\/96709.96718","article-title":"Interaction nets","author":"Lafont","year":"1990","journal-title":"Proc. POPL'90"},{"key":"10.1016\/0304-3975(94)90263-1_BIB15","series-title":"Lecture Notes in Computer Science","article-title":"Some Results on the Interpretation of \u03bb-calculus in Operator Algebras","author":"Malacaria","year":"1991"},{"key":"10.1016\/0304-3975(94)90263-1_BIB16","article-title":"\u03bb-calcolo puro, reti di dimostrazione e riduzione di testa","author":"Pedicini","year":"1991","journal-title":"Tesi di Laurea"},{"key":"10.1016\/0304-3975(94)90263-1_BIB17","series-title":"Draft Paper","article-title":"Calcolo Lineare di Testa per Reti di dimonstrazione e \u03bb-calcolo puro","author":"Pedicini","year":"1994"},{"key":"10.1016\/0304-3975(94)90263-1_BIB18","series-title":"Draft Paper","article-title":"A propos de l'equivalence operationelle","author":"Regnier","year":"1990"},{"key":"10.1016\/0304-3975(94)90263-1_BIB19","series-title":"Th\u00e8se de doctorat","author":"Regnier","year":"1992"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902631?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902631?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:51:54Z","timestamp":1555127514000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0304397594902631"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90263-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}