Resumen de Decidability of bounded higher-order unification

Manfred Schmidt Schauss, Klaus U. Schulz

• 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 ?-expanded ß-normal form.