| Transfinite reductions in orthogonal term rewriting systems R Kennaway, JW Klop, R Sleep, FJ Devries Information and computation 119 (1), 18-38, 1995 | 251* | 1995 |
| Infinitary lambda calculus JR Kennaway, JW Klop, MR Sleep, FJ de Vries Theoretical Computer Science 175 (1), 93-125, 1997 | 208 | 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 | 133 | 1994 |
| Dynamic interpretation and Hoare deduction J Van Eijck, FJ De Vries Journal of Logic, Language and Information 1, 1-44, 1992 | 99 | 1992 |
| Infinitary rewriting JR Kennaway, FJ de Vries Term Rewriting Systems, 668-711, 2003 | 88 | 2003 |
| Meaningless terms in rewriting R Kennaway, V Van Oostrom, FJ de Vries Journal of Logic and Functional Programming 1999 (Article 1), 35, 1999 | 77 | 1999 |
| Comparing curried and uncurried rewriting R Kennaway, JW Klop, MR Sleep, FJ De Vries Journal of Symbolic Computation 21 (1), 15-40, 1996 | 57 | 1996 |
| Reasoning about Update Logic DJN van Eijck, FJ de Vries Journal of Philosophical Logic, 1995 | 48* | 1995 |
| Infinitary lambda calculi and Böhm models R Kennaway, JW Klop, R Sleep, FJ de Vries Rewriting Techniques and Applications: 6th International Conference, RTA-95 …, 1995 | 37 | 1995 |
| Nominal coalgebraic data types with applications to lambda calculus A Kurz, DL Petrişan, P Severi, FJ de Vries Logical Methods in Computer Science 9, 2013 | 33 | 2013 |
| Syntactic definitions of undefined: On defining the undefined Z Ariola, R Kennaway, JW Klop, R Sleep, FJ de Vries Theoretical Aspects of Computer Software: International Symposium TACS'94 …, 1994 | 32 | 1994 |
| An extensional Böhm model P Severi, FJ de Vries Rewriting Techniques and Applications: 13th International Conference, RTA …, 2002 | 27 | 2002 |
| 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 | 23 | 1993 |
| Transfinite reductions in orthogonal term rewriting systems JR Kennaway, J KLOP, MR Sleep, FJ DEVRIES | 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 |
| Intersection types for λ-trees S Van Bakel, F Barbanera, M Dezani-Ciancaglini, FJ de Vries Theoretical Computer Science 272 (1-2), 3-40, 2002 | 21* | 2002 |
| Infinitary lambda calculus and discrimination of Berarducci trees M Dezani-Ciancaglini, P Severi, FJ de Vries Theoretical Computer Science 298 (2), 275-302, 2003 | 18 | 2003 |
| An alpha-corecursion principle for the infinitary lambda calculus A Kurz, D Petrişan, P Severi, FJ De Vries Coalgebraic Methods in Computer Science: 11th International Workshop, CMCS …, 2012 | 16 | 2012 |
| Weakening the axiom of overlap in infinitary lambda calculus P Severi, FJ de Vries 22nd International Conference on Rewriting Techniques and Applications (RTA …, 2011 | 14 | 2011 |
| Order structures on Böhm-like models P Severi, FJ de Vries International Workshop on Computer Science Logic, 103-118, 2005 | 14 | 2005 |
