Femke van Raamsdonk - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2011

Higher Order Dependency Pairs for Algebraic Functional SystemsCynthia Kop, Femke van Raamsdonk. RTA 2011: 203-218 [doi]

2009

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

2008

A Higher-Order Iterative Path OrderingCynthia Kop, Femke van Raamsdonk. lpar 2008: 697-711 [doi]

2007

Reduction Strategies and AcyclicityJan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk. birthday 2007: 89-112 [doi]

2004

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

2002

Eliminating Proofs from ProgramsFemke van Raamsdonk, Paula Severi. ENTCS, 70(2):42-59, 2002. [doi]

2001

On Termination of Higher-Order RewritingFemke van Raamsdonk. RTA 2001: 261-275 [doi]

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. tplp, 1(1):123-125, 2001. [doi]

2000

Constructor Subtyping in the Calculus of Inductive ConstructionsGilles Barthe, Femke van Raamsdonk. fossacs 2000: 17-34 [doi]

1999

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

Higher-Order RewritingFemke van Raamsdonk. RTA 1999: 220-239 [doi]

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

1998

Beyond Success and FailureSandro Etalle, Femke van Raamsdonk. ICLP 1998: 190-205

1997

Termination of Algebraic Type Systems: The Syntactic ApproachGilles Barthe, Femke van Raamsdonk. icalp 1997: 174-193

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

Outermost-Fair RewritingFemke van Raamsdonk. tlca 1997: 284-299

1994

Weak Orthogonality Implies Confluence: The Higher Order CaseVincent van Oostrom, Femke van Raamsdonk. lfcs 1994: 379-392

1993

Combinatory Reduction Systems: Introduction and SurveyJan Willem Klop, Vincent van Oostrom, Femke van Raamsdonk. TCS, 121(1&2):279-308, 1993.

Comparing Combinatory Reduction Systems and Higher-order Rewrite SystemsVincent van Oostrom, Femke van Raamsdonk. hoa 1994: 276-304

Confluence and SuperdevelopmentsFemke van Raamsdonk. RTA 1993: 168-182

Sign in or sign up to see more results.

runs on WebDSL