Confluence of Pattern-Based Calculi - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Confluence of Pattern-Based Calculi


Different pattern calculi integrate the functional mechanisms from the lambda-calculus and the matching capabilities from rewriting. Several approaches are used to obtain the confluence but in practice the proof methods share the same structure and each variation on the way pattern-abstractions are applied needs another proof of confluence. We propose here a generic confluence proof where the way pattern-abstractions are applied is axiomatized. Intuitively, the conditions guarantee that the matching is stable by substitution and by reduction. We show that our approach directly applies to different pattern calculi, namely the lambda calculus with patterns, the pure pattern calculus and the rewriting calculus. We also characterize a class of matching algorithms and consequently of pattern-calculi that are not confluent.

Dates and versions

inria-00185882 , version 1 (07-11-2007)



Horatiu Cirstea, Germain Faure. Confluence of Pattern-Based Calculi. 18th International Conference on Term Rewriting and Applications - RTA 2007, Jun 2007, Paris, France. pp.78-92, ⟨10.1007/978-3-540-73449-9_8⟩. ⟨inria-00185882⟩
47 View
0 Download



Gmail Facebook Twitter LinkedIn More