Unification of simply typed lambda-terms as logic programming

Unification of simply typed lambda-terms as logic programming (1991)

by Dale Miller

Venue:	In Eighth International Logic Programming Conference
Citations:	52 - 3 self

Datum	Value	Source
TITLE	Unification of simply typed lambda-terms as logic programming	INFERENCE
AUTHOR NAME	Dale Miller	SVM HeaderParse 0.2
AUTHOR AFFIL	Laboratory for the Foundation of Computer Science; University of Edinburgh, and; Computer Science Department; University of Pennsylvania	SVM HeaderParse 0.2
ABSTRACT	The unification of simply typed λ-terms modulo the rules of β- and η-conversions is often called “higher-order ” unification because of the possible presence of variables of functional type. This kind of unification is undecidable in general and if unifiers exist, most general unifiers may not exist. In this paper, we show that such unification problems can be coded as a query of the logic programming language Lλ in a natural and clear fashion. In a sense, the translation only involves explicitly axiomatizing in Lλ the notions of equality and substitution of the simply typed λ-calculus: the rest of the unification process can be viewed as simply an interpreter of Lλ searching for proofs using those axioms. 1	SVM HeaderParse 0.2
YEAR	1991	SVM HeaderParse 0.2
VENUE	In Eighth International Logic Programming Conference	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	255--269	INFERENCE
CITATIONS	16 found	ParsCit 1.0