A general framework for types in graph rewriting


Barbara König. A general framework for types in graph rewriting. In Proc. of FST TCS 2000, pages 373–384. Springer-Verlag, 2000. LNCS 1974.


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 -calculus and for a concurrent object-oriented calculus) and a new type system into the general framework.

Suggested BibTeX entry:

    author = {Barbara K{\"o}nig},
    booktitle = {Proc. of FST TCS 2000},
    note = {{LNCS} 1974},
    pages = {373--384},
    publisher = {{Springer-Verlag}},
    title = {A general framework for types in graph rewriting},
    year = {2000}

GZipped PostScript (102 kB)PDF (179 kB)Tech report version
© University of Duisburg-Essen, Theoretical Computer Science group