The following pages link to (Q4263866):
Displaying 15 items.
- Linear realizability and full completeness for typed lambda-calculi (Q556821) (← links)
- A type assignment system for game semantics (Q930873) (← links)
- Games characterizing Levy-Longo trees (Q1884875) (← links)
- Adapting innocent game models for the Böhm tree \(\lambda\)-theory (Q1884886) (← links)
- Processes and games (Q2851048) (← links)
- Model-checking games for typed \(\lambda\)-calculi (Q2864164) (← links)
- Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (Q3007657) (← links)
- Two-Level Game Semantics, Intersection Types, and Recursion Schemes (Q3167022) (← links)
- A General Class of Models of $\mathcal{H}^*$ (Q3182956) (← links)
- (Q4218941) (← links)
- (Q4580329) (← links)
- (Q4625694) (← links)
- Unfixing the Fixpoint: The Theories of the λY-Calculus (Q4922079) (← links)
- Refutation of Sallé's longstanding conjecture (Q5111316) (← links)
- Innocent game models of untyped \(\lambda\)-calculus (Q5958298) (← links)
