Strong functors and interleaving fixpoints in game semantics

DOI10.1051/ita/2012028zbMath1302.03072OpenAlexW2066766709MaRDI QIDQ2842239

Pierre Clairambault

Publication date: 13 August 2013

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/6baa7eb05615299aed1b9ac844d18fbc954c47ad

zbMATH Keywords

inductive typesgame semanticsinitial algebrascoinductive typesstrong functorsterminal coalgebras

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Cut-elimination and normal-form theorems (03F05) Theories (e.g., algebraic theories), structure, and semantics (18C10)

Related Items (1)

Fixed-Point Elimination in the Intuitionistic Propositional Calculus

This page was built for publication: Strong functors and interleaving fixpoints in game semantics