{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:43:24Z","timestamp":1725482604420},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540673064"},{"type":"electronic","value":"9783540464150"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10719839_44","type":"book-chapter","created":{"date-parts":[[2007,4,11]],"date-time":"2007-04-11T08:13:55Z","timestamp":1176279235000},"page":"447-456","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Theory of Operational Equivalence for Interaction Nets"],"prefix":"10.1007","author":[{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Ian","family":"Mackie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"key":"44_CR1","first-page":"65","volume-title":"Research Topics in Functional Programming","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: The lazy \u03bb-calculus. In: Turner, D.A. (ed.) Research Topics in Functional Programming, ch. 4, pp. 65\u2013117. AddisonWesley, London (1990)"},{"key":"44_CR2","first-page":"321","volume-title":"Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS 1998)","author":"M. Fern\u00e1ndez","year":"1998","unstructured":"Fern\u00e1ndez, M., Mackie, I.: Coinductive techniques for operational equivalence of interaction nets. In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS 1998), pp. 321\u2013332. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (1999)"},{"key":"44_CR4","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)"},{"issue":"2","key":"44_CR5","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1006\/inco.1996.0008","volume":"124","author":"D.J. Howe","year":"1996","unstructured":"Howe, D.J.: Proving congruence of bisimulation in functional programming languages. Information and Computation\u00a0124(2), 103\u2013112 (1996)","journal-title":"Information and Computation"},{"key":"44_CR6","unstructured":"Khalil, L.: M\u00e9moire de DEA SPP (1999), Available at \n \n http:\/\/www.dmi.ens.fr\/~khalil"},{"key":"44_CR7","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)"},{"issue":"1","key":"44_CR8","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":"44_CR9","first-page":"117","volume-title":"Proceedings of the 3rd ACM SIGPLAN 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 ACM SIGPLAN International Conference on Functional Programming (ICFP 1998), pp. 117\u2013128. ACM Press, New York (1998)"},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1017\/CBO9780511526619.007","volume-title":"Semantics and Logics of Computation (Publications of the Newton Institute)","author":"A.M. Pitts","year":"1997","unstructured":"Pitts, A.M.: Operationally-based theories of program equivalence. In: Dybjer, P., Pitts, A.M. (eds.) Semantics and Logics of Computation (Publications of the Newton Institute), pp. 241\u2013298. Cambridge University Press, Cambridge (1997)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2000: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10719839_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T07:38:49Z","timestamp":1567237129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10719839_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540673064","9783540464150"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/10719839_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"12 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}