Zena M. Ariola, Stefan Blom  Home/Search
Context Related
| uoregon.edu/pub/ariola/TACS97.ps cwi.nl/~sccblom/pu...lablomfull.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: uoregon.edu/~ariol...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We precisely characterize a class of cyclic lambda-graphs, and then give a sound and complete axiomatization of the terms that represent a given graph. The equational axiom system is an extension of lambda calculus with the letrec construct. In contrast to current theories, which impose restrictions on where the rewriting can take place, our theory is very liberal, e.g., it allows rewriting under lambda-abstractions and on cycles. As shown previously, the reduction theory is non-confluent. We ... (Update)
Cited by: More
Lambda Calculi and Linear Speedups - Sands, Gustavsson, Moran (Correct)
A Calculus for Link-time Compilation - Machkasova, Turbak (2000) (Correct)
Confluent Equational Reasoning for Linking with First-Class .. - Wells, Vestergaard (1999) (Correct)
Active bibliography (related documents): More All
0.5: λ_S: an Implicitly Parallel λ-Calculus with Letrec, .. - Arvind (1997) (Correct)
0.2: Program Transformation via Contextual Assertions - Mason, Talcott (1994) (Correct)
0.2: Recursion from Cyclic Sharing: Traced Monoidal Categories and.. - Hasegawa (1997) (Correct)
Similar documents based on text: More All
0.5: From Syntactic Theories to Interpreters: Automating the.. - Xiao, Sabry, Ariola (2001) (Correct)
0.4: Minimal Classical Logic and Control Operators - Ariola, Herbelin (2003) (Correct)
0.2: Cyclic Lambda Graph Rewriting - Ariola, Klop (1994) (Correct)
Related documents from co-citation: More All
19: A call-by-need lambda calculus - Ariola, Felleisen et al. - 1995
10: Lambda calculus with explicit recursion - Ariola, Klop - 1996
8: The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
BibTeX entry: (Update)
Ariola, Z. M., and Blom, S. Cyclic lambda calculi. In the International Symposium on Theoretical Aspects of Computer Software, Sendai, Japan (September 1997). http://citeseer.ist.psu.edu/ariola97cyclic.html More
@inproceedings{ ariola97cyclic,
author = "Zena M. Ariola and Stefan Blom",
title = "Cyclic Lambda Calculi",
booktitle = "Theoretical Aspects of Computer Software",
pages = "77-106",
year = "1997",
url = "citeseer.ist.psu.edu/ariola97cyclic.html" }
Citations (may not include all citations):729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
359 The implementation of Functional Programming Languages (context) - Jones - 1987
257 Report on the programming language Haskell (context) - Hudak, Jones et al. - 1992
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1980
191 A meta-environment for generating programming environments (context) - Klint - 1991
169 The call-by-need lambda calculus - Ariola, Felleisen - 1997
169 The call-byneed lambda calculus - Ariola, Felleisen et al. - 1995
137 Journal of Functional Programming (context) - Abadi, Cardelli et al. - 1991
128 Efficient Parsing for Natural Languages (context) - Tomita - 1985
114 A natural semantics for lazy evaluation - Launchbury - 1993
109 Interaction nets (context) - Lafont - 1990
87 call-by-value and the lambda calculus (context) - Plotkin - 1975
63 Laboratory for the Foundation of Computer Science (context) - Harper, Standard et al. - 1986
61 weak bisimulation up to (context) - Sangiorgi, Milner - 1993
47 The structure of shared forests in ambiguous parsing - Billot, Lang - 1989
46 MIT Laboratory for Computer Science (context) - Nikhil, version et al. - 1991
41 Interaction systems I: The theory of optimal reductions - Asperti, Laneve - 1994
41 R'eductions Correctes et Optimales dans le Lambda-Calcul (context) - L'evy - 1978
29 Recursion from cyclic sharing: traced monoidal categories an.. - Hasegawa - 1997
22 Explicit cyclic substitutions - Rose - 1992
22 Functional computation as concurrent computation - Niehren - 1996
22 Cyclic lambda graph rewriting - Ariola, Klop - 1994
21 Lambda calculus with explicit recursion - Ariola, Klop
19 Modeling sharing and recursion for weak reduction strategies.. - Benaissa, Lescanne et al. - 1996
18 and the linear lambda calculus (context) - Maraist, Odersky et al. - 1995
18 Using filters for the disambiguation of context-free grammar.. - Klint, Visser - 1994
15 The geometry of implementation (context) - Mackie - 1994
14 MIT Laboratory for Computer Science (context) - Arvind, Augusston et al. - 1993
14 Infinitary lambda calculus - Kennaway, Klop et al. - 1995
11 Syntactic definitions of undefined: On defining the undefine.. - Ariola, Klop et al. - 1994
7 Relating graph and term rewriting via Bohm models - Ariola - 1996
6 Order-incompleteness and finite lambda models (context) - Selinger - 1996
4 Technical Report ECSLFCS (context) - Moggi, calculus - 1988
2 an implicitly parallel - calculus with letrec (context) - Arvind, Nikhil et al. - 1997
1 Extended version: CWI Report CS-R (context) - Ariola, Klop et al. - 1996
1 PhD thesis (context) - Wadsworth, Pragmatics et al. - 1971
1 Department of computer and information science (context) - Ariola, Blom et al.
1 An algebraic interpretation of the fi-calculus and an applic.. (context) - L'evy - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.uoregon.edu/~ariola/publications.html): More
Order-of-evaluation Analysis for Destructive Updates in.. - Sastry, CLinger, Ariola (1993) (Correct)
Properties of a First-order Functional Language with Sharing - Ariola, Arvind (1994) (Correct)
Graph Rewriting Systems For Efficient Compilation - Ariola, Arvind (1993) (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