Article contents
Pure type systems with explicit substitutions
Published online by Cambridge University Press: 09 November 2015
Abstract
We introduce a new formulation of pure type systems (PTSs) with explicit substitution and de Bruijn indices and formally prove some of its meta-theory. Using techniques based on Normalisation by Evaluation, we prove that untyped conversion can be typed for predicative PTSs. Although this equivalence was settled by Siles and Herbelin for the conventional presentation of PTSs, we strongly conjecture that our proof method can also be applied to PTSs with η.
- Type
- Articles
- Information
- Copyright
- Copyright © Cambridge University Press 2015
References
- 1
- Cited by
Discussions
No Discussions have been published for this article.