EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 5 (1991) RAIRO-Theor. Inf. Appl., 25 5 (1991) 445-472 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 5, 1991
Page(s) 445 - 472
DOI https://doi.org/10.1051/ita/1991250504451
Published online 01 February 2017
  1. [BvEG*87] H. P. BARENDREGT, M. C. J. D. VAN EEKELEN, J. R. W. GLAUERT, J. R. KENNAWAY, M. J. PLASMEIJER and M. R. SLEEP, Term Graph Rewriting, Proc, PARLE, Lecture Notes in Comp. Sci., 1987, 259, pp. 141-158. [Google Scholar]
  2. [DJ90] N. DERSHOWITZ and J.-P. JOUANNAUD, Rewrite Systems, Handbook of Theoretical Computer Science, Vol. B, chapter 15, North Holland, 1990. [MR: 1127191] [Zbl: 0900.68283] [Google Scholar]
  3. [DM79] N. DERSHOWITZ and Z. MANNA, Proving Termination with Multiset Orderings, Comm. ACM, 1979, 22, (8), pp. 465-476. [MR: 540043] [Zbl: 0431.68016] [Google Scholar]
  4. [Ehr79] H. EHRIG, Introduction to the Algebraic Theory of Graph Grammars, Proc. 1st Graph Grammar Workshop, Lecture Notes in Comp. Sci., 1979, 73, pp. 1-69. [MR: 565034] [Zbl: 0407.68072] [Google Scholar]
  5. [Ehr83] H. EHRIG, Aspects of Concurrency in Graph Grammars, Proc. 2nd Graph Grammar Workshop, Lecture Notes in Comp. Sci., 1983, 153, pp. 58-81. [Zbl: 0522.68070] [Google Scholar]
  6. [ER76] H. EHRIG and B. K. ROSEN, Commutativity of Independent Transformations on Complex Objects, Research Report RC 6251, IBM T. J. Watson Research Center, Yorktown Heights, 1976. [Zbl: 0355.68053] [Google Scholar]
  7. [HKP88] A. HABEL, H.-J. KREOWSKI and D. PLUMP, Jungle Evaluation, Proc. Fifth Workshop on Specification of Abstract Data Types. Lecture Notes in Comput. Sci., 1988, 332, pp. 92-112. Revised version to appear in Fundamentae Informaticae. [Zbl: 0661.68016] [Google Scholar]
  8. [Hof83] B. HOFFMANN, Compiler Generation: From Language Descriptions to Abstract Compilers, Dissertation, TU Berlin, 1983. [Google Scholar]
  9. [HP88] B. HOFFMANN and D. PLUMP, Jungle Evaluation for Efficient Term Rewriting, Proc. Algebraic and Logic Programming, Lecture Notes in Comput. Sci., 1988, 343, pp. 191-203. [MR: 987712] [Zbl: 0708.68029] [Google Scholar]
  10. [Klo90] J. W. KLOP, Term Rewriting Systems: from Church-Rosser to Knuth-Bendix and Beyond, Proc. ICALP'90, Lecture Notes in Comput. Sci., 1990, 443, pp. 350-369. [MR: 1076830] [Zbl: 0765.68008] [Google Scholar]
  11. [KW87] H.-J. KREOWSKI and A. WILHARM, Is Parallelism Already Concurrency? [Zbl: 0643.68024] [Google Scholar]
  12. - Part 2: Non-sequential Processes in Graph Grammars, Proc. 3rd Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1987, 291, pp. 361-377. [Zbl: 0643.68024] [Google Scholar]
  13. [Pad82] P. PADAWITZ, Graph Grammars and Operational Semantics, Theoret. Comput. Sci., 1982, 19, pp. 117-141. [MR: 666537] [Zbl: 0486.68090] [Google Scholar]
  14. [Plu86] D. PLUMP, Im Dschungel: Ein neuer Graph-Grammatik-Ansatz zur effizienten Auswertung rekursiv definierter Funktionen, Diplomarbeit, Fachbereich Mathematik/Informatik, Universität Bremen, 1986. [Google Scholar]
  15. [Plu91] D. PLUMP, Graph-Reducible Term Rewriting Systems, Proc. 4th Graph Grammar Workshop, Lecture Notes in Comput. Sci., 1991 (to appear). [Zbl: 0787.68058] [Google Scholar]
  16. [Rao84] J. C. RAOULT, On Graph Rewritings, Theoret. Comput. Sci., 32, 1984, pp. 1-24. [MR: 761158] [Zbl: 0551.68065] [Google Scholar]
  17. [Sta80] J. STAPLES, Computations on Graph-like Expressions, Theoret.Comput.Sci., 1980, 10, pp. 171-185. [Zbl: 0423.68007] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.