Julia Lawall, Harry G. Mairson  Home/Search
Context Related
| brandeis.edu/~mairson/Pa...icfp96.ps.gz brandeis.edu/~jll/icfp96.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: brandeis.edu/~mairson/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the computational efficiency of the sharing graphs of Lamping [Lam90], Gonthier, Abadi, and L'evy [GAL92], and Asperti [Asp94], designed to effect so-called optimal evaluation, with the goal of reconciling optimality, efficiency, and the clarification of reasonable cost models for the -calculus. Do these graphs suggest reasonable cost models for the -calculus? If they are optimal, are they efficient? We present a brief survey of these optimal evaluators, identifying their common ... (Update)
Context of citations to this paper: More
.... is particularly interesting in light of the difficulty encountered in formulating a useful cost model in terms of graph reduction [LM96, Pey87]. Proof assistants may benefit from explicit substitution, due to the desire to perform substitutions locally and in a formal...
.... is particularly interesting in light of the difficulty encountered in formulating a useful cost model in terms of graph reduction [33, 40]. Proof assistants may benefit from explicit substitution, due to the desire to perform substitutions locally and in a formal manner....
Cited by: More
Bridging the lambda sigma- and lambda s-Styles of.. - Kamareddine, Ríos (1997) (Correct)
Calculi of Generalized beta-Reduction and Explicit.. - Kamareddine, Ríos, Wells (1998) (Correct)
Linear Naming: Experimental Software for Optimizing.. - Bawden, Mairson (1998) (Correct)
Active bibliography (related documents): More All
2.4: On Global Dynamics of Optimal Graph Reduction - Lawall, Mairson (1997) (Correct)
1.4: Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (Correct)
0.3: Coherence for Sharing Proof-Nets - Guerrini, Martini, Masini (1996) (Correct)
Similar documents based on text: More All
0.4: From Hilbert Spaces to Dilbert Spaces: - Context Semantics Made (Correct)
0.4: Sharing Continuations: Proofnets for Languages with Explicit.. - Lawall, Mairson (2000) (Correct)
0.3: Proofnets and Context Semantics for the Additives - Mairson, Rival (Correct)
Related documents from co-citation: More All
7: Optimal reductions in the lambda-calculus (context) - L'evy - 1980
6: New notions of reduction and non-semantic proofs of fi-strong normalization in t.. (context) - Kfoury, Wells - 1994
5: Generalising reduction in -calculus (context) - Kamareddine, Nederpelt - 1995
BibTeX entry: (Update)
H. Mairson and J. L. Lawall. Optimality and inefficiency: What isn't a cost model of the lambda calculus. In 1996 ACM International Conference on Functional Programming, pages 92--101, 1996. BIBLIOGRAPHY 135 http://citeseer.ist.psu.edu/lawall96optimality.html More
@inproceedings{ lawall96optimality,
author = "Julia L. Lawall and Harry G. Mairson",
title = "Optimality and Inefficiency: What Isn't a Cost Model of the Lambda Calculus?",
booktitle = "International Conference on Functional Programming",
pages = "92-101",
year = "1996",
url = "citeseer.ist.psu.edu/lawall96optimality.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
359 The Implementation of Functional Programming Languages (context) - Peyton-Jones - 1987
143 New implementation techniques for applicative languages (context) - Turner - 1979
42 On laziness and optimality in lambda interpreters: tools for.. (context) - Field - 1990
35 Supercombinators: a new implementation method for applicativ.. (context) - Hughes - 1982
20 Optimal interpreters for lambdacalculus based functional lan.. (context) - Kathail - 1990
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 optimizing optimal -calculus implementations (context) - Asperti, ffl - 1995
5 ACM Symposium on Principles of Programming Languages (context) - Gonthier, Abadi et al. - 1992
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
4 and optimal reductions (context) - Asperti, comonads
4 Princeton University Press (context) - Church, of - 1941
4 ACM Symposium on Principles of Programming Languages (context) - Lamping, for et al. - 1990
2 Unpublished manuscript (context) - Guerrini, sharingmorphisms et al. - 1995
2 ACM Symposium on Principles of Programming Languages (context) - Mackie, of - 1995
1 The complexity of type inference for higher-order typed lamb.. (context) - Mairson, Henglein - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.brandeis.edu/~mairson/): 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