1. Joachim Breitner, Martin Hecker & Gregor Snelting (2017): Der Grader Praktomat. In: O. J. Bott: Automatisierte Bewertung in der Programmierausbildung, Digitale Medien in der Hochschullehre 6. Waxmann Verlag GmbH, Münster, Germany, pp. 159–172. Available at
  2. Janusz A. Brzozowski (1962): Canonical Regular Expressions and Minimal State Graphs for Definite Events. In: Proceedings of the Symposium on Mathematical Theory of Automata, MRI Symposia 12. Polytechnic Institute of Brooklyn, NY, pp. 529–561.
  3. Janusz A. Brzozowski (1964): Derivatives of Regular Expressions. Journal of the ACM 11(4), pp. 481–494, doi:10.1145/321239.321249.
  4. Cyp—Checker for ``Morally Correct'' Induction Proofs about Haskell Programs. Available at Retrieved Apr 2022.
  5. Cyp—for Use with Leipzig Autotool. Available at Retrieved Apr 2022.
  6. Loris D'Antoni, Dileep Kini, Rajeev Alur, Sumit Gulwani, Mahesh Viswanathan & Björn Hartmann (2015): How Can Automatic Feedback Help Students Construct Automata?. ACM Transactions on Computer-Human Interaction 22(2), doi:10.1145/2723163.
  7. Kees Doets & Jan van Eijck (2004): The Haskell Road to Logic, Maths and Programming. King's College Publ..
  8. Matthew Farrugia-Roberts, Bryn Jeffries & Harald Søndergaard (2022): Programming to Learn: Logic and Computation from a Programming Perspective, doi:10.1145/3502718.3524814. To appear in Proceedings of the 27th ACM Conference on Information Technology in Computer Science Education, Dublin, July.
  9. Grok Academy webpage. Retrieved Feb 2022.
  10. Haskell webpage. Retrieved Apr 2022.
  11. Peter B. Henderson (2002): Functional and Declarative Languages for Learning Discrete Mathematics. In: Proceedings of the International Workshop on Functional and Declarative Programming in Education. Available from
  12. Maxim Hendriks, Cezary Kaliszyk, Femke Van Raamsdonk & Freek Wiedijk (2010): Teaching Logic Using a State-of-the-Art Proof Assistant. Acta Didactica Napocensia 3(2), pp. 35–48.
  13. Kevin Kappelmann, Jonas Rädle & Lukas Stevens (2022): Engaging, Large-Scale Functional Programming Education in Physical and Virtual Space. this volume of EPTCS. Open Publishing Association.
  14. Models of Computation (COMP30026) — The University of Melbourne Handbook (2021). Retrieved Feb 2022.
  15. Marco T. Morazán & Rosario Antunez (2014): Functional Automata: Formal Languages for Computer Science Students. In: J. Caldwell, P. Hölzenspies & P. Achten: Proceedings of the Third International Workshop on Trends in Functional Programming in Education (TFPIE 2014), EPTCS 170, pp. 19–32, doi:10.4204/EPTCS.170.2.
  16. Benedek Nagy (2004): A Normal Form for Regular Expressions. In: Supplemental Papers for the 8th International Conference on Developments in Language Technology, CDMTCS Research Report, pp. 53–62.
  17. Tobias Nipkow (2012): Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs. In: Verification, Model Checking, and Abstract Interpretation, LNCS 7148. Springer, pp. 24–38, doi:10.1007/978-3-642-27940-9_3.
  18. John O'Donnell, Cordelia Hall & Rex Page (2006): Discrete Mathematics Using a Computer. Springer.
  19. Peter-Michael Osera & Steve Zdancewic (2013): Teaching Induction with Functional Programming and a Proof Assistant. In: SPLASH Educators Symposium (SPLASH-E).
  20. Joseé Carlos Paiva, Joseé Paulo Leal & Álvaro Figueira (2022): Automated Assessment in Computer Science Education: A State-of-the-Art Review. ACM Transactions on Computing Education 22(3), pp. 34:1–34:40, doi:10.1145/3513140.
  21. Emil L. Post (1941): The Two-Valued Iterative Systems of Mathematical Logic. Princeton University Press.
  22. Mirko Rahn & Johannes Waldmann (2002): The Leipzig autotool System for Grading Student Homework. In: Proceedings of the International Workshop on Functional and Declarative Programming in Education. Available from
  23. Susan H. Rodger: JFLAP webpage. Retrieved Jan 2022.
  24. Susan H. Rodger, Bart Bressler, Thomas Finley & Stephen Reading (2006): Turning Automata Theory into a Hands-On Course. In: Proceedings of 37th SIGCSE Technical Symposium on Computer Science Education. ACM Press, pp. 379–383, doi:10.1145/1121341.1121459.
  25. Alley Stoughton (2008): Experimenting with Formal Languages Using Forlan. In: Proceedings of the 2008 International Workshop on Functional and Declarative Programming in Education, pp. 41–50, doi:10.1145/1411260.1411267.
  26. G. S. Tseitin (1968): On the Complexity of Derivation in the Propositional Calculus. In: A. O. Slisenko: Studies in Constructive Mathematics and Mathematical Logic Part II, pp. 115–125, doi:10.1007/978-3-642-81955-1_28.
  27. Thomas VanDrunen (2017): Functional Programming as a Discrete Mathematics Topic. ACM Inroads 8(2), pp. 51–58, doi:10.1145/3078325.
  28. Johannes Waldmann: Leipzig Autotool webpage. Retrieved Jan 2022.
  29. Johannes Waldmann (2014): Automated Exercises for Constraint Programming. In: 28th Workshop on (Constraint) Logic Programming (WLP 2014), pp. 66–80.
  30. Johannes Waldmann (2015): Automatisierte Bewertung und Erzeugung von Übungsaufgaben zu Prinzipien von Programmiersprachen. In: 18. Kolloquium Programmiersprachen und Grundlagen der Programmierung (KPS 2015).
  31. Johannes Waldmann (2017): Automatische Erzeugung und Bewertung von Aufgaben zu Algorithmen und Datenstrukturen. In: Proceedings of the Third Workshop ``Automatische Bewertung von Programmieraufgaben'' (ABP2017) 2015.
  32. Johannes Waldmann (2017): How I Teach Functional Programming. In: Workshop on Functional Logic Programming (WFLP 2017).
  33. Hao Wang (1960): Toward Mechanical Mathematics. IBM Journal of Research and Development 4(1), pp. 2–22, doi:10.1147/rd.41.0002.
  34. Bruce W. Watson (1995): Taxonomies and Toolkits of Regular Language Algorithms. Eindhoven University of Technology.

Comments and questions to:
For website issues: