On Equivalence and Canonical Forms in the LF Type Theory (2001)
Cached
Download Links
| Venue: | ACM Transactions on Computational Logic |
| Citations: | 78 - 15 self |
BibTeX
@TECHREPORT{Harper01onequivalence,
author = {Robert Harper and Frank Pfenning},
title = {On Equivalence and Canonical Forms in the LF Type Theory},
institution = {ACM Transactions on Computational Logic},
year = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Decidability of definitional equality and conversion of terms into canonical form play a central role in the meta-theory of a type-theoretic logical framework. Most studies of definitional equality are based on a confluent, strongly-normalizing notion of reduction. Coquand has considered a different approach, directly proving the correctness of a practical equivalence algorithm based on the shape of terms. Neither approach appears to scale well to richer languages with unit types or subtyping, and neither directly addresses the problem of conversion to canonical form.
