| Combinatory reduction systems: introduction and survey JW Klop, V Van Oostrom, F Van Raamsdonk Theoretical computer science 121 (1-2), 279-308, 1993 | 392 | 1993 |
| Confluence and Normalisation of Higher-Order Rewriting F van Raamsdonk | 143 | 1996 |
| Weak orthogonality implies confluence: the higher-order case V Van Oostrom, F Van Raamsdonk Logical Foundations of Computer Science: Third International Symposium, LFCS …, 1994 | 93 | 1994 |
| Perpetual Reductions inλ-Calculus F van Raamsdonk, P Severi, MHB Sørensen, H Xi Information and Computation 149 (2), 173-225, 1999 | 89 | 1999 |
| 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 | 83 | 1994 |
| 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 | 82 | 2013 |
| On normalisation F Van Raamsdonk, P Severi Centrum voor Wiskunde en Informatica, 1995 | 49 | 1995 |
| Teaching logic using a state-of-the-art proof assistant M Hendriks, C Kaliszyk, F Raamsdonk, F Wiedijk | 44 | 2010 |
| Higher-order rewriting F van Raamsdonk Rewriting Techniques and Applications: 10th International Conference, RTA-99 …, 1999 | 36* | 1999 |
| Confluence and superdevelopments F Van Raamsdonk RTA 690, 168-182, 1993 | 35 | 1993 |
| On termination of higher-order rewriting F van Raamsdonk Rewriting Techniques and Applications: 12th International Conference, RTA …, 2001 | 29 | 2001 |
| Higher order dependency pairs for algebraic functional systems C Kop, F van Raamsdonk 22nd International Conference on Rewriting Techniques and Applications (RTA'11), 2011 | 23 | 2011 |
| Dynamic dependency pairs for algebraic functional systems C Kop, F van Raamsdonk Logical Methods in Computer Science 8, 2012 | 21 | 2012 |
| Translating Logic Programs into Conditional Rewriting Systems. F van Raamsdonk ICLP 97, 168-182, 1997 | 21 | 1997 |
| Constructor subtyping in the calculus of inductive constructions G Barthe, F Van Raamsdonk Foundations of Software Science and Computation Structures: Third …, 2000 | 18 | 2000 |
| A higher-order iterative path ordering C Kop, F van Raamsdonk Logic for Programming, Artificial Intelligence, and Reasoning: 15th …, 2008 | 14 | 2008 |
| Teaching logic using a state-of-the-art proof assistant CS Kaliszyk, F Wiedijk, M Hendriks, F Raamsdonk Paris, France: CNAM, 2007 | 14 | 2007 |
| Term Rewriting Systems E Barendsen, I Bethke, J Heering, R Kennaway, P Klint, V van Oostrom, ... Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2003 | 12 | 2003 |
| Termination of algebraic type systems: the syntactic approach G Baxthe, F van Raamsdonk Algebraic and Logic Programming: 6th International Joint Conference ALP'97 …, 2005 | 11 | 2005 |
| Outermost-fair rewriting F van Raamsdonk Typed Lambda Calculi and Applications: Third International Conference on …, 1997 | 11 | 1997 |
Jan Willem KlopVrije Universiteit AmsterdamBestätigte E-Mail-Adresse bei vu.nl
