{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T21:03:43Z","timestamp":1794344623336,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540691747","type":"print"},{"value":"9783540691754","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11964681_2","type":"book-chapter","created":{"date-parts":[[2007,1,19]],"date-time":"2007-01-19T00:48:37Z","timestamp":1169167717000},"page":"19-36","source":"Crossref","is-referenced-by-count":3,"title":["Encoding Strategies in the Lambda Calculus with Interaction Nets"],"prefix":"10.1007","author":[{"given":"Ian","family":"Mackie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(93)90181-R","volume":"111","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S.: Computational Interpretations of Linear Logic. Theoretical Comput. Sci.\u00a0111, 3\u201357 (1993)","journal-title":"Theoretical Comput. Sci."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(97)00082-0","volume":"190","author":"M. Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Interaction nets and term rewriting systems. Theoretical Computer Science\u00a0190(1), 3\u201339 (1998)","journal-title":"Theoretical Computer Science"},{"key":"2_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)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/3-540-48168-0_16","volume-title":"Computer Science Logic","author":"M. Fern\u00e1ndez","year":"1999","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Closed reductions in the \u03bb-calculus. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 220\u2013234. Springer, Heidelberg (1999)"},{"key":"2_CR5","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Packing interaction nets: Applications to linear logic and the lambda calculus. In: Frias, M., Heintz, J. (eds.) Proceedings of the 5th Argentinian Workshop of Theoretical Computer Science (WAIT 2001), Anales JAIIO, vol. 30, pp. 91\u2013107 (September 2001)"},{"issue":"1","key":"2_CR6","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":"2_CR7","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), pp. 15\u201326. ACM Press, New York (1992)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/LICS.1992.185535","volume-title":"Proceedings of the 7th IEEE Symposium on Logic in Computer Science (LICS 1992)","author":"G. Gonthier","year":"1992","unstructured":"Gonthier, G., Abadi, M., L\u00e9vy, J.-J.: Linear logic without boxes. In: Proceedings of the 7th IEEE Symposium on Logic in Computer Science (LICS 1992), pp. 223\u2013234. IEEE Press, Los Alamitos (1992)"},{"key":"2_CR9","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), pp. 95\u2013108. ACM Press, New York (1990)"},{"key":"2_CR10","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1017\/CBO9780511629150.012","volume-title":"Advances in Linear Logic","author":"Y. Lafont","year":"1995","unstructured":"Lafont, Y.: From proof nets to interaction nets. In: Girard, J.-Y., Lafont, Y., Regnier, L. (eds.) Advances in Linear Logic. London Mathematical Society Lecture Note Series, vol.\u00a0222, pp. 225\u2013247. Cambridge University Press, Cambridge (1995)"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/inco.1997.2643","volume":"137","author":"Y. Lafont","year":"1997","unstructured":"Lafont, Y.: Interaction combinators. Information and Computation\u00a0137(1), 69\u2013101 (1997)","journal-title":"Information and Computation"},{"key":"2_CR12","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), pp. 16\u201330. ACM Press, New York (1990)"},{"key":"2_CR13","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions Correctes et Optimales dans le Lambda-Calcul. Th\u00e8se d\u2019\u00e9tat, Universit\u00e9 Paris VII (January 1978)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Lippi, S.: \u03bb-calculus left reduction with interaction nets. Mathematical Structures in Computer Science 12(6) (2002)","DOI":"10.1017\/S0960129502003754"},{"key":"2_CR15","unstructured":"Lippi, S.: Th\u00e9orie et pratique des r\u00e9seaux d\u2019interaction. PhD thesis, Universit\u00e9 de la M\u00e9diterran\u00e9e (June 2002)"},{"key":"2_CR16","unstructured":"Mackie, I.: The Geometry of Implementation. PhD thesis, Department of Computing, Imperial College of Science, Technology and Medicine (September 1994)"},{"key":"2_CR17","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":"2_CR18","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"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-25979-4_11","volume-title":"Rewriting Techniques and Applications","author":"I. Mackie","year":"2004","unstructured":"Mackie, I.: Efficient \u03bb-evaluation with interaction nets. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 155\u2013169. Springer, Heidelberg (2004)"},{"issue":"2","key":"2_CR20","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":"2_CR21","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":"2_CR22","unstructured":"Pinto, J.S.: Parallel Implementation with Linear Logic. PhD thesis, \u00c9cole Polytechnique (February 2001)"},{"key":"2_CR23","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)"},{"key":"2_CR24","volume-title":"Functional Programming and Parallel Graph Rewriting","author":"R. Plasmeijer","year":"1993","unstructured":"Plasmeijer, R., Eekelen, M.: Functional Programming and Parallel Graph Rewriting. Addison-Wesley, Reading (1993)"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/11417170_28","volume-title":"Typed Lambda Calculi and Applications","author":"F.-R. Sinot","year":"2005","unstructured":"Sinot, F.-R.: Call-by-name and call-by-value as token-passing interaction nets. In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol.\u00a03461, pp. 386\u2013400. Springer, Heidelberg (2005)"},{"issue":"5","key":"2_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.entcs.2005.09.027","volume":"135","author":"F.-R. Sinot","year":"2006","unstructured":"Sinot, F.-R.: Token-passing nets: Call-by-need for free. Electronic Notes in Theoretical Computer Science\u00a0135(5), 129\u2013139 (2006)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2_CR27","unstructured":"Wadsworth, C.P.: Semantics and Pragmatics of the Lambda-Calculus. PhD thesis, Oxford University (1971)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Functional Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11964681_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:00:42Z","timestamp":1605625242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11964681_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540691747","9783540691754"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11964681_2","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11964681","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}