Relating Message Passing and Shared Memory, Proof-Theoretically - Coordination Models and Languages Access content directly
Conference Papers Year : 2023

Relating Message Passing and Shared Memory, Proof-Theoretically

Frank Pfenning
  • Function : Author
  • PersonId : 1408360
Klaas Pruiksma
  • Function : Author
  • PersonId : 1408361

Abstract

We exhibit a strong bisimulation between asynchronous message passing concurrency with session types and shared memory concurrency with futures. A key observation is that both arise from closely related interpretations of the semi-axiomatic sequent calculus with recursive definitions, which provides a unifying framework. As a further result we show that the bisimulation applies to both linear and nonlinear versions of the two languages.
Embargoed file
Embargoed file
1 4 7
Year Month Jours
Avant la publication
Thursday, January 1, 2026
Embargoed file
Thursday, January 1, 2026
Please log in to request access to the document

Dates and versions

hal-04673814 , version 1 (20-08-2024)

Licence

Identifiers

Cite

Frank Pfenning, Klaas Pruiksma. Relating Message Passing and Shared Memory, Proof-Theoretically. 25th International Conference on Coordination Languages and Models (COORDINATION), Jun 2023, Lisbon, Portugal. pp.3-27, ⟨10.1007/978-3-031-35361-1_1⟩. ⟨hal-04673814⟩
0 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More