Saved in:
Bibliographic Details
Main Authors: Behr, Nicolas, Krivine, Jean
Format: Preprint
Published: 2019
Subjects:
Online Access:https://arxiv.org/abs/1904.09322
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929449790865408
author Behr, Nicolas
Krivine, Jean
author_facet Behr, Nicolas
Krivine, Jean
contents We extend the notion of compositional associative rewriting as recently studied in the rule algebra framework literature to the setting of rewriting rules with conditions. Our methodology is category-theoretical in nature, where the definition of rule composition operations encodes the non-deterministic sequential concurrent application of rules in Double-Pushout (DPO) and Sesqui-Pushout (SqPO) rewriting with application conditions based upon $\mathcal{M}$-adhesive categories. We uncover an intricate interplay between the category-theoretical concepts of conditions on rules and morphisms, the compositionality and compatibility of certain shift and transport constructions for conditions, and thirdly the property of associativity of the composition of rules.
format Preprint
id arxiv_https___arxiv_org_abs_1904_09322
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle Compositionality of Rewriting Rules with Conditions
Behr, Nicolas
Krivine, Jean
Logic in Computer Science
Category Theory
16B50, 60J27, 68Q42 (Primary) 60J28, 16B50, 05E99 (Secondary)
F.4.2; G.3; G.2.2
We extend the notion of compositional associative rewriting as recently studied in the rule algebra framework literature to the setting of rewriting rules with conditions. Our methodology is category-theoretical in nature, where the definition of rule composition operations encodes the non-deterministic sequential concurrent application of rules in Double-Pushout (DPO) and Sesqui-Pushout (SqPO) rewriting with application conditions based upon $\mathcal{M}$-adhesive categories. We uncover an intricate interplay between the category-theoretical concepts of conditions on rules and morphisms, the compositionality and compatibility of certain shift and transport constructions for conditions, and thirdly the property of associativity of the composition of rules.
title Compositionality of Rewriting Rules with Conditions
topic Logic in Computer Science
Category Theory
16B50, 60J27, 68Q42 (Primary) 60J28, 16B50, 05E99 (Secondary)
F.4.2; G.3; G.2.2
url https://arxiv.org/abs/1904.09322