Article contents
Pure Type System conversion is always typable
Published online by Cambridge University Press: 16 March 2012
Abstract
Pure Type Systems are usually described in two different ways, one that uses an external notion of computation like beta-reduction, and one that relies on a typed judgment of equality, directly in the typing system. For a long time, the question was open to know whether both presentations described the same theory. A first step towards this equivalence has been made by Adams for a particular class of Pure Type Systems (PTS) called functional. Then, his result has been relaxed to all semi-full PTSs in previous work. In this paper, we finally give a positive answer to the general question, and prove that equivalence holds for any Pure Type System.
- Type
- Articles
- Information
- Copyright
- Copyright © Cambridge University Press 2012
References
- 7
- Cited by
Discussions
No Discussions have been published for this article.