A categorical foundation for structured reversible flowchart languages: Soundness and adequacy
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)...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Logical Methods in Computer Science e.V.
2018-09-01
|
| Series: | Logical Methods in Computer Science |
| Subjects: | |
| Online Access: | https://lmcs.episciences.org/3987/pdf |
| _version_ | 1797268566846734336 |
|---|---|
| author | Robert Glück Robin Kaarsgaard |
| author_facet | Robert Glück Robin Kaarsgaard |
| author_sort | Robert Glück |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:34:31Z |
| format | Article |
| id | doaj.art-72d2317d48df413b90c06610023f7cf7 |
| institution | Directory Open Access Journal |
| issn | 1860-5974 |
| language | English |
| last_indexed | 2024-04-25T01:34:31Z |
| publishDate | 2018-09-01 |
| publisher | Logical Methods in Computer Science e.V. |
| record_format | Article |
| series | Logical Methods in Computer Science |
| spelling | doaj.art-72d2317d48df413b90c06610023f7cf72024-03-08T10:02:03ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742018-09-01Volume 14, Issue 310.23638/LMCS-14(3:16)20183987A categorical foundation for structured reversible flowchart languages: Soundness and adequacyRobert GlückRobin KaarsgaardStructured 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.https://lmcs.episciences.org/3987/pdfcomputer science - programming languagesmathematics - category theoryd.3.1f.3.2 |
| spellingShingle | Robert Glück Robin Kaarsgaard A categorical foundation for structured reversible flowchart languages: Soundness and adequacy Logical Methods in Computer Science computer science - programming languages mathematics - category theory d.3.1 f.3.2 |
| title | A categorical foundation for structured reversible flowchart languages: Soundness and adequacy |
| title_full | A categorical foundation for structured reversible flowchart languages: Soundness and adequacy |
| title_fullStr | A categorical foundation for structured reversible flowchart languages: Soundness and adequacy |
| title_full_unstemmed | A categorical foundation for structured reversible flowchart languages: Soundness and adequacy |
| title_short | A categorical foundation for structured reversible flowchart languages: Soundness and adequacy |
| title_sort | categorical foundation for structured reversible flowchart languages soundness and adequacy |
| topic | computer science - programming languages mathematics - category theory d.3.1 f.3.2 |
| url | https://lmcs.episciences.org/3987/pdf |
| work_keys_str_mv | AT robertgluck acategoricalfoundationforstructuredreversibleflowchartlanguagessoundnessandadequacy AT robinkaarsgaard acategoricalfoundationforstructuredreversibleflowchartlanguagessoundnessandadequacy AT robertgluck categoricalfoundationforstructuredreversibleflowchartlanguagessoundnessandadequacy AT robinkaarsgaard categoricalfoundationforstructuredreversibleflowchartlanguagessoundnessandadequacy |