Practical higher-order pattern unification with on-the-fly raising

Practical higher-order pattern unification with on-the-fly raising (2005)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gopalan Nadathur , Natalie Linnell

Venue:	In ICLP 2005: 21st International Logic Programming Conference, volume 3668 of LNCS
Citations:	5 - 4 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Practical higher-order pattern unification with on-the-fly raising	INFERENCE
AUTHOR NAME	Gopalan Nadathur	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science and Engineering, University of Minnesota,	SVM HeaderParse 0.2
AUTHOR ADDR	4-192 EE/CS Building, 200 Union Street SE, Minneapolis, MN 55455	SVM HeaderParse 0.2
AUTHOR NAME	Natalie Linnell	SVM HeaderParse 0.2
AUTHOR AFFIL	Department of Computer Science and Engineering, University of Minnesota,	SVM HeaderParse 0.2
AUTHOR ADDR	4-192 EE/CS Building, 200 Union Street SE, Minneapolis, MN 55455	SVM HeaderParse 0.2
ABSTRACT	Abstract. Higher-order pattern unification problems arise often in computations carried out within systems such as Twelf, λProlog and Isabelle. An important characteristic of such problems is that they are given by equations appearing under a prefix of alternating universal and existential quantifiers. Existing algorithms for solving these problems assume that such prefixes are simplified to a ∀∃ ∀ form by an a priori application of a transformation known as raising. There are drawbacks to this approach. Mixed quantifier prefixes typically manifest themselves in the course of computation, thereby requiring a dynamic form of preprocessing that is difficult to support in low-level implementations. Moreover, raising may be redundant in many cases and its effect may have to be undone by a subsequent pruning transformation. We propose a method to overcome these difficulties. In particular, a unification algorithm is described that proceeds by recursively descending through the structures of terms, performing raising and other transformations on-the-fly and only as needed. This algorithm also exploits an explicit substitution notation for lambda terms. 1	SVM HeaderParse 0.2
YEAR	2005	INFERENCE
VENUE	In ICLP 2005: 21st International Logic Programming Conference, volume 3668 of LNCS	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	371--386	INFERENCE
TECH	Technical Report 2005/2	INFERENCE
CITATIONS	18 found	ParsCit 1.0