Skip to main content
Article thumbnail
Location of Repository

Third-order matching in the presence of type constructors

By J. Springintveld


We show that it is decidable whether a third-order matching problem in λω (an extension\ud of the simply typed lambda calculus with type constructors) has a solution or not. We\ud present an algorithm which, given such a problem, returns a solution for this problem if\ud the problem has a solution and returns fail otherwise. We also show that it is undecidable whether a third-order matching problem in λω has a closed solution or not

Topics: Wijsbegeerte
Year: 1994
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.