Simultaneous Critical Pairs and Church-Rosser Property
نویسنده
چکیده
We introduce simultaneous critical pairs, which account for simultaneous overlapping of several rewrite rules. Based on this, we introduce a new CR-criterion widely applicable to arbitrary left-linear term rewriting systems. Our result extends the well-known criterion given by Huet (1980), Toyama (1988), and Oostrom (1997) and incomparable with other well-known criteria for left-linear systems.
منابع مشابه
Confluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming. An important issue, in either case, is determining whether a rewrite system has the Church-Rosser, or confluence, property. In this paper, we settle negatively the question whether "joinabihty of critical pairs" is, ...
متن کاملA Church-Rosser Checker Tool for Conditional Order-Sorted Equational Maude Specifications
The (ground) Church-Rosser property, together with termination, is essential for an equational specification to have good executability conditions, and also for having a complete agreement between the specification’s initial algebra, mathematical semantics, and its operational semantics by rewriting. Checking this property for expressive specifications that are order-sorted, conditional with po...
متن کاملThe Church-Rosser Property for Pure Type Systems with βη -reduction
The main content of this paper is to give a proof of the Church-Rosser property (or confluence) with respect to βη -reduction for type theories with labelled lambda abstraction. This property is interesting in general since many other useful properties of a system depends on it and it is crucial when trying to use such systems as framework for defining logics. The usual way of encoding logics i...
متن کاملAdditives of linear logic and normalization - Part I: a (restricted) Church-Rosser property
We deene a generalized cut-elimination procedure for proof-nets of full linear logic (without constants), for which we prove a (restricted) Church-Rosser property.
متن کاملAn Application of Klop ' s Counterexampleto a Higher
In 1978, Klop demonstrated that a rewrite system constructed by adding the untyped lambda calculus, which has the Church-Rosser property, to a Church-Rosser rst-order algebraic rewrite system may not be Church-Rosser. In contrast, Breazu-Tannen recently showed that augmenting any Church-Rosser rst-order algebraic rewrite system with the simply-typed lambda calculus results in a Church-Rosser re...
متن کامل