Name
Abstract | ||
|---|---|---|
This paper is concerned with categorical structures for reversible computation. In particular, we focus on a typed, functional reversible language based on Theseus. We discuss how join inverse rig categories do not in general capture pattern-matching, the core construct Theseus uses to enforce reversibility. We then derive a categorical structure to add to join inverse rig categories in order to capture pattern-matching. We show how such a structure makes an adequate model for reversible pattern-matching. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.4204/EPTCS.351.2 | Mathematical Foundations of Programming Semantics (MFPS) |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Louis Lemonnier | 1 | 0 | 0.34 |
| Kostia Chardonnet | 2 | 0 | 0.68 |
| Benoît Valiron | 3 | 228 | 21.00 |