{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:00:18Z","timestamp":1725487218773},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540672579"},{"type":"electronic","value":"9783540464327"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46432-8_18","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T12:22:02Z","timestamp":1184588522000},"page":"267-282","source":"Crossref","is-referenced-by-count":10,"title":["Sequential and Concurrent Abstract Machines for Interaction Nets"],"prefix":"10.1007","author":[{"given":"Jorge Sousa","family":"Pinto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"issue":"6","key":"18_CR1","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1017\/S0956796800001994","volume":"6","author":"A. Asperti","year":"1996","unstructured":"Andrea Asperti, Cecilia Giovannetti, and Andrea Naletto. The bologna optimal higher-order machine. Journal of Functional Programming, 6(6):763\u2013810, November 1996.","journal-title":"Journal of Functional Programming"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Berry and G\u00e9rard Boudol. The Chemical Abstract Machine. In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 81\u201394, 1990.","DOI":"10.1145\/96709.96717"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0304-3975(91)90230-Y","volume":"82","author":"P.-L. Curien","year":"1991","unstructured":"P.-L. Curien. An abstract framework for environment machines. Theoretical Computer Science, 82(2):389\u2013402, May 1991.","journal-title":"Theoretical Computer Science"},{"key":"18_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Principles and Practice of Declarative Programming\u201999 Conference Proceedings","author":"M. Fernndez","year":"1999","unstructured":"Maribel Fernndez and Ian Mackie. A calculus for interaction nets. In Gopalan Nadathur, editor, Principles and Practice of Declarative Programming\u201999 Conference Proceedings, number 1702 in Lecture Notes in Computer Science. Springer-Verlag, September\/October 1999."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Georges Gonthier, Martn Abadi, and Jean-Jacques Lvy. The geometry of optimal lambda reduction. In Proceedings of ACM Symposium Principles of Programming Languages, pages 15\u201326, January 1992.","DOI":"10.1145\/143165.143172"},{"key":"18_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0022136","volume-title":"Distributed Algorithms, 9th International Workshop, WDAG\u2019 95","author":"P. Jayanti","year":"1995","unstructured":"P. Jayanti. Wait-free computing. In Distributed Algorithms, 9th International Workshop, WDAG\u2019 95, volume 972 of Lecture Notes in Computer Science, pages 19\u201350, 1995."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Yves Lafont. Interaction nets. In Seventeenth Annual Symposium on Principles of Programming Languages, pages 95\u2013108, San Francisco, California, 1990. ACM Press.","DOI":"10.1145\/96709.96718"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Yves Lafont. From proof nets to interaction nets. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 225\u2013247. Cambridge University Press, 1995. Proceedings of the Workshop on Linear Logic, Ithaca, New York, June 1993.","DOI":"10.1017\/CBO9780511629150.012"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"John Lamping. An algorithm for optimal lambda-calculus reductions. In Proceedings of the Seventeenth ACM Symposium on Principles of Programming Languages, pages 16\u201330. ACM, ACM Press, January 1990.","DOI":"10.1145\/96709.96711"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Peter Landin. The mechanical evaluation of expressions. Computer Journal, 6(4), 1963.","DOI":"10.1093\/comjnl\/6.4.308"},{"key":"18_CR12","unstructured":"Jean-Jacques L\u00e9vy. R\u00e9ductions Correctes et Optimales dans le Lambda Calcul. Th\u00e8se de Doctorat d\u2019Etat, University of Paris VII, 1978."},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Ian Mackie. YALE: Yet another lambda evaluator based on interaction nets. In Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming (ICFP\u201998), pages 117\u2013128. ACM Press, September 1998.","DOI":"10.1145\/289423.289434"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46432-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:32:10Z","timestamp":1556667130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46432-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540672579","9783540464327"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46432-8_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}