A general framework for types in graph rewriting
In: FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science : Proceedings of the 20th Conference New Delhi, India, December 13–15, 2000 . - (Lecture Notes in Computer Science ; 1974)
Berlin [u.a.]: Springer (2000), S. 373-384
Buchaufsatz / Kapitel / Fach: Informatik
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 for a concurrent object-oriented calculus) and a new type system into the general framework.