Reversible effects as inverse arrows

Christiaan Heunen, Robin Kaarsgaard, Martti Karvonen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Reversible computing models settings in which all processes can be reversed. Applications include low-power computing, quantum computing, and robotics. It is unclear how to represent side-effects in this setting, because conventional methods need not respect reversibility. We model reversible effects by adapting Hughes’ arrows to dagger arrows and inverse arrows. This captures several fundamental reversible effects, including serialization and mutable store computations. Whereas arrows are monoids in the category of profunctors, dagger arrows are involutive monoids in the category of profunctors, and inverse arrows satisfy certain additional properties. These semantics inform the design of functional reversible programs supporting side-effects.
Original languageEnglish
Title of host publication34th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2018)
Number of pages14
Publication statusAccepted/In press - 12 May 2018
Event34th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2018) - Dalhousie University, Halifax, Canada
Duration: 6 Jun 20189 Jun 2018
https://www.mathstat.dal.ca/mfps2018/

Publication series

NameElectronic Notes in Theoretical Computer Science
PublisherElsevier
Volume341
ISSN (Electronic)1571-0661

Conference

Conference34th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2018)
Abbreviated titleMFPS 2018
CountryCanada
CityHalifax
Period6/06/189/06/18
Internet address

Fingerprint Dive into the research topics of 'Reversible effects as inverse arrows'. Together they form a unique fingerprint.

Cite this