An Elementary affine λ-calculus with multithreading and side effects (extended version)

Abstract : 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 provide a new combinatorial proof of termination in elementary time for the functional case. Second, we develop an extension of the approach to a call-by-value $lambda$-calculus with multithreading and side effects. 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.
Document type :
Reports
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00569095
Contributor : Antoine Madet <>
Submitted on : Friday, June 10, 2011 - 1:14:02 PM
Last modification on : Friday, January 4, 2019 - 5:32:59 PM
Document(s) archivé(s) le : Sunday, September 11, 2011 - 2:23:21 AM

Files

rapport.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00569095, version 2
  • ARXIV : 1102.4971

Collections

Citation

Antoine Madet, Roberto M. Amadio. An Elementary affine λ-calculus with multithreading and side effects (extended version). 2011. ⟨hal-00569095v2⟩

Share

Metrics

Record views

794

Files downloads

115