Dartmouth College Computer Science
Technical Report series
TR search TR listserv
|By author:||A B C D E F G H I J K L M N O P Q R S T U V W X Y Z|
|By number:||2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010, 2009, 2008, 2007, 2006, 2005, 2004, 2003, 2002, 2001, 2000, 1999, 1998, 1997, 1996, 1995, 1994, 1993, 1992, 1991, 1990, 1989, 1988, 1987, 1986|
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.
Bibliographic citation for this report: [plain text] [BIB] [BibTeX] [Refer]
Or copy and paste:
Chris Hawblitzel, Heng Huang, and Lea Wittie, "Composing a Well-Typed Region." Dartmouth Computer Science Technical Report TR2004-521, October 2004.
Notify me about new tech reports.
Search the technical reports.
To receive paper copy of a report, by mail, send your address and the TR number to reports AT cs.dartmouth.edu
Copyright notice: The documents contained in this server are included by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
Technical reports collection maintained by David Kotz.