An Elementary affine λ-calculus with multithreading and side effects (extended version)
| Autor: | Madet, Antoine, Amadio, Roberto M. |
|---|---|
| Přispěvatelé: | Preuves, Programmes et Systèmes (PPS), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), ANR-08-BLAN-0211,COMPLICE,Complexité Implicite, Concurrence et Extraction(2008), European Project: 243881,EC:FP7:ICT,FP7-ICT-2009-C,CERCO(2010), Implicit Computational Complexity, Concurrency and Extraction, COMPLICE, ANR-08-BLANC-0211-01,Implicit Computational Complexity, Concurrency and Extraction, COMPLICE, ANR-08-BLANC-0211-01 |
| Jazyk: | angličtina |
| Rok vydání: | 2011 |
| Předmět: | |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|