Finitary type theories with and without contexts

by   Philipp G. Haselwarter, et al.

We give a definition of finitary type theories that subsumes many examples of dependent type theories, such as variants of Martin-Löf type theory, simple type theories, first-order and higher-order logics, and homotopy type theory. We prove several general meta-theorems about finitary type theories: weakening, admissibility of substitution and instantiation of metavariables, derivability of presuppositions, uniqueness of typing, and inversion principles. We then give a second formulation of finitary type theories in which there are no explicit contexts. Instead, free variables are explicitly annotated with their types. We provide translations between finitary type theories with and without contexts, thereby showing that they have the same expressive power. The context-free type theory is implemented in the nucleus of the Andromeda 2 proof assistant.



page 1

page 2

page 3

page 4


Coherence of strict equalities in dependent type theories

We study the coherence and conservativity of extensions of dependent typ...

Graded Modal Dependent Type Theory

Graded type theories are an emerging paradigm for augmenting the reasoni...

An Investigation of Kripke-style Modal Type Theories

This technical report investigates Kripke-style modal type theories, bot...

A Generalized Modality for Recursion

Nakano's later modality allows types to express that the output of a fun...

Providing Self-Aware Systems with Reflexivity

We propose a new type of self-aware systems inspired by ideas from highe...

A general definition of dependent type theories

We define a general class of dependent type theories, encompassing Marti...

Context, Judgement, Deduction

We introduce judgemental theories and their calculi as a general framewo...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.