1. Krzysztof R. Apt (1984): Ten Years of Hoare's Logic: A Survey. Part II: Nondeterminism. Theoretical Computer Science 28, pp. 83–109, doi:10.1016/0304-3975(83)90066-X.
  2. Franz Baader & Tobias Nipkow (1998): Term Rewriting and All That. Cambridge University Press, doi:10.1017/cbo9781139172752.
  3. Christopher Bak (2015): GP+.1667em2: Efficient Implementation of a Graph Programming Language. Department of Computer Science, University of York, UK. Available at
  4. Christopher Bak & Detlef Plump (2016): Compiling Graph Programs to C. In: Proc. International Conference on Graph Transformation (ICGT 2016), Lecture Notes in Computer Science 9761. Springer, pp. 102–117, doi:10.1007/978-3-319-40530-8_7.
  5. Ronald V. Book & Friedrich Otto (1993): String-Rewriting Systems. Springer, doi:10.1007/978-1-4613-9771-7.
  6. Graham Campbell, Brian Courtehoute & Detlef Plump (2020): Fast Rule-Based Graph Programs. ArXiv e-prints arXiv:2012.11394. Available at 47 pages.
  7. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein (2009): Introduction to Algorithms, 3 edition. The MIT Press.
  8. Edsger W. Dijkstra (1997): A Discipline of Programming, 1st edition. Prentice Hall PTR.
  9. Hartmut Ehrig, Karsten Ehrig, Ulrike Prange & Gabriele Taentzer (2006): Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. Springer, doi:10.1007/3-540-31188-2_3.
  10. Wan Fokkink & Thuy Vu (2003): Structural Operational Semantics and Bounded Nondeterminism. Acta Informatica 39, pp. 501–516, doi:10.1007/s00236-003-0111-1.
  11. Ivaylo Hristakiev & Detlef Plump (2016): Attributed Graph Transformation via Rule Schemata: Church-Rosser Theorem. In: Software Technologies: Applications and Foundations – STAF 2016 Collocated Workshops, Revised Selected Papers, Lecture Notes in Computer Science 9946. Springer, pp. 145–160, doi:10.1007/978-3-319-50230-4_11.
  12. Dénes König (1927): Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta Sci. Math.(Szeged) 3(2-3), pp. 121–130.
  13. Georg Moser & Manuel Schneckenreither (2020): Automated amortised resource analysis for term rewrite systems. Science of Computer Programming 185, pp. 102306, doi:10.1016/j.scico.2019.102306.
  14. Hanne Riis Nielson & Flemming Nielson (2007): Semantics with Applications: An Appetizer. Springer, doi:10.1007/978-1-84628-692-6.
  15. Gordon D. Plotkin (2004): A Structural Approach to Operational Semantics. Journal of Logic and Algebraic Programming 60–61, pp. 17–139, doi:10.1016/j.jlap.2004.05.001.
  16. Detlef Plump (2012): The Design of GP+.1667em2. In: Proc. 10th International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2011), Electronic Proceedings in Theoretical Computer Science 82, pp. 1–16, doi:10.4204/EPTCS.82.1.
  17. Detlef Plump (2017): From Imperative to Rule-based Graph Programs. Journal of Logical and Algebraic Methods in Programming 88, pp. 154–173, doi:10.1016/j.jlamp.2016.12.001.
  18. John C Reynolds (1998): Theories of Programming Languages. Cambridge University Press, doi:10.1017/cbo9780511626364.
  19. H. S\IeCø ndergaard & P. Sestoft (1992): Non-determinism in Functional Languages. The Computer Journal 35(5), pp. 514–523, doi:10.1093/comjnl/35.5.514.

Comments and questions to:
For website issues: