English

On principal types and well-foundedness of the cummulativity relation in ECC

Logic in Computer Science 2021-05-12 v4

Abstract

When we investigate a type system, it is helpful if we can establish the well-foundedness of types or terms with respect to a certain hierarchy, and the Extended Calculus of Constructions (called ECCECC, defined and studied comprehensively in [Luo,1994]) is no exception. However, under a very natural hierarchy relation (called the cumulativity relation in [Luo,1994]), the well-foundedness of the hierarchy does not hold generally. In this article,we show that the cumulativity relation is well-founded if it is restricted to one of the following two natural families of terms: \begin{enumerate} \item types in a valid context \item terms having normal forms \end{enumerate} Also, we give an independent proof of the existence of principal types in ECCECC since it is used in the proof of well-foundedness of cumulativity relation in a valid context although it is often proved by utilizing the well-foundedness of the hierarchy, which would make our argument circular if adopted.

Keywords

Cite

@article{arxiv.2009.03486,
  title  = {On principal types and well-foundedness of the cummulativity relation in ECC},
  author = {Eitetsu Ken and Masaki Natori and Kenji Tojo and Kazuki Watanabe},
  journal= {arXiv preprint arXiv:2009.03486},
  year   = {2021}
}

Comments

14 pages, no figures, the title changed, the historical remarks modified, the results unchanged, the e-mail addresses added