Combining algebraic rewriting, extensional lambda calculi, and fixpoints

Roberto Di Cosmo, Delia Kesner
1996 Theoretical Computer Science  
It is well known that confluence and strong normalization are preserved when combining algebraic rewriting systems with the simply typed lambda calculus. It is equally well known that confluence fails when adding either the usual contraction rule for II, or recursion together with the usual contraction rule for sujective pairing. We show that confluence and strong normalization are modular properties for the combination of algebraic rewriting systems with typed lambda calculi enriched with
more » ... sive extensional rules for q and sujective pairing. We also show how to preserve confluence in a modular way when adding jxpoints to different rewriting systems. This result is also obtained by a simple translation technique allowing to simulate bounded recursion.
doi:10.1016/s0304-3975(96)00121-1 fatcat:3wj6hg4vobfxzoxumonlv3gvva