Accretive Computation of Global Transformations
Alexandre Fernandez (LACL), Luidnel Maignan (LACL), Antoine Spicher, (LACL)
TL;DR
This paper introduces accretive rule systems for global transformations on presheaf-based data structures, providing a semantic-level analysis and an online algorithm for fully synchronous rule systems.
Contribution
It defines accretive rule systems and a local criterion, enabling online computation of global transformations on presheaves.
Findings
Defined accretive rule systems with a local criterion
Developed an online algorithm for synchronous rule systems
Analyzed the semantic sub-steps for efficient computation
Abstract
Global transformations form a categorical framework adapting graph transformations to describe fully synchronous rule systems on a given data structure.In this work we focus on data structures that can be captured as presheaves and study the computational aspects of such synchronous rule systems.To obtain an online algorithm, a complete study of the sub-steps within each synchronous step is done at the semantic level.This leads to the definition of accretive rule systems and a local criterion to characterize these systems.Finally an online computation algorithm for theses systems is given.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Graph Theory and Algorithms · Advanced Database Systems and Queries