 | 2009 |
|---|
| 20 |       | 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) |
| 2008 |
|---|
| 19 | | Cynthia Kop,
Femke van Raamsdonk:
A Higher-Order Iterative Path Ordering.
LPAR 2008: 697-711 |
| 2007 |
|---|
| 18 | | Jan Willem Klop,
Vincent van Oostrom,
Femke van Raamsdonk:
Reduction Strategies and Acyclicity.
Rewriting, Computation and Proof 2007: 89-112 |
| 2005 |
|---|
| 17 |  | Aart Middeldorp,
Vincent van Oostrom,
Femke van Raamsdonk,
Roel C. de Vrijer:
Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday
Springer 2005 |
| 2004 |
|---|
| 16 | | 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) |
| 2002 |
|---|
| 15 | | Femke van Raamsdonk,
Paula Severi:
Eliminating Proofs from Programs.
Electr. Notes Theor. Comput. Sci. 70(2): (2002) |
| 2001 |
|---|
| 14 | | Femke van Raamsdonk:
On Termination of Higher-Order Rewriting.
RTA 2001: 261-275 |
| 13 | | 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) |
| 2000 |
|---|
| 12 | | Gilles Barthe,
Femke van Raamsdonk:
Constructor Subtyping in the Calculus of Inductive Constructions.
FoSSaCS 2000: 17-34 |
| 1999 |
|---|
| 11 | | Sandro Etalle,
Femke van Raamsdonk:
Logic Programming with Requests.
ICLP 1999: 558-572 |
| 10 | | Femke van Raamsdonk:
Higher-Order Rewriting.
RTA 1999: 220-239 |
| 9 | | Femke van Raamsdonk,
Paula Severi,
Morten Heine Sørensen,
Hongwei Xi:
Perpetual Reductions in Lambda-Calculus.
Inf. Comput. 149(2): 173-225 (1999) |
| 1998 |
|---|
| 8 | | Sandro Etalle,
Femke van Raamsdonk:
Beyond Success and Failure.
IJCSLP 1998: 190-205 |
| 1997 |
|---|
| 7 | | Gilles Barthe,
Femke van Raamsdonk:
Termination of Algebraic Type Systems: The Syntactic Approach.
ALP/HOA 1997: 174-193 |
| 6 | | Femke van Raamsdonk:
Translating Logic Programs into Conditional Rewriting Systems.
ICLP 1997: 168-182 |
| 5 | | Femke van Raamsdonk:
Outermost-Fair Rewriting.
TLCA 1997: 284-299 |
| 1994 |
|---|
| 4 | | Vincent van Oostrom,
Femke van Raamsdonk:
Weak Orthogonality Implies Confluence: The Higher Order Case.
LFCS 1994: 379-392 |
| 1993 |
|---|
| 3 | | Vincent van Oostrom,
Femke van Raamsdonk:
Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems.
HOA 1993: 276-304 |
| 2 | | Femke van Raamsdonk:
Confluence and Superdevelopments.
RTA 1993: 168-182 |
| 1 | | Jan Willem Klop,
Vincent van Oostrom,
Femke van Raamsdonk:
Combinatory Reduction Systems: Introduction and Survey.
Theor. Comput. Sci. 121(1&2): 279-308 (1993) |
