Abstract Modularity (2005)

by Michael Abbott , Neil Ghani , Christoph Lüth
Citations:1 - 0 self

Documents Related by Co-Citation

5 Universal algebra for termination of higher-order rewriting – Makoto Hamana - 2005
8 Confluence and termination of simply typed term rewriting systems – T Yamada - 2001
12 Confluence of Curried Term-Rewriting Systems – Stefan Kahrs - 1995
16 Comparing Curried and Uncurried Rewriting – Richard Kennaway, Jan Willem Klop, Ronan Sleep, Fer-jan De Vries - 1995
11 Modular term rewriting systems and the termination – M Kurihara, I Kaji - 1990
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
2 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
11 A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems – Enno Ohlebusch - 1993
43 Rewriting Systems, volume 55 of Cambridge Tracts – Term - 2003
937 Term Rewriting and All That – F Baader, T Nipkow - 1998
282 The Lambda Calculus – Its Syntax and Semantics, volume 103 of – Hendrik Pieter Barendregt - 1984
245 Combinatory reduction systems – J W Klop - 1980
124 Higher-order critical pairs – T Nipkow - 1991