Calculating Compilers for Concurrency

Patrick Bahr, Graham Hutton

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

Abstract

Choice trees have recently been introduced as a general structure for defining the semantics of programming languages with a wide variety of features and effects. In this article we focus on concurrent languages, and show how a codensity version of choice trees allows the semantics for such languages to be systematically transformed into compilers using equational reasoning techniques. The codensity construction is the key ingredient that enables a high-level, algebraic approach. As a case study, we calculate a compiler for a concurrent lambda calculus with channel-based communication.
OriginalsprogEngelsk
TitelProceedings of the ACM on Programming Languages
Antal sider28
Vol/bind7
UdgivelsesstedNew York, NY, USA
Publikationsdato31 aug. 2023
Sider740–767
Artikelnummer213
DOI
StatusUdgivet - 31 aug. 2023

Fingeraftryk

Dyk ned i forskningsemnerne om 'Calculating Compilers for Concurrency'. Sammen danner de et unikt fingeraftryk.

Citationsformater