Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Femke van Raamsdonk
2010 – today
- 2013
[e3]Femke van Raamsdonk (Ed.): 24th International Conference on Rewriting Techniques and Applications (RTA 2013), RTA 2013, June 24-26, 2013, Eindhoven, The Netherlands. LIPIcs 21, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik 2013, ISBN 978-3-939897-53-8- 2012
- [j7]Cynthia Kop, Femke van Raamsdonk: Dynamic Dependency Pairs for Algebraic Functional Systems. Logical Methods in Computer Science 8(2) (2012)
- 2011
- [c14]Cynthia Kop, Femke van Raamsdonk: Higher Order Dependency Pairs for Algebraic Functional Systems. RTA 2011: 203-218
- [e2]Elham Kashefi, Jean Krivine, Femke van Raamsdonk (Eds.): Proceedings 7th International Workshop on Developments of Computational Methods. EPTCS 88, 2011
2000 – 2009
- 2009
- [j6]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
- [c13]
- 2007
- [c12]Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk: Reduction Strategies and Acyclicity. Rewriting, Computation and Proof 2007: 89-112
- 2005
- [e1]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
- 2004
- [j5]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
- [j4]Femke van Raamsdonk, Paula Severi: Eliminating Proofs from Programs. Electr. Notes Theor. Comput. Sci. 70(2): 42-59 (2002)
- 2001
- [j3]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)
- [c11]
- 2000
- [c10]Gilles Barthe, Femke van Raamsdonk: Constructor Subtyping in the Calculus of Inductive Constructions. FoSSaCS 2000: 17-34
1990 – 1999
- 1999
- [j2]Femke van Raamsdonk, Paula Severi, Morten Heine Sørensen, Hongwei Xi: Perpetual Reductions in Lambda-Calculus. Inf. Comput. 149(2): 173-225 (1999)
- [c9]
- [c8]
- 1998
- [c7]
- 1997
- [c6]Gilles Barthe, Femke van Raamsdonk: Termination of Algebraic Type Systems: The Syntactic Approach. ALP/HOA 1997: 174-193
- [c5]Femke van Raamsdonk: Translating Logic Programs into Conditional Rewriting Systems. ICLP 1997: 168-182
- [c4]
- 1994
- [c3]Vincent van Oostrom, Femke van Raamsdonk: Weak Orthogonality Implies Confluence: The Higher Order Case. LFCS 1994: 379-392
- 1993
- [j1]Jan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk: Combinatory Reduction Systems: Introduction and Survey. Theor. Comput. Sci. 121(1&2): 279-308 (1993)
- [c2]Vincent van Oostrom, Femke van Raamsdonk: Comparing Combinatory Reduction Systems and Higher-order Rewrite Systems. HOA 1993: 276-304
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:17 CEST by the dblp team