Previous Page 2

Displaying 21 – 35 of 35

Showing per page

Strong functors and interleaving fixpoints in game semantics

Pierre Clairambault (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We describe a sequent calculus μLJ with primitives for inductive and coinductive datatypes and equip it with reduction rules allowing a sound translation of Gödel’s system T. We introduce the notion of a μ-closed category, relying on a uniform interpretation of open μLJ formulas as strong functors. We show that any μ-closed category is a sound model for μLJ. We then turn to the construction of a concrete μ-closed category based on Hyland-Ong game semantics. The model relies on three main ingredients:...

Currently displaying 21 – 35 of 35

Previous Page 2