{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T08:10:02Z","timestamp":1746000602495,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381638"},{"type":"electronic","value":"9783642381645"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38164-5_11","type":"book-chapter","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T17:59:00Z","timestamp":1367344740000},"page":"150-165","source":"Crossref","is-referenced-by-count":0,"title":["Unfixing the Fixpoint: The Theories of the \u03bbY-Calculus"],"prefix":"10.1007","author":[{"given":"Furio","family":"Honsell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1006\/inco.2000.2930","volume":"163","author":"S. Abramsky","year":"2000","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation\u00a0163, 404\u2013470 (2000)","journal-title":"Information and Computation"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1006\/inco.1993.1044","volume":"105","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Ong, C.-H.L.: Full Abstraction in the Lazy lambda-calculus. Information and Computation\u00a0105(2), 159\u2013268 (1993)","journal-title":"Information and Computation"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-44802-0_31","volume-title":"Computer Science Logic","author":"S. Abramsky","year":"2001","unstructured":"Abramsky, S., Lenisa, M.: Fully Complete Minimal PER Models for the Simply Typed \u03bb-calculus. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol.\u00a02142, pp. 443\u2013457. Springer, Heidelberg (2001)"},{"key":"11_CR4","unstructured":"Baeten, J., Boerboom, B.: Omega can be anything it should not be. Proc. of Koninklijke Netherlandse Akademie van Wetenschappen, Serie A, Indag. Matematicae 41 (1979)"},{"key":"11_CR5","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. North-Holland, Amsterdam (1984)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bloom, S., Esik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer (1993)","DOI":"10.1007\/978-3-642-78034-9"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-44904-3_6","volume-title":"Typed Lambda Calculi and Applications","author":"A. Bucciarelli","year":"2003","unstructured":"Bucciarelli, A., Leperchey, B., Padovani, V.: Relative Definability and Models of Unary PCF. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 75\u201389. Springer, Heidelberg (2003)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Carraro, A., Salibra, A.: Reflexive domains are not complete for the extensional lambda calculus. In: Proc. of LICS 2009, pp. 91\u2013100. IEEE Computer Society Publications (2009)","DOI":"10.1109\/LICS.2009.22"},{"key":"11_CR9","unstructured":"Conway, J.H.: On Numbers and Games, 2nd edn. A K Peters Ltd. (2001); 1st edn. Academic Press (1976)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48959-2_10","volume-title":"Typed Lambda Calculi and Applications","author":"P. Gianantonio Di","year":"1999","unstructured":"Di Gianantonio, P., Franco, G., Honsell, F.: Game semantics for untyped \u03bb\u03b2\u03b7-calculus. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol.\u00a01581, pp. 114\u2013128. Springer, Heidelberg (1999)"},{"key":"11_CR11","unstructured":"Honsell, F., Lenisa, M.: Categories of Coalgebraic Games with Selective Sum, http:\/\/sole.dimi.uniud.it\/~marina.lenisa\/Papers\/Soft-copy-pdf\/sel.pdf (submitted)"},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.ic.2008.03.027","volume":"207","author":"F. Honsell","year":"2009","unstructured":"Honsell, F., Plotkin, G.: On the completeness of order-theoretic models of the \u03bb-calculus. Information and Computation\u00a0207(5), 583\u2013594 (2009)","journal-title":"Information and Computation"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Honsell, F., Ronchi Della Rocca, S.: An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus. Journal of Computer and System Sciences\u00a045(1) (1992)","DOI":"10.1016\/0022-0000(92)90040-P"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44904-3_15","volume-title":"Typed Lambda Calculi and Applications","author":"J. Laird","year":"2003","unstructured":"Laird, J.: A Fully Abstract Bidomain Model of Unary FPC. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 211\u2013225. Springer, Heidelberg (2003)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Plotkin, G., Simpson, A.: Complete Axioms for Categorical Fixed-point Operators. In: Proc. of LICS 2000, pp. 30\u201341. Computer Society Press of the IEEE (2000)","DOI":"10.1109\/LICS.2000.855753"}],"container-title":["Lecture Notes in Computer Science","Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38164-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T07:35:32Z","timestamp":1745998532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38164-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381638","9783642381645"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38164-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}