Third-order matching in the polymorphic lambda calculus
| Autor: | Jan Springintveld |
|---|---|
| Rok vydání: | 1996 |
| Předmět: |
Discrete mathematics
Matching (graph theory) System F Type variable Substitution (algebra) Binary lambda calculus Decidability TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Calculus Lambda calculus computer Typed lambda calculus Mathematics computer.programming_language |
| Zdroj: | Higher-Order Algebra, Logic, and Term Rewriting ISBN: 9783540612544 HOA |
| DOI: | 10.1007/3-540-61254-8_28 |
| Popis: | We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. We give an algorithm that, given such a problem, returns a substitution if it has a solution and fail otherwise. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|