Delaying Unification Algorithms for Lambda Calculi


Huet proposed delay!c?g some unifications of typed lambda terms, as part of a higher-order resolution method. This paper abstracts that idea from the resolution context. Unification delays are formalised independently of any context, by defining a lambda calculus where a unification constraint forms an integral part of each term. This calculus is shown to… (More)
DOI: 10.1016/0304-3975(88)90135-1


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics