{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:38Z","timestamp":1725489518327},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678953"},{"type":"electronic","value":"9783540446224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44622-2_9","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T04:32:38Z","timestamp":1187238758000},"page":"140-155","source":"Crossref","is-referenced-by-count":9,"title":["A Fully Complete PER Model for ML Polymorphic Types"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"S. Abramsky. Retracing some paths in Process Algebra, Concur\u201996, 1996.","key":"9_CR1","DOI":"10.1007\/3-540-61604-7_44"},{"unstructured":"S. Abramsky. Axioms for Full Abstraction and Full Completeness, 1997, to appear.","key":"9_CR2"},{"unstructured":"S. Abramsky. Interaction, Combinators, and Complexity, Notes, Siena (Italy), 1997.","key":"9_CR3"},{"unstructured":"S. Abramsky, E. Haghverdi, P. Panangaden, P. Scott. Geometry of Interaction and Models of Combinatory Logic, 1998, to appear.","key":"9_CR4"},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1994.1041","volume":"111","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky, R. Jagadeesan. New foundations for the Geometry of Interaction, Inf. and Comp. 111(1), 1994, 53\u2013119.","journal-title":"Inf. and Comp."},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"S. Abramsky, R. Jagadeesan. Games and Full Completeness for Multiplicative Linear Logic, J. of Symbolic Logic 59(2), 1994, 543\u2013574.","journal-title":"J. of Symbolic Logic"},{"unstructured":"S. Abramsky, R. Jagadeesan, P. Malacaria. Full Abstraction for PCF, 1996, Inf. and Comp. to appear.","key":"9_CR7"},{"unstructured":"S. Abramsky, J. Longley. Realizability models based on history-free strategies, Draft paper, 1999.","key":"9_CR8"},{"unstructured":"S. Abramsky, M. Lenisa. Fully Complete Models for ML Polymorphic Types, Technical Report ECS-LFCS-99-414, LFCS, 1999 (available at http:\/\/www.dimi.uniud.it\/~lenisa\/Papers\/Soft-copy-ps\/lfcs99.ps.gz ).","key":"9_CR9"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(99)00047-X","volume":"227","author":"S. Abramsky","year":"1999","unstructured":"S. Abramsky, G. McCusker. Full abstraction for idealized Algol with passive expressions, TCS 227, 1999, 3\u201342.","journal-title":"TCS"},{"unstructured":"S. Abramsky, P. Mellies. Concurrent Games and Full Completeness, LICS\u201999.","key":"9_CR11"},{"unstructured":"A. Asperti, G. Longo. Categories, Types and Structures, Foundations of Computing Series, The MIT Press, 1991.","key":"9_CR12"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0304-3975(88)90097-7","volume":"59","author":"V. Breazu-Tannen","year":"1988","unstructured":"V. Breazu-Tannen, T. Coquand. Extensional models for polymorphism, TCS 59, 1988, 85\u2013114.","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"R. Crole, Categories for Types, Cambridge University Press, 1993.","key":"9_CR14","DOI":"10.1017\/CBO9781139172707"},{"key":"9_CR15","series-title":"Lect Notes Comput Sci","volume-title":"TLCA\u201999","author":"P. Gianantonio Di","year":"1999","unstructured":"P. Di Gianantonio, G. Franco, F. Honsell. Game Semantics for Untyped \u03bb-calculus, TLCA\u201999, LNCS, 1999."},{"unstructured":"J.Y. Girard. Interpr\u00e9tation functionelle et \u00e9limunation des coupures de l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur, Th\u00e9se d\u2019Etat, Universit\u00e9 Paris VII, 1972.","key":"9_CR16"},{"key":"9_CR17","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/conm\/092\/1003197","volume":"92","author":"J.Y. Girard","year":"1989","unstructured":"J.Y. Girard. Towards a Geometry of Interaction, Contemporary Mathematics 92, 1989, 69\u2013108.","journal-title":"Contemporary Mathematics"},{"unstructured":"D. Hughes. Hypergame Semantics: Full Completeness for System F, D.Phil. thesis, University of Oxford, submitted 1999.","key":"9_CR18"},{"key":"9_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BFb0040266","volume-title":"MFPS","author":"J. Hyland","year":"1990","unstructured":"J. Hyland, E. Robinson, G. Rosolini. Algebraic types in PER models, MFPS, M. Main et al. eds, LNCS 442, 1990, 333\u2013350."},{"unstructured":"M. Hyland, L. Ong. On full abstraction for PCF, Inf. and Comp., 1996, to appear.","key":"9_CR20"},{"key":"9_CR21","series-title":"Lect Notes Comput Sci","volume-title":"CSL\u201999","author":"A. Ker","year":"1999","unstructured":"A. Ker, H. Nickau, L. Ong. More Universal Game Models of Untyped \u03bb-Calculus: The B\u00f6hm Tree Strikes Back, CSL\u201999, LNCS, 1999."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1017\/S0305004100074338","volume":"119","author":"A. Joyal","year":"1996","unstructured":"A. Joyal, R. Street, D. Verity. Traced monoidal categories, Math. Proc. Comb. Phil. Soc. 119, 1996, 447\u2013468.","journal-title":"Math. Proc. Comb. Phil. Soc."},{"unstructured":"J. Laird. Full abstraction for functional languages with control, LICS\u201997.","key":"9_CR23"},{"unstructured":"G. McCusker. Games and full abstraction for FPC, LICS\u201996, 1996.","key":"9_CR24"},{"key":"9_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of the Symposium Logical Foundations for Computer Science","author":"H. Nickau","year":"1994","unstructured":"H. Nickau. Hereditarily sequential functionals, Proc. of the Symposium Logical Foundations for Computer Science, LNCS 813, 1994."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02023009","volume":"23","author":"R. Statman","year":"1983","unstructured":"R. Statman. \u03bb-definable functionals and \u03b2\u03b7-conversion, Arch. Math. Logik 23, 1983, 21\u201326.","journal-title":"Arch. Math. Logik"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44622-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:18:00Z","timestamp":1556756280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44622-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678953","9783540446224"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44622-2_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}