Decidability of bounded higher-order unification

• Autores: Manfred Schmidt Schauss, Klaus U. Schulz
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 40, Nº 2, 2005, págs. 905-954
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.