Oxide: The essence of rust
Rust claims to advance industrial programming by bridging the gap between low-level
systems programming and high-level application programming. At the heart of the argument …
systems programming and high-level application programming. At the heart of the argument …
[PDF][PDF] Is there a use for linear logic?
P Wadler - ACM SIGPLAN Notices, 1991 - dl.acm.org
Past attempts to apply Girard's linear logic have either had a clear relation to the theory
(Lafont, Holmstr6m, Abramsky) or a clear practical value (Guzmiin and Hudak, Wadler), but …
(Lafont, Holmstr6m, Abramsky) or a clear practical value (Guzmiin and Hudak, Wadler), but …
[PDF][PDF] Names and higher-order functions
IDB Stark - 1994 - Citeseer
Many functional programming languages rely on the elimination of 'impure'features:
assignment to variables, exceptions and even input/output. But some of these are genuinely …
assignment to variables, exceptions and even input/output. But some of these are genuinely …
Lively linear Lisp: “look ma, no garbage!”
HG Baker - ACM Sigplan notices, 1992 - dl.acm.org
Linear logic has been proposed as one solution to the problem of garbage collection and
providing efficient" update-in-place" capabilities within a more functional language. Linear …
providing efficient" update-in-place" capabilities within a more functional language. Linear …
“Use-once” variables and linear objects: storage management, reflection and multi-threading
HG Baker - ACM Sigplan Notices, 1995 - dl.acm.org
Programming languages should have'use-once'variables in addition to the usual'multiple-
use'variables.'Use-once'variables are bound to linear (unshared, unaliased, or singly …
use'variables.'Use-once'variables are bound to linear (unshared, unaliased, or singly …
NREVERSAL of fortune—the thermodynamics of garbage collection
HG Baker - International Workshop on Memory Management, 1992 - Springer
The need to reverse a computation arises in many contexts—debugging, editor undoing,
optimistic concurrency undoing, speculative computation undoing, trace scheduling …
optimistic concurrency undoing, speculative computation undoing, trace scheduling …
Operational interpretations of linear logic
DN Turner, P Wadler - Theoretical Computer Science, 1999 - Elsevier
Two different operational interpretations of intuitionistic linear logic have been proposed in
the literature. The simplest interpretation recomputes non-linear values every time they are …
the literature. The simplest interpretation recomputes non-linear values every time they are …
Lilac: A functional programming language based on linear logic
I Mackie - Journal of Functional Programming, 1994 - cambridge.org
We take Abramsky's term assignment for Intuitionistic Linear Logic (the linear term calculus)
as the basis of a functional programming language. This is a language where the …
as the basis of a functional programming language. This is a language where the …
Assignments for applicative languages
We propose a theoretical framework for adding assignments and dynamic data to functional
languages without violating their semantic properties. This differs from semifunctional …
languages without violating their semantic properties. This differs from semifunctional …
[PDF][PDF] Minimizing reference count updating with deferred and anchored pointers for functional data structures
HG Baker - ACM Sigplan Notices, 1994 - dl.acm.org
While the linear style can help organize and reduce reference count updating, it does not
eliminate the updating tha t results from simple traversal. Thus, a linear length function will …
eliminate the updating tha t results from simple traversal. Thus, a linear length function will …