On equivalence classes of interpolation equations
An Interpolation Equation is an equation of the form [(x)c1⋯cn=b], where c1⋯c n , b are simply typed terms containing no instantiable variable. A natural equivalence relation between two interpolation equations is the equality of their sets of solutions. We prove in this paper that given a typed variable x and a simply typed term b, the quotient by this relation of the set of all interpolation equations of the form [(x)w1⋯wp=b] contains only a finite number of classes, and relate this result to the general study of Higher Order Matching.
Unable to display preview. Download preview PDF.
- 1.Barendregt, H.: The Lambda Calculus, its Syntax and Semantics. North Holland (1981), (1984)Google Scholar
- 2.Hindley J.R., Seldin, J.P.: Introduction to Combinators and λ-Calculus. Cambridge University Press, Oxford (1986)Google Scholar
- 3.Krivine J.L.: Lambda Calculus, Types and Models. Ellis Horwood series in computer and their applications (1993) 1–66Google Scholar
- 4.Dowek G.: Third Order Matching is Decidable. Proceedings of Logic in Computer Science, Annals of Pure and Applied Logic (1993)Google Scholar
- 5.Padovani V.: Fourth Order Dual Interpolation is Decidable. Manuscript (1994)Google Scholar
- 6.Padovani V.: Atomic Matching is Decidable. Manuscript (1994)Google Scholar