(Enter summary)
Abstract: We introduce xLIN, a novel linear abstract machine that ensures
computing with linear resources takes no space and constant time by
executing linear substitutions immediately, as specied by the -rule.
In addition, computing with non-linear resources introduces no e-
ciency penalty. Garbage collection is not required for linear objects,
while still present for non-linear objects.
Using a suitable memory model we show that when we use sharing
of common subexpression during execution the... (Update)
Similar documents (at the sentence level):
15.8%: An Efficient Linear Machine With Single-Pointer Property - Francisco Alberti
(Correct)
Active bibliography (related documents): More All
0.2: Completeness of Bisimilarity for Contextual Equivalence in Linear.. - Crole (2001)
(Correct)
0.2: Observations on a Linear PCF - Bierman (1997)
(Correct)
0.2: A computational model of classical linear logic: Is.. - Carlsson, Wadler (1997)
(Correct)
Similar documents based on text: More All
0.0: Tree transducer based program transformations for.. - Höff, Vater, Maletti.. (2001)
(Correct)
0.0: \Pi-Calculus with Type Similarity - Brown, Ritter (1995)
(Correct)
0.0: Explicit Substitutions for Linear Logical Frameworks.. - Cervesato, de Paiva.. (1999)
(Correct)
BibTeX entry: (Update)
@misc{ ritter-efficient,
author = "Eike Ritter",
title = "An Efficient Linear Machine With Update-in-Place for Linear Variables",
url = "citeseer.ist.psu.edu/313080.html" }
Citations (may not include all citations):
242
Linear Logic (context) - Girard - 1987
114
A natural semantics for lazy evaluation
- Launchbury - 1993
77
Dual Intuitionistic Linear Logic (context) - Barber, Plotkin - 1997
60
A term calculus for Intuitionistic Linear Logic
- Benton, Bierman et al. - 1993
53
Quasi-linear types
- Kobayashi - 1999
35
Reference counting as a computational interpretation of line..
- Chirimar, Gunter et al. - 1996
25
Operational Interpretations of Linear Logic
- Turner, Wadler - 1998
25
Once upon a polymorphic type
- Wansbrough, Jones - 1999
21
Con uence Properties for Weak and Strong Calculi of Explicit.. (context) - Curien, Hardin - 1996
15
The Linear Abstract Machine (context) - Lafont - 1989
13
Linear Explicit Substitutions
- Ghani, de Paiva et al.
4
The Girard Translation Extended with Recursion
- Bra - 1994
1
Operational aspects of the linear - calculus (context) - Lincoln, Mitchell - 1992
Documents on the same site (http://www.cs.bham.ac.uk/~exr/papers.html): More
Proof-Terms for Classical and Intuitionistic Resolution - Ritter, Pym, Wallen (1996)
(Correct)
Relating Categorical and Kripke Semantics for.. - Alechina, de Paiva.. (1998)
(Correct)
On the Intuitionistic Force of Classical Search - Ritter, Pym (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