Julia L. Lawall, Harry G. Mairson  Home/Search
Context Related
| brandeis.edu/~mairson/Pap...LM96b.ps.gz brandeis.edu/~mairson/Pa...icfp97.ps.gz brandeis.edu/~jll/icfp97.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: bu.edu/groups/c...eminarschedule (more) From: brandeis.edu/~mairson/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Optimal graph reduction technology for the -calculus, as developed by Lamping, with modifications by Asperti, Gonthier, Abadi, and L'evy, has a well-understood local dynamics based on a standard menagerie of reduction rules, as well as a global context semantics based on Girard's geometry of interaction. However, the global dynamics of graph reduction has not been subject to careful investigation. In particular, graphs lose their structural resemblence to -terms after only a few graph reduction ... (Update)
Context of citations to this paper: More
...the computational complexity of sharing as a function of the real work of fi reduction. In recent years, various papers [Asp96, LM96, LM97] have begun to address this issue. This question concerning algorithm analysis only begs more global questions that one can pose...
.... difficult to give a direct and formal proof of this claim) Criticisms against this measure had been already raised by many authors [As96, ML96, ML97]. In particular, the total number of interactions in Lamping s abstract system looks as a much more realistic bound to the...
Cited by: More
Linear Naming: Experimental Software for Optimizing.. - Bawden, Mairson (1998) (Correct)
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (Correct)
(Optimal) duplication is not elementary recursive - Asperti, Coppola, Martini (2000) (Correct)
Active bibliography (related documents): More All
2.4: Optimality and Inefficiency : What Isn't a Cost Model of the.. - Lawall, Mairson (1996) (Correct)
0.2: Coherence for Sharing Proof-nets - Guerrini, Martini, Masini (1997) (Correct)
0.2: Coherence for Sharing Proof-Nets - Guerrini, Martini, Masini (1996) (Correct)
Similar documents based on text: More All
0.5: Proofnets and Context Semantics for the Additives - Mairson, Rival (Correct)
0.4: From Hilbert Spaces to Dilbert Spaces: - Context Semantics Made (Correct)
0.3: Sharing Continuations: Proofnets for Languages with Explicit.. - Lawall, Mairson (2000) (Correct)
Related documents from co-citation: More All
4: Optimality and inefficiency: What isn't a cost model of the lambda calculus - Mairson, Lawall - 1996
3: The Optimal Implementation of Functional Programming Languages (context) - Asperti, Guerrini - 1997
3: Optimal reductions in the lambda-calculus (context) - L'evy - 1980
BibTeX entry: (Update)
H. Mairson and J. L. Lawall. On the global dynamics of optimal graph reduction. In 1997 ACM International Conference on Functional Programming, 1997. http://citeseer.ist.psu.edu/lawall97global.html More
@inproceedings{ lawall97global,
author = "Julia L. Lawall and Harry G. Mairson",
title = "on Global Dynamics of Optimal Graph Reduction",
booktitle = "International Conference on Functional Programming",
pages = "188-195",
year = "1997",
url = "citeseer.ist.psu.edu/lawall97global.html" }
Citations (may not include all citations):185 The Calculi of Lambda-conversion (context) - Church - 1941
42 On laziness and optimality in lambda interpreters: tools for.. (context) - Field - 1990
26 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
20 Optimal interpreters for lambda-calculus based functional la.. (context) - Kathail - 1990
14 Optimality and inefficiency: what isn't a cost model of the .. - Lawall, Mairson - 1996
13 Handbook of Theoretical Computer Science (context) - Boas, models - 1990
10 Optimal reductions in the lambda-calculus (context) - L'evy - 1980
9 R'eductions correctes et optimales dans le lambda-calcul (context) - L'evy - 1978
6 Theoretical Computer Science (context) - Asperti, computations et al. - 1995
5 ACM Symposium on Principles of Programming Languages (context) - Asperti, complexity - 1996
5 ACM Conference on Functional Programming and Computer Archit.. (context) - Frandsen, Sturtivant et al. - 1991
5 ACM Symposium on Principles of Programming Languages (context) - Gonthier, Abadi et al. - 1992
5 Programming Research Group (context) - Wadsworth, pragmatics et al.
4 and optimal reductions (context) - Asperti, comonads - 1994
4 ACM Symposium on Principles of Programming Languages (context) - Lamping, for et al. - 1990
2 Unpublished manuscript (context) - Guerrini, sharing-morphisms et al. - 1995
2 ACM Symposium on Principles of Programming Languages (context) - Mackie, of - 1995
The graph only includes citing articles where the year of publication is known.
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