¶Lafont1988
Y. Lafont. “The linear abstract machine”. Theoretical Computer Science, Volume 59, Issues 1–2, 1988, Pages 157-180, ISSN 0304-3975.
(https://www.sciencedirect.com/science/article/pii/0304397588901004)
¶Abstract
Linear Logic provides a refinement of functional programming and suggests a new implementation technique, with the following features:
- a synthesis of strict and lazy evaluation,
- a clean semantics of side effects,
- no garbage collector.
¶BiBTeX
@article{LAFONT1988157,
title = {The linear abstract machine},
journal = {Theoretical Computer Science},
volume = {59},
number = {1},
pages = {157-180},
year = {1988},
issn = {0304-3975},
doi = {https://doi.org/10.1016/0304-3975(88)90100-4},
url = {https://www.sciencedirect.com/science/article/pii/0304397588901004},
author = {Y. Lafont}
}