Combining second order matching and first order E-matching - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

Combining second order matching and first order E-matching

Régis Curien
  • Function : Author
  • PersonId : 756548
  • IdRef : 133500268

Abstract

We propose an algorithm for combining second order matching and first order matching in an algebraic first order theory E. This algorithm has the flavor of the higher order E-unification algorithmof Nipkow and Qian, but relies on the classical second order matching algorithm of Huet and Lang instead of higher order unification. Since matching is simpler than unification, we are able to prove the termination of our algorithm when the algebraic theory E respects some conditions. We show that it is possible to preserve the termination when we relax some of these conditions by adapting the previous algorithm. It allows us to use AC1, ACI and ACI1 for example. These algebraic theories are the more useful for our purpose (recognizing logical or functional schemata). We have implemented our algorithm for the AC and AC1 theories and we show examples of possible applications.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2012.pdf (1.11 Mo) Télécharger le fichier

Dates and versions

inria-00074659 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074659 , version 1

Cite

Régis Curien. Combining second order matching and first order E-matching. [Research Report] RR-2012, INRIA. 1993. ⟨inria-00074659⟩
57 View
19 Download

Share

Gmail Facebook Twitter LinkedIn More