A dependent nominal type theory
arXiv:1201.5240 · doi:10.2168/LMCS-8(1:8)2012
Abstract
Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and ML-like polymorphic languages have been studied, but decidability and normalization results have only been established for simple nominal type theories. We present a LF-style dependent type theory extended with name-abstraction types, prove soundness and decidability of beta-eta-equivalence checking, discuss adequacy and canonical forms via an example, and discuss extensions such as dependently-typed recursion and induction principles.
Cited by in corpus (6)
- Confusion of Tagged Perturbations in Forward Automatic Differentiation of Higher-Order Functions
- Nominal Coalgebraic Data Types with Applications to Lambda Calculus
- Fibred Computational Effects
- Internal Parametricity for Cubical Type Theory
- Transpension: The Right Adjoint to the Pi-type
- A simple sequent calculus for nominal logic