{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T19:27:46Z","timestamp":1673206066940},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3827,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0304-3975(02)00637-0","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:52:06Z","timestamp":1048611126000},"page":"157-181","source":"Crossref","is-referenced-by-count":9,"title":["Operational equivalence for interaction nets"],"prefix":"10.1016","volume":"297","author":[{"given":"Maribel","family":"Fern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Ian","family":"Mackie","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00637-0_BIB1","series-title":"Research Topics in Functional Programming","first-page":"65","article-title":"The lazy \u03bb-calculus","author":"Abramsky","year":"1990"},{"key":"10.1016\/S0304-3975(02)00637-0_BIB2","unstructured":"D. Bechet, Partial evaluation of interaction nets, in: M. Billaud, P. Cast\u00e9ran, M.M. Corsini, K. Musumbu, A. Rauzyand (Eds.), Proc. Second Workshop on Static Analysis WSA\u201992; Bigre J. 81\u201382 (1992) 331\u2013338."},{"key":"10.1016\/S0304-3975(02)00637-0_BIB3","series-title":"Proc. 13th Annu. IEEE Symp. on Logic in Computer Science (LICS\u201998)","first-page":"321","article-title":"Coinductive techniques for operational equivalence of interaction nets","author":"M. Fern\u00e1ndez","year":"1998"},{"key":"10.1016\/S0304-3975(02)00637-0_BIB4","series-title":"Proc. Internat. Conf. on Principles and Practice of Declarative Programming (PPDP\u201999)","first-page":"170","article-title":"A calculus for interaction nets","volume":"vol. 1702","author":"Fern\u00e1ndez","year":"1999"},{"key":"10.1016\/S0304-3975(02)00637-0_BIB5","series-title":"LATIN 2000. Theoretical Informatics. Proc. Fourth Latin American Symp., Punta del Este, Uruguay","first-page":"447","article-title":"A theory of operational equivalence for interaction nets","volume":"vol. 1776","author":"Fern\u00e1ndez","year":"2000"},{"issue":"1","key":"10.1016\/S0304-3975(02)00637-0_BIB6","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00637-0_BIB7","series-title":"Proc. 19th ACM Symp. on Principles of Programming Languages (POPL\u201992)","first-page":"15","article-title":"The geometry of optimal lambda reduction","author":"Gonthier","year":"1992"},{"key":"10.1016\/S0304-3975(02)00637-0_BIB8","doi-asserted-by":"crossref","unstructured":"A.D. Gordon, G.D. Rees, Bisimilarity for a first-order calculus of objects with subtyping, in: Proc. 23rd ACM Symp. on Principles of Programming Languages, ACM Press, New York, January 1996.","DOI":"10.1145\/237721.237807"},{"issue":"2","key":"10.1016\/S0304-3975(02)00637-0_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/inco.1996.0008","article-title":"Proving congruence of bisimulation in functional programming languages","volume":"124","author":"Howe","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00637-0_BIB10","unstructured":"L. Khalil, Polymorphic types for interaction nets, in: H. Ehrig, G. Taentzer (Eds.), Proc. GRATRA\u20192000, Joint Appligraph and Getgrats Workshop on Graph Transformation Systems, Technical University of Berlin Report Number 2000\u20132, March 2000, pp. 257\u2013266."},{"key":"10.1016\/S0304-3975(02)00637-0_BIB11","doi-asserted-by":"crossref","unstructured":"Y. Lafont, Interaction nets, in: Proc. 17th ACM Symp. on Principles of Programming Languages (POPL\u201990), ACM Press, New York, January 1990, pp. 95\u2013108.","DOI":"10.1145\/96709.96718"},{"issue":"1","key":"10.1016\/S0304-3975(02)00637-0_BIB12","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":"Inform. Comput."},{"key":"10.1016\/S0304-3975(02)00637-0_BIB13","unstructured":"I. Mackie, The geometry of implementation, Ph.D. Thesis, Department of Computing, Imperial College of Science, Technology and Medicine, September 1994."},{"key":"10.1016\/S0304-3975(02)00637-0_BIB14","doi-asserted-by":"crossref","unstructured":"I. Mackie, YALE: Yet another lambda evaluator based on interaction nets, in: Proc. Third ACM SIGPLAN Internat. Conf. on Functional Programming (ICFP\u201998), ACM Press, New York, September 1998, pp. 117\u2013128.","DOI":"10.1145\/289423.289434"},{"key":"10.1016\/S0304-3975(02)00637-0_BIB15","doi-asserted-by":"crossref","unstructured":"J.S. Pinto, Sequential and concurrent abstract machines for interaction nets, in: J. Tiuryn (Ed.), Proc. Foundations of Software Science and Computation Structures (FOSSACS), Lecture Notes in Computer Science, vol. 1784, Springer, Berlin, 2000, pp. 267\u2013282.","DOI":"10.1007\/3-540-46432-8_18"},{"key":"10.1016\/S0304-3975(02)00637-0_BIB16","series-title":"Semantics and Logics of Computation, Publications of the Newton Institute","first-page":"241","article-title":"Operationally-based theories of program equivalence","author":"Pitts","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006370?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502006370?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T09:29:20Z","timestamp":1553678960000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502006370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0304397502006370"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00637-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}