An insertion operator preserving infinite reduction sequences

Abstract : A common way to show the termination of the union of two abstract reduction systems, provided both systems terminate, is to prove that they enjoy a specific property (some sort of 'commutation' for instance). This specific property is actually used to show that, for the union not to terminate, one of the systems must itself be non-terminating, which leads to a contradiction. Unfortunately, the property may be impossible to prove because some of the objects that are reduced do not enjoy an adequate form. Hence the purpose of this paper is threefold: - First, it introduces an operator enabling us to insert a reduction step on such an object, and therefore to change its shape, while still preserving the ability to use the property. Of course, some new properties will need to be verified. - Second, as an instance of our technique, the operator is applied to relax a well-known lemma stating the termination of the union of two termination abstract reduction systems. - Finally, this lemma is applied in a peculiar and then in a more general way to show the termination of some lambda calculi with inductive types augmented with specific reductions dealing with: (i) copies of inductive types; (ii) the representation of symmetric groups.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download
Contributor : David Chemouil <>
Submitted on : Wednesday, January 30, 2013 - 5:07:13 PM
Last modification on : Thursday, October 17, 2019 - 8:52:18 AM
Long-term archiving on : Saturday, April 1, 2017 - 12:54:14 PM


Files produced by the author(s)



David Chemouil. An insertion operator preserving infinite reduction sequences. Mathematical Structures in Computer Science, Cambridge University Press (CUP), 2008, 18 (4), pp.693-728. ⟨10.1017/S0960129508006816⟩. ⟨hal-00782799⟩



Record views


Files downloads