Name
Abstract | ||
|---|---|---|
We present an algorithm for unification in the simply typed lambda calculus which enumerates complete sets of unifiers using a finitely branching search space. In fact, the types of terms may contain type variables, so that a solution may involve type-substitution as well as term substitution. The problem is first translated into the problem of unification with respect to exstensional equality in combinatory logic, and the algorithm is defined in terms of transformations on systems of combinatory terms. These transformations are based on a new method (itself based on systems) for deciding extensional equality between typed combinatory logic terms. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1016/0304-3975(93)90075-5 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
Higher-order unification | Journal | 114 |
Issue | ISSN | Citations |
2 | Theoretical Computer Science | 18 |
PageRank | References | Authors |
1.32 | 15 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel J. Dougherty | 1 | 413 | 32.13 |