{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:59Z","timestamp":1761611159647},"reference-count":12,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3528,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s1571-0661(05)82614-3","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T13:46:30Z","timestamp":1116510390000},"page":"625-640","source":"Crossref","is-referenced-by-count":3,"title":["Weak Reduction and Garbage Collection in Interaction Nets"],"prefix":"10.1016","volume":"86","author":[{"given":"Jorge Sousa","family":"Pinto","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82614-3_BIB1","series-title":"The Optimal Implementation of Functional Programming Languages, volume 45 of Cambridge Tracts in Theoretical Computer Science","author":"Asperti","year":"1998"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB2","series-title":"Proceedings of the International Conference on Principles and Practice of Declarative Programming (PPDP'99), number 1702 in Lecture Notes in Computer Science","first-page":"170","article-title":"A calculus for interaction nets","author":"Fern\u00e1ndez","year":"1999"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB3","doi-asserted-by":"crossref","unstructured":"M. Fern\u00e1ndez, I. Mackie, J.S. Pinto. A higher-order calculus for graph transformation. In Proceedings of the International Workshop on Term Graph Rewriting, TERMGRAPH 2002, volume 72 of Electronic Notes in Theoretical Computer Science.","DOI":"10.1016\/j.entcs.2002.09.005"},{"issue":"1","key":"10.1016\/S1571-0661(05)82614-3_BIB4","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB5","series-title":"Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL'92)","first-page":"15","article-title":"The geometry of optimal lambda reduction","author":"Gonthier","year":"1992"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB6","series-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL'90)","first-page":"95","article-title":"Interaction nets","author":"Lafont","year":"1990"},{"issue":"1","key":"10.1016\/S1571-0661(05)82614-3_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2643","article-title":"Interaction combinators","volume":"137","author":"Lafont","year":"1997","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB8","series-title":"Proceedings of the 11th ACM Symposium on Principles of Programming Languages (POPL'90)","first-page":"16","article-title":"An algorithm for optimal lambda calculus reduction","author":"Lamping","year":"1990"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB9","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"159","article-title":"Optimal reductions in the lambda calculus","author":"L\u00e9vy","year":"1980"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB10","series-title":"Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming (ICFP'98)","first-page":"117","article-title":"YALE: Yet another lambda evaluator based on interaction nets","author":"Mackie","year":"1998"},{"issue":"2","key":"10.1016\/S1571-0661(05)82614-3_BIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/inco.2002.3163","article-title":"Encoding linear logic with interaction combinators","volume":"176","author":"Mackie","year":"2002","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)82614-3_BIB12","series-title":"Proceedings of Foundations of Software Science and Computation Structures (FOSSACS), number 1784 in Lecture Notes in Computer Science","first-page":"267","article-title":"Sequential and Concurrent Abstract Machines for Interaction Nets","author":"Pinto","year":"2000"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105826143?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105826143?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T11:07:42Z","timestamp":1586257662000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105826143"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S1571066105826143"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82614-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}