Document type:
Technical Report
Author(s):
Barbara Koenig
Title:
A General Framework for Types in Graph Rewriting
Abstract:
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 three case studies it is shown how to incorporate existing type systems (for the polyadic $\pi$-calculus and...    »

Keywords:
graph rewriting; type systems; pi-calculus; static analysis
Year:
2000
Year / month:
2000-09-01 00:00:00
Pages:
34