Flexible recovery of uniqueness and immutability
journal contribution
posted on 2020-11-01, 22:39 authored by P Giannini, Marco ServettoMarco Servetto, E Zucca, J Cone© 2018 Elsevier B.V. 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.
History
Preferred citation
Giannini, P., Servetto, M., Zucca, E. & Cone, J. (2019). Flexible recovery of uniqueness and immutability. Theoretical Computer Science, 764, 145-172. https://doi.org/10.1016/j.tcs.2018.09.001Publisher DOI
Journal title
Theoretical Computer ScienceVolume
764Publication date
2019-04-11Pagination
145-172Publisher
Elsevier BVPublication status
PublishedISSN
0304-3975eISSN
1879-2294Language
enUsage metrics
Categories
No categories selectedKeywords
Licence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC