Skip to main content
Conference Proceedings

Decidability of bounded higher-order unification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2471 522-537
DOI: 10.1007/3-540-45793-3_35
3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Schmidt-Schauß, M., & Schulz, K. U. (2002). Decidability of bounded higher-order unification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2471, pp. 522–537). Springer Verlag. https://doi.org/10.1007/3-540-45793-3_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free