Projects per year
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.
|Title of host publication||34th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2018)|
|Number of pages||14|
|Publication status||Accepted/In press - 12 May 2018|
|Event||34th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2018) - Dalhousie University, Halifax, Canada|
Duration: 6 Jun 2018 → 9 Jun 2018
|Name||Electronic Notes in Theoretical Computer Science|
|Conference||34th Conference on the Mathematical Foundations of Programming Semantics (MFPS 2018)|
|Abbreviated title||MFPS 2018|
|Period||6/06/18 → 9/06/18|
FingerprintDive into the research topics of 'Reversible effects as inverse arrows'. Together they form a unique fingerprint.
- 1 Finished