Type Structure for Low-Level Programming Languages (1999)
| Venue: | In Twenty-Sixth International Colloquium on Automata, Languages, and Programming |
| Citations: | 16 - 2 self |
BibTeX
@INPROCEEDINGS{Crary99typestructure,
author = {Karl Crary and Greg Morrisett},
title = {Type Structure for Low-Level Programming Languages},
booktitle = {In Twenty-Sixth International Colloquium on Automata, Languages, and Programming},
year = {1999},
pages = {40--54},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Providing type structure for extremely low-level programming languages, such as assembly language, yields a number of important benefits for compiler and systems projects, where reliability and security are crucial concerns. We discuss some of the issues involved in designing type systems for low-level languages, and identify some general principles that simplify constructing a proof of soundness. 1 Introduction Over the past twenty years, there has been tremendous progress in the design and foundations of type systems for high-level programming languages culminating in the design of such languages as Modula-3, Standard ML, Haskell, and Java. The goal of much of the research was to strengthen the logic of a type system so that a richer class of abstractions and invariants could be stated and yet enforced automatically. Recently, we (and others) have been exploring the design, applications, and foundations of type systems for extremely low-level languages. In particular, we have conc...
