Year: 2026
Type: preprint
Abstract: Nested conditions are used, among other things, as a graphical way to express first order formulas ruling the applicability of a graph transformation rule to a given match. In this paper, we first introduce several operators on conditions mimicking logical connectives. Next we propose an original notion of structural morphism among nested conditions, and we identify circumstances under which morphisms are consistent with the entailment of the corresponding conditions. Finally we frame the results in a categorical context, proving functoriality and universality properties of the various operations.
Source: arXiv (Cornell University)
Authors: Rensink, Arend, Corradini, Andrea
Institutions: University of Twente, University of Pisa
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7202386701
Cites:
Cited by:
Related to: