References

  1. C.K. Anand & W. Kahl (2009): An Optimized Cell BE Special Function Library Generated by Coconut. IEEE Transactions on Computers 58(8), pp. 1126–1138, doi:10.1109/TC.2008.223.
  2. Z.M. Ariola, J.W. Klop & D. Plump (2000): Bisimilarity in Term Graph Rewriting. Information and Computation 156(1), pp. 2–24, doi:10.1006/inco.1999.2824.
  3. R. Banach (1993): A Fibration Semantics for Extended Term Graph Rewriting. In: Sleep: Term Graph Rewriting: Theory and Practice, chapter 7, pp. 91–100.
  4. A. Corradini & F. Gadducci (1997): A 2-categorical presentation of term graph rewriting. In: E. Moggi & G. Rosolini: Category Theory and Computer Science, LNCS 1290. Springer, Berlin, Heidelberg, pp. 87–105, doi:10.1007/BFb0026983.
  5. A. Corradini & F. Gadducci (1999): An Algebraic Presentation of Term Graphs, via GS-Monoidal Categories. Applied Categorical Structures 7(4), pp. 299–331, doi:10.1023/A:1008647417502.
  6. A. Corradini & F. Gadducci (1999): Rewriting on cyclic structures: Equivalence between the operational and the categorical description. RAIRO Theor.Inform.Appl. 33, pp. 467–493, doi:10.1051/ita:1999128.
  7. A. Corradini & F. Gadducci (2002): Categorical rewriting of term-like structures. ENTCS 51, pp. 108–121, doi:10.1016/S1571-0661(04)80195-6. GETGRATS Closing Workshop.
  8. A. Corradini & F. Gadducci (2005): On Term Graphs as an Adhesive Category. ENTCS 127(5), pp. 43–56, doi:10.1016/j.entcs.2005.02.014.
  9. A. Corradini & F. Rossi (1993): Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming. Theoret.Comput.Sci. 109(1–2), pp. 7–48, doi:10.1016/0304-3975(93)90063-Y.
  10. D. Duval, R. Echahed & F. Prost (2009): A Heterogeneous Pushout Approach to Term-Graph Transformation. In: R. Treinen: Rewriting Techniques and Applications. Springer, Berlin, Heidelberg, pp. 194–208, doi:10.1007/978-3-642-02348-4_14.
  11. B. Hoffmann & D. Plump (1991): Implementing Term Rewriting by Jungle Evaluation. Informatique théorique et applications/Theoretical Informatics and Applications 25(5), pp. 445–472, doi:10.1051/ita/1991250504451.
  12. A. Habel & D. Plump (2012): M,N-Adhesive Transformation Systems. In: H. Ehrig: Graph Transformation, ICGT 2012, LNCS 7562. Springer, pp. 218–233, doi:10.1007/978-3-642-33654-6_15.
  13. W. Kahl, C.K. Anand & J. Carette (2006): Control-Flow Semantics for Assembly-Level Data-Flow Graphs. In: W. McCaull, M. Winter & I. Düntsch: 8th Intl.Seminar on Relational Methods in Computer Science, RelMiCS 8, Feb.2005, LNCS 3929. Springer, pp. 147–160, doi:10.1007/11734673_12.
  14. W. Kahl (1996): Algebraische Termgraphersetzung mit gebundenen Variablen. Reihe Informatik. Herbert Utz Verlag Wissenschaft, München. ISBN 3-931327-60-4; also Doctoral Diss.at Univ.der Bundeswehr München, Fakultät für Informatik.
  15. W. Kahl (1997): A Fibred Approach to Rewriting — How the Duality between Adding and Deleting Cooperates with the Difference between Matching and Rewriting. Technical Report 9702. Fakultät für Informatik, Universität der Bundeswehr München. Available at http://www.cas.mcmaster.ca/~kahl/Publications/TR/Kahl-1997b.html.
  16. W. Kahl (2011): Dependently-Typed Formalisation of Typed Term Graphs. In: R. Echahed: Proc. of 6th International Workshop on Computing with Terms and Graphs, TERMGRAPH 2011, EPTCS 48, pp. 38–53, doi:10.4204/EPTCS.48.6.
  17. W. Kahl (2014): Towards ``Mouldable Code'' via Nested Code Graph Transformation. J.Logic and Algebraic Programming 83(2), pp. 225–234, doi:10.1016/j.jlap.2014.02.010.
  18. W. Kahl (2017): Relation-Algebraic Theories in Agda — RATH-Agda-2.2. Mechanically checked Agda theories, with 580 pages literate document output. http://relmics.mcmaster.ca/RATH-Agda/. With contributions by Musa Al-hassy and Yuhang Zhao..
  19. J.R. Kennaway, J.W. Klop, M.R. Sleep & F.J. de Vries (1993): The Adequacy of Term Graph Rewriting for Simulating Term Rewriting. In: Sleep: Term Graph Rewriting: Theory and Practice, chapter 12, pp. 157–170.
  20. J.R. Kennaway, J.W. Klop, M.R. Sleep & F.J. de Vries (1994): On the Adequacy of Graph Rewriting for Simulating Term Rewriting. ACM Transactions on Programming Languages and Systems 16(3), pp. 493–523, doi:10.1145/177492.177577.
  21. F.W. Lawvere (1963): Functorial Semantics of Algebraic Theories. Proc.Nat.Acad.Sci.USA 50, pp. 869–872, doi:10.2307/2272673.
  22. S. Mac Lane (1971): Categories for the Working Mathematician. Springer-Verlag, doi:10.1007/978-1-4757-4721-8.
  23. U. Norell (2007): Towards a Practical Programming Language Based on Dependent Type Theory. Dept.Comp.Sci.and Eng., Chalmers Univ.of Technology. See also http://wiki.portal.chalmers.se/agda/pmwiki.php.
  24. D. Plump (2002): Essentials of Term Graph Rewriting. ENTCS 51, pp. 277–289, doi:10.1016/S1571-0661(04)80210-X. GETGRATS Closing Workshop.
  25. K.H. Rose (1993): Graph-based Operational Semantics of a Lazy Functional Language. In: Sleep: Term Graph Rewriting: Theory and Practice, chapter 22, pp. 303–316.
  26. M.R. Sleep, M.J. Plasmeijer & M.C.J.D. van Eekelen (1993): Term Graph Rewriting: Theory and Practice. Wiley.
  27. C.P. Wadsworth (1971): Semantics and Pragmatics of the Lambda Calculus. D.Phil. thesis. Oxford University.
  28. Y. Zhao (2018): Formalisation of Term Graph Rewriting in Agda — TGR1. Mechanically checked Agda development, with 283 pages literate document output. http://relmics.mcmaster.ca/RATH-Agda/TGR1/.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org