1 citations · 2 across the 14 of their papers we have counts for
7 papers · 1 filter
A Game-Semantic Model of Computation, Revisited: an Automata-Theoretic Perspective
Norihiro Yamada
In the previous work, we have given a novel, game-semantic model of computation in an intrinsic, non-inductive and non-axiomatic manner, which is similar to Turing machines but bey…
Game-theoretic Investigation of Intensional Equalities
Norihiro Yamada
This article presents a new game semantics for Martin-Löf type theory (MLTT), in which each game is equipped with selected isomorphism strategies that represent (computational) pro…
A Game-Semantic Model of Computation
Norihiro Yamada
The present paper introduces a novel notion of `(effective) computability', called viability, of strategies in game semantics in an intrinsic (i.e., without recourse to the standar…
Game Semantics for Martin-Löf Type Theory
Norihiro Yamada
We present a new game semantics for Martin-Löf type theory (MLTT), our aim is to give a mathematical and intensional explanation of MLTT. Specifically, we propose a category with f…
Game-theoretic Interpretation of Type Theory Part II: Uniqueness of Identity Proofs and Univalence
Norihiro Yamada
In the present paper, based on the previous work (Part I), we present a game semantics for the intensional variant of intuitionistic type theory that refutes the principle of uniqu…
Game-theoretic Interpretation of Intuitionistic Type Theory
Norihiro Yamada
We present a game semantics for intuitionistic type theory. Specifically, we propose categories with families of a new variant of games and strategies for both extensional and inte…
Dynamic Game Semantics
Norihiro Yamada, Samson Abramsky
The present paper gives a mathematical, in particular, syntax-independent, formulation of intensionality and dynamics of computation in terms of games and strategies. Specifically,…