Type Checking with Universes

  title={Type Checking with Universes},
  author={Robert Harper and Robert Pollack},
  journal={Theor. Comput. Sci.},
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… CONTINUE READING
Highly Cited
This paper has 58 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications citing this paper.

59 Citations

Citations per Year
Semantic Scholar estimates that this publication has 59 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 40 references

An algorithm for checking PL/CV arithmetical infer- ences

  • Tat-Hung Chan
  • Technical Report 77{236,
  • 1977
Highly Influential
5 Excerpts

CC1 and its metatheory

  • Zhaolui Luo
  • Technical Report ECS{LFCS{
  • 1988
Highly Influential
5 Excerpts

Principia Mathematica, Volume 1

  • Alfred North Whitehead, Bertrand Russell
  • 1925
Highly Influential
4 Excerpts

Mathematical logic as based on a theory of types

  • Bertrand Russell
  • American Journal of Mathematics,
  • 1908
Highly Influential
4 Excerpts

The De nition of Stan- dard ML

  • Robin Milner, Mads Tofte, Robert Harper
  • 1990
2 Excerpts

A framework for de ning logics

  • Robert Harper, Furio Honsell, Gordon Plotkin
  • Technical Report CMU{CS{89{173, School of Com…
  • 1989
2 Excerpts

Similar Papers

Loading similar papers…