Henry G. Baker  Home/Search
Context Related
| netcom.com/pub/hb/hba...LinearLisp.ps.Z rice.edu/~rahul/hbake...LinearLisp.ps.Z 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: stanford.edu/~iliano/linear...llb (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Linear logic has been proposed as one solution to the problem of garbage collection and providing efficient "updatein -place" capabilities within a more functional language. Linear logic conserves accessibility, and hence provides a mechanical metaphor which is more appropriate for a distributed-memory parallel processor in which copying is explicit. However, linear logic's lack of sharing may introduce significant inefficiencies of its own. We show an efficient implementation of linear logic... (Update)
Cited by: More
Safe and Leakproof Resource Management using Ada83 Limited Types - Baker (1993) (Correct)
Sparse Polynomials and Linear Logic - Baker (1993) (Correct)
Minimizing Reference Count Updating with Deferred and Anchored.. - Baker (1994) (Correct)
Active bibliography (related documents): More All
1.9: the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
0.7: Shallow Binding Makes Functional Arrays Fast - Baker (1991) (Correct)
0.7: Cache-Conscious Copying Collectors - Baker (1991) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: The Nimble Type Inferencer for Common Lisp-84 - Baker (1990) (Correct)
0.1: A "Linear Logic" Quicksort - Baker (1994) (Correct)
0.1: Computing A*B (mod N) Efficiently in ANSI C - Baker (1992) (Correct)
Related documents from co-citation: More All
3: Proving memory management invariants for a language based on linear logic - Chirimar, Gunter et al. - 1992
3: Mechanism for Compile-Time Enforcement of Security (context) - Strom - 1983
3: Computational interpretations of linear logic - Abramsky - 1993
BibTeX entry: (Update)
Baker, H.G. "Lively Linear Lisp --- 'Look Ma, No Garbage!'". ACM Sigplan Notices 27,8 (Aug. 1992), 89-98. http://citeseer.ist.psu.edu/baker92lively.html More
@article{ baker92lively,
author = "Henry G. Baker",
title = "Lively Linear {Lisp} --- `{Look} {Ma}, No Garbage!'",
journal = "ACM SIGPLAN Notices",
volume = "27",
number = "9",
publisher = "ACM Press",
pages = "89--98",
year = "1992",
url = "citeseer.ist.psu.edu/baker92lively.html" }
Citations (may not include all citations):359 The Implementation of Functional Programming Languages (context) - Peyton-Jones - 1987
242 Linear Logic (context) - Girard - 1987
197 Revised Report on the Algorithmic Language Scheme - Rees, Clinger - 1986
173 A Real-Time Garbage Collector Based on the Lifetimes of Obje.. - Lieberman, Hewitt - 1983
152 Structures: Data Structures for Parallel Computing - Nikhil, Pingali et al. - 1989
143 A New Implementation Technique for Applicative Languages (context) - Turner - 1979
125 Wait-Free Synchronization - Maurice - 1991
109 Interaction Nets (context) - Yves - 1990
101 Garbage Collection in a Large Lisp System (context) - Moon - 1984
84 Lambda lifting: transforming programs to recursive equations - Johnsson - 1985
69 Executing a program on the MIT tagged-token dataflow archite.. (context) - Nikhil - 1987
68 Performance and Evaluation of Lisp Systems (context) - Gabriel - 1985
66 Efficient compilation of lazy evaluation - Johnsson - 1984
64 A method for overlapping and erasure of lists (context) - Collins - 1960
53 Compile-time garbage collection by sharing analysis (context) - Jones, Le Metayer - 1989
52 The Chemical Abstract Machine (context) - Berry, Boudol - 1990
41 Lifetime analysis of dynamically allocated objects (context) - Cristina, Thomas - 1967
38 Deciding ML Typability is Complete for Deterministic Exponen.. (context) - Mairson - 1990
32 Unify and Conquer (context) - Baker - 1990
31 The Incremental Garbage Collection of Processes - Baker, Hewitt - 1977
28 Analysis of functional programs to detect run-time garbage c.. (context) - Inoue - 1988
27 Update Analysis and the Efficient Implementation of Function.. (context) - Bloss - 1989
26 An Architecture for Mostly Functional Languages (context) - Tom - 1986
26 Copying and Swapping: Influences on the Design of Reusable S.. (context) - Harms, Weide - 1991
24 Symmetric List Processor (context) - Weizenbaum - 1963
23 ACM Sigplan Notices (context) - Notices - 1992
23 ACM Sigplan Notices (context) - Notices - 1992
20 Linearity and Laziness - Wakeling, Runciman - 1991
18 Demonic memory for process histories (context) - Wilson, Moher - 1989
18 Efficient Applicative Data Types (context) - Eugene - 1984
16 M-Structures: Extending a Parallel, Non-strict, Functional L.. - Paul - 1991
16 Connection Graphs (context) - Alan - 1986
16 On Programming of Arithmetic Operations (context) - Ershov - 1958
15 Monocopy and Associative Algorithms in an Extended Lisp (context) - Eiichi - 1974
15 The Linear Abstract Machine (context) - Yves - 1988
15 Shifting garbage collection overhead to compile time (context) - Barth - 1977
12 The one-bit reference count (context) - Wise, Friedman - 1977
12 The Semantics of Destructive Lisp (context) - Ian - 1986
11 A proof of the Schorr-Waite algorithm (context) - Morris - 1982
11 Values and Objects in Programming Languages (context) - MacLennan - 1982
10 Some Issues and Strategies in Heap Management and Memory Hie.. (context) - Paul - 1991
10 Shallow Binding Makes Functional Arrays Fast - Baker - 1991
10 A Logical View of Composition and Refinement - Abadi, Plotkin - 1991
8 A recoverable object store - Strom - 1988
6 Compile Time Garbage Collection (context) - Lucy - 1988
6 Analysis of Pointer 'Rotation (context) - Suzuki - 1982
6 Garbage Collection and Other Optimizations - David - 1987
6 Hashing Lemmas on Time Complexities with Applications to For.. (context) - Eiichi, Yasumasa - 1976
6 Linear types can change the world - Philip - 1990
5 Is there a use for linear logic - Philip - 1991
5 Genetic Order and Compactifying Garbage Collectors (context) - Terashima, Goto - 1978
4 The Boyer Benchmark at Warp Speed - Baker - 1992
3 Shallow Binding in Lisp 1.5 (context) - Baker - 1978
3 A RISC Architecture for Symbolic Computation (context) - Richard - 1987
3 Two comprehensive virtual copy mechanisms (context) - Paul - 1988
3 Equal Rights for Functional Objects (context) - Baker - 1993
3 Programming without pointer variables (context) - Richard - 1976
2 ACM Lisp Pointers (context) - Gabriel, The - 1988
1 Parallel Hashing Algorithms (context) - Goto - 1977
1 Design of a Lisp Machine --- FLATS (context) - Goto - 1982
1 The G-machine: a fast, graph-reduction evaluator (context) - Richard - 1985
1 Address/Memory Management for a Gigantic LISP Environment, o.. (context) - Jon - 1980
1 Endpaper: FRPOLY: A Benchmark Revisited (context) - Richard - 1991
1 Parallel Evaluation of Functional Programs: The <v,G>-machin.. (context) - Johnsson - 1991
1 MIT AI Lab (context) - Beeler, Gosper et al. - 1972
1 The Paradigm of Interaction (Short Version - Yves - 1991
Documents on the same site (http://theory.stanford.edu/~iliano/linearbib/llb.html): More
First Order Linear Logic without Modalities is NEXPTIME-Hard - Lincoln, Scedrov (1994) (Correct)
The Undecidability Of Second Order Linear Logic Without.. - Lafont (1995) (Correct)
The Finite Model Property For Various Fragments Of Linear Logic - Lafont (1997) (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