Linear logic provides a framework to control the complexity of higher-order functional programs. We present an extension of this framework to programs with multithreading and side effects focusing on the case of elementary time. Our main contributions are as follows. First, we introduce a modal call-by-value λ-calculus with multithreading and side effects. Second, we provide a combinatorial proof of termination in elementary time for the language. Third, we introduce an elementary affine type system that guarantees the standard subject reduction and progress properties. Finally, we illustrate the programming of iterative functions with side effects in the presented formalism. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Madet, A., & Amadio, R. M. (2011). An elementary affine λ-calculus with multithreading and side effects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6690 LNCS, pp. 138–152). https://doi.org/10.1007/978-3-642-21691-6_13
Mendeley helps you to discover research relevant for your work.