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)
Similar documents based on text: More All
0.4: Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (Correct)
0.4: From Hilbert Spaces to Dilbert Spaces: - Context Semantics Made (Correct)
0.4: (Optimal) duplication is not elementary recursive - Asperti, Coppola, Martini (2000) (Correct)
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
[Article contains additional citations not shown here]
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