|
11
|
Modular term rewriting systems and the termination
– M Kurihara, I Kaji
- 1990
|
|
28
|
Termination for the direct sum of left-linear term rewriting systems
– Y Toyama, J Klop, H Barendregt
- 1989
|
|
3
|
Comparing combinatory reduction systems and higher-order rewrite systems
– V v Oostrom, F v Raamsdonk
- 1993
|
|
6
|
Modularity in noncopying term rewriting
– M Kurihara, A Ohuchi
- 1995
|
|
2
|
1 Modular Termination of r-Consistent and Left-Linear,Term Rewriting Systems
– Manfred Schmidt-schauss, Massimo Marchiori, Sven Eric Panitz
|
|
1
|
Modularity in higher-order term rewriting
– C Appel
- 2009
|
|
1
|
Reduction strategies and acyclicity
– J Klop, V v Oostrom, F v Raamsdonk
- 2007
|
|
1
|
Take five
– V v Oostrom
- 1996
|
|
1
|
Modularity of confluence, constructed
– V v Oostrom
- 2008
|
|
1
|
Weak orthogonality implies confluence: the higher-order case
– V v Oostrom, F v Raamsdonk
- 1994
|
|
10
|
A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems
– Enno Ohlebusch
- 1993
|
|
4
|
Universal algebra for termination of higher-order rewriting
– Makoto Hamana
- 2005
|
|
10
|
Confluence of Curried Term-Rewriting Systems
– Stefan Kahrs
- 1995
|
|
6
|
Termination of simply typed term rewriting systems by translation and labelling
– T Aoto, T Yamada
- 2003
|
|
5
|
Confluence for abstract and higher-order rewriting
– V V Oostrom
- 1994
|
|
15
|
Comparing Curried and Uncurried Rewriting
– Richard Kennaway, Jan Willem Klop, Ronan Sleep, Fer-jan De Vries
- 1995
|
|
75
|
Combinatory Reduction Systems: introduction and survey
– Jan Willem Klop, Vincent Van Oostrom, Femke Van Raamsdonk, Dedicated To Corrado Bohm
- 1993
|
|
119
|
Higher-order critical pairs
– T Nipkow
- 1991
|
|
35
|
rewriting systems, volume 55 of Cambridge Tracts in Theoretical Computer Science
– Term
- 2003
|
