{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:40:09Z","timestamp":1728175209588},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_11","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"155-169","source":"Crossref","is-referenced-by-count":19,"title":["Efficient \u03bb-Evaluation with Interaction Nets"],"prefix":"10.1007","author":[{"given":"Ian","family":"Mackie","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"11_CR1","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1017\/S0956796800001994","volume":"6","author":"A. Asperti","year":"1996","unstructured":"Asperti, A., Giovannetti, C., Naletto, A.: The Bologna Optimal Higher-Order Machine. Journal of Functional Programming\u00a06(6), 763\u2013810 (1996)","journal-title":"Journal of Functional Programming"},{"key":"11_CR2","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"The Optimal Implementation of Functional Programming Langua ges","author":"A. Asperti","year":"1998","unstructured":"Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Langua ges. Cambridge Tracts in Theoretical Computer Science, vol.\u00a045. Cambridge University Press, Cambridge (1998)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/10704567_10","volume-title":"Principles and Practice of Declarative Programming","author":"M. Fern\u00e1ndez","year":"1999","unstructured":"Fern\u00e1ndez, M., Mackie, I.: A calculus for interaction nets. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 170\u2013187. Springer, Heidelberg (1999)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear Logic. Theoretical Computer Science\u00a050(1), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"11_CR5","first-page":"15","volume-title":"Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL 1992)","author":"G. Gonthier","year":"1992","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: The geometry of optimal lambda reduction. In: Proceedings of the 19th ACM Symposium on Principles of Programming Languages (POPL 1992), January 1992, pp. 15\u201326. ACM Press, New York (1992)"},{"key":"11_CR6","first-page":"95","volume-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990)","author":"Y. Lafont","year":"1990","unstructured":"Lafont, Y.: Interaction nets. In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990), January 1990, pp. 95\u2013108. ACM Press, New York (1990)"},{"key":"11_CR7","first-page":"16","volume-title":"Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990)","author":"J. Lamping","year":"1990","unstructured":"Lamping, J.: An algorithm for optimal lambda calculus reduction. In: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL 1990), January 1990, pp. 16\u201330. ACM Press, New York (1990)"},{"key":"11_CR8","unstructured":"Lang, F.: Mod\u00e8les de la beta-r\u00e9duction pour les implantations. PhD thesis, ENS Lyon (1998)"},{"key":"11_CR9","first-page":"159","volume-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"J.-J. L\u00e9vy","year":"1980","unstructured":"L\u00e9vy, J.-J.: Optimal reductions in the lambda calculus. In: Hindley, J.P., Seldin, J.R. (eds.) To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 159\u2013191. Academic Press, London (1980)"},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1017\/S0960129502003754","volume":"12","author":"S. Lippi","year":"2002","unstructured":"Lippi, S.: Encoding left reduction in the lambda-calculus with interaction nets. Mathematical Structures in Computer Science\u00a012(6), 797\u2013822 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR11","unstructured":"Mackie, I.: The Geometry of Implementation. PhD thesis, Department of Computing, Imperial College of Science, Technology and Medicine (September 1994)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/289423.289434","volume-title":"Proceedings of the 3rd International Conference on Functional Programming (ICFP 1998)","author":"I. Mackie","year":"1998","unstructured":"Mackie, I.: YALE: Yet another lambda evaluator based on interaction nets. In: Proceedings of the 3rd International Conference on Functional Programming (ICFP 1998), pp. 117\u2013128. ACM Press, New York (1998)"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(00)00198-5","volume":"247","author":"I. Mackie","year":"2000","unstructured":"Mackie, I.: Interaction nets for linear logic. Theoretical Computer Science\u00a0247(1), 83\u2013140 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"11_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/inco.2002.3163","volume":"176","author":"I. Mackie","year":"2002","unstructured":"Mackie, I., Pinto, J.S.: Encoding linear logic with interaction combinators. Information and Computation\u00a0176(2), 153\u2013186 (2002)","journal-title":"Information and Computation"},{"key":"11_CR15","volume-title":"The Implementation of Functional Programming Languages","author":"S.L. Peyton Jones","year":"1987","unstructured":"Peyton Jones, S.L.: The Implementation of Functional Programming Languages. Prentice Hall International, Englewood Cliffs (1987)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/3-540-46432-8_18","volume-title":"Foundation of Software Science and Computation Structures","author":"J.S. Pinto","year":"2000","unstructured":"Pinto, J.S.: Sequential and concurrent abstract machines for interaction nets. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol.\u00a01784, pp. 267\u2013282. Springer, Heidelberg (2000)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Pinto, J.S.: Weak reduction and garbage collection in interaction nets. In: Proceedings of the 3rd International Workshop on Reduction Strategies in Rewriting and Programming, Valencia, Spain (2003)","DOI":"10.1016\/S1571-0661(05)82614-3"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:51:04Z","timestamp":1553075464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}