A kernel language for programmed rewriting of (hyper)graphs
The paper presents a formalism for rewriting (hyper)graphs in a controlled manner. This formalism is essentially a simple programming language with productions, that is rewriting rules, playing the role of basic instructions. Programs in this language are built from productions by means of rather standard constructors, including a parallel composition. They may contain parameters to point to specific elements of graphs to which they are supposed to be applied. Programs are intended to describe how to transform a graph and a valuation of parameters in this graph in order to reach a resulting graph and a resulting valuation of parameters.
- LEAN: An intermediate language based on graph rewriting
- A calculus of concurrent graph-rewriting processes
- scientific article; zbMATH DE number 3926271 (Why is no real title available?)
- On edge addition rewrite systems and their relevance to program analysis
- scientific article; zbMATH DE number 919850 (Why is no real title available?)
- A strategy language for graph rewriting
- Formal specification of a graph rewriting system with environments
- LMNtal as a Unifying Declarative Language: Live Demonstration
This page was built for publication: A kernel language for programmed rewriting of (hyper)graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1901702)
