{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:18Z","timestamp":1725483738222},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_10","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T09:28:20Z","timestamp":1178357300000},"page":"141-151","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Axiomatizing Fully Complete Models 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,1]]},"reference":[{"key":"10_CR1","unstructured":"S. Abramsky. Axioms for Definability and Full Completeness, in Proof, Language and Interaction: Essays in Honour of Robin Milner, G. Plotkin, C. Stirling and M. Tofte, eds., MIT Press, 2000, 55\u201375."},{"issue":"2","key":"10_CR2","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\n                           59(2), 1994, 543\u2013574.","journal-title":"J. of Symbolic Logic"},{"key":"10_CR3","unstructured":"S. Abramsky, R. Jagadeesan, P. Malacaria. Full Abstraction for PCF, 1996, Inf. and Comp., to appear."},{"key":"10_CR4","unstructured":"A. Asperti, G. Longo. Categories, Types ad Structures, Foundations of Computing Series, The MIT Press, 1991."},{"key":"10_CR5","unstructured":"S. Abramsky, M. Lenisa. Fully Complete Models for ML Polymorphic Types, Report ECS-LFCS-99-414, University of Edinburgh, October 1999."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"S. Abramsky, M. Lenisa. A Fully Complete PER Model for ML Polymorphic Types, CSL\u20192000 Conf. Proc., to appear.","DOI":"10.1007\/3-540-44622-2_9"},{"key":"10_CR7","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\n                           227, 1999, 3\u201342.","journal-title":"TCS"},{"key":"10_CR8","unstructured":"S. Abramsky, P. Mellies. Concurrent Games and Full Completeness, LICS\u201999."},{"key":"10_CR9","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\n                           59, 1988, 85\u2013114.","journal-title":"TCS"},{"key":"10_CR10","unstructured":"N. Benton, P. Wadler. Linear Logic, Monads and the Lambda Calculus, LICS\u201996."},{"key":"10_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60042-6","volume-title":"TLCA\u201995","author":"G. Bierman","year":"1995","unstructured":"G. Bierman. What is a categorical Model of Intuitionistic Linear Logic?, TLCA\u201995 Conf. Proc., LNCS, 1995."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"R. Crole, Categories for Types, Cambridge University Press, 1993.","DOI":"10.1017\/CBO9781139172707"},{"key":"10_CR13","volume-title":"Interpr\u00e9tation functionelle et \u00e9limunation des coupures de l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur","author":"J.Y. Girard","year":"1972","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":"10_CR14","unstructured":"D.J.D. Hughes. Hypergame Semantics: Full Completeness for System F. D.Phil. thesis, University of Oxford, submitted 1999."},{"key":"10_CR15","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 Conf. Proc., M. Main et al. eds, LNCS 442, 1990, 333\u2013350."},{"key":"10_CR16","unstructured":"M. Hyland, L Ong. On full abstraction for PCF, Inf. and Comp., 1996, to appear."},{"key":"10_CR17","unstructured":"J. Laird. Full abstraction for functional languages with control, LICS\u201997."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"F. Lawvere. Equality in hyperdoctrines and the comprehension schema as an adjoint functor, Proc. Symp. on Applications of Categorical Logic, 1970.","DOI":"10.1090\/pspum\/017\/0257175"},{"key":"10_CR19","unstructured":"G. McCusker. Games and full abstraction for FPC, LICS\u201996."},{"key":"10_CR20","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":"10_CR21","series-title":"Lect Notes Comput Sci","volume-title":"CTCS\u201988","author":"A. Pitts","year":"1988","unstructured":"A. Pitts. Polymorphism is set-theoretic constructively, CTCS\u201988 Conf. Proc., D. Pitt ed., LNCS 283, 1988."},{"key":"10_CR22","unstructured":"R. Seely. Linear logic, *-autonomous categories and cofree coalgebras, in Category theory, computer science and logic, American Math. Society, 1987."},{"key":"10_CR23","volume-title":"Math. Reports","author":"R. Seely","year":"1990","unstructured":"R. Seely. Polymorphic linear logic and topos models, Math. Reports, Academy of Science (Canada) XII, 1990."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Statman. \u03bb-definable functionals and \u03b2\u03b7-conversion, Arch. Math. Logik\n                           23, 1983.","DOI":"10.1007\/BF02023009"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:11:58Z","timestamp":1558257118000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"1 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}