A categorical foundation for structured reversible flowchart languages: Soundness and adequacy
Research output: Contribution to journal › Journal article › peer-review
Standard
A categorical foundation for structured reversible flowchart languages : Soundness and adequacy. / Glück, Robert; Kaarsgaard, Robin.
In: Logical Methods in Computer Science, Vol. 14, No. 3, 16, 2018.Research output: Contribution to journal › Journal article › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - A categorical foundation for structured reversible flowchart languages
T2 - Soundness and adequacy
AU - Glück, Robert
AU - Kaarsgaard, Robin
PY - 2018
Y1 - 2018
N2 - Structured reversible flowchart languages is a class of imperative reversible programming languages allowing for a simple diagrammatic representation of control flow built from a limited set of control flow structures. This class includes the reversible programming language Janus (without recursion), as well as more recently developed reversible programming languages such as R-CORE and R-WHILE. In the present paper, we develop a categorical foundation for this class of languages based on inverse categories with joins. We generalize the notion of extensivity of restriction categories to one that may be accommodated by inverse categories, and use the resulting decisions to give a reversible representation of predicates and assertions. This leads to a categorical semantics for structured reversible flowcharts, which we show to be computationally sound and adequate, as well as equationally fully abstract with respect to the operational semantics under certain conditions.
AB - Structured reversible flowchart languages is a class of imperative reversible programming languages allowing for a simple diagrammatic representation of control flow built from a limited set of control flow structures. This class includes the reversible programming language Janus (without recursion), as well as more recently developed reversible programming languages such as R-CORE and R-WHILE. In the present paper, we develop a categorical foundation for this class of languages based on inverse categories with joins. We generalize the notion of extensivity of restriction categories to one that may be accommodated by inverse categories, and use the resulting decisions to give a reversible representation of predicates and assertions. This leads to a categorical semantics for structured reversible flowcharts, which we show to be computationally sound and adequate, as well as equationally fully abstract with respect to the operational semantics under certain conditions.
U2 - 10.23638/LMCS-14(3:16)2018
DO - 10.23638/LMCS-14(3:16)2018
M3 - Journal article
VL - 14
JO - Logical Methods in Computer Science
JF - Logical Methods in Computer Science
SN - 1860-5974
IS - 3
M1 - 16
ER -
ID: 202165060