| Combinatory reduction systems: introduction and survey JW Klop, V Van Oostrom, F Van Raamsdonk Theoretical computer science 121 (1-2), 279-308, 1993 | 402 | 1993 |
| Confluence for abstract and higher-order rewriting V van Oostrom | 210 | 1994 |
| Confluence by decreasing diagrams V Van Oostrom Theoretical computer science 126 (2), 259-280, 1994 | 133 | 1994 |
| Developing developments V Van Oostrom Theoretical Computer Science 175 (1), 159-181, 1997 | 105 | 1997 |
| Weak orthogonality implies confluence: the higher-order case V van Oostrom, F van Raamsdonk International Symposium on Logical Foundations of Computer Science, 379-392, 1994 | 98 | 1994 |
| Confluence by decreasing diagrams: converted V van Oostrom International Conference on Rewriting Techniques and Applications, 306-320, 2008 | 90 | 2008 |
| Comparing combinatory reduction systems and higher-order rewrite systems V Van Oostrom, F Van Raamsdonk Higher-Order Algebra, Logic, and Term Rewriting: First International …, 1994 | 87 | 1994 |
| Lambda calculus with patterns V Van Oostrom Technical Report IR-228, Faculteit der Wiskunde en Informatica, Vrije …, 1990 | 79 | 1990 |
| Meaningless terms in rewriting R Kennaway, V van Oostrom, FJ de Vries International Conference on Algebraic and Logic Programming, 254-268, 1996 | 77 | 1996 |
| Lambda calculus with patterns JW Klop, V van Oostrom, R de Vrijer Theoretical Computer Science 398 (1-3), 16-31, 2008 | 48 | 2008 |
| Finite family developments V van Oostrom Rewriting Techniques and Applications: 8th International Conference, RTA-97 …, 1997 | 40 | 1997 |
| Logical description of context-free graph languages J Engelfriet, V van Oostrom Journal of Computer and System Sciences 55 (3), 489-503, 1997 | 39 | 1997 |
| Normalisation in weakly orthogonal rewriting V van Oostrom International Conference on Rewriting Techniques and Applications, 60-74, 1999 | 36 | 1999 |
| Higher-order families V van Oostrom International Conference on Rewriting Techniques and Applications, 392-407, 1996 | 35 | 1996 |
| Development closed critical pairs V van Oostrom International Workshop on Higher-Order Algebra, Logic, and Term Rewriting …, 1995 | 35 | 1995 |
| Random descent V van Oostrom International Conference on Rewriting Techniques and Applications, 314-328, 2007 | 30 | 2007 |
| Diagram techniques for confluence M Bezem, JW Klop, V van Oostrom Information and Computation 141 (2), 172-204, 1998 | 27 | 1998 |
| Proof orders for decreasing diagrams B Felgenhauer, V van Oostrom 24th International Conference on Rewriting Techniques and Applications (RTA …, 2013 | 26 | 2013 |
| Uniform normalisation beyond orthogonality Z Khasidashvili, M Ogawa, V van Oostrom Rewriting Techniques and Applications: 12th International Conference, RTA …, 2001 | 25 | 2001 |
| Perpetuality and uniform normalization in orthogonal rewrite systems Z Khasidashvili, M Ogawa, V van Oostrom Information and Computation 164 (1), 118-151, 2001 | 23 | 2001 |
