Skip to main navigation Skip to search Skip to main content

Flexible recovery of uniqueness and immutability

Research output: Contribution to journal › Article › peer-review

Abstract

We present an imperative object calculus where types are annotated with qualifiers for aliasing and mutation control. There are two key novelties with respect to similar proposals. First, the type system is very expressive. Notably, it adopts the recovery approach, that is, using the type context to justify strengthening types, greatly improving its power by permitting to recover uniqueness and immutability properties even in presence of other references. This is achieved by rules which restrict the use of such other references in the portion of code which is recovered. Second, execution is modeled by a non standard operational model, where properties of qualifiers can be directly expressed on source terms, rather than as invariants on an auxiliary structure which mimics physical memory. Formally, this is achieved by the block construct, introducing local variable declarations, which, when evaluated, play the role of store.

Original languageEnglish
Pages (from-to)145-172
Number of pages28
JournalTheoretical Computer Science
Volume764
DOIs
Publication statusPublished - 11 Apr 2019

Keywords

  • Aliasing
  • Immutability
  • Imperative calculi
  • Type systems

Fingerprint

Dive into the research topics of 'Flexible recovery of uniqueness and immutability'. Together they form a unique fingerprint.

Cite this