Least and Greatest Fixpoints in Game Semantics

We show how solutions to many recursive arena equations can be computed in a natural way by allowing loops in arenas. We then equip arenas with winning functions and total winning strategies. We present two natural winning conditions compatible with the loop construction which respectively provide initial algebras and terminal coalgebras for a large class of continuous functors. Finally, we introduce an intuitionistic sequent calculus, extended with syntactic constructions for least and greatest fixed points, and prove it has a sound and (in a certain weak sense) complete interpretation in our game model.

[1]  Lawrence S. Moss.  Parametric corecursion , 2001, Theor. Comput. Sci..

[2]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 2000, Inf. Comput..

[3]  Samson Abramsky,et al.  A fully abstract game semantics for general references , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[4]  Radha Jagadeesan,et al.  Full Abstraction for PCF , 1994, Inf. Comput..

[5]  R. Cockett,et al.  Strong categorical datatypes I , 1991 .

[6]  P. Freyd.  Algebraically complete categories , 1991 .

[7]  Robert L. Constable,et al.  Infinite Objects in Type Theory , 1986, LICS.

[8]  Per Martin-Löf,et al.  Mathematics of infinity , 1988, Conference on Computer Logic.

[9]  Samson Abramsky.  Semantics of Interaction (Abstract) , 1996, CAAP.

[10]  Thorsten Altenkirch,et al.  A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types , 1999, TYPES.

[11]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[12]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[13]  Luigi Santocanale.  µ-Bicomplete Categories and Parity Games , 2002, RAIRO Theor. Informatics Appl..

[14]  Von Kurt Gödel,et al.  ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES , 1958 .

[15]  Andreas Blass,et al.  Degrees of indeterminacy of games , 1972 .

[16]  Joachim De Lataillade.  Second-order type isomorphisms through game semantics , 2008, Ann. Pure Appl. Log..

[17]  J. Roger Hindley,et al.  Introduction to combinators and λ-calculus , 1986, Acta Applicandae Mathematicae.

[18]  G. Winskel.  The formal semantics of programming languages , 1993 .

[19]  A. Arnold,et al.  Rudiments of μ-calculus , 2001 .

[20]  Paulo Oliva,et al.  Effective Bounds on Strong Unicity in L1-Approximation , 2001 .

[21]  Václav Koubek,et al.  Least Fixed Point of a Functor , 1979, J. Comput. Syst. Sci..

[22]  Guy McCusker.  Games and Full Abstraction for FPC , 2000, Inf. Comput..

[23]  J. Lambek.  A fixpoint theorem for complete categories , 1968 .

[24]  Thierry Coquand,et al.  Inductively defined types , 1988, Conference on Computer Logic.

[25]  J. Girard,et al.  Proofs and types , 1989 .

[26]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[27]  Ulrik Frendrup,et al.  Checking for Open Bisimilarity in the -Calculus , 2001 .

[28]  Russell Harmer,et al.  Totality in arena games , 2010, Ann. Pure Appl. Log..

[29]  J. Robin B. Cockett,et al.  Strong Categorical Datatypes II: A Term Logic for Categorical Programming , 1995, Theor. Comput. Sci..

[30]  Michael Barr,et al.  *-Autonomous categories and linear logic , 1991, Mathematical Structures in Computer Science.

[31]  A. Joyal.  Free Lattices, Communication and Money Games , 1997 .

[32]  P. J. Freyd.  Applications of Categories in Computer Science: Remarks on algebraically compact categories , 1992 .

[33]  André Joyal,et al.  Coherence Completions of Categories , 1999, Theor. Comput. Sci..

[34]  Daniel Fridlender,et al.  Do we need dependent types? , 2000, Journal of Functional Programming.

[35]  Martin Hyland.  Semantics and Logics of Computation: Game Semantics , 1997 .

[36]  Luigi Santocanale,et al.  The Alternation Hierarchy for the Theory of mu-lattices , 2000 .

[37]  Russ Harmer.  Innocent game semantics , 2006 .

[38]  Helmut Seidl.  Fast and Simple Nested Fixpoints , 1996, Inf. Process. Lett..

[39]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[40]  C.-H. Luke Ong,et al.  On Full Abstraction for PCF: I, II, and III , 2000, Inf. Comput..

[41]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[42]  Russell Harmer,et al.  Categorical Combinatorics for Innocent Strategies , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[43]  R. Seely,et al.  Finite sum-product logic. , 2001 .

[44]  Andreas Blass,et al.  A Game Semantics for Linear Logic , 1992, Ann. Pure Appl. Log..

[45]  Frits W. Vaandrager,et al.  Linear parametric model checking of timed automata , 2001, J. Log. Algebraic Methods Program..

[46]  S. Abramsky.  Game Semantics , 1999 .

[47]  R. A. G. Seely,et al.  Weakly distributive categories , 1997 .

[48]  S. Abramsky.  Semantics of Interaction: an introduction to Game Semantics , 1997 .

[49]  Paul-André Melliès.  Asynchronous games 4: a fully complete model of propositional linear logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[50]  Verzekeren Naar Sparen,et al.  Cambridge , 1969, Humphrey Burton: In My Own Time.

[51]  Luigi Santocanale.  A Calculus of Circular Proofs and Its Categorical Semantics , 2002, FoSSaCS.

[52]  Peter J. Freyd,et al.  Recursive types reduced to inductive types , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[53]  P. Dybjer.  Inductive sets and families in Martin-Lo¨f's type theory and their set-theoretic semantics , 1991 .

[54]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[55]  Gregory Gutin,et al.  Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP , 2001, Discret. Appl. Math..

[56]  Olivier Danvy,et al.  The Abstraction and Instantiation of String-Matching Programs , 2001, The Essence of Computation.

[57]  Z. Ésik,et al.  Iteration Theories: The Equational Logic of Iterative Processes , 1993 .

[58]  Michael Barr,et al.  Terminal Coalgebras in Well-Founded Set Theory , 1993, Theor. Comput. Sci..

[59]  Eng Guan Tay,et al.  On the number of quasi‐kernels in digraphs , 2001, J. Graph Theory.

[60]  Radha Jagadeesan,et al.  Games and Full Completeness for Multiplicative Linear Logic , 1994, J. Symb. Log..

[61]  Ralph Loader,et al.  Equational Theories for Inductive Types , 1997, Ann. Pure Appl. Log..

[62]  Olivier Laurent.  Classical isomorphisms of types , 2005, Math. Struct. Comput. Sci..

[63]  L. Santocanale,et al.  Free μ-lattices , 2000 .

[64]  A. Nerode,et al.  Concurrent Programs as Strategies in Games , 1992 .

[65]  Peter Dybjer,et al.  A general formulation of simultaneous inductive-recursive definitions in type theory , 2000, Journal of Symbolic Logic.

[66]  Claus Brabrand,et al.  Static Validation of Dynamically Generated HTML , 2001 .

[67]  R.K. Guy,et al.  On numbers and games , 1978, Proceedings of the IEEE.

[68]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[69]  Igor Walukiewicz,et al.  Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus , 2000, Inf. Comput..

[70]  Nellie Clarke Brown.  Trees , 1896, Savage Dreams.

[71]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .