Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


Unification and matching in Church's Original Lambda Calculus

Hustadt, Ullrich

MPI-I-92-219. June 1992, 16 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
In current implementations of higher-order logics higher-orderunification is used to lift the resolution principle from the first-order case to the higher-order case. Higher-order matching is the core of implementations of
higher-order rewriting systems and some systems for program transformation.

In this paper I argue that Church's original lambda calculus, called non-forgetful lambda calculus, is an appropriate basis for higher-order matching. I provide two correct and complete algorithms for unification in the non-forgetful lambda calculus. Finally, I show how these unification algorithms can be used for matching in the non-forgetful lambda calculus.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-92-219.pdfMPI-I-92-219.pdfMPI-I-92-219.dvi89 KBytes; 140 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Hustadt, Ullrich},
  TITLE = {Unification and matching in Church's Original Lambda Calculus},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-92-219},
  MONTH = {June},
  YEAR = {1992},
  ISSN = {0946-011X},