We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
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 otherwise
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.