Linear higher-order pre-unification

Authors:
I. Cervesato;F. Pfenning
Affiliations:
-;-
Venue:
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Year:
1997

Citing 0
Cited 7

Fully Automatic Adaptation of Software Components Based on Semantic Specifications

AMAST '02 Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology
Higher Order Unification 30 Years Later

TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
A linear logical framework

Information and Computation
Higher-order unification and matching

Handbook of automated reasoning
Logical frameworks

Handbook of automated reasoning
Decidability of bounded higher-order unification

Journal of Symbolic Computation
Proof-theoretic and higher-order extensions of logic programming

A 25-year perspective on logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop an efficient representation and a pre-unification algorithm in the style of Huet (1975) for the linear /spl lambda/-calculus /spl lambda//sup /spl rarr//spl rArr/0&T/ which includes intuitionistic functions (/spl rarr/), linear functions (/spl rArr/), additive pairing (&), and additive unit (T). Applications lie in proof scorch, logic programming, and logical frameworks based on linear type theories. We also show that, surprisingly, a similar pre-unification algorithm does not exist for certain sublanguages.