Strong functors and interleaving fixpoints in game semantics (Q2842239)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6198058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong functors and interleaving fixpoints in game semantics |
scientific article; zbMATH DE number 6198058 |
Statements
13 August 2013
0 references
game semantics
0 references
strong functors
0 references
initial algebras
0 references
terminal coalgebras
0 references
inductive types
0 references
coinductive types
0 references
Strong functors and interleaving fixpoints in game semantics (English)
0 references
The paper develops a sequent calculus for inductive and coinductive types and endows it with reduction rules for allowing a sound translation of Gödel's system \(T\). The authors introduce a categorical model for the calculus and build a concrete instance based on Hyland-Ong game semantics. A weak completeness result is proved for this model, that yields a normalisation proof for the calculus.
0 references
0.8021753430366516
0 references
0.7547193765640259
0 references
0.7527967691421509
0 references
0.7458380460739136
0 references
0.7429198622703552
0 references
