| 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 and Normalisation of Higher-Order Rewriting F van Raamsdonk | 147 | 1996 |
| 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 |
| Perpetual Reductions inλ-Calculus F van Raamsdonk, P Severi, MHB Sørensen, H Xi Information and Computation 149 (2), 173-225, 1999 | 93 | 1999 |
| Abstract logical model checking of infinite-state systems using narrowing K Bae, S Escobar, J Meseguer 24th International Conference on Rewriting Techniques and Applications (RTA …, 2013 | 86 | 2013 |
| 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 | 86 | 1994 |
| Teaching logic using a state-of-the-art proof assistant M Hendriks, C Kaliszyk, F Raamsdonk, F Wiedijk | 50 | 2010 |
| On normalisation F Van Raamsdonk, PG Severi Technische Universiteit Eindhoven, 1995 | 47 | 1995 |
| Confluence and superdevelopments F Van Raamsdonk International Conference on Rewriting Techniques and Applications, 168-182, 1993 | 36 | 1993 |
| Higher-order rewriting F van Raamsdonk International Conference on Rewriting Techniques and Applications, 220-239, 1999 | 33* | 1999 |
| On termination of higher-order rewriting F van Raamsdonk International Conference on Rewriting Techniques and Applications, 261-275, 2001 | 29 | 2001 |
| Dynamic dependency pairs for algebraic functional systems C Kop, F van Raamsdonk Logical Methods in Computer Science 8, 2012 | 22 | 2012 |
| Higher order dependency pairs for algebraic functional systems C Kop, F van Raamsdonk 22nd International Conference on Rewriting Techniques and Applications (RTA …, 2011 | 21 | 2011 |
| Translating logic programs into conditional rewriting systems F van Raamsdonk | 21 | 1997 |
| Constructor subtyping in the calculus of inductive constructions G Barthe, F Van Raamsdonk International Conference on Foundations of Software Science and Computation …, 2000 | 19 | 2000 |
| Teaching logic using a state-of-the-art proof assistant CS Kaliszyk, F Wiedijk, M Hendriks, F Raamsdonk Paris, France: CNAM, 2007 | 14 | 2007 |
| A higher-order iterative path ordering C Kop, F van Raamsdonk International Conference on Logic for Programming Artificial Intelligence …, 2008 | 13 | 2008 |
| Outermost-fair rewriting F van Raamsdonk International Conference on Typed Lambda Calculi and Applications, 284-299, 1997 | 13 | 1997 |
| Termination of algebraic type systems: the syntactic approach G Baxthe, F van Raamsdonk International Conference on Algebraic and Logic Programming, 174-193, 1997 | 11 | 1997 |
| Deduction using the ProofWeb system CS Kaliszyk, F Raamsdonk, F Wiedijk, H Wupper, M Hendriks, R Vrijer Nijmegen: ICIS, 2008 | 10 | 2008 |
Jan Willem KlopVrije Universiteit Amsterdam在 vu.nl 的电子邮件经过验证
