On the confluence of lambda-calculus with conditional rewriting
<|reference_start|>On the confluence of lambda-calculus with conditional rewriting: The confluence of untyped lambda-calculus with unconditional rewriting has already been studied in various directions. In this paper, we investigate the confluence of lambda-calculus with conditional rewriting and provide general results in two directions. First, when conditional rules are algebraic. This extends results of Muller and Dougherty for unconditional rewriting. Two cases are considered, whether beta-reduction is allowed or not in the evaluation of conditions. Moreover, Dougherty's result is improved from the assumption of strongly normalizing beta-reduction to weakly normalizing beta-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 an extended notion of orthogonality that takes advantage of the conditional part of rewrite rules.<|reference_end|>
@article{blanqui2006on,
    title={On the confluence of lambda-calculus with conditional rewriting},
    author={Fr'ed'eric Blanqui (INRIA Lorraine - LORIA), Claude Kirchner (INRIA
  Lorraine - LORIA), Colin Riba (INRIA Lorraine - LORIA)},
    journal={arXiv preprint arXiv:cs/0609002},
    year={2006},
    doi={10.1007/11690634\_26},
    archivePrefix={arXiv},
    eprint={cs/0609002},
    primaryClass={cs.LO cs.PL}
}