The Design and Formalization of Mezzo, a Permission-Based Programming Language
Authors:
Open Access
- 2 August 2016
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 38 (4) , 1-94
Abstract
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.Keywords
This publication has 73 references indexed in Scilit:
- Semantics of fractional permissions with nestingACM Transactions on Programming Languages and Systems, 2010
- Structuring the verification of heap-manipulating programsACM SIGPLAN Notices, 2010
- The ins and outs of Clean I/OJournal of Functional Programming, 2008
- Language support for fast and reliable message-based communication in singularity OSACM SIGOPS Operating Systems Review, 2006
- JavariACM SIGPLAN Notices, 2005
- Universes: Lightweight Ownership for JML.The Journal of Object Technology, 2005
- Ownership types for safe programmingACM SIGPLAN Notices, 2002
- Typed memory management via static capabilitiesACM Transactions on Programming Languages and Systems, 2000
- Simple imperative polymorphismHigher-Order and Symbolic Computation, 1995
- A theory of type polymorphism in programmingJournal of Computer and System Sciences, 1978