AbstractIn his type theory, Martin-Löf considers certain evaluation procedures for his expressions. These evaluation procedures or reductions can be interpreted in various ways; this paper examines the properties that such reductions must have to satisfy Martin-Löf's rules
We describe a non-extensional variant of Martin-Löf type theory, which we call two-dimensional type ...
Abstra t Martin-Lof's type theory is a onstru tive type theory originally on eived as a forma...
Contains fulltext : 147055.pdf (Publisher’s version ) (Open Access)163 p
We present an algorithm for computing normal terms and types in Martin-L\uf6f type theory with one u...
We present an algorithm for computing normal terms and types in Martin-Löf type theory with one univ...
AbstractWe present an algorithm for computing normal terms and types in Martin-Löf type theory with ...
The decidability of equality is proved for Martin-L\uf6f type theory with a universe a la Russell an...
For certain kinds of applications of type theories, the faithfulness of formalization in the theory ...
The decidability of equality is proved for Martin-Löf type theory with a universe a la Russell and t...
One may formulate the dependent product types of Martin-Löf type theory either in terms of abstracti...
The theory we will be concerned with in this paper is Martin-Löf's polymorphic type theory with...
Abstract The decidability of equality is proved for Martin-L"oftype theory with a universe ...
AbstractWe present well-ordering proofs for Martin-Löf's type theory with W-type and one universe. T...
AbstractType Theory is a mathematical language with computation rules developed by Per Martin-Löf. T...
In this paper we prove that any subexpression of a correct judgement in Martin-Löf's Type Theory is ...
We describe a non-extensional variant of Martin-Löf type theory, which we call two-dimensional type ...
Abstra t Martin-Lof's type theory is a onstru tive type theory originally on eived as a forma...
Contains fulltext : 147055.pdf (Publisher’s version ) (Open Access)163 p
We present an algorithm for computing normal terms and types in Martin-L\uf6f type theory with one u...
We present an algorithm for computing normal terms and types in Martin-Löf type theory with one univ...
AbstractWe present an algorithm for computing normal terms and types in Martin-Löf type theory with ...
The decidability of equality is proved for Martin-L\uf6f type theory with a universe a la Russell an...
For certain kinds of applications of type theories, the faithfulness of formalization in the theory ...
The decidability of equality is proved for Martin-Löf type theory with a universe a la Russell and t...
One may formulate the dependent product types of Martin-Löf type theory either in terms of abstracti...
The theory we will be concerned with in this paper is Martin-Löf's polymorphic type theory with...
Abstract The decidability of equality is proved for Martin-L"oftype theory with a universe ...
AbstractWe present well-ordering proofs for Martin-Löf's type theory with W-type and one universe. T...
AbstractType Theory is a mathematical language with computation rules developed by Per Martin-Löf. T...
In this paper we prove that any subexpression of a correct judgement in Martin-Löf's Type Theory is ...
We describe a non-extensional variant of Martin-Löf type theory, which we call two-dimensional type ...
Abstra t Martin-Lof's type theory is a onstru tive type theory originally on eived as a forma...
Contains fulltext : 147055.pdf (Publisher’s version ) (Open Access)163 p