ACM Transactions on Programming Languages and Systems · 2016 · 23 citations · 73 references
ComputingComputer ScienceFormal MethodsProgramming LanguagesSystems ProgrammingConcurrency VerificationControl-flow AnalysisType CheckingType SystemsAbstract SemanticsAuthorization LanguagesData-race FreedomOwnership TestsOwnership Type Systems
The programming language Mezzo is equipped with a rich type system that controls aliasing and access to mutable memory. We give a comprehensive tutorial overview of the language. Then we present a modular formalization of Mezzo’s core type system, in the form of a concurrent λ-calculus, which we successively extend with references, locks, and adoption and abandon, a novel mechanism that marries Mezzo’s static ownership discipline with dynamic ownership tests. We prove that well-typed programs do not go wrong and are data-race free. Our definitions and proofs are machine checked.
73
A theory of type polymorphism in programming
Robin Milner · Journal of Computer and System Sciences · 1978 · 2.2K citations · Full text
Separation logic: a logic for shared mutable data structures
John Reynolds · 2003 · 2.2K citations
Imperative functional programming
Simon Jones, Philip Wadler · 1993 · 1.2K citations · Full text
A Syntactic Approach to Type Soundness
Andy Wright, Matthias Felleisen · Information and Computation · 1994 · 1.1K citations