{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:58Z","timestamp":1760202598367,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_3","type":"book-chapter","created":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T01:13:03Z","timestamp":1238116383000},"page":"16-31","source":"Crossref","is-referenced-by-count":10,"title":["Least and Greatest Fixpoints in Game Semantics"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Clairambault","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-44557-9_2","volume-title":"Types for Proofs and Programs","author":"A. Abel","year":"2000","unstructured":"Abel, A., Altenkirch, T.: A predicative strong normalisation proof for a lambda-calculus with interleaving inductive types. In: Coquand, T., Nordstr\u00f6m, B., Dybjer, P., Smith, J. (eds.) TYPES 1999. LNCS, vol.\u00a01956, pp. 21\u201340. Springer, Heidelberg (2000)"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S.: Semantics of interaction: an introduction to game semantics. In: Semantics and Logics of Computation, pp. 1\u201331 (1996)","DOI":"10.1017\/CBO9780511526619.002"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"543","DOI":"10.2307\/2275407","volume":"59","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jagadeesan, R.: Games and full completeness for multiplicative linear logic. J. Symb. Log.\u00a059(2), 543\u2013574 (1994)","journal-title":"J. Symb. Log."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jagadeesan, R., Malacaria, P.: Full Abstraction for PCF. Info. & Comp. (2000)","DOI":"10.1006\/inco.2000.2930"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Kohei, H., McCusker, G.: A fully abstract game semantics for general references. In: LICS, pp. 334\u2013344 (1998)","DOI":"10.1109\/LICS.1998.705669"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75560-9_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"D. Baelde","year":"2007","unstructured":"Baelde, D., Miller, D.: Least and greatest fixed points in linear logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS, vol.\u00a04790, pp. 92\u2013106. Springer, Heidelberg (2007)"},{"key":"3_CR7","unstructured":"Clairambault, P., Harmer, R.: Totality in Arena Games (submitted, 2008)"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Conway, J.H.: On Numbers and Games. AK Peters, Ltd. (2001)","DOI":"10.1201\/9781439864159"},{"issue":"2-3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.apal.2007.10.008","volume":"151","author":"J. Lataillade De","year":"2008","unstructured":"De Lataillade, J.: Second-order type isomorphisms through game semantics. Ann. Pure Appl. Logic\u00a0151(2-3), 115\u2013150 (2008)","journal-title":"Ann. Pure Appl. Logic"},{"key":"3_CR10","first-page":"59","volume":"14","author":"P. Dybjer","year":"1991","unstructured":"Dybjer, P.: Inductive sets and families in Martin-L\u00f6fs Type Theory and their set-theoretic semantics: An inversion principle for Martin-L\u00f6s type theory. Logical Frameworks\u00a014, 59\u201379 (1991)","journal-title":"Logical Frameworks"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"525","DOI":"10.2307\/2586554","volume":"65","author":"P. Dybjer","year":"2000","unstructured":"Dybjer, P.: A general formulation of simultaneous inductive-recursive definitions in type theory. J. Symb. Log.\u00a065(2), 525\u2013549 (2000)","journal-title":"J. Symb. Log."},{"key":"3_CR12","first-page":"95","volume-title":"Proc. 1990 Como Category Theory Conference","author":"P. Freyd","year":"1990","unstructured":"Freyd, P.: Algebraically complete categories. In: Proc. 1990 Como Category Theory Conference, vol.\u00a01488, pp. 95\u2013104. Springer, Heidelberg (1990)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Godel, K.: \u00dcber eine bisher noch nicht bentzte Erweiterung des finiten Standpunktes. Dialectica (1958)","DOI":"10.1111\/j.1746-8361.1958.tb01464.x"},{"key":"3_CR14","unstructured":"Harmer, R.: Innocent game semantics. Lecture notes (2004)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Harmer, R., Hyland, J.M.E., Melli\u00e8s, P.-A.: Categorical combinatorics for innocent strategies. In: LICS, pp. 379\u2013388 (2007)","DOI":"10.1109\/LICS.2007.14"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Hyland, J.M.E.: Game semantics. Semantics and Logics of Computation (1996)","DOI":"10.1017\/CBO9780511526619.005"},{"issue":"2","key":"3_CR17","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/inco.2000.2917","volume":"163","author":"J.M.E. Hyland","year":"2000","unstructured":"Hyland, J.M.E., Ong, C.H.L.: On full abstraction for PCF: I, II, and III. Inf. Comput.\u00a0163(2), 285\u2013408 (2000)","journal-title":"Inf. Comput."},{"key":"3_CR18","unstructured":"Joyal, A.: Remarques sur la th\u00e9orie des jeux \u00e0 deux personnes. Gaz. Sc. Math. Qu. (1977)"},{"issue":"5","key":"3_CR19","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1017\/S0960129505004895","volume":"15","author":"O. Laurent","year":"2005","unstructured":"Laurent, O.: Classical isomorphisms of types. Mathematical Structures in Computer Science\u00a015(5), 969\u20131004 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0168-0072(96)00021-8","volume":"84","author":"R. Loader","year":"1997","unstructured":"Loader, R.: Equational theories for inductive types. Ann. Pure Appl. Logic\u00a084(2), 175\u2013217 (1997)","journal-title":"Ann. Pure Appl. Logic"},{"key":"3_CR21","unstructured":"Lorenzen, P.: Logik und Agon. Atti Congr. Internat. di Filosofia (1960)"},{"issue":"1-2","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1999.2845","volume":"160","author":"G. McCusker","year":"2000","unstructured":"McCusker, G.: Games and full abstraction for FPC. Inf. Comput.\u00a0160(1-2), 1\u201361 (2000)","journal-title":"Inf. Comput."},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Melli\u00e8s, P.-A.: Asynchronous games 4: A fully complete model of propositional linear logic. In: LICS, pp. 386\u2013395 (2005)","DOI":"10.1109\/LICS.2005.6"},{"issue":"2-3","key":"3_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0022-4049(01)00098-6","volume":"168","author":"L. Santocanale","year":"2002","unstructured":"Santocanale, L.: Free \u03bc-lattices. J. Pure Appl. Algebra\u00a0168(2-3), 227\u2013264 (2002)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"3_CR25","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics\u00a05(2), 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T18:24:28Z","timestamp":1739039068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}