A polynomial time λ-calculus with multithreading and side effects

Antoine Madet 1, *
Abstract : The framework of Light Logics has been extensively studied to control the complexity of higher-order functional programs. We propose an extension of this framework to multithreaded programs with side effects, focusing on the case of polynomial time. After introducing a modal λ-calculus with parallel composition and regions, we prove that a realistic call-by-value evaluation strategy can be computed in polynomial time for a class of well-formed programs. The result relies on the simulation of call-by-value by a polynomial shallow-first strategy which preserves the evaluation order of side effects. Then, we provide a polynomial type system that guarantees that well-typed programs do not go wrong. Finally, we illustrate the expressivity of the type system by giving a programming example of concurrent iteration producing side effects over an inductive data structure.
Type de document :
Communication dans un congrès
Andy King. 14th International Symposium on Principles and Practice of Declarative Programming, Sep 2012, Leuven, Belgium. ACM, pp.55-66, 2012, <10.1145/2370776.2370785>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00735544
Contributeur : Antoine Madet <>
Soumis le : mercredi 26 septembre 2012 - 00:10:51
Dernière modification le : mardi 11 octobre 2016 - 13:59:26
Document(s) archivé(s) le : jeudi 27 décembre 2012 - 04:30:10

Fichiers

ppdp19-madet.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

PPS | USPC

Citation

Antoine Madet. A polynomial time λ-calculus with multithreading and side effects. Andy King. 14th International Symposium on Principles and Practice of Declarative Programming, Sep 2012, Leuven, Belgium. ACM, pp.55-66, 2012, <10.1145/2370776.2370785>. <hal-00735544>

Partager

Métriques

Consultations de
la notice

124

Téléchargements du document

104