Comparing Cubes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Comparing Cubes

Abstract

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.
Fichier principal
Vignette du fichier
1994-lfcs-94.pdf (305.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01157211 , version 1 (27-05-2015)

Identifiers

Cite

Steffen van Bakel, Luigi Liquori, Simona Ronchi Della Rocca, Pawel Urzyczyn. Comparing Cubes. Logical Foundations of Computer Science. Third International Symposium, LFCS '94 St. Petersburg, Russia, July 11–14, 1994 Proceedings, Jul 1994, St. Petersburg, Russia. pp.353-365, ⟨10.1007/3-540-58140-5_33⟩. ⟨hal-01157211⟩

Collections

INRIA INRIA2
163 View
75 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More