Random descent
V van Oostrom - International Conference on Rewriting Techniques and …, 2007 - Springer
We introduce a method for establishing that a reduction strategy is normalising and minimal,
or dually, that it is perpetual and maximal, in the setting of abstract rewriting. While being …
or dually, that it is perpetual and maximal, in the setting of abstract rewriting. While being …
Diagram techniques for confluence
M Bezem, JW Klop, V van Oostrom - Information and Computation, 1998 - Elsevier
We develop diagram techniques for proving confluence in abstract reductions systems. The
underlying theory gives a systematic and uniform framework in which a number of known …
underlying theory gives a systematic and uniform framework in which a number of known …
[PDF][PDF] Context-sensitive conditional expression reduction systems
Z Khasidashvili, V van Oostrom - Electronic Notes in Theoretical …, 1995 - core.ac.uk
We justify our framework in two ways. First, we de ne orthogonality for CERSs and show that
the usual results for orthogonal systems (niteness of developments, con uence, permutation …
the usual results for orthogonal systems (niteness of developments, con uence, permutation …
Reduction strategies and acyclicity
In this paper we review some well-known theory about reduction strategies of various kinds:
normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the definition of …
normalizing, outermost-fair, cofinal, Church-Rosser. A stumbling block in the definition of …
[BOEK][B] Diagram Techniques for Confluence
M Bezem, JW Klop, V van Oostrom - 1996 - Citeseer
We develop diagram techniques for proving con uence in abstract reductions systems. The
underlying theory gives a systematic and uniform framework in which a number of known …
underlying theory gives a systematic and uniform framework in which a number of known …
[PDF][PDF] Context sensitive conditional reduction systems
Z Khasidashvili, V van Oostrom - Electronic Notes in Theoretical …, 1995 - cmp.uea.ac.uk
Context-sensitive Conditional Reduction Systems Page 1 Context-sensitive Conditional
Reduction Systems Z. Khasidashvili and V. van Oostrom Technical Report SYS-C95-06 …
Reduction Systems Z. Khasidashvili and V. van Oostrom Technical Report SYS-C95-06 …
[CITAAT][C] Delimiting diagrams
V Oostrom - Artificial Intelligence Preprint Series, 2004
[CITAAT][C] Four equivalent equivalences of reductions
V Oostrom, R Vrijer - Artificial Intelligence Preprint Series, 2002
On normalisation of infinitary combinatory reduction systems
J Ketema - … and Applications: 19th International Conference, RTA …, 2008 - Springer
For fully-extended, orthogonal infinitary Combinatory Reduction Systems, we prove that terms
with perpetual reductions starting from them do not have (head) normal forms. Using this, …
with perpetual reductions starting from them do not have (head) normal forms. Using this, …
[CITAAT][C] R Confluence of graph transformation revisited Processes
PDMA van Oostrom, VRF de Vrijer - Terms and Cycles: Steps on the Road to Infinity, 2005
