{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:50Z","timestamp":1760202530161},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540638766"},{"type":"electronic","value":"9783540696599"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0058024","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T10:48:04Z","timestamp":1154602084000},"page":"74-87","source":"Crossref","is-referenced-by-count":14,"title":["Compilation and equivalence of imperative objects"],"prefix":"10.1007","author":[{"given":"A. D.","family":"Gordon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. D.","family":"Hankin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. B.","family":"Lassen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Cardelli. An imperative object calculus: Basic typing and soundness. In Proceedings SIPL'95, 1995. Technical Report UIUCDCS-R-95-1900, Department of Computer Science, University of Illinois at Urbana-Champaign.","DOI":"10.1007\/3-540-59293-8_214"},{"issue":"13","key":"7_CR2","first-page":"151","volume":"1","author":"M. Abadi","year":"1996","unstructured":"M. Abadi and L. Cardelli. An imperative object calculus. Theory and Practice of Object Systems, 1(13):151\u2013166, 1996.","journal-title":"Theory and Practice of Object Systems"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Cardelli. A Theory of Objects. Springer-Verlag, 1996.","DOI":"10.1007\/978-1-4419-8598-9"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"M. Abadi and K.R.M. Leino. A logic of object-oriented programs. In Proceedings TAPSOFT '97, volume 1214 of Lecture Notes in Computer Science, pages 682\u2013696. Springer-Verlag, April 1997.","DOI":"10.1007\/BFb0030634"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"G. Agha, I. Mason, S. Smith and C. Talcott. A foundation for actor computation. Journal of Functional Programming, 7(1), January 1997.","DOI":"10.1017\/S095679689700261X"},{"key":"7_CR6","unstructured":"D.S. Andersen and L.H. Pedersen. An operational approach to the \u03c2-calculus. Master's thesis, Department of Mathematics and Computer Science, Aalborg, 1996. Available as Report R-96-2034."},{"key":"7_CR7","unstructured":"C. Chambers. The Design and Implementation of the Self Compiler, an Optimizing Compiler for Object-Oriented Programming Languages. PhD thesis, Computer Science Department, Stanford University, March 1992."},{"key":"7_CR8","unstructured":"M. Felleisen and D. Friedman. Control operators, the SECD-machine, and the \u03bb-calculus. In Formal Description of Programming Concepts III, pages 193\u2013217. North-Holland, 1986."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"A.D. Gordon, S.B. Lassen and P.D. Hankin. Compilation and equivalence of imperative objects. Technical Report 429, University of Cambridge Computer Laboratory, 1997. Also appears as BRICS Report RS-97-19, BRICS, Department of Computer Science, University of Aarhus.","DOI":"10.7146\/brics.v4i19.21677"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"A.D. Gordon and G.D. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Proceedings POPL'96, pages 386\u2013395. ACM, 1996. Accepted for publication in Information and Computation.","DOI":"10.1145\/237721.237807"},{"issue":"1\/2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01128407","volume":"8","author":"J.D. Guttman","year":"1995","unstructured":"J.D. Guttman, V. Swarup and J. Ramsdell. The VLISP verified scheme system. Lisp and Symbolic Computation, 8(1\/2):33\u2013110, 1995.","journal-title":"Lisp and Symbolic Computation"},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1017\/S0960129500001559","volume":"4","author":"J. Hannan","year":"1992","unstructured":"J. Hannan and D. Miller. From operational semantics to abstract machines. Mathematical Structures in Computer Science, 4(2):415\u2013489, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"T. Hardin, L. Maranget and B. Pagano. Functional back-ends and compilers within the lambda-sigma calculus. In ICFP'96, May 1996.","DOI":"10.1145\/232627.232632"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1006\/inco.1995.1077","volume":"119","author":"F. Honsell","year":"1993","unstructured":"F. Honsell, I. Mason, S. Smith and C. Talcott. A variable typed logic of effects. Information and Computation, 119(1):55\u201390, 1993.","journal-title":"Information and Computation"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"H. H\u00fcttel and J. Kleist. Objects as mobile processes. In Proceedings MFPS'96, 1996.","DOI":"10.7146\/brics.v3i38.20020"},{"key":"7_CR16","unstructured":"X. Leroy. The ZINC experiment: an economical implementation of the ML language. Technical Report 117, INRIA, 1990."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"T. Lindholm and F. Yellin. The Java Virtual Machine Specification. The Java Series. Addison-Wesley, 1997.","DOI":"10.1007\/978-3-642-95851-9_5"},{"issue":"3","key":"7_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I. Mason","year":"1991","unstructured":"I. Mason and C. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1(3):287\u2013327, 1991.","journal-title":"Journal of Functional Programming"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E. Moggi","year":"1989","unstructured":"E. Moggi. Notions of computations and monads. Information and Computation, 93:55\u201392, 1989. Earlier version in Proceedings LICS'89.","journal-title":"Information and Computation"},{"key":"7_CR20","unstructured":"J.H. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, MIT, December 1968."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"A. Ohori. A compilation method for ML-style polymorphic record calculi. In Proceedings POPL'92, pages 154\u2013165. ACM, 1992.","DOI":"10.1145\/143165.143200"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"G.D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science, 1:125\u2013159, 1975.","journal-title":"Theoretical Computer Science"},{"key":"7_CR23","unstructured":"M. Rittri. Proving compiler correctness by bisimulation. PhD thesis, Chalmers, 1990."},{"key":"7_CR24","unstructured":"D. Sangiorgi. An interpretation of typed objects into typed \u03c0-calculus. In FOOL 3, New Brunswick, 1996."},{"key":"7_CR25","unstructured":"P. Sestoft. Deriving a lazy abstract machine. Technical Report 1994-146, Department of Computer Science, Technical University of Denmark, September 1994."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"I. Stark. Names, equations, relations: Practical ways to reason about new. In TLCA '97, number 1210 in LNCS, pages 336\u2013353. Springer, 1997.","DOI":"10.1007\/3-540-62688-3_45"},{"key":"7_CR27","unstructured":"C. Talcott. Reasoning about functions with effects. In Higher Order Operational Techniques in Semantics, Publications of the Newton Institute, pages 347\u2013390. Cambridge University Press, 1997. To appear."},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"M. Wand. Compiler correctness for parallel languages. In Proceedings FPCA '95, pages 120\u2013134. ACM, June 1995.","DOI":"10.1145\/224164.224193"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0058024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:03:40Z","timestamp":1555769020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0058024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540638766","9783540696599"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0058024","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}