Aart Middeldorp  Home/Search
Context Related
| score.is.tsukuba.ac.jp/~...popl97.ps.gz 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: score.is.tsukuba.ac.jp/~ami/...cp (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The following theorem of Huet and L'evy forms the basis of all results on optimal reduction strategies for orthogonal term rewriting systems: every term not in normal form contains a needed redex, and repeated contraction of needed redexes results in the normal form, if the term under consideration has one. We generalize this theorem to computations to root-stable form and we argue that the resulting notion of root-neededness is more fundamental than (other variants of) neededness when it comes ... (Update)
Cited by: More
Rules + Strategies for Transforming Lazy Functional.. - Alpuente, Falaschi.. (2004) (Correct)
Refining Weakly Outermost-Needed Rewriting and Narrowing - Escobar (2003) (Correct)
Descendants and Origins in Term Rewriting - Bethke, Klop, de Vrijer (1999) (Correct)
Active bibliography (related documents): More All
0.3: Context-Sensitive Rewriting Strategies - Lucas (1997) (Correct)
0.2: Finite Family Developments - van Oostrom (1997) (Correct)
0.2: Higher-Order Families - van Oostrom (1996) (Correct)
Similar documents based on text: More All
1.5: Decidable Call by Need Computations in Term Rewriting.. - Durand, Middeldorp (1997) (Correct)
0.7: On the Complexity of Deciding Call-by-Need - Durand, Middeldorp (Correct)
0.7: Sieve Methods - Charles (Correct)
Related documents from co-citation: More All
24: Term Rewriting and All That (context) - Baader, Nipkow - 1998
20: Term rewriting systems - Klop - 1992
18: Rewrite systems - Dershowitz, Jouannaud - 1990
BibTeX entry: (Update)
A. Middeldorp. Call by need computations to root-stable form. In Proc. the 24th ACM POPL, pages 94--105, 1997. http://citeseer.ist.psu.edu/middeldorp97call.html More
@inproceedings{ middeldorp97call,
author = "Aart Middeldorp",
title = "Call by Need Computations to Root-Stable Form",
booktitle = "Symposium on Principles of Programming Languages",
pages = "94-105",
year = "1997",
url = "citeseer.ist.psu.edu/middeldorp97call.html" }
Citations (may not include all citations):788 Rewrite Systems - Dershowitz, Jouannaud - 1990
474 Term Rewriting Systems - Klop - 1992
88 Computing in Systems Described by Equations (context) - O'Donnell - 1977
71 Transfinite Reductions in Orthogonal Term Rewriting Systems - Kennaway, Klop et al. - 1995
44 Programming in Equational Logic: Beyond Strong Sequentiality - Sekar, Ramakrishnan - 1993
34 Second-Order Monadic Logic and Tree Automata (context) - Comon - 1995
33 Decidable Approximations of Term Rewriting Systems (context) - Jacquemard - 1996
29 NV-Sequentiality: A Decidable Condition for Call-by-Need Com.. (context) - Oyamaguchi - 1993
28 Needed Reduction and Spine Strategies for the Lambda Calculu.. (context) - Barendregt, Kennaway et al. - 1987
25 Optimal Normalization in Orthogonal Term Rewriting Systems - Khasidashvili - 1993
24 A Sequential Reduction Strategy - Antoy, Middeldorp - 1996
14 A Conflict Between Call-by-Need Computation and Parallelism - Kennaway - 1995
13 Algebraic and Topological Properties (context) - Arnold, Nivat et al. - 1980
4 ese de Doctorat, Universit (context) - Maranget, Paresseuse - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.score.is.tsukuba.ac.jp/~ami/research/papers/cp.html): More
Relative Undecidability in the Termination.. - Geser.. (1997) (Correct)
Relative Undecidability in Term Rewriting - Geser, Middeldorp, Ohlebusch.. (1996) (Correct)
Strong Completeness of a Lazy Conditional Narrowing Calculus - Hamada, Middeldorp (1997) (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