{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T06:23:12Z","timestamp":1744093392995},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425540"},{"type":"electronic","value":"9783540448020"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_31","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:15:38Z","timestamp":1180656938000},"page":"443-457","source":"Crossref","is-referenced-by-count":7,"title":["Fully Complete Minimal PER Models for the Simply Typed \u03bb-Calculus"],"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,8,30]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky. Retracing some paths in Process Algebra, Concur\u201996, U. Montanari and V. Sassone eds., 1996, 1\u201317.","DOI":"10.1007\/3-540-61604-7_44"},{"key":"31_CR2","unstructured":"S. Abramsky. Interaction, Combinators, and Complexity, Notes, Siena (Italy), 1997."},{"key":"31_CR3","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."},{"key":"31_CR4","unstructured":"S. Abramsky. A Structural Approach to Reversible Computation, May 2001."},{"key":"31_CR5","unstructured":"S. Abramsky, E. Haghverdi, P. Scott. Geometry of Interaction and Models of Combinatory Logic, 1998, to appear."},{"issue":"1","key":"31_CR6","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":"31_CR7","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"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"S. Abramsky, R. Jagadeesan, P. Malacaria. Full Abstraction for PCF, Inf. and comp. 163, 2000, 409\u2013470.","journal-title":"Inf. and comp."},{"key":"31_CR9","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":"31_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/3-540-44622-2_9","volume-title":"CSL\u201900","author":"S. Abramsky","year":"2000","unstructured":"S. Abramsky, M. Lenisa. A Fully-complete PER Model for ML Polymorphic Types, CSL\u201900, LNCS 1862, 2000, 140\u2013155."},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"S. Abramsky, J. Longley. Realizability models based on history-free strategies, 1999.","DOI":"10.1016\/S1571-0661(04)00099-4"},{"key":"31_CR12","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"},{"key":"31_CR13","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":"31_CR14","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."},{"key":"31_CR15","unstructured":"J. Laird. Games, control and full abstraction, February 2000."},{"key":"31_CR16","unstructured":"An Algorithm for the Minimal Model, Note, 1997."},{"key":"31_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/3-540-61780-9_71","volume-title":"TYPES\u201995","author":"V. Padovani","year":"1996","unstructured":"V. Padovani. Decidability of all Minimal Models, TYPES\u201995, LNCS 1185, 201\u2013215."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T23:46:58Z","timestamp":1683848818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}