Least and greatest fixpoints in game semantics

Abstract : 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.
Document type :
Conference papers
Foundations of Software Science and Computational Structures, Mar 2009, York, United Kingdom. pp.16-31, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-00596-1_3>


https://hal.archives-ouvertes.fr/hal-00443537
Contributor : Pierre Clairambault <>
Submitted on : Wednesday, December 30, 2009 - 1:22:20 PM
Last modification on : Friday, May 11, 2012 - 11:56:15 AM

Files

fixpoints.pdf
fileSource_public_author

Identifiers

Collections

PPS

Citation

Pierre Clairambault. Least and greatest fixpoints in game semantics. Foundations of Software Science and Computational Structures, Mar 2009, York, United Kingdom. pp.16-31, 2009, Lecture Notes in Computer Science. <10.1007/978-3-642-00596-1_3>. <hal-00443537>

Export

Share

Metrics

Consultation de
la notice

87

Téléchargement du document

55