Luc Maranget  Home/Search
Context Related
| inria.fr/INRIA/Projects...optimal.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: pauillac.inria.fr/publioscope (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce the new framework of Labeled Terms Rewriting Systems (T l RS), a general framework to express sharing in Term Rewriting Systems (TRS). For Orthogonal T l RS, an important subclass of T l RS, we characterize optimal derivations. This result is applied to weak -calculi, showing the optimality of the lazy strategy, that is, the call-by-name with sharing strategy. The result is also valid in the presence of ffi -rules, as in PCF. Orthogonal T l RS is also useful as a calculus... (Update)
Context of citations to this paper: More
...in a term can be expressed through identical labels. Such labelled terms correspond to acyclic term graphs and have been studied in [76, 74, 82]. In [36, 4, 2, 67] systems of recursion equations realize finite and infinite terms with sharing. As to the complexity of...
...tracking [4, 5, 10] Origin tracking is based on so called residuals . Residuals have been used successfully in more theoretical work [15, 21, 23], for reasoning about optimal reduction strategies in TRSs. Figure 1: Example of a generated environment using origin tracking. 1.1...
Cited by: More
Context-Sensitive Rewriting Strategies - Lucas (2000) (Correct)
Sharing of Computations - Amtoft (1993) (Correct)
lambda f-calculus - a Functional Calculus with Shared.. - Yoshida, Honda, Tokoro (Correct)
Active bibliography (related documents): More All
0.1: An Abstract Standardisation Theorem - Gonthier, Lévy.. (1992) (Correct)
0.1: Implementing lazy functional languages on stock hardware: the.. - Jones (1992) (Correct)
0.1: GAML: a Parallel Implementation of Lazy ML - Maranget (1991) (Correct)
Similar documents based on text: More All
0.1: Coherence in Category Theory and the - Church-Rosser Property Barry (Correct)
0.1: Reducibility Method for Simple Types and Church-Rosser Property - Ghilezan, Kuncak (2000) (Correct)
0.1: Two Techniques for Compiling Lazy Pattern Matching - Maranget (1994) (Correct)
Related documents from co-citation: More All
13: Term rewriting systems - Klop - 1992
10: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
10: Term Graph Rewriting (context) - Barendregt, Eekelen et al.
BibTeX entry: (Update)
L. Maranget. Optimal derivations in weak lambda-calculi and in orthogonal term rewriting systems. In Proceedings of the Eighteenth conference on Principles of Programming Languages POPL '91, pages 225--269, 1991. http://citeseer.ist.psu.edu/maranget91optimal.html More
@inproceedings{ maranget91optimal,
author = "Luc Maranget",
title = "Optimal Derivations in Weak Lambda-calculi and in Orthogonal Terms Rewriting Systems",
booktitle = "Conference Record of the Eighteenth Annual {ACM} Symposium on Principles of Programming Languages",
address = "Orlando, Florida",
pages = "255--269",
year = "1991",
url = "citeseer.ist.psu.edu/maranget91optimal.html" }
Citations (may not include all citations):359 The Implementation of Functional Programming Languages (context) - Jones - 1987
306 LCF Considered as a Programming Language (context) - Plotkin - 1977 DBLP
137 Introduction to Combinators and -calculus (context) - Hindley, Seldin - 1986
106 The Categorical Abstract Machine (context) - Cousineau, Curien et al. - 1985 ACM DBLP
92 Explicit substitutions - Abadi, Cardelli et al. ACM DBLP
88 Computing in Systems Described by Equations (context) - O'Donnell - 1977 ACM
81 The Zinc experiment : an economical implementation of the ML.. - Leroy - 1989
70 An Algorithm for Optimal Lambda Calculus Reduction (context) - Lamping ACM DBLP
69 Compiling Lazy Functional Languages (context) - Johnsson - 1987
42 On Laziness and Optimality in Lambda Interpreters : Tools fo.. (context) - Field
36 Call by Need Computations in Non-Ambiguous Linear Term Rewri.. (context) - Huet, L'evy - 1979
28 A confluent Calculus of Substitution (context) - Hardin, L'evy - 1989
23 Minimal and Optimal Computations of Recursive Programs (context) - Berry, L'evy - 1979 ACM DBLP
20 Optimal Interpreters for Lambdacalculus Based Functional Lan.. (context) - Kathail - 1990
8 R'eductions correctes et optimales dans le -calcul (context) - L'evy - 1978
7 Operational and Axiomatic Semantics of PCF - Howard, Mitchell ACM DBLP
7 Compiling Lazy Functional Languages Part II (context) - Augustsson - 1987
1 An Outline of Some Results of Staples on Optimal Reduction O.. (context) - Kennaway - 1984
1 Syntaxe, S'emantique et axiomatique d'un language de program.. (context) - Vuillemin - 1974
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://pauillac.inria.fr/publioscope.html): More
Functional Back-Ends within the Lambda-Sigma Calculus - Hardin, Maranget, Pagano (1996) (Correct)
Compiling Join-Patterns - Maranget, Le Fessant (1998) (Correct)
A Web navigator with applets in Caml - Rouaix (1996) (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