Abstract

The concept of a “unique ” object arises in many emerging programming languages such as Clean, CQual, Cyclone, TAL, and Vault. In each of these systems, unique objects make it possible to perform operations that would otherwise be prohibited (e.g., deallocating an object) or to ensure that some obligation will be met (e.g., an opened file will be closed). However, different languages provide different interpretations of “uniqueness ” and have different rules regarding how unique objects interact with the rest of the language. Our goal is to establish a common model that supports each of these languages, by allowing us to encode and study the interactions of the different forms of uniqueness. The model we provide is based on a substructural variant of the polymorphic λ-calculus, augmented with four kinds of mutable references: unrestricted, relevant, affine, and linear. The language has a natural operational semantics that supports deallocation of references, strong (typevarying) updates, and storage of unique objects in shared references. We establish the strong soundness of the type system by constructing a novel, semantic interpretation of the types.

Citations

579	Separation logic: A logic for shared mutable data structures - Reynolds - 2002
347	Enforcing high-level protocols in low-level software - DeLine, Fähndrich
213	Foundational proof-carrying code - APPEL - 2001
156	Alias types - Smith, Walker, et al. - 2000
147	as an assertion language for mutable data structures - BI - 2001
140	Adoption and focus: practical linear types for imperative programming - Fähndrich, DeLine - 2002
136	Stack-based typed assembly language - Morrisett, Crary, et al. - 2002
128	Alias types for recursive data structures - Walker, Morrisett - 2000
120	types can change the world - Linear - 1990
111	An indexed model of recursive types for foundational proofcarrying code - Appel, McAllester
91	linear Lisp – ’Look Ma, no garbage - Baker, Lively - 1992
83	Resource usage analysis - Igarashi, Kobayashi
79	A type system for bounded space and functional in-place update - Hofmann - 2000
77	Once upon a type - Turner, Wadler, et al. - 1995
54	Quasi-linear types - Kobayashi - 1999
52	J.C.: From Algol to polymorphic linear lambda-calculus - O’Hearn, Reynolds - 2000
42	Semantics of types for mutable state - Ahmed - 2004
33	Another Type System for In-Place Update - Aspinall, Hofmann - 2002
33	Once upon a polymorphic type - Wansbrough, Jones - 1999
32	Connecting effects and uniqueness with adoption - Boyland, Retert - 2005
32	On regions and linear types - Walker, Watkins - 2001
29	Guaranteeing safe destructive updates through a type system with uniqueness information for graphs - Smetsers, Barendsen, et al. - 1994
26	Experience with safe manual memory-management in cyclone - Hicks, Morrisett, et al. - 2004
25	Substructural type systems - Walker - 2005
21	L 3 : A linear language with locations - Ahmed, Fluet, et al. - 2007
17	An indexed model of impredicative polymorphism and mutable references - Ahmed, Appel, et al. - 2003
16	Tachio Terauchi. Checking and inferring local nonaliasing - Aiken, Foster, et al.
12	Types for 0, 1 or many uses - Mogensen - 1997
11	A usage analysis with bounded usage polymorphism and subtyping - Gustavsson, Svenningsson - 2000
4	and Adriana Compagnoni. Heap bounded assembly language - Aspinall - 2001