Femke van Raamsdonk

Cynthia Kop, Femke van Raamsdonk: Dynamic Dependency Pairs for Algebraic Functional Systems. Logical Methods in Computer Science 8(2) (2012)

Cynthia Kop, Femke van Raamsdonk: Higher Order Dependency Pairs for Algebraic Functional Systems. RTA 2011: 203-218

Elham Kashefi, Jean Krivine, Femke van Raamsdonk (Eds.): Proceedings 7th International Workshop on Developments of Computational Methods. EPTCS 88, 2011

Femke van Raamsdonk: Lambda-Calculus and Combinators, An Introduction, 2nd Edition, J. Roger Hindley and Jonathan P. Seldin, Cambridge University Press, 2008. Hardback, ISBN 9780521898850. TPLP 9(2): 239-243 (2009)

Cynthia Kop, Femke van Raamsdonk: A Higher-Order Iterative Path Ordering. LPAR 2008: 697-711

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk: Reduction Strategies and Acyclicity. Rewriting, Computation and Proof 2007: 89-112

Aart Middeldorp, Vincent van Oostrom, Femke van Raamsdonk, Roel C. de Vrijer (Eds.): Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 3838, Springer 2005, isbn 3-540-30911-X

Femke van Raamsdonk: Book review: Advanced Topics in Term Rewriting by Enno Ohlebusch, Springer-Verlag, 2002, hard cover: ISBN 0-387-95250-0. TPLP 4(4): 539-541 (2004)

Femke van Raamsdonk, Paula Severi: Eliminating Proofs from Programs. Electr. Notes Theor. Comput. Sci. 70(2): 42-59 (2002)

Femke van Raamsdonk: Book Review - Logic in Computer Science: Modelling and Reasoning about Systems by Michael R. A. Huth and Mark D. Ryan, Cambridge University Press, 2000, ISBN 0521652006, (hardback), ISBN 0521656028, (paperback). TPLP 1(1): 123-125 (2001)

Femke van Raamsdonk: On Termination of Higher-Order Rewriting. RTA 2001: 261-275

Gilles Barthe, Femke van Raamsdonk: Constructor Subtyping in the Calculus of Inductive Constructions. FoSSaCS 2000: 17-34

Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen, Hongwei Xi: Perpetual Reductions in Lambda-Calculus. Inf. Comput. 149(2): 173-225 (1999)

Sandro Etalle, Femke van Raamsdonk: Logic Programming with Requests. ICLP 1999: 558-572

Femke van Raamsdonk: Higher-Order Rewriting. RTA 1999: 220-239

Sandro Etalle, Femke van Raamsdonk: Beyond Success and Failure. IJCSLP 1998: 190-205

Gilles Barthe, Femke van Raamsdonk: Termination of Algebraic Type Systems: The Syntactic Approach. ALP/HOA 1997: 174-193

Femke van Raamsdonk: Translating Logic Programs into Conditional Rewriting Systems. ICLP 1997: 168-182

Femke van Raamsdonk: Outermost-Fair Rewriting. TLCA 1997: 284-299

Vincent van Oostrom, Femke van Raamsdonk: Weak Orthogonality Implies Confluence: The Higher Order Case. LFCS 1994: 379-392

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk: Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121(1&2): 279-308 (1993)

Vincent van Oostrom, Femke van Raamsdonk: Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. HOA 1993: 276-304

Femke van Raamsdonk: Confluence and Superdevelopments. RTA 1993: 168-182