• Corpus ID: 10861013

Game Semantics for Martin-Löf Type Theory

  title={Game Semantics for Martin-L{\"o}f Type Theory},
  author={Norihiro Yamada},
We present a new game semantics for Martin-L\"of type theory (MLTT), our aim is to give a mathematical and intensional explanation of MLTT. Specifically, we propose a category with families of a novel variant of games, which induces a surjective and injective (when Id-types are excluded) interpretation of the intensional variant of MLTT equipped with unit-, empty-, N-, dependent product, dependent sum and Id-types as well as the cumulative hierarchy of universes for the first time in the… 
Game-theoretic Investigation of Intensional Equalities
A first game semantics for MLTT is obtained that refutes the principle of uniqueness of identity proofs (UIP) and validates univalence axiom (UA) though it does not model non-trivial higher equalities.
A game-semantic model of computation
This work shows, as a main technical achievement, that viable strategies in game semantics are Turing complete and has given a mathematical foundation of computation in the same sense as Turing machines but beyond computation on natural numbers, e.g., higher-order computation, in a more abstract fashion.
Proofs and Strategies A Characterization of Classical and Intuitionistic Logic using Games with Explicit Strategies MSc Thesis (Afstudeerscriptie)
This work enrichs the language of first-order logic with two force markers denoting assertion and challenge with a close correspondence between composition and the cut-rule, giving soundness and completeness for classical and intuitionistic logic.
Game semantics of Martin-Löf type theory, part III: its consistency with Church's thesis
This work proves consistency of intensional Martin-Lof type theory with formal Church's thesis (CT) by novel realizability a la game semantics, which is based on the author's previous work.
Parametric Church's Thesis: Synthetic Computability Without Choice
This work introduces various parametric strengthenings of CTφ, which are equivalent to assuming CT φ and an S n operator for φ like in the S n theorem, and explains the novel axioms and proofs of Rice’s theorem.
In Search of Effectful Dependent Types
This thesis develops a game semantics for dependent type theory, which had so far been missing altogether and explores a generalisation of Levy’s call-by-push-value to encompass dependent types.
Dependent Cartesian Closed Categories
DCCCs accomplish mathematical elegance as well as a direct interpretation of the syntax of Martin-L\"{o}f type theory (MLTT) by capturing the categorical counterpart of the generalization of the simply-typed lambda-calculus to MLTT in syntax.


A game semantics for generic polymorphism
Dynamic Games and Strategies
A new game semantics of a prototypical programming language that distinguishes terms with the same value yet different algorithms, capturing intensionality of computation is given, equipped with the hiding operation on strategies that exactly corresponds to the (small-step) operational semantics of the programming language.
Extensional and Intensional Semantic Universes: A Denotational Model of Dependent Types
An operational semantics for intensional terms is defined, giving a functional programming language based on the type theory, and it is proved that the semantics for it is computationally adequate.
On Full Abstraction for PCF: I, II, and III
An order-extensional, order (or inequationally) fully abstract model for Scott's language pcf, based on a kind of game in which each play consists of a dialogue of questions and answers between two players who observe the following principles of civil conversation.
On Universes in Type Theory
The notion of a universe of types was introduced into constructive type theory by Martin-Lof (1975). According to the propositions-as-types principle inherent in type theory, the notion plays two
Full Abstraction for PCF
The effective version of the model is considered and it is proved that every element of the effective extensional model is definable in PCF, which is the first syntax-independent description of the fully abstract model for PCF.
Games and Full Abstraction for a Functional Metalanguage with Recursive Types
This book discusses FPC and its Models, Rational Categories and Recursive Types, and Semantics of the Recursion Combinator, as well as games and Strategies, and the author's own contributions.
Games and full completeness for multiplicative linear logic
It is shown that this semantics yields a categorical model of Linear Logic and proves full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net.
A formulation of the simple theory of types
  • A. Church
  • Mathematics
    Journal of Symbolic Logic
  • 1940
A formulation of the simple theory oftypes which incorporates certain features of the calculus of λ-conversion into the theory of types and is offered as being of interest on this basis.