Results 1 
4 of
4
Proofassistants using Dependent Type Systems
, 2001
"... this article we will not attempt to describe all the dierent possible choices of type theories. Instead we want to discuss the main underlying ideas, with a special focus on the use of type theory as the formalism for the description of theories including proofs ..."
Abstract

Cited by 55 (4 self)
 Add to MetaCart
this article we will not attempt to describe all the dierent possible choices of type theories. Instead we want to discuss the main underlying ideas, with a special focus on the use of type theory as the formalism for the description of theories including proofs
Comparing Cubes
"... We study the cube of type assignment systems, as introduced in [10]. This cube is obtained from Barendregt's typed cube [1] via a natural type erasing function E, that erases type information from terms. We prove that the systems in the former cube enjoy good computational properties, like ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
We study the cube of type assignment systems, as introduced in [10]. This cube is obtained from Barendregt's typed cube [1] via a natural type erasing function E, that erases type information from terms. We prove that the systems in the former cube enjoy good computational properties, like subject reduction and strong normalization. We study the relationship between the two cubes, which leads to some unexpected results in the eld of systems with dependent types.
Abstract
"... We study the cube of type assignment systems, as introduced in [10]. This cube is obtained from Barendregt’s typedcube [1] via a natural type erasing function E, that erases type information from terms. We prove that the systems in the former cube enjoy good computational properties, like subject r ..."
Abstract
 Add to MetaCart
(Show Context)
We study the cube of type assignment systems, as introduced in [10]. This cube is obtained from Barendregt’s typedcube [1] via a natural type erasing function E, that erases type information from terms. We prove that the systems in the former cube enjoy good computational properties, like subject reduction and strong normalization. We study the relationship between the two cubes, which leads to some unexpected results in the field of systems with dependent types.
Steffen van Bakel1∗, Luigi Liquori2†, Simona Ronchi della Rocca2, and Paweł Urzyczyn3‡ 1 Afdeling Informatica,
"... We study the cube of type assignment systems, as introduced in [10]. This cube is obtained from Barendregt’s typed λcube [1] via a natural type erasing function E, that erases type information from terms. We prove that the systems in the former cube enjoy good computational properties, like subjec ..."
Abstract
 Add to MetaCart
(Show Context)
We study the cube of type assignment systems, as introduced in [10]. This cube is obtained from Barendregt’s typed λcube [1] via a natural type erasing function E, that erases type information from terms. We prove that the systems in the former cube enjoy good computational properties, like subject reduction and strong normalization. We study the relationship between the two cubes, which leads to some unexpected results in the field of systems with dependent types.