On the confluence of lambda-calculus with conditional rewriting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2010

On the confluence of lambda-calculus with conditional rewriting


The confluence of untyped λ-calculus with unconditional rewriting is now well un- derstood. In this paper, we investigate the confluence of λ-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Müller and Dougherty for unconditional rewriting. Two cases are considered, whether β-reduction is allowed or not in the evaluation of conditions. Moreover, Dougherty's result is improved from the assumption of strongly normalizing β-reduction to weakly normalizing β-reduction. We also provide examples showing that outside these conditions, modularity of confluence is difficult to achieve. Second, we go beyond the algebraic framework and get new confluence results using a restricted notion of orthogonality that takes advantage of the conditional part of rewrite rules.
Fichier principal
Vignette du fichier
main.pdf (529.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00509054 , version 1 (20-09-2011)



Frédéric Blanqui, Claude Kirchner, Colin Riba. On the confluence of lambda-calculus with conditional rewriting. Theoretical Computer Science, 2010, 411 (37), pp.3301-3327. ⟨10.1016/j.tcs.2009.07.058⟩. ⟨inria-00509054⟩
192 View
236 Download



Gmail Facebook X LinkedIn More