{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171417},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590484"},{"type":"electronic","value":"9783540491781"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0014067","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T02:50:31Z","timestamp":1132714231000},"page":"397-413","source":"Crossref","is-referenced-by-count":6,"title":["A fully abstract translation between a \u03bb-calculus with reference types and Standard ML"],"prefix":"10.1007","author":[{"given":"Elke","family":"Ritter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew M.","family":"Pitts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"S. Abramsky and C.-H. L. Ong. Full abstraction in the lazy lambda calculus. Information and Computation, 105:159\u2013267, 1993.","journal-title":"Information and Computation"},{"key":"27_CR2","unstructured":"A. Gordon. Functional Programming and Input\/Output. PhD thesis, University of Cambridge, 1993. Also available as Technical Report No. 285."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"D. J. Howe. Equality in lazy computation systems. In Proc. 4th Annual Symp. Logic in Computer Science, pages 198\u2013203. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39174"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0956796800000125","volume":"1","author":"I. A. Mason","year":"1991","unstructured":"I. A. Mason and C. L. Talcott. Equivalence in functional languages with effects. Journal of Functional Programming, 1:287\u2013327, 1991.","journal-title":"Journal of Functional Programming"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"I. A. Mason and C. L. Talcott. References, local variables and operational reasoning. In Proc. 7th Annual Symp. Logic in Computer Science, pages 186\u2013197. IEEE Computer Society Press, 1992.","DOI":"10.1109\/LICS.1992.185532"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner. Fully abstract models of typed \u03bb-calculi. Theoretical Computer Science, 4:1\u201322, 1977.","journal-title":"Theoretical Computer Science"},{"key":"27_CR7","volume-title":"The Definition of Standard ML","author":"R. Milner","year":"1990","unstructured":"R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, Cambridge, MA, 1990."},{"key":"27_CR8","first-page":"275","volume-title":"Non-determinism in a functional setting-extended abstract","author":"C. L. Ong","year":"1993","unstructured":"C.-H. L. Ong. Non-determinism in a functional setting-extended abstract. In Proc. 8th Annual Symp. Logic in Computer Science, Montr\u00e9al, Canada, pages 275\u2013286. IEEE Computer Society Press, 1993."},{"key":"27_CR9","unstructured":"V. C. V. de Paiva, A. M. Pitts and I. D. B. Stark. A Monadic ML. In preparation."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-3975(94)90014-0","volume":"124","author":"A. M. Pitts","year":"1994","unstructured":"A. M. Pitts. A co-induction principle for recursively defined domains. Theoretical Computer Science, 124:195\u2013219, 1994.","journal-title":"Theoretical Computer Science"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"A. M. Pitts and I. D. B. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Proc. Int. Symp. on Math. Foundations of Computer Science, pages 122\u2013141. Lecture Notes in Computer Science No. 711, Berlin, 1993.","DOI":"10.1007\/3-540-57182-5_8"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1017\/S0960129500000293","volume":"3","author":"J.G. Riecke","year":"1993","unstructured":"J.G. Riecke. Fully abstract translations between functional languages. Mathematical Structures in Computer Science, 3:387\u2013415, 1993.","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:37:34Z","timestamp":1586565454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590484","9783540491781"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0014067","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}