 |
PREUVES, PROGRAMMES et SYSTÈMES |  |
|
PREUVES, PROGRAMMES et SYSTÈMES | |
| HAL : hal-00569095, version 2 |
| arXiv : 1102.4971 |
| Fiche détaillée |  Récupérer au format |
 |
| Versions disponibles : | v1 (24-02-2011) | v2 (10-06-2011) |
|
|
|
|
| An Elementary affine λ-calculus with multithreading and side effects (extended version) |
|
|
Antoine Madet 1Roberto M. Amadio 1 |
|
|
| (23/02/2011) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Preuves, Programmes et Systèmes (PPS) |
|
|
|
CNRS : UMR7126 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Langage de programmation |
|
|
| Linear Logic – Implicit Complexity – Functional Language – Multithreading – Side Effects |
|
|
|
| Liste des fichiers attachés à ce document : | ||||||||||
|
||||||||||
|
|
|
| hal-00569095, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00569095 | |
| oai:hal.archives-ouvertes.fr:hal-00569095 | |
| Contributeur : Antoine Madet | |
| Soumis le : Vendredi 10 Juin 2011, 13:14:02 | |
| Dernière modification le : Mercredi 26 Septembre 2012, 09:57:00 | |
