On equivalence classes of interpolation equations

  • Vincent Padovani
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 902)

Abstract

An Interpolation Equation is an equation of the form [(x)c1cn=b], where c1c 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)w1wp=b] contains only a finite number of classes, and relate this result to the general study of Higher Order Matching.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barendregt, H.: The Lambda Calculus, its Syntax and Semantics. North Holland (1981), (1984)Google Scholar
  2. 2.
    Hindley J.R., Seldin, J.P.: Introduction to Combinators and λ-Calculus. Cambridge University Press, Oxford (1986)Google Scholar
  3. 3.
    Krivine J.L.: Lambda Calculus, Types and Models. Ellis Horwood series in computer and their applications (1993) 1–66Google Scholar
  4. 4.
    Dowek G.: Third Order Matching is Decidable. Proceedings of Logic in Computer Science, Annals of Pure and Applied Logic (1993)Google Scholar
  5. 5.
    Padovani V.: Fourth Order Dual Interpolation is Decidable. Manuscript (1994)Google Scholar
  6. 6.
    Padovani V.: Atomic Matching is Decidable. Manuscript (1994)Google Scholar

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • Vincent Padovani
    • 1
  1. 1.Equipe de Logique MathématiqueUniversité Paris VII-C.N.R.S U.R.A. 753Paris Cedex 05France

Personalised recommendations