{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:49Z","timestamp":1761610369537,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80462-1","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Relating Semantic Models for the Object Calculus"],"prefix":"10.1016","volume":"7","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Hans","family":"H\u00fcttel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Josva","family":"Kleist","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"year":"1996","series-title":"A Theory of Objects","author":"Abadi","key":"10.1016\/S1571-0661(05)80462-1_BIB1"},{"key":"10.1016\/S1571-0661(05)80462-1_BIB2","series-title":"volume 103 of Studies in Logic and the Foundations of Mathematics.","article-title":"The Lambda-Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S1571-0661(05)80462-1_BIB3","doi-asserted-by":"crossref","unstructured":"Andrew D. Gordon and Gareth D. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Programming Languages, 1996.","DOI":"10.1145\/237721.237807"},{"key":"10.1016\/S1571-0661(05)80462-1_BIB4","doi-asserted-by":"crossref","unstructured":"A.R. Meyer. Semantical paradigms: Notes for an invited lecture. In Proceedings 3th Annual Symposium on Logic in Computer Science, Edinburgh, pages 236\u2013242. IEEE Computer Society Press, 1988.","DOI":"10.1109\/LICS.1988.5123"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)80462-1_BIB5"},{"key":"10.1016\/S1571-0661(05)80462-1_BIB6","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proceedings of 5th GI Conference LNCS 104, pages 167-183. Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S1571-0661(05)80462-1_BIB7","doi-asserted-by":"crossref","unstructured":"A. M. Pitts. Computational adequacy via 'mixed' inductive definitions. In Mathematical Foundations of Programming Semantics, Proc. 9th Int. Conf., New Orleans, LA, USA, April 1993, volume 802 of Lecture Notes in Computer Science, pages 72-82. Springer-Verlag, Berlin, 1994.","DOI":"10.1007\/3-540-58027-1_3"},{"issue":"3","key":"10.1016\/S1571-0661(05)80462-1_BIB8","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80462-1_BIB9","article-title":"Lazy functions and mobile processes","author":"Sangiorgi","year":"1995","journal-title":"Rapports de Recherche RR-2515, INRIA Sophia-Antipolis"},{"year":"1988","series-title":"Fully abstract models of programming languages","author":"Stoughton","key":"10.1016\/S1571-0661(05)80462-1_BIB10"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804621?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804621?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:56Z","timestamp":1761610016000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804621"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":10,"alternative-id":["S1571066105804621"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80462-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Relating Semantic Models for the Object Calculus","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80462-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}