Propositions-as-types and shared state

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)
4 Downloads (Pure)

Abstract

We develop a principled integration of shared mutable state into a proposition-as-types linear logic interpretation of a session-based concurrent programming language. While the foundation of type systems for the functional core of programming languages often builds on the proposition-as-types correspondence, automatically ensuring strong safety and liveness properties, imperative features have mostly been handled by extra-logical constructions. Our system crucially builds on the integration of nondeterminism and sharing, inspired by logical rules of differential linear logic, and ensures session fidelity, progress, confluence and normalisation, while being able to handle first-class shareable reference cells storing any persistent object. We also show how preservation and, perhaps surprisingly, progress, resiliently survive in a natural extension of our language with first-class locks. We illustrate the expressiveness of our language with examples highlighting detailed features, up to simple shareable concurrent ADTs.

Original languageEnglish
Article number3473584
JournalProceedings of the ACM on Programming Languages
Volume5
Issue numberICFP
DOIs
Publication statusPublished - Aug 2021

Keywords

  • Propositions-as-Types
  • Session Types
  • Shared State

Fingerprint

Dive into the research topics of 'Propositions-as-types and shared state'. Together they form a unique fingerprint.

Cite this