Skip to Main content Skip to Navigation

Concurrency, references and linear logic

Abstract : The topic of this thesis is the study of the encoding of references andconcurrency in Linear Logic. Our perspective is to demonstrate the capabilityof Linear Logic to encode side-effects to make it a viable, formalized and wellstudied compilation target for functional languages in the future. The keynotion we develop is that of routing areas: a family of proof nets whichcorrespond to a fragment of differential linear logic and which implementscommunication primitives. We develop routing areas as a parametrizable deviceand study their theory. We then illustrate their expressivity by translating aconcurrent λ-calculus featuring concurrency, references and replication to afragment of differential nets. To this purpose, we introduce a language akin toAmadio’s concurrent λ-calculus, but with explicit substitutions for bothvariables and references. We endow this language with a type and effect systemand we prove termination of well-typed terms by a mix of reducibility and anew interactive technique. This intermediate language allows us to prove asimulation and an adequacy theorem for the translation
Document type :
Complete list of metadatas

Cited literature [77 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Wednesday, January 22, 2020 - 9:39:07 AM
Last modification on : Friday, August 21, 2020 - 5:32:00 AM
Long-term archiving on: : Thursday, April 23, 2020 - 2:21:27 PM


Version validated by the jury (STAR)


  • HAL Id : tel-02448116, version 1


Yann Hamdaoui. Concurrency, references and linear logic. Logic in Computer Science [cs.LO]. Université Sorbonne Paris Cité, 2018. English. ⟨NNT : 2018USPCC190⟩. ⟨tel-02448116⟩



Record views


Files downloads