BibTeX
@MISC{Harper91typechecking,
author = {Robert Harper and Robert Pollack},
title = {Type Checking with Universes},
year = {1991}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Various formulations of constructive type theories have been proposed to serve as the basis for machine-assisted proof and as a theoretical basis for studying programming languages. Many of these calculi include a cumulative hierarchy of "universes," each a type of types closed under a collection of type-forming operations. Universes are of interest for a variety of reasons, some philosophical (predicative vs. impredicative type theories), some theoretical (limitations on the closure properties of type theories), and some practical (to achieve some of the advantages of a type of all types without sacrificing consistency.) The Generalized Calculus of Constructions (CC ! ) is a formal theory of types that includes such a hierarchy of universes. Although essential to the formalization of constructive mathematics, universes are tedious to use in practice, for one is required to make specific choices of universe levels and to ensure that all choices are consistent. In this pa...
Keyphrases
type-forming operation cumulative hierarchy generalized calculus various formulation constructive mathematics formal theory machine-assisted proof impredicative type theory specific choice type theory constructive type theory universe level predicative v closure property theoretical basis programming language
