{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:14Z","timestamp":1725663614245},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:47:05Z","timestamp":1330192025000},"page":"131-151","source":"Crossref","is-referenced-by-count":2,"title":["Full abstraction and the Context Lemma (preliminary report)"],"prefix":"10.1007","author":[{"given":"Trevor","family":"Jim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert R.","family":"Meyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"7_CR1","unstructured":"S. Abramsky. The lazy lambda calculus. In D. L. Turner, editor, Research Topics in Functional Programming. Addison-Wesley Publishing Co., 1989."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(91)90065-T","volume":"51","author":"S. Abramsky","year":"1991","unstructured":"S. Abramsky. Domain theory in logical form. Ann. Pure Appl. Logic, 51:1\u201377, 1991.","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR3","unstructured":"G. Berry. S\u00e9quentialit\u00e9 de l'evaluation formelle des lambda-expressions. In B. Robinet, editor, Program Transformations, 3 eme Colloque International sur la programmation, pages 67\u201380, 1978."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"G. Berry. Stable models of typed lambda-calculi. In G. Ausiello and C. B\u00f6hm, editors, Automata, Languages and Programming: Fifth Colloquium, volume 62 of Lecture Notes in Computer Science, pages 72\u201389. Springer-Verlag, July 1978.","DOI":"10.1007\/3-540-08860-1_7"},{"issue":"3","key":"7_CR5","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"G. Berry and P.-L. Curien. Sequential algorithms on concrete data structures. Theor. Comput. Sci., 20(3):265\u2013321, July 1982.","journal-title":"Theor. Comput. Sci."},{"key":"7_CR6","unstructured":"G. Berry and P.-L. Curien. Theory and practice of sequential algorithms: the kernel of the programming language CDS. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, chapter 2, pages 35\u201387. Cambridge Univ. Press, 1985."},{"key":"7_CR7","unstructured":"G. Berry, P.-L. Curien, and J.-J. L\u00e9vy. Full abstraction for sequential languages: the state of the art. In M. Nivat and J. C. Reynolds, editors, Algebraic Methods in Semantics, chapter 3, pages 89\u2013132. Cambridge Univ. Press, 1985."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"B. Bloom. Can LCF be topped? Flat lattice models of typed lambda calculus (preliminary report). In Third Annual Symposium on Logic in Computer Science, pages 282\u2013295. IEEE, 1988.","DOI":"10.1109\/LICS.1988.5127"},{"issue":"1\/2","key":"7_CR9","first-page":"263","volume":"87","author":"B. Bloom","year":"1990","unstructured":"B. Bloom. Can LCF be topped? Flat lattice models of typed \u03bb-calculus. Information and Computation, 87(1\/2):263\u2013300, July\/Aug. 1990.","journal-title":"Information and Computation"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can't be traced (preliminary report). In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, pages 229\u2013239, 1988. Also appears as MIT Technical Memo MIT\/LCS\/TM-345; submitted for journal publication.","DOI":"10.1145\/73560.73580"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"A. Bucciarelli and T. Ehrard. Sequentiality and strong stability. In Proceedings, Sixth Annual IEEE Symposium on Logic in Computer Science, 1991. to appear.","DOI":"10.1109\/LICS.1991.151638"},{"key":"7_CR12","unstructured":"P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. John Wiley and Sons, 1986."},{"key":"7_CR13","first-page":"152","volume":"45","author":"J.-Y. Girard","year":"1986","unstructured":"J.-Y. Girard. The system F of variable types, fifteen years later. Theor. Comput. Sci., 45:152\u2013192, 1986.","journal-title":"Theor. Comput. Sci."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"D. J. Howe. Equality in lazy computation systems. In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 198\u2013203. IEEE, 1989.","DOI":"10.1109\/LICS.1989.39174"},{"key":"7_CR15","series-title":"Technical Report","volume-title":"Computations in nonambiguous term rewriting systems","author":"G. Huet","year":"1979","unstructured":"G. Huet and J.-J. L\u00e9vy. Computations in nonambiguous term rewriting systems. Technical Report 359, INRIA, Rocquencourt, France, 1979."},{"key":"7_CR16","unstructured":"T. Jim and A. R. Meyer. Communication in the types electronic forum (types@theory.lcs.mit.edu). June 17 th , 1989."},{"key":"7_CR17","unstructured":"G. Kahn and D. B. MacQueen. Coroutines and networks of parallel processes. In B. Gilchrist, editor, Information Processing '77, pages 993\u2013998. North-Holland Publishing Co., 1977."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"I. Mason and C. Talcott. Programming, transforming, and proving with function abstractions and memories. In G. Ausiello, M. Dezani-Ciancaglini, and S. R. D. Rocca, editors, Automata, Languages and Programming: 16 th International Colloquium, volume 372 of Lecture Notes in Computer Science. Springer-Verlag, 1989.","DOI":"10.1007\/BFb0035784"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A. R. Meyer","year":"1982","unstructured":"A. R. Meyer. What is a model of the lambda calculus? Information and Control, 52(1):87\u2013122, Jan. 1982.","journal-title":"Information and Control"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"A. R. Meyer. Semantical paradigms: Notes for an invited lecture, with two appendices by Stavros Cosmadakis. In Third Annual Symposium on Logic in Computer Science, pages 236\u2013253. IEEE, 1988.","DOI":"10.1109\/LICS.1988.5123"},{"key":"7_CR21","doi-asserted-by":"crossref","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 the typed lambda calculus. Theor. Comput. Sci., 4:1\u201322, 1977.","journal-title":"Theor. Comput. Sci."},{"key":"7_CR22","unstructured":"K. Mulmuley. Full Abstraction and Semantic Equivalence. ACM Doctoral Dissertation Award 1986. MIT Press, 1987."},{"key":"7_CR23","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."},{"issue":"3","key":"7_CR24","doi-asserted-by":"publisher","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. Theor. Comput. Sci., 5(3):223\u2013256, Dec. 1977.","journal-title":"Theor. Comput. Sci."},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BF01876321","volume":"15","author":"V. Sazonov","year":"1976","unstructured":"V. Sazonov. Expressibility of functions in D. Scott's LCF language. Algebra i Logika, 15:308\u2013330, 1976. (Russian).","journal-title":"Algebra i Logika"},{"key":"7_CR26","unstructured":"D. S. Scott. A type theoretical alternative to CUCH, ISWIM, OWHY. Manuscript, Oxford Univ., 1969."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"D. S. Scott. Continuous lattices. In F. W. Lawvere, editor, Toposes, Algebraic Geometry and Logic, volume 274 of Lecture Notes in Mathematics, pages 97\u2013136. Springer-Verlag, 1972.","DOI":"10.1007\/BFb0073967"},{"key":"7_CR28","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. S. Scott","year":"1976","unstructured":"D. S. Scott. Data types as lattices. SIAM J. Comput., 5:522\u2013587, 1976.","journal-title":"SIAM J. Comput."},{"key":"7_CR29","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/359810.359826","volume":"20","author":"D. S. Scott","year":"1977","unstructured":"D. S. Scott. Logic and programming languages. Commun. ACM, 20:634\u2013645, 1977.","journal-title":"Commun. ACM"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"S. Smith. From operational to denotational semantics. In Mathematical Foundations of Programming Semantics, 1991. To appear.","DOI":"10.1007\/3-540-55511-0_3"},{"key":"7_CR31","unstructured":"A. Stoughton. Fully Abstract Models of Programming Languages. Research Notes in Theoretical Computer Science. Pitman\/Wiley, 1988. Revision of Ph.D. thesis, Dept. of Computer Science, Univ. Edinburgh, Report No. CST-40-86, 1986."},{"key":"7_CR32","series-title":"Lecture Notes","volume-title":"Fundamental concepts in programming languages","author":"C. Strachey","year":"1967","unstructured":"C. Strachey. Fundamental concepts in programming languages. Lecture Notes, Int'l. Summer School in Computer Programming, Copenhagen., 1967."},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"C. Talcott. Programming and proving with function and control abstractions. Technical Report STAN-CS-89-1288, Stanford Univ., 1988.","DOI":"10.21236\/ADA324006"}],"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-54415-1_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:21:25Z","timestamp":1619558485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}