The following pages link to (Q4501156):
Displaying 38 items.
- Intuitionistic games: determinacy, completeness, and normalization (Q332080) (← links)
- Realizability for Peano arithmetic with winning conditions in HON games (Q345704) (← links)
- Full abstraction for Reduced ML (Q388212) (← links)
- A game semantics for disjunctive logic programming (Q388214) (← links)
- Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
- Totality in arena games (Q636307) (← links)
- Glueing and orthogonality for models of linear logic (Q1398466) (← links)
- Parallel and serial hypercoherences (Q1583243) (← links)
- Game semantics for dependent types (Q1641014) (← links)
- Answer set programming in intuitionistic logic (Q1688962) (← links)
- Game semantics and linear CPS interpretation (Q1770417) (← links)
- The sequentially realizable functionals (Q1849853) (← links)
- Games and full abstraction for FPC. (Q1854351) (← links)
- Full abstraction for PCF (Q1854394) (← links)
- Comparing hierarchies of types in models of linear logic (Q1881220) (← links)
- Adapting innocent game models for the Böhm tree \(\lambda\)-theory (Q1884886) (← links)
- Game-theoretic analysis of call-by-value computation (Q1960532) (← links)
- Algorithmic probabilistic game semantics. Playing games with automata (Q2248076) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- Game semantics approach to higher-order complexity (Q2396718) (← links)
- Second-order type isomorphisms through game semantics (Q2474443) (← links)
- A game semantics of names and pointers (Q2474444) (← links)
- Asynchronous games. II: The true concurrency of innocence (Q2503039) (← links)
- A relational account of call-by-value sequentiality (Q2506495) (← links)
- Syntax vs. semantics: A polarized approach (Q2570132) (← links)
- Sequential algorithms and strongly stable functions (Q2570134) (← links)
- (Q2851048) (← links)
- Definability and Full Abstraction (Q2864154) (← links)
- A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus (Q2988382) (← links)
- Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (Q3007657) (← links)
- Full Abstraction for Reduced ML (Q3617719) (← links)
- Game theoretic analysis of call-by-value computation (Q4571955) (← links)
- The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ (Q4637682) (← links)
- A Game Semantics of Idealized CSP (Q4917059) (← links)
- Towards Nominal Abramsky (Q4922085) (← links)
- (Q5382449) (← links)
- Game semantics of Martin-Löf type theory (Q6190409) (← links)
- (Towards a) statistical probabilistic lazy lambda calculus (Q6612804) (← links)
