Skip to Main content Skip to Navigation
Conference papers

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

Christophe Ringeissen 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00108076
Contributor : Publications Loria <>
Submitted on : Thursday, October 19, 2006 - 3:40:46 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM

Identifiers

  • HAL Id : inria-00108076, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

113