Morgan, J., Paiement, A., Williams, J., Wyner, A., & Seisenberger, M. (2018). A Chatbot Framework for the Children’s Legal Centre. In Frontiers in Artificial Intelligence and Applications (pp. 205-209).
Berger, U., James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2018). Verification of the European Rail Traffic Management System in Real-Time Maude. Science of Computer Programming, 154, 61-88.
James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2016). Towards Safety Analysis of ERTMS/ETCS Level 2 in Real-Time Maude. Formal Techniques for Safety-Critical SystemsSpringer
Berger, U., James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2018). Verification of the European Rail Traffic Management System in Real-Time Maude. Science of Computer Programming, 154, 61-88.
Berger, U. & Seisenberger, M.(2005). Applications of inductive definitions and choice principles to program synthesis. Oxford Logic Guides, 48, 137-148.
Berger, U., Helmut, S., Monika, S., & Seisenberger, M. (2001). The Warshall Algorithm and Dickson's Lemma: Two examples of realistic program extraction. Journal of Automated Reasoning, 26(2), 205-221.
James, P., Lawrence, A., Roggenbach, M., & Seisenberger, M. (2016). Towards Safety Analysis of ERTMS/ETCS Level 2 in Real-Time Maude. Formal Techniques for Safety-Critical SystemsSpringer
James, P., Lawrence, A., Moller, F., Roggenbach, M., Seisenberger, M., Setzer, A., Kanso, K., & Chadwick, S. (2014). Verification of Solid State Interlocking Programs. Software Engineering and Formal Methods (pp. 253-268). Springer
Ulrich, B. & Seisenberger, M.(2010). Program extraction via typed realisability for induction and coinduction. Ways of Proof Theory (pp. 157-181). Ontos Verlag
Benl, H., Berger, U., Schwichtenberg, H., Seisenberger, M., & Zuber, W. (1998). Proof theory at work: Program development in the Minlog system. Automated Deduction - A Basis for Applications (pp. 41-71). Kluwer
Berger, U. & Seisenberger, M. (n.d.) On the computational content of choice principles. In Douglas Bridges
Hajime Ishihara
Michael Rathjen
Helmut Schwichtenberg (Ed.),Handbook of Bishop Constructive MathematicsCambridge University Press
Morgan, J., Paiement, A., Williams, J., Wyner, A., & Seisenberger, M. (2018). A Chatbot Framework for the Children’s Legal Centre. In Frontiers in Artificial Intelligence and Applications (pp. 205-209).
Berger, U., Miyamoto, K., Schwichtenberg, H., & Seisenberger, M. (2011). Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. In Lecture Notes In Computer Science (pp. 393-399).
Seisenberger, M. (2001). An Inductive Version of Nash-Williams’ Minimal-Bad-Sequence Argument for Higman’s Lemma. In Lecture Notes In Computer Science (pp. 233-242). Springer.
This module is a continuation of the module CSC061: Introduction to Programming.
In it, students will continue to enhance their skills in programming, as well as gain a basic understanding of algorithms and data structures.
CS-205
Declarative Programming
This module provides an introduction to the functional and logic programming paradigms and gives students the opportunity to gain practical experience in using both.