Andrea Asperti. Linear logic, comonads, and optimal reductions. Fundamenta Informaticae 22:1, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Global Dynamics of Optimal Graph Reduction - Lawall, Mairson (1997) (3 citations) (Correct)
.... research by Lamping, and independently Kathail, has shown that there indeed exist calculus evaluators satisfying L evy s specification [Lam90, Kat90] Lamping s work, in particular, was followed by variants and simplifications proposed by Asperti, and Gonthier, Abadi, and L evy, among others [Asp94, GAL92]. The basic framework was to begin with a straightforward graph reduction scheme made up of application ( and abstraction ( nodes, and augment it with sharing nodes that lazily duplicate pieces of the graph. Traditional sharing nodes, found in implementations of lazy evaluation, allow the ....
Andrea Asperti. Linear logic, comonads, and optimal reductions. Fundamenta Informaticae 22:1, 1994.
Optimality and Inefficiency : What Isn't a Cost Model of the.. - Lawall, Mairson (1996) (11 citations) (Correct)
....Universitaire de Beaulieu 35042 Rennes Cedex France Harry G. Mairson y Computer Science Department Brandeis University Waltham, Massachusetts 02254 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 ....
....consider reasonable cost models for calculus. It was an open question for some fifteen years whether optimal reduction strategies exist, answered affirmatively by Lamping [Lam90] Kathail [Kat90] and in a simplified way by Gonthier, Abadi, and L evy [GAL92] henceforth, GAL) as well as Asperti [Asp94]. The solution of GAL was appealing because it also gave a static semantics to calculus in the spirit of Girard s geometry of interaction [Gir88] this semantics has also been recently investigated as an implementation technique by Mackie [Mac95] All these solutions are contributions to ....
[Article contains additional citation context not shown here]
Andrea Asperti. Linear logic, comonads, and optimal reductions. Unpublished manuscript.
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) Self-citation (Asperti) (Correct)
....Kat90] Lamping introduced a beautiful graph reduction technology for sharing evaluation contexts dual to the sharing of values. His pioneering insights have been modi ed and improved in subsequent implementations of optimal reduction, most notably by Asperti, and by Gonthier, Abadi, and L evy [Asp94, GAL92a]. Lamping s sharing nodes allow a single, shared representation of a redex family, and thus provide a means to implement L evy s notion of parallel reduction. The varied implementations of this graph reduction framework di er in the underlying bookkeeping technology used to control interactions ....
Andrea Asperti. Linear logic, comonads, and optimal reductions. Fundamenta Informaticae 22:1, 1994.
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) Self-citation (Asperti) (Correct)
....Kat90] Lamping 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, most notably by Asperti, and by Gonthier, Abadi, and L evy [Asp94, GAL92a]. Lamping s sharing nodes allow a single, shared representation of a redex family, and thus provide a means to implement L evy s notion of parallel reduction. The varied implementations of this graph reduction framework differ in the underlying bookkeeping technology used to control interactions ....
Andrea Asperti. Linear logic, comonads, and optimal reductions. Fundamenta Informaticae 22:1, 1994.
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