Skip to main content
Article thumbnail
Location of Repository

Third-Order Matching in the Polymorphic Lambda Calculus

By J. Springintveld


We show that it is decidable whether a third-order matching problem in the polymorphic\ud lambda calculus has a solution. The proof is constructive in the sense that an algorithm\ud can be extracted from it that, given such a problem, returns a substitution if it has a\ud solution and fail otherwise

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.