Second order E-matching as a tool for automated theorem proving

  • Régis Curien
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 727)


We describe a second order matching algorithm which takes account of algebraic properties of functions. Higher order allows us the use of function variables and is relevant in many applications concerning functional or logical schemes. To add algebraic properties significantly increases the expressiveness of the matching process and extends the set of problems having solutions. This higher order E-matching works for a set of algebraic theories E which have to satisfy some properties. It has been implemented for the Associative Commutative case and adapted for similar theories like AC1 which do not fulfill the previous requirements.


Automated reasoning pattern recognition higher-order logic equational theories 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BT88]
    V. Breazu-Tannen. Combining algebra and higher-order types. In Proceedings 3rd IEEE Symposium on Logic in Computer Science, Edinburgh (UK), pages 82–90, 1988.Google Scholar
  2. [Dow92]
    G. Dowek. Third order matching is decidable. In Proceedings of LICS'92, Santa-Cruz (California, USA), June 1992.Google Scholar
  3. [HL78]
    G. Huet and B. Lang. Proving and applying program transformations expressed with second-order patterns. Acta Informatica, 11:31–55, 1978.Google Scholar
  4. [HS86]
    J. Roger Hindley and Johnathan P. Seldin. Introduction to Combinators and Lambda-calculus. Cambridge University, 1986.Google Scholar
  5. [NQ91]
    T. Nipkow and Z. Qian. Modular higher-order E-unification. In R. V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of Lecture Notes in Computer Science, pages 200–214. Springer-Verlag, 1991.Google Scholar
  6. [QW92]
    Z. Qian and K. Wang. Higher-order E-unification for arbitrary theories. In K. Apt, editor, LOGIC PROGRAMMING: Proceedings of 1992 joint international conference and symposium on logic programming, 1992.Google Scholar
  7. [Sny88]
    W.S. Snyder. Complete Sets of Transformations for General Unification. PhD thesis, University of Pennsylvania, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Régis Curien
    • 1
  1. 1.CRIN and INRIA-LorraineVandoeuvre-les-Nancy CedexFrance

Personalised recommendations