Results 1 
2 of
2
Comparing cubes of typed and type assignment systems
 Annals of Pure and Applied Logic
, 1997
"... We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt’s typed λcube [4]. The first is obtained from the latter through applying a natural type erasing function E to derivation rules, that erases type information from terms. In particular, we address th ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
(Show Context)
We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt’s typed λcube [4]. The first is obtained from the latter through applying a natural type erasing function E to derivation rules, that erases type information from terms. In particular, we address the question whether a judgement, derivable in a type assignment system, is always an erasure of a derivable judgement in a corresponding typed system; we show that this property holds only for the systems without polymorphism. The type assignment systems we consider satisfy the properties ‘subject reduction’ and ‘strong normalization’. Moreover, we define a new type assignment cube that is isomorphic to the typed one.
Comparing Cubes of Typed and Type Assignment Systems
"... We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt’s typedcube [4]. The first is obtained from the latter through applying a natural type erasing function E to derivation rules, that erases type information from terms. In particular, we address the ..."
Abstract
 Add to MetaCart
(Show Context)
We study the cube of type assignment systems, as introduced in [13], and confront it with Barendregt’s typedcube [4]. The first is obtained from the latter through applying a natural type erasing function E to derivation rules, that erases type information from terms. In particular, we address the question whether a judgement, derivable in a type assignment system, is always an erasure of a derivable judgement in a corresponding typed system; we show that this property holds only for the systems without polymorphism. The type assignment systems we consider satisfy the properties ‘subject reduction ’ and ‘strong normalization’. Moreover, we define a new type assignment cube that is isomorphic to the typed one.