Comparing Cubes Steffen van Bakel 1
Download:
|
|
by Luigi Liquori, Simona Ronchi Della Rocca, Afdeling Informatica, Instytut Informatyki
ftp://ftp.cs.kun.nl/pub/Clean/papers/1994/baks-LFCS94.ps.gz
Add To MetaCart
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.
Citations
| 530 | A framework for defining logics – Harper, Honsell, et al. - 1993 |
| 444 | Lambda calculi with types – Barendregt - 1991 |
| 372 | The Calculus of Constructions – Coquand, Huet - 1988 |
| 317 | Towards a theory of type structure – Reynolds - 1974 |
| 85 | Polymorphic type inference – Leivant - 1983 |
| 43 | A modular proof of strong normalization for the calculus of constructions – Geuvers, Nederhof - 1991 |
| 29 | Introduction to Generalised Type Systems – Barendregt - 1991 |
| 19 | The System F of Variable Types – Girard - 1986 |
| 11 | Towards a Mathematical Analysis of Type Dependence in Coquand–Huet Calculus of Constructions and the Other Systems in Barendregt’s Cube – Berardi - 1988 |
| 5 | The Undecidability of Typability – Dowek - 1993 |
| 4 | Modified Basic Functionality – Curry - 1969 |
| 4 | Metamathematical Investigations of a Calculus – Coquand - 1990 |
