A general framework for types in graph rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1974, Issue , 2000, Pages 373-384

  König, Barbara ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; SOFTWARE ENGINEERING;

CASE-STUDIES; CONCURRENT OBJECTS; GRAPH REWRITING; GRAPH REWRITING SYSTEMS; PI CALCULUS; TYPE SYSTEMS;

OBJECT ORIENTED PROGRAMMING;

EID: 84947779795     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_30     Document Type: Conference Paper

References (21)

1. A. Corradini, U. Montanari, and F. Rossi. Graph processes. Fundamenta Informaticae, 26(3/4):241–265, 1996.
2. H. Ehrig. Introduction to the algebraic theory of graphs. In Proc. 1st International Workshop on Graph Grammars, pages 1–69. Springer-Verlag, 1979. LNCS 73.
3. H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol.3: Concurrency, Parallellism, and Distribution. World Scientific, 1999.
4. F. Gadducci and U. Montanari. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science, 2000. to appear.
5. Philippa Gardner. Closed action calculi. Theoretical Computer Science (in association with the conference on Mathematical Foundations in Programming Semantics), 1998.
6. Annegret Habel. Hyperedge Replacement: Grammars and Languages. Springer-Verlag, 1992. LNCS 643.
7. Masahito Hasegawa. Models of Sharing Graphs (A Categorical Semantics of Let and Letrec). PhD thesis, University of Edingburgh, 1997. available in Springer Distinguished Dissertation Series.
8. Kohei Honda. Composing processes. In Proc. of POPL’96, pages 344–357. ACM, 1996.
9. Atsushi Igarashi, Benjamin Pierce, and Philip Wadler. Featherweight Java: A core calculus for Java and GJ. In Proc. of OOPSLA 1999, 1999.
10. Barbara K¨onig. Generating type systems for process graphs. In Proc. of CONCUR’99, pages 352–367. Springer-Verlag, 1999. LNCS 1664.
11. Barbara König. A general framework for types in graph rewriting. Technical Report TUM-I0014, Technische Universität München, 2000.
12. Barbara König. A graph rewriting semantics for the polyadic pi-calculus. In Workshop on Graph Transformation and Visual Modeling Techniques (Geneva, Switzerland), ICALP Workshops 2000, pages 451–458. Carleton Scientific, 2000.
13. Barbara König. Hypergraph construction and its application to the compositional modelling of concurrency. In GRATRA 2000: Joint APPLIGRAPH/GETGRATS Workshop on Graph Transformation Systems, 2000.
14. Yves Lafont. Interaction nets. In Proc. of POPL’90, pages 95–108. ACM Press, 1990.
15. James J. Leifer and Robin Milner. Deriving bisimulation congruences for reactive systems. In Proc. of CONCUR 2000, 2000. LNCS 1877.
16. José Meseguer. Rewriting logic as a semantic framework for concurrency: A progress report. In Concurrency Theory, pages 331–372. Springer-Verlag, 1996. LNCS 1119.
17. Robin Milner. The polyadic π-calculus: a tutorial. In F. L. Hamer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification. Springer-Verlag, Heidelberg, 1993.
18. Robin Milner. Calculi for interaction. Acta Informatica, 33(8):707–737, 1996.
19. Benjamin Pierce and Davide Sangiorgi. Typing and subtyping for mobile processes. In Proc. of LICS ‘93, pages 376–385, 1993.
20. David Walker. Objects in the π-calculus. Information and Computation, 116:253–271, 1995.
21. Nobuko Yoshida. Graph notation for concurrent combinators. In Proc. of TPPP’94. Springer-Verlag, 1994. LNCS 907.