Parallelism and synchronization in an infinitary context
From MaRDI portal
Abstract: We study multitoken interaction machines in the context of a very expressive logical system with exponentials, fixpoints 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.
Recommendations
Cited in
(6)- Semantics of higher-order quantum computation via geometry of interaction
- Geometry of resource interaction and Taylor-Ehrhard-Regnier expansion: \textit{a minimalist approach}
- A Fresh Look at the λ-Calculus
- Abstract machines, optimal reduction, and streams
- The geometry of concurrent interaction: handling multiple ports by way of multiple tokens
- (Definitely not) boring interaction abstract machines
This page was built for publication: Parallelism and synchronization in an infinitary context
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635836)