{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:22Z","timestamp":1761611122069,"version":"build-2065373602"},"reference-count":33,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,9,25]],"date-time":"2004-09-25T00:00:00Z","timestamp":1096070400000},"content-version":"vor","delay-in-days":3555,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1016\/s1571-0661(04)00027-1","type":"journal-article","created":{"date-parts":[[2004,1,29]],"date-time":"2004-01-29T05:14:39Z","timestamp":1075353279000},"page":"487-514","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Objects, Interference, and the Yoneda Embedding"],"prefix":"10.1016","volume":"1","author":[{"given":"Peter W.","family":"O'Hearn","sequence":"first","affiliation":[]},{"given":"Uday S.","family":"Reddy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"8","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the von Neumann style? A functional style and its algebra of programs","volume":"21","author":"Backus","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB2","doi-asserted-by":"crossref","unstructured":"G. Berry. Stable models of typed lambda calculi. In G. Ausiello and C. Boehm, editors, Automata, Languages and Programming, volume 62 of Lecture Notes in Computer Science, pages 72\u201389, Berlin, 1978. Springer-Verlag.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB3","unstructured":"R. Cartwright, P.-L. Curien, and M. Felleisen. Fully abstract semantics for observably sequential languages. Technical Report 93-219, Rice University, December 1993. To appear in Information and Computation, 1994."},{"year":"1993","series-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB4"},{"year":"1989","series-title":"Proofs and Types","author":"Girard","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB5"},{"year":"1994","series-title":"Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB6"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB7","unstructured":"C.B. Jones. An object-based design method for concurrent programs. Univ of Manchester CS tech report, UMCS-92-12-1, 1992."},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB8","unstructured":"G.M. Kelly. Basic Concepts of Enriched Category Theory. Cambridge University Press, 1982. London Math. Soc. Lecture Notes Series, 64."},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB9","doi-asserted-by":"crossref","unstructured":"A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables: preliminary report. In Conf. Record 15th ACM Symp. on Principles of Programming Languages, pages 191\u2013203. ACM, New York, 1988.","DOI":"10.1145\/73560.73577"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB10","doi-asserted-by":"crossref","unstructured":"E. Moggi. Computational lambda-calculus and monads. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 14\u201323, Pacific Grove, California, 1989. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1989.39155"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB11","unstructured":"M. Odersky. A functional theory of local names. In Conf. Record 20th ACM Symp. on Principles of Programming Languages, Charleston, South Carolina, 1993. ACM, New York."},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1017\/S0960129500000311","article-title":"A model for syntactic control of interference","volume":"3","author":"O'Hearn","year":"1993","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB13","doi-asserted-by":"crossref","unstructured":"P. W. O'Hearn, A. J. Power, M. Takeyama, and R. D. Tennent. Syntactic control of interference revisited, in thie volume, 1995.","DOI":"10.1016\/S1571-0661(04)00026-X"},{"issue":"1","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB14","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1006\/inco.1993.1060","article-title":"Semantical analysis of specification logic, part 2","volume":"107","author":"O'Hearn","year":"1993","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB15","doi-asserted-by":"crossref","unstructured":"P. W. O'Hearn and R. D. Tennent. Parametricity and local variables. Journal of the ACM, 1995. To appear. Preliminary version appeared in Conf. Record 20th ACM Symp. on Principles of Programming Languages, Charleston, South Carolina, pages 171\u2013184. ACM, New York, 1993.","DOI":"10.1145\/158511.158624"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB16","unstructured":"F. J. Oles. A Category-Theoretic Approach to the Semantics of Programming Languages. Ph.D. thesis, Syracuse University, Syracuse, N.Y., 1982."},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB17","series-title":"Algebraic Methods in Semantics","first-page":"543","article-title":"Type algebras, functor categories and block structure","author":"Oles","year":"1985"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB18","doi-asserted-by":"crossref","unstructured":"A. Pitts and I. Stark. On the observable properties of higher-order functions that dynamically create local names (preliminary report). In ACM SIGLPLAN Workshop on State in Programming Languages, pages 31\u201345, 1993. Available as Yale Technical Report YALEU\/DCS\/RR-968.","DOI":"10.1007\/3-540-57182-5_8"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB19","doi-asserted-by":"crossref","unstructured":"A. M. Pitts and I. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Mathematical Foundations of Computer Science, number 711 in Lecture Notes in Computer Science, pages 122\u2013141. Springer-Verlag, 1993","DOI":"10.1007\/3-540-57182-5_8"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB20","unstructured":"G. D. Plotkin. Type theory and recursion. 1993."},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB21","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Passivity and independence. In Proceedings, 9th Annual IEEE Symposium on Logic in Computer Science, pages 342\u2013352. IEEE Computer Society Press, Los Alamitos, California, 1994.","DOI":"10.1109\/LICS.1994.316055"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB22","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Global states considered unnecessary: Introduction to object-based semantics. To appear in Lisp and Symbolic Computation special issue on state in programming languages, 1995.","DOI":"10.1007\/BF01806032"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB23","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. Syntactic control of interference. In Conf. Record 5th ACM Symp. on Principles of Programming Languages, pages 39\u201346, Tucson, Arizona, 1978. ACM, New York.","DOI":"10.1145\/512760.512766"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB24","series-title":"Algorithmic Languages","first-page":"345","article-title":"The essence of Algol","author":"Reynolds","year":"1981"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB25","series-title":"Information Processing 83","first-page":"513","article-title":"Types, abstraction and parametric polymorphism","author":"Reynolds","year":"1983"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB26","doi-asserted-by":"crossref","unstructured":"K. Sieber. Full abstraction for the second order subset of an Algol-like language (preliminary report). Technischer Bericht A 01\/94, Universitaet des Saarlandes, February, 1994.","DOI":"10.1007\/3-540-58338-6_107"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB27","unstructured":"I. A. Stark. Categorical models of local names. Submitted to Lisp and Symbolic Computation, special issue on state in programming languages., 1994."},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB28","unstructured":"C. Strachey. Fundamental Concepts in Programming Languages. Unpublished lecture notes, International Summer School in Computer Programming, Copenhagen, August 1967."},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB29","doi-asserted-by":"crossref","unstructured":"R. D. Tennent. Functor-category semantics of programming languages and logics. In D. Pitt, S. Abramsky, A. Poign\u00e9, and D. Rydeheard, editors, Category Theory and Computer Programming, volume 240 of Lecture Notes in Computer Science, pages 206\u2013224, Guildford, U.K., 1986. Springer-Verlag, Berlin","DOI":"10.1007\/3-540-17162-2_124"},{"issue":"2","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB30","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0890-5401(90)90045-J","article-title":"Semantical analysis of specification logic","volume":"85","author":"Tennent","year":"1990","journal-title":"Information and Computation"},{"year":"1991","series-title":"Semantics of Programming Languages","author":"Tennent","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB31"},{"issue":"2","key":"10.1016\/S1571-0661(04)00027-1_NEWBIB32","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1006\/inco.1995.1018","article-title":"Objects in the \u03c0-calculus","volume":"116","author":"Walker","year":"1995","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00027-1_NEWBIB33","doi-asserted-by":"crossref","unstructured":"G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Applications and Relationships to Other Models of Concurrency, volume 255 of LNCS, pages 325\u2013392. Springer-Verlag, 1987","DOI":"10.1007\/3-540-17906-2_31"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104000271?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:04:01Z","timestamp":1761609841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104000271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":33,"alternative-id":["S1571066104000271"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00027-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Objects, Interference, and the Yoneda Embedding","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(04)00027-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}