Game semantics for dependent types
type: Item
instance of: scholarly article
title: Game semantics for dependent types
zbMATH Open document ID: 1395.68183
author: Matthijs Vákár
author: Radha Jagadeesan
author: Samson Abramsky
published in: Information and Computation
publication date: 2018-06-14T00:00:00Z
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 6889864
zbMATH Keywords: game semantics
zbMATH Keywords: dependent type theory
zbMATH Keywords: intensionality
MaRDI profile type: Publication
OpenAlex ID: W2553266761
cites work: Faking it Simulating dependent types in Haskell
cites work: Homotopy theoretic models of identity types
cites work: Homotopy Type Theory: Univalent Foundations of Mathematics
cites work: Games and full completeness for multiplicative linear logic
cites work: On full abstraction for PCF: I, II and III
cites work: Q4501156
cites work: Full abstraction for PCF
cites work: A game semantics for generic polymorphism
cites work: Probabilistic game semantics
cites work: Q4218919
cites work: Extensional Constructs in Intensional Type Theory
cites work: Q2968413
cites work: Domain interpretations of Martin-Löf's partial type theory
cites work: Q4247303
cites work: Games for Dependent Types
cites work: Generalized algebraic theories and contextual categories
cites work: Handbook of logic in computer science. Vol. 5: Logical and algebraic methods
cites work: Inductive families
cites work: Game semantics for access control
cites work: A Categorical Semantics for Linear Logical Frameworks
cites work: Q4247302
cites work: Internal type theory
cites work: Q4870803
cites work: Typed Lambda Calculi and Applications
cites work: Least and Greatest Fixpoints in Game Semantics
DOI: 10.1016/J.IC.2018.02.015
description: scientific article; zbMATH DE number 6889864