This entry is from Winter semester 2016/17 and might be obsolete. You can find a current equivalent here.
CS 310 — Declarative Programming
(dt. Deklarative Programmierung)
|Level, degree of commitment||Basic module, depends on importing study program|
|Forms of teaching and learning,
|Lecture (4 SWS), recitation class (2 SWS), |
270 hours (90 h attendance, 180 h private study)
Course requirement(s): Written examination
Examination type: Successful completion of at least 50 percent of the points from the weekly exercises as well as at least 2 presentations of the tasks.
|German,The grading is done with 0 to 15 points according to the examination regulations for study course B.Sc. Computer Science.|
|Subject, Origin||Computer Science, B.Sc. Computer Science|
|One semester, |
each summer semester
|Person in charge of the module's outline||Prof. Dr. Rita Loogen, Prof. Dr. Christoph Bockisch|
Introduction to declarative programming: basic concepts, programming methodology, formal foundations, i.e. recursive functional equations, reduction semantics/reduction strategies, algebraic data structures, pattern matching, polymorphic type systems, type inference, higher-order functions, interactive input/output, detection of program properties (equational reasoning, induction techniques), lambda calculus
- Learning a declarative programming language,
- Recognition and application of abstraction in program development,
- Differentiate between different programming paradigms and their application areas,
- Knowledge in testing and verification of programs,
- Mathematical foundations of declarative programming,
- Practice of scientific working methods (recognition, formulation, solving problems, training of abstraction skills),
- Training of oral communication skills in the exercises by practicing free speech in front of an audience and during discussion.
- Richard Bird: Thinking Functionally with Haskell, Cambridge University Press, Dec. 2014
- S. Thompson: Haskell – The Craft of Functional Programming, Addison-Wesley 1999;
- M. Felleisen, R. B. Findler, M. Flatt, S. Krishnamurthi: How to Design Programs, Second Edition, MIT Press 2014
- L.Sterling, E.Shapiro: The Art of Prolog, MIT Press 1994
- Weitere Literatur wird in der Veranstaltung bekanntgegeben.
Most translations on this page are (as of now) unchecked automatic translations. We are in the process of checking them. Until then, there might be errors due to faulty translation.
This page describes a module according to the latest valid module guide in Winter semester 2016/17. Most rules valid for a module are not covered by the examination regulations and can therefore be updated on a semesterly basis. The following versions are available in the online module guide:
- Winter 2016/17
- Summer 2018
- Winter 2018/19
- Winter 2019/20
- Winter 2020/21
- Summer 2021
- Winter 2021/22
- Winter 2022/23
- Winter 2023/24
The module guide contains all modules, independent of the current event offer. Please compare the current course catalogue in Marvin.
The information in this online module guide was created automatically. Legally binding is only the information in the examination regulations (Prüfungsordnung). If you notice any discrepancies or errors, we would be grateful for any advice.