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.
Type de document :
Rapport
2011


https://hal.archives-ouvertes.fr/hal-00569095
Contributeur : Antoine Madet <>
Soumis le : vendredi 10 juin 2011 - 13:14:02
Dernière modification le : mardi 11 octobre 2016 - 14:09:15
Document(s) archivé(s) le : dimanche 11 septembre 2011 - 02:23:21

Fichiers

rapport.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Collections

PPS | LARA | USPC

Citation

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

Exporter

Partager

Métriques

Consultations de
la notice

322

Téléchargements du document

82