Parallelism and Synchronization in an Infinitary Context

We study multitoken interaction machines in the context of a very expressive linear logical system with exponentials, fix points and synchronization. The advantage of such machines is to provide models in the style of the Geometry of Interaction, i.e., An interactive semantics which is close to low-...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science s. 559 - 572
Hlavní autoři: Dal Lago, Ugo, Faggian, Claudia, Valiron, Benoit, Yoshimizu, Akira
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2015
Témata:
Abstract Machines
Context
Geometry
Geometry of Interaction
Linear Logic
Machinery
Parallel Computation
Parallel processing
Semantics
Synchronization
System recovery
ISSN:1043-6871
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study multitoken interaction machines in the context of a very expressive linear logical system with exponentials, fix points and synchronization. The advantage of such machines is to provide models in the style of the Geometry of Interaction, i.e., An interactive semantics which is close to low-level implementation. On the one hand, we prove that despite the inherent complexity of the framework, interaction is guaranteed to be deadlock-free. On the other hand, the resulting logical system is powerful enough to embed PCF and to adequately model its behaviour, both when call-by-name and when call-by-value evaluation are considered. This is not the case for single-token stateless interactive machines.
ISSN:1043-6871
DOI:10.1109/LICS.2015.58