{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:52Z","timestamp":1725664012542},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578871"},{"type":"electronic","value":"9783540483830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57887-0_91","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:39:45Z","timestamp":1330245585000},"page":"76-95","source":"Crossref","is-referenced-by-count":2,"title":["Extensions to type systems can preserve operational equivalences"],"prefix":"10.1007","author":[{"given":"Jon G.","family":"Riecke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh","family":"Subrahmanyam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"5_CR1","unstructured":"S. Abramsky. The lazy lambda calculus. In D. A. Turner, editor, Research Topics in Functional Programming, pages 65\u2013117. Addison-Wesley, 1990."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"R. Amadio. A fixed-point extension of the second-order lambda calculus. In Proceedings, Third Annual Symposium on Logic in Computer Science. IEEE, 1988.","DOI":"10.1109\/LICS.1988.5100"},{"key":"5_CR3","unstructured":"R. Amadio. On the adequacy of PER models. Technical Report CRIN 91-R-177, Centre de Recherche en Informatique de Nancy, 1991."},{"key":"5_CR4","unstructured":"R. Amadio. Recursion and Subtyping in Lambda Calculi. PhD thesis, Universita di Pisa, 1991."},{"key":"5_CR5","unstructured":"H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic. North-Holland, 1981. Revised Edition, 1984."},{"key":"5_CR6","unstructured":"B. Bloom and J. G. Riecke. LCF should be lifted. In T. Rus, editor, Proc. Conf. Algebraic Methodology and Software Technology, pages 133\u2013136. Department of Computer Science, University of Iowa, 1989."},{"key":"5_CR7","unstructured":"V. Breazu-Tannen. Conservative extensions of type theories. PhD thesis, Dept. Mathematics, Massachusetts Institute of Technology, 1987. Supervised by Albert R. Meyer."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings, Third Annual Symposium on Logic in Computer Science, pages 82\u201390. IEEE, 1988.","DOI":"10.1109\/LICS.1988.5103"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"V. Breazu-Tannen and A. R. Meyer. Computable values can be classical. In Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 238\u2013245. ACM, 1987.","DOI":"10.1145\/41625.41646"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"T. Coquand, C. A. Gunter, and G. Winskel. dI-domains as a model of polymorphism. In M. Main, A. Melton, M. Mislove, and D. Schmidt, editors, Mathematical Foundations of Programming Language Semantics: 3rd Workshop, volume 298 of Lect. Notes in Computer Sci., pages 344\u2013363. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-19020-1_18"},{"key":"5_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0890-5401(89)90068-0","volume":"81","author":"T. Coquand","year":"1989","unstructured":"T. Coquand, C. A. Gunter, and G. Winskel. Domain theoretic models of polymorphism. Information and Computation, 81:123\u2013167, 1989.","journal-title":"Information and Computation"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"S. S. Cosmadakis. Computing with recursive types. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 24\u201338. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39156"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"G. Ghelli. Recursive types are not conservative over F\u2264. In Typed Lambda Calculi and Applications, volume 664 of Lect. Notes in Computer Sci., pages 146\u2013162. Springer-Verlag, 1993.","DOI":"10.1007\/BFb0037104"},{"key":"5_CR14","unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989."},{"key":"5_CR15","unstructured":"C. A. Gunter. Semantics of Programming Languages: Structures and Techniques. MIT Press, 1992."},{"key":"5_CR16","unstructured":"R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, 1990."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"J. C. Mitchell. On abstraction and the expressive power of programming languages. In Theoretical Aspects of Computer Software, volume 526 of Lect. Notes in Computer Sci., pages 290\u2013310, 1991.","DOI":"10.1007\/3-540-54415-1_51"},{"key":"5_CR18","unstructured":"K. Mulmuley. Full Abstraction and Semantic Equivalence. ACM Doctoral Dissertation Award 1986. MIT Press, 1987."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"C.-H. L. Ong. Fully abstract models of the lazy lambda calculus. In 29th Annual Symposium on Foundations of Computer Science, pages 368\u2013376. IEEE, 1988.","DOI":"10.1109\/SFCS.1988.21953"},{"key":"5_CR20","unstructured":"C.-H. L. Ong. The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College, University of London, 1988."},{"key":"5_CR21","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. D. Plotkin","year":"1977","unstructured":"G. D. Plotkin. LCF considered as a programming language. Theoretical Computer Sci., 5:223\u2013257, 1977.","journal-title":"Theoretical Computer Sci."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"J. C. Reynolds. On the relation between direct and continuation semantics. In Proceedings of the Second Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 14, pages 141\u2013156. Springer-Verlag, 1974.","DOI":"10.1007\/3-540-06841-4_57"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"J. G. Riecke. Fully abstract translations between functional languages (preliminary report). In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 245\u2013254. ACM, 1991.","DOI":"10.1145\/99583.99617"},{"key":"5_CR24","unstructured":"J. G. Riecke. The Logic and Expressibility of Simply-Typed Call-by-Value and Lazy Languages. PhD thesis, Massachusetts Institute of Technology, 1991. Available as technical report MIT\/LCS\/TR-523 (MIT Laboratory for Computer Science)."},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"J. G. Riecke. Delimiting the scope of effects. In Proceedings of the 1993 Conference on Functional Programming and Computer Architecture, pages 146\u2013158. ACM, 1993.","DOI":"10.1145\/165180.165200"},{"key":"5_CR26","unstructured":"D. Scott. A type theoretical alternative to CUCH, ISWIM, OWHY. Unpublished manuscript, Oxford University, 1969."},{"key":"5_CR27","unstructured":"B. B. Sorensen and C. Clausen. Adequacy results for a lazy functional language with recursive and polymorphic types. Unpublished manuscript."},{"key":"5_CR28","unstructured":"R. Subrahmanyam. A theory of language expressiveness. Unpublished manuscript, Wesleyan University, 1993."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57887-0_91.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:36Z","timestamp":1605629736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}