MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Safe operators: brackets closed forever: optimizing optimal *-calculus implementations (1997) [2 citations — 0 self]

Download:
Download as a PDF | Download as a PS
by Andrea Asperti, Juliusz Chroboczek
Appl. Algebra Engrg. Comm. Comput
http://www.pps.jussieu.fr/~jch/safebrackets.ps.gz
Add To MetaCart

Abstract:

Abstract. Considerations from category theory described in [As94] have permitted to add new rewriting rules for optimal reductions of the-calculus [Lam90, GAL92a]. These rules produce an impressive improvement in the performance of the reduction system, and provide a first step towards the solution of the well known and crucial problem of accumulation of control operators. In this paper, after an introduction to optimal reductions, we exhibit the aforementioned problem and prove the correctness of the new rules. 1

Citations

150 Interaction nets – Lafont - 1990
114 An algorithm for optimal lambda calculus reduction – Lamping - 1990
93 The geometry of optimal lambda-reduction – Gonthier, Abadi, et al. - 1992
87 Réductions Correctes et Optimales dans le Lambda-Calcul – Levy - 1978
84 Geometry of interaction I: interpretation of system F – Girard - 1989
80 Optimal reductions in the lambda calculus – L'evy - 1980
56 Linear logic without boxes – Gonthier, Abadi, et al. - 1992
45 On Laziness and Optimality in Lambda Interpreters: Tools for Specification and Analysis – Field - 1990
43 Interaction systems I: The theory of optimal reductions – Asperti, Laneve - 1994
29 Geometry of interaction II : deadlock-free algorithms – Girard - 1990
21 Lambda Calcul et R'eseaux. Th`ese de doctorat, Universit'e Paris VII – Regnier - 1992
20 Local and asynchronous beta-reduction – Danos, Regnier - 1993
18 Interaction systems II: The practice of optimal reductions – Asperti, Laneve - 1996
7 The Caml Light System, Release 0.5. Documentation and User's – Leroy, Mauny - 1992
5 ffiffi!ffl = 1: Optimizing optimal *-calculus implementations – Asperti - 1995
4 Paths in the -calculus: Three years of communication without understanding – Asperti, Danos, et al. - 1994
3 Optimal Reductions – Logic, Comonads - 1994
2 Relating -calculus translations in sharing graphs – Asperti, Laneve - 1995
1 De l'optimisation des impl'ementations optimales du -calcul. Rapport de stage – Chroboczek - 1995
1 gestione della condivisione di espressioni riducibili in linguaggi funzionali. Dissertazione di Laurea. Dipartimento di Matematica, Universit`a degli Studi di – Sulla - 1995
1 An investigation on the optimal implementation of processes. Unpublished – Laneve
1 The Yale Haskell Users – Group - 1994