Zena M. Ariola, Arvind  Home/Search
Context
Related
| mit.edu/publicatio...LCSTM3471.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: mit.edu/publications/pubs/ps/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we discuss the syntactic and semantic properties of a calculus, which is adequate for capturing the sharing of subexpressions in first-order functional languages. The results of this paper are also relevant to compiling higher-order functional languages, because compilers of such languages often employ a technique known as "lambda-lifting" [13]. The program that results after lambda-lifting is in a "supercombinatory" form, and is treated as a first-order program [12] (Update)
Similar documents (at the sentence level):
7.2%: Graph Rewriting Systems For Efficient Compilation - Ariola, Arvind (1993) (Correct)
Active bibliography (related documents): More All
1.1: Properties of a First-order Functional Language with Sharing - Ariola, Arvind (1994) (Correct)
0.4: Relating Graph and Term Rewriting via Böhm Models - Ariola (1993) (Correct)
0.3: Cyclic Lambda Graph Rewriting - Ariola, Klop (1994) (Correct)
Similar documents based on text: More All
0.6: A Distributed Monitoring System for large, heterogeneous WLANs - Grob (Correct)
0.3: Using Grammatical Relations to Compare Parsers - Judita Preiss Computer (2003) (Correct)
0.3: Computation Structures Group Progress Report 1991-92 - Computation Structures (Correct)
BibTeX entry: (Update)
@misc{ ariola-properties,
author = "Zena M. Ariola and Arvind",
title = "Properties of a First-order Functional Lanuage with Sharing Computation
Structures",
url = "citeseer.ist.psu.edu/ariola94properties.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
299 Algebraic Theory of Processes (context) - Hennessy - 1988
102 Term Graph Rewriting (context) - Barendregt, van Eekelen et al. - 1987
84 Lambda Lifting: Transforming Programs to Recursive Equations - Johnsson - 1985
72 Semantics And Pragmatics Of The Lambda-Calculus (context) - Wadsworth - 1971
71 Transfinite Reductions in Orthogonal Term Rewriting Systems - Kennaway, Klop et al. - 1991
70 An algorithm for optimal lambda calculus reduction (context) - Lamping - 1990
49 Equational Term Graph Rewriting - Ariola, Klop - 1993
44 Clean - A language for Functional Graph Rewriting (context) - Brus, van Eekelen et al. - 1987
26 A Syntactic Approach to Program Transformations - Ariola - 1991
21 TAC: A Parallel Intermediate Language (context) - Ariola, P- - 1989
20 Implementing Term Rewrite Languages in Dactl (context) - Kennaway - 1990
17 Towards an Intermediate Language based on Graph Rewriting (context) - Barendregt, Brus et al. - 1987
14 Laboratory for Computer Science (context) - Nikhil, Version et al. - 1990
9 Super-combinators (context) - Hughes - 1982
9 R'eductions Correctes et Optimales dans le Lambda-Calcul (context) - L'evy - 1978
7 Continuous Semantics and Inside-out Reductions (context) - Welch - 1975
7 Relating Graph and Term Rewriting via Bohm Models - Ariola - 1993
6 Optimal Interpreters for Lambda-calculus Based Funtional Lan.. (context) - Kathail - 1990
5 Compilation of Id - Ariola - 1991
1 Computations in orthogonal rewriting systems 1 and (context) - Huet, L'evy - 1991
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/ps/): More
Maps: A Compiler-Managed Memory System for Raw Machines - Barua, Lee, Amarasinghe.. (1998) (Correct)
A Technique for Constructing Highly-Available Services - Ladin, Liskov, Shrira (1987) (Correct)
Design and Verification of Speculative Processors - Shen, Arvind (1998) (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