Least and Greatest Fixpoints in Game Semantics

DOI10.1007/978-3-642-00596-1_3zbMath1234.03017OpenAlexW1526446965MaRDI QIDQ3617718

Pierre Clairambault

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_3

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Logic in computer science (03B70)

Related Items (5)

Game semantics for dependent types ⋮ Realizability for Peano arithmetic with winning conditions in HON games ⋮ Imperative programs as proofs via game semantics ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Totality in arena games
• Equational theories for inductive types
• Games and full abstraction for FPC.
• On full abstraction for PCF: I, II and III
• Full abstraction for PCF
• Second-order type isomorphisms through game semantics
• A lattice-theoretical fixpoint theorem and its applications
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• Classical isomorphisms of types
• Games and full completeness for multiplicative linear logic
• A general formulation of simultaneous inductive-recursive definitions in type theory
• Least and Greatest Fixed Points in Linear Logic
• Free \(\mu\)-lattices

This page was built for publication: Least and Greatest Fixpoints in Game Semantics