{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300816,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"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_87","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:37:37Z","timestamp":1330263457000},"page":"1-15","source":"Crossref","is-referenced-by-count":40,"title":["Full Abstraction for PCF (extended abstract)"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pasquale","family":"Malacaria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radha","family":"Jagadeesan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Proofs as processes. Unpublished Lecture, 1991.","DOI":"10.1016\/0165-5728(91)90204-K"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"S. Abramsky and R. Jagadeesan, Games and Full Completeness for Multiplicative Linear Logic, 1992. To appear in Journal of Symbolic Logic.","DOI":"10.1007\/3-540-56287-7_113"},{"key":"1_CR3","unstructured":"S. Abramsky and R. Jagadeesan, Game semantics for Exponentials, 1993. Announcement on the types mailing list."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"M. Abadi and G. Plotkin, A PER model of polymorphism and recursive types, Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.","DOI":"10.1109\/LICS.1990.113761"},{"key":"1_CR5","unstructured":"G. Berry, Modeles completement adequats et stable de lambda-calculs types. These de Doctorat d'Etat, Universite Paris VII, 1979."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"G. Berry and P.-L. Curien, Sequential algorithms on concrete data structures. Theoretical Computer Science 1982.","DOI":"10.1016\/S0304-3975(82)80002-9"},{"key":"1_CR7","unstructured":"G Berry, P.-L. Curien and J.-J. Levy, Full Abstraction for Sequential Languages: the State of the Art, in M. Nivat and J. Reynolds, eds., Algebraic Methods in Semantics, Cambridge University Press 1985."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"A. Bucciarelli and T. Ehrhard, Extensional embedding of a strongly stable model of PCF, Proc. ICALP 1991, Springer LNCS 510 1991.","DOI":"10.1007\/3-540-54233-7_123"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"R. Cartwright and M. Felleisen, Observable Sequentiality and Full Abstraction, Proc. POPL 1992.","DOI":"10.1145\/143165.143232"},{"key":"1_CR10","unstructured":"P.-L. Curien, Categorical Combinators, Sequential Algorithms and Functional Programming, Pitman 1986."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"P.L. Curien, Sequentiality and Full Abstraction, in M. Fourman, P. T. Johnstone and A. M. Pitts, eds., Applications of Categories in Computer Science, Cambridge University Press 1992.","DOI":"10.1017\/CBO9780511525902.005"},{"key":"1_CR12","unstructured":"P.-L. Curien, Observable sequential algorithms on concrete data structures, Proc. LICS 1992."},{"key":"1_CR13","unstructured":"B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990."},{"key":"1_CR14","unstructured":"T. Ehrhard, Projecting sequential algorithms on the strongly stable functions, Annals of Pure and Applied Logic, 1993."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Towards a geometry of interaction. In J. W. Gray and A. Scedrov, editors, Categories in Computer Science and Logic, volume 92 of Contemporary Mathematics, pages 69\u2013108. American Mathematical Society, 1989.","DOI":"10.1090\/conm\/092\/1003197"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Geometry of interaction 1: Interpretation of System F. In R. Ferro et al., editor, Logic Colloquium 88. North Holland, 1989.","DOI":"10.1016\/S0049-237X(08)70271-4"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard. Geometry of interaction 2: Deadlock-free algorithms. In P. Martin-L\u00f6f and G. Mints, editors, International Conference on Computer Logic, COLOG 88, pages 76\u201393. Springer-Verlag, 1988. Lecture Notes in Computer Science 417.","DOI":"10.1007\/3-540-52335-9_49"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"A. Jung and A. Stoughton, Studying the Fully Abstract Model of PCF within its Continuous Function Model, Proc. Typed Lambda Calculus, 1993.","DOI":"10.1007\/BFb0037109"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"R. Milner, Fully Abstract Models for Typed Lambda Calculi, Theoretical Computer Science 1977.","DOI":"10.1016\/0304-3975(77)90053-6"},{"key":"1_CR21","unstructured":"K. Mulmuley, Full Abstraction and Semantic Equivalence, MIT Press 1987."},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"W. Phoa, Effective domains and intrinsic structure, Proc. of 5th Annual Symposium on Logic in Computer Science, 1990.","DOI":"10.1109\/LICS.1990.113762"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"G. Plotkin, LCF considered as a programming language, Theoretical Computer Science 1977.","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"1_CR24","unstructured":"A. Stoughton, Fully Abstract Models of Programming Languages, Pitman 1988."}],"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_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:16:24Z","timestamp":1742595384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57887-0_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578871","9783540483830"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-57887-0_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}