Matching with Free Function Symbols -- A Simple Extension of Matching? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Matching with Free Function Symbols -- A Simple Extension of Matching?

Abstract

Matching is a solving process which is crucial in declarative (rule-based) programming languages. In order to apply rules, one has to match the left-hand side of a rule with the term to be rewritten. In several declarative programming languages, programs involve operators that may also satisfy some structural axioms. Therefore, their evaluation mechanism must implement powerful matching algorithms working modulo equational theories. In this paper, we show the existence of an equational theory where matching is decidable (resp. finitary) but matching in presence of additional (free) operators is undecidable (resp. infinitary). The interest of this result is to easily prove the existence of a frontier between matching and matching with free operators.

Domains

Other [cs.OH]
Not file

Dates and versions

inria-00108076 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00108076 , version 1

Cite

Christophe Ringeissen. Matching with Free Function Symbols -- A Simple Extension of Matching?. International Conference on Rewriting Techniques and Applications - RTA'2001, Vincent van Oostrom, 2001, Utrecht, The Netherlands, pp.276--290. ⟨inria-00108076⟩
44 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More