Modular Church-Rosser Modulo: the Full Picture - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Software and Informatics (IJSI) Year : 2008

Modular Church-Rosser Modulo: the Full Picture

Jean-Pierre Jouannaud
  • Function : Author
  • PersonId : 857080
Yoshihito Toyama
  • Function : Author


Toyama proved that the union of two confluent term-rewriting systems that share absolutely no function symbols or constants is likewise confluent, a property called modularity. The proof of this beautiful modularity result, technically based on slicing terms into an homogeneous cap and a so called alien, possibly heterogeneous substitution, was later substantially simplified by Klop, Middledorp, Toyama and de Vrijer. In this paper we present a further simplification of the proof of Toyama's result for confluence, which shows that the crux of the problem lies in two different properties: a cleaning lemma, whose goal is to anticipate the application of collapsing reductions; a modularity property of ordered completion, that allows to pairwise match the caps and alien substitutions of two equivalent terms. We then show that Toyama's modularity result scales up to rewriting modulo equations under natural assumptions met by all relations introduced in the litterature.
No file

Dates and versions

inria-00350970 , version 1 (08-01-2009)


  • HAL Id : inria-00350970 , version 1


Jean-Pierre Jouannaud, Yoshihito Toyama. Modular Church-Rosser Modulo: the Full Picture. International Journal of Software and Informatics (IJSI), 2008. ⟨inria-00350970⟩
84 View
0 Download


Gmail Facebook Twitter LinkedIn More