Introduction to combinators and &lgr;-calculus
Introduction to combinators and &lgr;-calculus
An introduction to mathematical logic and type theory: to truth through proof
An introduction to mathematical logic and type theory: to truth through proof
Handbook of theoretical computer science (vol. B)
Functional programming and lambda calculus
Handbook of theoretical computer science (vol. B)
Simple second-order languages for which unification is undecidable
Theoretical Computer Science
The clausal theory of types
Handbook of logic in artificial intelligence and logic programming
Basic simple type theory
On the undecidability of second-order unification
Information and Computation - Special issue on RTA-98
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
Solvability of context equations with two context variable is decidable
Journal of Symbolic Computation
Introduction to Functional Programming
Introduction to Functional Programming
On the Exponent of Periodicity of Minimal Solutions of Context Equation
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
A Decidable Variant of Higher Order Matching
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Higher-order unification and matching
Handbook of automated reasoning
Handbook of automated reasoning
Decidability of bounded higher-order unification
Journal of Symbolic Computation
A self-dependency constraint in the simply typed lambda calculus
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Describing lambda terms in context unification
LACL'05 Proceedings of the 5th international conference on Logical Aspects of Computational Linguistics
| Hi-index | 0.00 |
It is shown that unifiability of terms in the simply typed lambda calculus with 脽 and 驴 rules becomes decidable if there is a bound on the number of bound variables and lambdas in a unifier in 驴-long 脽-normal form.