Abstract. We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type theories with primitive judgements to express logic. By adding type theoretic rules that correspond to the collection axiom schemes of the constructive set theory CZF we obtain a generalisation of the type theoretic interpretation of CZF. Suitable logic-enriched type theories allow also the study of reinterpretations of logic. We end the paper with an application to the double-negation in-terpretation
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
This paper proves the non-derivability of induction in second order dependent type theory (¿P2). Thi...
The theory of dependently sorted first order logic is developed. Two variants of the notion of a typ...
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type ...
Abstract. We present a generalisation of the type-theoretic interpre-tation of constructive set theo...
We present a generalisation of the type-theoretic interpretation of constructive set theory into Mar...
In this talk, we will develop a type theory that is based solely on dependent inductive and coinduct...
Intuitionistic type theory (also constructive type theory or Martin-L\uf6f type theory) is a formal ...
. We describe a method for constructing a model of second order dependent type theory out of a model...
This paper examines the connections between intuitionistic type theory and category theory. A versi...
Real world programming languages crucially depend on the availability of computational effects to ac...
We investigate the development of theories of types and computability via realizability. In the firs...
First-order logic with dependent sorts, such as Makkai's first-order logic with dependent sorts (FOL...
We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular we...
We give an account of the basic combinatorial structure underlying the notion of type dependency. We...
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
This paper proves the non-derivability of induction in second order dependent type theory (¿P2). Thi...
The theory of dependently sorted first order logic is developed. Two variants of the notion of a typ...
We introduce logic-enriched intuitionistic type theories, that extend intuitionistic dependent type ...
Abstract. We present a generalisation of the type-theoretic interpre-tation of constructive set theo...
We present a generalisation of the type-theoretic interpretation of constructive set theory into Mar...
In this talk, we will develop a type theory that is based solely on dependent inductive and coinduct...
Intuitionistic type theory (also constructive type theory or Martin-L\uf6f type theory) is a formal ...
. We describe a method for constructing a model of second order dependent type theory out of a model...
This paper examines the connections between intuitionistic type theory and category theory. A versi...
Real world programming languages crucially depend on the availability of computational effects to ac...
We investigate the development of theories of types and computability via realizability. In the firs...
First-order logic with dependent sorts, such as Makkai's first-order logic with dependent sorts (FOL...
We present the type theory CaTT, originally introduced by Finster and Mimram to describe globular we...
We give an account of the basic combinatorial structure underlying the notion of type dependency. We...
Abstract. In our approach we consider programming as logical reasoning over type theory of a given s...
This paper proves the non-derivability of induction in second order dependent type theory (¿P2). Thi...
The theory of dependently sorted first order logic is developed. Two variants of the notion of a typ...