Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422233 | Electronic Notes in Theoretical Computer Science | 2008 | 15 Pages |
Abstract
The type theory λP corresponds to the logical framework LF. In this paper we present λH, a variant of λP where convertibility is not implemented by means of the customary conversion rule, but instead type conversions are made explicit in the terms. This means that the time to type check a λH term is proportional to the size of the term itself.We define an erasure map from λH to λP, and show that through this map the type theory λH corresponds exactly to λP: any λH judgment will be erased to a λP judgment, and conversely each λP judgment can be lifted to a λH judgment.We also show a version of subject reduction: if two λH terms are provably convertible then their types are also provably convertible.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics