Computational category-theoretic rewriting

DOI10.1016/j.jlamp.2023.100888arXiv2111.03784MaRDI QIDQ6113023

Tyler Hanks, Kristopher Brown, James P. Fairbanks, Evan Patterson

Publication date: 8 August 2023

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.03784

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• How to delete categorically -- two pushout complement constructions
• Algebraic approach to single-pushout graph transformation
• Functorial data migration
• The Verigraph system for graph transformation
• Concurrency theorems for non-linear rewriting theories
• Kan extensions are partial colimits
• AGREE – Algebraic Graph Rewriting with Controlled Embedding
• Graph Transformation by Computational Category Theory
• Sesqui-Pushout Rewriting
• Pattern Graphs and Rule-Based Models: The Semantics of Kappa
• Foundations of Software Science and Computation Structures
• Adhesive and quasiadhesive categories
• Categories and Sheaves
• Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational category-theoretic rewriting