A Linearly Typed Assembly Language (0)
Cached
Download Links
- [www.cs.cornell.edu]
- [www.cs.princeton.edu]
- [www.cs.princeton.edu:80]
- [www.cs.cornell.edu]
- [www.cs.cmu.edu]
- [www.cs.cmu.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.eecs.harvard.edu]
- [www.cs.cornell.edu]
- [reports-archive.adm.cs.cmu.edu]
- [reports-archive.adm.cs.cmu.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.cs.cornell.edu]
- [www.eecs.harvard.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Workshop on Types in Compilation |
| Citations: | 136 - 35 self |
BibTeX
@INPROCEEDINGS{Cheney_alinearly,
author = {James Cheney and Greg Morrisett},
title = {A Linearly Typed Assembly Language},
booktitle = {In Workshop on Types in Compilation},
year = {},
pages = {28--52},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Today's type-safe low-level languages rely on garbage collection to recycle heap-allocated objects safely. We present LTAL, a safe, low-level, yet simple language that "stands on its own": it guarantees safe execution within a fixed memory space, without relying on external run-time support. We demonstrate the expressiveness of LTAL by giving a type-preserving compiler for the functional core of ML. But this independence comes at a steep price: LTAL's type system imposes a draconian discipline of linearity that ensures that memory can be reused safely, but prohibits any useful kind of sharing. We present the results of experiments with a prototype LTAL system that show just how high the price of linearity can be.
