Femke van Raamsdonk

According to our database, Femke van Raamsdonk authored at least 21 papers between 1993 and 2012.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2012

Dynamic Dependency Pairs for Algebraic Functional Systems

Cynthia Kop, Femke van Raamsdonk

Log. Methods Comput. Sci., 2012

2011

Higher Order Dependency Pairs for Algebraic Functional Systems.

Cynthia Kop, Femke van Raamsdonk

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2009

Lambda-Calculus and Combinators, An Introduction, 2nd Edition, J. Roger Hindley and Jonathan P. Seldin, Cambridge University Press, 2008. Hardback, ISBN 9780521898850.

Femke van Raamsdonk

Theory Pract. Log. Program., 2009

2008

A Higher-Order Iterative Path Ordering.

Cynthia Kop, Femke van Raamsdonk

Proceedings of the Logic for Programming, 2008

2007

Reduction Strategies and Acyclicity.

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk

Proceedings of the Rewriting, 2007

2004

Book review: Advanced Topics in Term Rewriting by Enno Ohlebusch, Springer-Verlag, 2002, hard cover: ISBN 0-387-95250-0.

Femke van Raamsdonk

Theory Pract. Log. Program., 2004

2002

Eliminating Proofs from Programs.

Femke van Raamsdonk, Paula Severi

Proceedings of the International Workshop on Logical Frameworks and Meta-Languages, 2002

2001

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).

Femke van Raamsdonk

Theory Pract. Log. Program., 2001

On Termination of Higher-Order Rewriting.

Femke van Raamsdonk

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

2000

Constructor Subtyping in the Calculus of Inductive Constructions.

Gilles Barthe, Femke van Raamsdonk

Proceedings of the Foundations of Software Science and Computation Structures, 2000

1999

Perpetual Reductions in Lambda-Calculus.

Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen, Hongwei Xi

Inf. Comput., 1999

Higher-Order Rewriting.

Femke van Raamsdonk

Proceedings of the Rewriting Techniques and Applications, 10th International Conference, 1999

Logic Programming with Requests.

Sandro Etalle, Femke van Raamsdonk

Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

1998

Beyond Success and Failure.

Sandro Etalle, Femke van Raamsdonk

Proceedings of the 1998 Joint International Conference and Symposium on Logic Programming, 1998

1997

Outermost-Fair Rewriting.

Femke van Raamsdonk

Proceedings of the Typed Lambda Calculi and Applications, 1997

Translating Logic Programs into Conditional Rewriting Systems.

Femke van Raamsdonk

Proceedings of the Logic Programming, 1997

Termination of Algebraic Type Systems: The Syntactic Approach.

Gilles Barthe, Femke van Raamsdonk

Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1994

Weak Orthogonality Implies Confluence: The Higher Order Case.

Vincent van Oostrom, Femke van Raamsdonk

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993

Combinatory Reduction Systems: Introduction and Survey.

Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk

Theor. Comput. Sci., 1993

Confluence and Superdevelopments.

Femke van Raamsdonk

Proceedings of the Rewriting Techniques and Applications, 5th International Conference, 1993

Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems.

Vincent van Oostrom, Femke van Raamsdonk

Proceedings of the Higher-Order Algebra, 1993