Reversible Session-Based Concurrency in Haskell

Folkert Vries, de, Jorge A. Perez

OnderzoeksoutputAcademicpeer review

2 Citaten (Scopus)
196 Downloads (Pure)

Samenvatting

A reversible semantics enables to undo computation steps. Reversing message-passing, concurrent programs is a challenging and delicate task; one typically aims at causally consistent reversible semantics. Prior work has addressed this challenge in the context of a process model of multiparty protocols (or choreographies). In this paper, we describe a Haskell implementation of this reversible operational seman- tics. We exploit algebraic data types to faithfully represent three core ingredients: a process calculus, multiparty session types, and forward and backward reduction semantics. Our implementation bears witness to the convenience of pure functional programming for implementing reversible languages.
Originele taal-2English
TitelTrends in Functional Programming
RedacteurenMichal Palka, Magnus Myreen
Plaats van productieCham
UitgeverijSpringer
Pagina's20-45
ISBN van elektronische versie978-3-030-18506-0
ISBN van geprinte versie978-3-030-18505-3
DOI's
StatusPublished - 2019
Evenement19th International Symposium, TFP 2018 - Gothenburg, Sweden
Duur: 11-jun-201813-jun-2018

Publicatie series

Naam Lecture Notes in Computer Science
UitgeverijSpringer
Volume11457
ISSN van geprinte versie0302-9743

Conference

Conference19th International Symposium, TFP 2018
Land/RegioSweden
StadGothenburg
Periode11/06/201813/06/2018

Citeer dit