Abstract
The programming language Mezzo is equipped with a rich type system that controls aliasing and access to mutable memory. We incorporate shared-memory concurrency into Mezzo and present a modular formalization of its core type system, in the form of a concurrent λ-calculus, which we extend with references and locks. We prove that well-typed programs do not go wrong and are data-race free. Our definitions and proofs are machine-checked.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahmed, A., Fluet, M., Morrisett, G.: L 3: A linear language with locations. Fundamenta Informaticæ 77(4), 397–449 (2007)
Balabonski, T., Pottier, F.: A Coq formalization of Mezzo (December 2013), http://gallium.inria.fr/~fpottier/mezzo/mezzo-coq.tar.gz
Buisse, A., Birkedal, L., Støvring, K.: A step-indexed Kripke model of separation logic for storable locks. Electronic Notes in Theoretical Computer Science 276, 121–143 (2011)
Charguéraud, A., Pottier, F.: Functional translation of a calculus of capabilities. In: International Conference on Functional Programming (ICFP), pp. 213–224 (2008)
Chlipala, A.: Certified Programming and Dependent Types. MIT Press (2013)
Delaware, B., Oliveira, B.C.D.S., Schrijvers, T.: Meta-theory à La Carte. In: Principles of Programming Languages (POPL), pp. 207–218 (2013)
Dinsdale-Young, T., Birkedal, L., Gardner, P., Parkinson, M.J., Yang, H.: Views: compositional reasoning for concurrent programs. In: Principles of Programming Languages (POPL), pp. 287–300 (2013)
Gotsman, A., Berdine, J., Cook, B., Rinetzky, N., Sagiv, M.: Local reasoning for storable locks and threads. Tech. Rep. MSR-TR-2007-39, Microsoft Research (2007)
Mosses, P.D.: Modular structural operational semantics. Journal of Logic and Algebraic Programming 60, 195–228 (2004)
O’Hearn, P.W.: Resources, concurrency and local reasoning. Theoretical Computer Science 375(1-3), 271–307 (2007)
Pottier, F.: Syntactic soundness proof of a type-and-capability system with hidden state. Journal of Functional Programming 23(1), 38–144 (2013)
Pottier, F., Protzenko, J.: Programming with permissions in Mezzo. In: International Conference on Functional Programming (ICFP), pp. 173–184 (2013)
Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: Logic in Computer Science (LICS), pp. 55–74 (2002)
Turon, A., Dreyer, D., Birkedal, L.: Unifying refinement and Hoare-style reasoning in a logic for higher-order concurrency. In: International Conference on Functional Programming (ICFP), pp. 377–390 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Balabonski, T., Pottier, F., Protzenko, J. (2014). Type Soundness and Race Freedom for Mezzo. In: Codish, M., Sumii, E. (eds) Functional and Logic Programming. FLOPS 2014. Lecture Notes in Computer Science, vol 8475. Springer, Cham. https://doi.org/10.1007/978-3-319-07151-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-07151-0_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07150-3
Online ISBN: 978-3-319-07151-0
eBook Packages: Computer ScienceComputer Science (R0)