Pages that link to "Item:Q3007657"
From MaRDI portal
The following pages link to Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (Q3007657):
Displaying 11 items.
- A coinductive approach to proof search through typed lambda-calculi (Q2231698) (← links)
- A short note on type-inhabitation: formula-trees vs. game semantics (Q2353633) (← links)
- Model-checking games for typed \(\lambda\)-calculi (Q2864164) (← links)
- Ludics with repetitions (Exponentials, Interactive types and Completeness) (Q3003332) (← links)
- Two-Level Game Semantics, Intersection Types, and Recursion Schemes (Q3167022) (← links)
- A Datalog Recognizer for Almost Affine λ-CFGs (Q3172825) (← links)
- (Q4218941) (← links)
- (Q4263866) (← links)
- Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search (Q5236550) (← links)
- Innocent game models of untyped \(\lambda\)-calculus (Q5958298) (← links)
- Partial proof terms in the study of idealized proof search (Q6648177) (← links)