POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fundamenta Informaticae - Special issue on graph transformations
Featherweight Java: a minimal core calculus for Java and GJ
Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Models of Sharing Graphs: A Categorical Semantics of Let and Letrec
Uncertain Programming
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Comparing logics for rewriting: rewriting logic, action calculi and tile logic
Theoretical Computer Science - Rewriting logic and its applications
Graph Notation for Concurrent Combinators
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
Generating Type Systems for Process Graphs
CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Approximating the Behaviour of Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
| Hi-index | 0.00 |
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.