Femke van Raamsdonk  Home/Search
Context Related
| cs.vu.nl/~femke/ps/rta99.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.vu.nl/~femke/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper will appear in the proceedings of the 10th international conference on rewriting techniques and applications (RTA'99). c flSpringer Verlag. (Update)
Context of citations to this paper: More
.... also for weaklyorthogonal higher order TRSs if an additional condition, full extension, is imposed on higher order rewrite rules [23]. The theory of higher order narrowing is even less developed. Similar to the first order case, several classes of higherorder TRSs have...
Cited by: More
Evaluation Strategies for Functional Logic Programming - Antoy (2001) (Correct)
Active bibliography (related documents): More All
0.6: On the Longest Perpetual Reductions in Orthogonal Expression.. - Khasidashvili (2000) (Correct)
0.6: Perpetual Reductions in λ-Calculus - van Raamsdonk, Severi.. (1999) (Correct)
0.5: Stable Results and Relative Normalization - Glauert, Kennaway, Khasidashvili (Correct)
Similar documents based on text: More All
0.2: A Termination Ordering for Higher Order Rewrite Systems - Lysne, Piris (1995) (Correct)
0.1: Logic Programming with Requests - Etalle, van Raamsdonk (1999) (Correct)
0.1: Combinatory Reduction Systems: introduction and survey - Klop, van Oostrom, al. (1993) (Correct)
BibTeX entry: (Update)
F. van Raamsdonk. Higher-order rewriting. In Proceedings of the 10th International Conference on Rewriting Techniques and Applications (RTA '99), pages 220--239. Springer LNCS 1631, 99. http://citeseer.ist.psu.edu/vanraamsdonk99higherorder.html More
@article{ vanraamsdonk99higherorder,
author = "Femke van Raamsdonk",
title = "Higher-Order Rewriting",
journal = "Lecture Notes in Computer Science",
volume = "1631",
pages = "220--??",
year = "1999",
url = "citeseer.ist.psu.edu/vanraamsdonk99higherorder.html" }
Citations (may not include all citations):384 Simple word problems in universal algebras (context) - Knuth, Bendix - 1970
251 A logic programming language with lambda-abstraction - Miller - 1991
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
214 Orderings for term rewriting systems (context) - Dershowitz - 1982
126 Higher-order critical pairs (context) - Nipkow - 1991
89 Termination of term rewriting: Interpretation and type elimi.. - Zantema - 1994
88 Computing in Systems Described by Equations (context) - O'Donnell - 1977
71 Conditional rewrite rules: Confluence and termination (context) - Bergstra, Klop - 1986
65 volume 103 of Studies in Logic and the Foundations of Mathem.. (context) - Barendregt, Calculus et al. - 1984
57 Confluence for Abstract and Higher-Order Rewriting (context) - van Oostrom - 1994
54 Tree-manipulating systems and Church-Rosser theorems (context) - Rosen - 1973
51 Theoretical Computer Science (context) - van Oostrom - 1997
45 Call by need computations to root-stable form - Middeldorp - 1997
44 Higher-order narrowing with definitional trees - Hanus, Prehofer - 1996
44 Programming in equational logic: Beyond strong sequentiality - Sekar, Ramakrishnan - 1990
41 Interaction systems I: The theory of optimal reductions - Asperti, Laneve - 1994
37 A general Church-Rosser theorem (context) - Aczel - 1978
35 Solving Higher-Order Equations: From Logic to Programming - Prehofer - 1995
34 Higher-order rewrite systems and their confluence - Mayr, Nipkow - 1998
31 Confluence and Normalisation for Higher-Order Rewriting (context) - van Raamsdonk - 1996
29 The higher-order recursive path ordering - Jouannaud, Rubio - 1999
28 Proofs of strong normalization (context) - Gandy - 1980
20 Expression Reduction Systems - Khasidashvili - 1990
19 Termination proofs for higher-order rewrite systems - Pol - 1994
19 Equations and rewrite rules (context) - Huet, Oppen - 1980
17 Surjective Pairing and Strong Normalization: Two Themes in L.. (context) - de Vrijer - 1987
15 Exactly estimating functionals and strong normalization (context) - de Vrijer - 1987
14 Relative normalization in deterministic residual structures - Glauert, Khasidashvili - 1996
14 Termination of Higher-order Rewrite Systems (context) - Pol - 1996
11 Higher-order rewriting and equational reasoning (context) - Nipkow, Prehofer - 1998
9 volume 127 of Mathematical Centre Tracts (context) - Klop, Systems - 1980
6 Normalisation in weakly orthogonal rewriting - van Oostrom - 1999
6 Unification of higher-order patterns in linear time and spac.. (context) - Qian - 1996
5 es. Description Abstraite des Syst`emes de R (context) - Melli - 1996
2 Transactions of the Americal Mathematical Society (context) - Hindley, residuals - 1978
1 Transactions of the Americal Mathematical Society (context) - Church, Rosser et al. - 1936
1 To appear in Mathematical Structures in Computer Science (context) - Kahrs, in et al.
Documents on the same site (http://www.cs.vu.nl/~femke/papers.html): More
Beyond Success and Failure - Etalle, van Raamsdonk (1998) (Correct)
Outermost-Fair Rewriting - van Raamsdonk (1997) (Correct)
Logic Programming with Requests - Etalle, van Raamsdonk (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC