BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR2004-521
ENTRY:: October 21, 2004
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Composing a Well-Typed Region
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Hawblitzel, Chris
AUTHOR:: Huang, Heng
AUTHOR:: Wittie, Lea
DATE:: October 2004
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR2004-521.pdf
ABSTRACT:: Efficient low-level systems need more control over memory than
safe high-level languages usually provide. In particular, safe languages
usually prohibit explicit deallocation, in order to prevent dangling pointers.
Regions provide one safe deallocation mechanism; indeed, many region calculi
have appeared recently, each with its own set of operations and often complex
rules. This paper encodes regions from lower-level typed primitives (linear
memory, coercions, and delayed types), so that programmers can design their own
region operations and rules.
END:: ncstrl.dartmouthcs//TR2004-521