| Transfinite reductions in orthogonal term rewriting systems R Kennaway, JW Klop, R Sleep, FJ Devries Information and computation 119 (1), 18-38, 1995 | 242* | 1995 |
| Infinitary lambda calculus JR Kennaway, JW Klop, MR Sleep, FJ de Vries Theoretical Computer Science 175 (1), 93-125, 1997 | 193 | 1997 |
| On the adequacy of graph rewriting for simulating term rewriting JR Kennaway, JW Klop, MR Sleep, FJ de Vries ACM Transactions on Programming Languages and Systems (TOPLAS) 16 (3), 493-523, 1994 | 125 | 1994 |
| Infinitary rewriting JR Kennaway, FJ de Vries Term Rewriting Systems, 668-711, 2003 | 88 | 2003 |
| Dynamic interpretation and Hoare deduction J Van Eijck, FJ De Vries Journal of Logic, Language and Information 1 (1), 1-44, 1992 | 88 | 1992 |
| Meaningless terms in rewriting R Kennaway, V Van Oostrom, FJ de Vries Journal of Logic and Functional Programming 1999 (Article 1), 35, 1999 | 68 | 1999 |
| Comparing curried and uncurried rewriting R Kennaway, JW Klop, MR Sleep, FJ De Vries Journal of Symbolic Computation 21 (1), 15-40, 1996 | 53 | 1996 |
| Reasoning about Update Logic DJN van Eijck, FJ de Vries Journal of Philosophical Logic, 1995 | 47* | 1995 |
| Infinitary lambda calculi and Böhm models R Kennaway, JW Klop, R Sleep, FJ Vries International Conference on Rewriting Techniques and Applications, 257-270, 1995 | 35 | 1995 |
| An extensional Böhm model P Severi, FJ Vries International Conference on Rewriting Techniques and Applications, 159-173, 2002 | 29 | 2002 |
| Nominal coalgebraic data types with applications to lambda calculus FJ de Vries, P Severi, DL Petrişan, A Kurz Logical Methods in Computer Science 9, 2013 | 27 | 2013 |
| Syntactic definitions of undefined: On defining the undefined Z Ariola, R Kennaway, JW Klop, R Sleep, FJ Vries International Symposium on Theoretical Aspects of Computer Software, 543-554, 1994 | 26 | 1994 |
| Event Structures and orthogonal term graph rewriting JR Kennaway, JW Klop, MR Sleep, FJ de Vries Term graph rewriting: theory and practice, 141-156, 1993 | 25 | 1993 |
| Transfinite reductions in orthogonal term rewriting systems JR Kennaway, JW Klop, MR Sleep Department of Computer Science [CS], 1990 | 23 | 1990 |
| Pure type systems with corecursion on streams: from finite to infinitary normalisation PG Severi, FJ de Vries Proceedings of the 17th ACM SIGPLAN international conference on Functional …, 2012 | 22 | 2012 |
| Infinitary lambda calculus and discrimination of Berarducci trees M Dezani-Ciancaglini, P Severi, FJ de Vries Theoretical Computer Science 298 (2), 275-302, 2003 | 21 | 2003 |
| Intersection types for λ-trees S Van Bakel, F Barbanera, M Dezani-Ciancaglini, FJ de Vries Theoretical Computer Science 272 (1-2), 3-40, 2002 | 20* | 2002 |
| Weakening the axiom of overlap in infinitary lambda calculus P Severi, FJ de Vries 22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011 | 13 | 2011 |
| Order structures on Böhm-like models P Severi, FJ Vries International Workshop on Computer Science Logic, 103-118, 2005 | 13 | 2005 |
| An infinitary Church-Rosser property for non-collapsing orthogonal term rewriting systems OT Rewriting, JR Kennaway, JW Klop, MR Sleep, FJ de Vries Term graph rewriting: theory and practice, 47, 1993 | 12* | 1993 |
