A. Asperti and C. Laneve. Paths, computations and labels in the #-calculus. Theoretical Computer Science, 142(2):277--297, 15 May 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
From Hilbert Spaces to Dilbert Spaces: - Context Semantics Made (Correct)
....that this label on the function in the last application above, describes a path between an and # node in the initial graph coding of (#x.xx) #x.xx) read underlined atomic labels by reversing the orientation of the graph edge. This connection between labels and paths has been studied in [5]; we add some intuitions. First, except for K redexes, which discard term structure, the history of the computation is coded in the labels: we can e#ectively run the reductions backwards. But the same is not true of context semantics we cannot reconstruct the initial term. For example, ....
A. Asperti and C. Laneve. Paths, computations and labels in the #-calculus. Theoretical Computer Science, 142(2):277--297, 15 May 1995.
A Syntactical Analysis of Normalization - Khasidashvili, Piperno (Correct)
....of terms to be closed under reduction. It follows that the structure of hyperbalanced terms is preserved by reduction. A strong normalization result for hyperbalanced terms is presented in [34] with a rather complex but powerful technique based on arrow decorations, a restricted notion of path [1, 2]. In this paper we prove that hyperbalanced terms normalize using a simpler technique based on labels. The intended meaning of the labeling is to give information about the minimal number of contractions needed by a variable to be substituted during the reduction process. The inspiration for the ....
A. Asperti, C. Laneve. Paths, computations and labels in the lambda calculus. Theoretical Computer Science 142(2):277-297, 1995.
On Global Dynamics of Optimal Graph Reduction - Lawall, Mairson (1997) (3 citations) (Correct)
....A labelled term thus codes the reduction history that led to its derivation; labels can also be interpreted in terms of context semantics [GAL92] as coding information flow in the graph representation between functions and arguments. This insight is developed in considerable detail by Asperti [Asp95]. The label on the abstraction in a fi redex is called the family index of the redex, because the same label may appear on the function position of a family of distinct redexes that should be reduced as one. When (x:E)F is reduced, the label on each free x in E is (reverse) concatenated with the ....
Andrea Asperti. Paths, computations, and labels in the -calculus. Theoretical Computer Science 142:2 (May, 1995), pp. 277--297.
Safe Operators: Brackets Closed Forever - Optimizing.. - Asperti, Chroboczek Self-citation (Asperti) (Correct)
....an introduction to optimal reductions, we exhibit the aforementioned problem and prove the correctness of the new rules. 1 Introduction Almost twenty years ago, L evy [Le78] proposed a complex notion of redex family to formalize the intuitive idea of optimal sharing in the calculus (see also [Le80, AL93b]) The redexes of a term obtained during the reduction would be linked into families, and all members of a single family reduced in parallel, or, equivalently, represented by a single piece of structure. Arguably, the length of his family reduction would provide a lower bound to the intrinsic ....
....is out of question. By pointing out the relations between optimal reductions, Linear Logic [Gi86] and the Geometry of Interaction [Gi88a, Gi88b] it provided an essential breakthrough in the topic, suggesting new and absolutely innovative perspectives. The interested reader might want to consult [GAL92b, As94, AL93b, ADLR94]) In [As94] we explained that the well known and crucial problem of accumulation of control operators [GAL92a] the exponential explosion of the bookkeeping work required for implementing the oracle) is due to the absence of a few simple rules. However, adding these rules to the rewriting ....
A. Asperti, C. Laneve. Paths, Computations and Labels in the -calculus. Theoretical Computer Science, 142,2, 277--297. 1993.
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) Self-citation (Asperti) (Correct)
No context found.
Andrea Asperti and Cosimo Laneve. Paths, computations, and labels in the -calculus. Theoretical Computer Science 142:2 (May, 1995), pp. 277-297.
Parallel Beta Reduction is Not Elementary Recursive - Asperti, Mairson (1998) (5 citations) Self-citation (Asperti) (Correct)
No context found.
Andrea Asperti and Cosimo Laneve. Paths, computations, and labels in the -calculus. Theoretical Computer Science 142:2 (May, 1995), pp. 277--297.
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