 |
|
|
|
| HAL: hal-00443537, version 1 |
| arXiv: 1001.0641 |
| DOI: 10.1007/978-3-642-00596-1_3 |
| Detailed view |  Export this paper |
|
|
| Foundations of Software Science and Computational Structures, York : United Kingdom (2009) |
|
|
|
|
| Least and greatest fixpoints in game semantics |
|
|
| Pierre Clairambault 1 |
|
|
| (2009-03-27) |
|
|
|
| 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: | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Programming Languages Computer Science/Computer Science and Game Theory Computer Science/Logic in Computer Science |
|
|
| game semantics – initial algebras – terminal coalgebras |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00443537, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00443537 | |
| oai:hal.archives-ouvertes.fr:hal-00443537 | |
| From: Pierre Clairambault | |
| Submitted on: Wednesday, 30 December 2009 13:22:20 | |
| Updated on: Friday, 11 May 2012 11:56:15 | |
