Andrea Asperti, Harry G. Mairson  Home/Search
Context Related
| brandeis.edu/~mairson/Pape...optimal.ps Cached: 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.
PS.gz PS Image Update HelpFrom: brandeis.edu/~mairson/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We analyze the inherent complexity of implementing Lévy's notion of optimal evaluation for the lambda-calculus, where similar redexes are contracted in one step via so-called parallel lambda-reduction. Optimal evaluation was finally realized by Lamping, who introduced a beautiful graph reduction technology for sharing evaluation contexts dual to the sharing of values. His pioneering insights have been modified and improved in subsequent implementations of optimal reduction. We prove that ... (Update)
Context of citations to this paper: More
...paths. A strong normalization proof for simply typed l calculus using a similar idea (but completely different technically) appears in [2]. Arrow decoration of hyperbalanced terms is useful for other purposes too. For example, it allows us to develop a static garbage...
.... reduction does not say that such optimal reduction is inecient only that the parallel reduction cannot be considered a unit cost operation [3]. In summary, all of the translations we outline possess a simple graph reduction on translated terms (cut elimination for linear logic)...
Cited by: More
Relating Typability and Expressiveness in Finite-Rank .. - Kfoury, Mairson.. (1999) (Correct)
From Hilbert Spaces to Dilbert Spaces: - Context Semantics Made (Correct)
Sharing Continuations: Proofnets for Languages With Explicit.. - Lawall, Mairson (2000) (Correct)
Similar documents (at the sentence level):
48.4%: Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (Correct)
Active bibliography (related documents): More All
1.7: On Global Dynamics of Optimal Graph Reduction - Lawall, Mairson (1997) (Correct)
1.3: Optimality and Inefficiency : What Isn't a Cost Model of the.. - Lawall, Mairson (1996) (Correct)
1.2: (Optimal) duplication is not elementary recursive - Asperti, Coppola, Martini (2000) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.3: Linear Naming: Experimental Software for Optimizing.. - Bawden, Mairson (1998) (Correct)
0.3: Distribution of the Number of Factors in Random Ordered.. - Hwang (1999) (Correct)
0.3: Computer Science 190 (Autumn Term, 1997) - Te Rm (Correct)
Related documents from co-citation: More All
4: The complexity of type inference for higher-order typed lambda-calculi - Henglein, Mairson - 1991
4: The geometry of optimal lambda reduction - Gonthier, Abadi et al. - 1992
4: A Simple Proof of a Theorem of Statman - Mairson - 1992
BibTeX entry: (Update)
Andrea Asperti and Harry Mairson. Parallel beta reduction is not elementary recursive. In Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, 1998. http://citeseer.ist.psu.edu/asperti98parallel.html More
@inproceedings{ asperti98parallel,
author = "Andrea Asperti and Harry G. Mairson",
title = "Parallel Beta Reduction is not Elementary Recursive",
booktitle = "Symposium on Principles of Programming Languages",
pages = "303--315",
year = "1998",
url = "citeseer.ist.psu.edu/asperti98parallel.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, rey et al. - 1979
185 The Calculi of Lambda-conversion (context) - Church - 1941
146 Computers and Intractibility: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
42 On laziness and optimality in lambda interpreters: tools for.. (context) - Field - 1990
33 From proof nets to interaction nets - Lafont - 1995
26 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
23 The Optimal Implementation of Functional Programming Languag.. (context) - Asperti, Guerrini - 1999
21 A simple proof of a theorem of Statman - Mairson - 1992
18 The inherent computational complexity of theories of ordered.. (context) - Meyer - 1974
17 rd Annual ACM Symposium on the Theory of Computing (context) - Cook, of
17 Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
14 Introduction to Combinators and -Calculus (context) - Hindley, Seldin - 1986
13 Handbook of Theoretical Computer Science (context) - Boas, models - 1990
12 Correct and optimal implementation of recursion in a simple .. (context) - Vuillemin
10 Optimal reductions in the lambda-calculus (context) - evy - 1980
9 calculus is not elementary recursive (context) - Statman - 1979
8 Theoretical and practical issues of optimal implementations .. (context) - Guerrini - 1996
6 QED and the men who made it: Dyson (context) - Schweber - 1994
6 the global dynamics of optimal graph reduction - Lawall, Mairson - 1997
6 Theoretical Computer Science (context) - Asperti, Laneve et al. - 1995
5 ACM Symposium on Principles of Programming Languages (context) - Asperti, complexity - 1996
5 ACM Symposium on Principles of Programming Languages (context) - Gonthier, Abadi et al. - 1992
5 Programming Research Group (context) - Wadsworth, pragmatics et al. - 1971
5 Optimal interpreters for lambda-calculus based functional la.. (context) - Kathail - 1990
5 ACM Conference on Functional Programming and Computer Archit.. (context) - Frandsen, Sturtivant et al. - 1991
4 eductions correctes et optimales dans le lambda-calcul (context) - evy - 1978
4 ACM Symposium on Principles of Programming Languages (context) - Lamping, for et al. - 1990
4 and optimal reductions (context) - Asperti, comonads - 1994
4 Thirty years of information theory (context) - Tribus - 1978
4 Harper and Row (context) - Dyson, Universe - 1979
3 Optimality and ineciency: what isn't a cost model of the lam.. (context) - Lawall, Mairson - 1996
3 IEEE Symposium on Logic in Computer Science (context) - Gonthier, Abadi et al. - 1992
3 The Mathematics of Programming (context) - Richard - 1985
2 Complexity of normalization in the pure typed lambda calculu.. (context) - Schwichtenberg - 1982
2 ACM Symposium on Principles of Programming Languages (context) - Lafont - 1990
1 Ein einfaches Beispiel fur ein unentsheidbares arithmetisch.. (context) - aszl, Kalm et al. - 1943
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.brandeis.edu/~mairson/index.html): More
Undecidable Boundedness Problems for Datalog Programs - Hillebrand, Kanellakis.. (1995) (Correct)
Unification and ML Type Reconstruction - Kanellakis, Mairson, Mitchell (1991) (Correct)
Outline of a Proof Theory of Parametricity - Mairson (1991) (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