Optimizing Higher-Order Pattern Unification (2003)
Cached
Download Links
| Venue: | 19th International Conference on Automated Deduction |
| Citations: | 10 - 7 self |
BibTeX
@INPROCEEDINGS{Pientka03optimizinghigher-order,
author = {Brigitte Pientka and Frank Pfenning},
title = {Optimizing Higher-Order Pattern Unification},
booktitle = {19th International Conference on Automated Deduction},
year = {2003},
pages = {473--487},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern unification such as linearization, which eliminates many unnecessary occurs-checks. The presented modal framework explains a number of features of the current implementation of higher-order unification in Twelf and provides insight into several optimizations. Experimental results demonstrate significant performance improvement in many example applications of Twelf, including those in the area of proof-carrying code.
