Third-Order Matching in the Polymorphic Lambda Calculus
Abstract
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can be extracted from it that, given such a problem, returns a substitution if it has a solution and fail otherwiseSimilar works
Full text
Last time updated on 14/06/2016
This paper was published in Utrecht University Repository.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.