A general framework for types in graph rewriting

A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type graph is invariant under reduction, but still contains meaningful behaviour information. We present conditions, a type system for graph rewriting should satisfy, and a methodology for proving these conditions. In two case studies it is shown how to incorporate existing type systems (for the polyadic calculus and for a concurrent object-oriented calculus) into the general framework.

• Type: Journal
• Year: 2005
• Where: ACTA
• Authors: Barbara König
• Keywords: ACTA 2005, General Framework, Graph Rewriting Systems, Type Graph