Rewriting Abstract Structures: Materialization Explained Categorically

02/13/2019
by   Andrea Corradini, et al.
0

The paper develops an abstract (over-approximating) semantics for double-pushout rewriting of graphs and graph-like objects. The focus is on the so-called materialization of left-hand sides from abstract graphs, a central concept in previous work. The first contribution is an accessible, general explanation of how materializations arise from universal properties and categorical constructions, in particular partial map classifiers, in a topos. Second, we introduce an extension by enriching objects with annotations and give a precise characterization of strongest post-conditions, which are effectively computable under certain assumptions.

READ FULL TEXT
research
04/30/2021

Graph Traversals as Universal Constructions

We exploit a decomposition of graph traversals to give a novel character...
research
03/22/2018

On Cayley graphs of algebraic structures

We present simple graph-theoretic characterizations of Cayley graphs for...
research
03/28/2019

An Improved Approach for Semantic Graph Composition with CCG

This paper builds on previous work using Combinatory Categorial Grammar ...
research
12/19/2020

On graded semantics of abstract argumentation: Extension-based case

Based on Grossi and Modgil's recent work [1], this paper considers some ...
research
04/21/2020

Egel – Graph Rewriting with a Twist

Egel is an untyped eager combinator toy language. Its primary purpose is...
research
09/28/2009

On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction

The universal-algebraic approach has proved a powerful tool in the study...
research
11/15/2012

Optimizing Abstract Abstract Machines

The technique of abstracting abstract machines (AAM) provides a systemat...

Please sign up or login with your details

Forgot password? Click here to reset