de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Report

Unification and matching in Church's Original Lambda Calculus

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44660

Hustadt,  Ullrich
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)

MPI-I-92-219.pdf
(Any fulltext), 141KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Hustadt, U.(1992). Unification and matching in Church's Original Lambda Calculus (MPI-I-92-219). Saarbrücken: Max-Planck-Institut für Informatik.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-B1CB-7
Abstract
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.