Eliminating redundancy in higher-order unification: a lightweight approach

Authors:
Brigitte Pientka
Affiliations:
School of Computer Science, McGill University, Montreal, Canada
Venue:
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Year:
2006

Citing 8
Cited 2

A framework for defining logics

Journal of the ACM (JACM)
System Description: Twelf - A Meta-Logical Framework for Deductive Systems

CADE-16 Proceedings of the 16th International Conference on Automated Deduction: Automated Deduction
Logical frameworks

Handbook of automated reasoning
Efficient Representation and Validation of Proofs

LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Foundational Proof-Carrying Code

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Tabled higher-order logic programming

Tabled higher-order logic programming
Optimizing the runtime processing of types in polymorphic logic programming languages

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Mechanized metatheory for the masses: the PoplMark challenge

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

A meta-programming approach to realizing dependently typed logic programming

Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Overcoming performance barriers: efficient verification techniques for logical frameworks

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss a lightweight approach to eliminate the overhead due to implicit type arguments during higher-order unification of dependently-typed terms. First, we show that some implicit type information is uniquely determined, and can therefore be safely skipped during higher-order unification. Second, we discuss its impact in practice during type reconstruction and during proof search within the logical framework Twelf. Our experimental results show that implicit type arguments are numerous and large in size, but their impact on run-time is between 10% and 20%. On the other hand optimizations such as eliminating the occurs check are shown to be crucial to achieve significant performance improvements.