Course details

# Functional and Logic Programming

FLP Acad. year 2024/2025 Summer semester 5 credits

Practical applications and broader introduction into lambda calculus and predicate logic within the context of functional and logic programming languages. Within functional programming, abstract data types are discussed, as well as the use of recursion and induction, manipulation of lists and infinite data structures in language Haskell. Experience in logic programming is gained in programming languages Prolog (cut operator, state space search, database modification), CLP, and Goedel. Moreover, principles of their implementation are mentioned too.

Why is the course taught

Purely declarative programming languages are such a phenomenon, which enables to get a new viewpoint on many problems and, thus, one can obtain new, original solutions.

Exam prerequisites

At the end of a term, a student should have at least 20 points out of 40 possible, plus

• at least 4 points from project on functional programming (12 possible),
• and at least 3 points from project on logical programming (8 possible).

Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.

Guarantor

Course coordinator

Language of instruction

Czech

Completion

Credit+Examination (written)

Time span

• 26 hrs lectures
• 12 hrs pc labs
• 14 hrs projects

Assessment points

• 60 pts final exam
• 20 pts mid-term test
• 20 pts projects

Department

Lecturer

Instructor

Learning objectives

Obtaining a basic knowledge and practical experience in functional and logic programming. Introduction into formal concepts used as a theoretical basis for both paradigms.

Students will get basic knowledge and practical experience in functional and logic programming (two important representatives of declarative programming). Moreover, they will get basic information about theoretical basis of both paradigms and implementation techniques.
Use and understanding of recursion for expression of algorithms.

Prerequisite knowledge and skills

Processing (analysis, evaluation/interpretation/compilation) of programming languages, predicate logic.

Study literature

• Podklady k přednáškám (slajdy, ukázky, ...)
• Thompson, S.: Haskell, The Craft of Functional Programming, ADDISON-WESLEY, 1999, ISBN 0-201-34275-8
• Hill, P., Lloyd, J.: The Gödel Programming Language, MIT Press, 1994, ISBN 0-262-08229-2
• Jones, S.P.: Haskell 98 Language and Libraries, Cambridge University Press, 2003, p. 272, ISBN 0521826144
• Nilsson, U., Maluszynski, J.: Logic, Programming and Prolog (2ed), John Wiley & Sons Ltd., 1995
• Bieliková, M., Návrat, P.: Funkcionálne a logické programovanie, Vydavateĺstvo STU, Vazovova 5, Bratislava, 2000.

Fundamental literature

• Lipovača, M.: Learn You a Haskell for Great Good!, No Starch Press, 2011, ISBN-13: 978-1-59327-283-8

Syllabus of lectures

1. Introduction to functional programming
2. Lambda calculus
3. Programming language Haskell, introduction, lists
4. User-defined data types, type classes, and arrays in Haskell
5. Input/Output in Haskell - type classes IO and Monad
6. Proofs in functional programming
7. Denotational semantics, implementation of functional languages
8. Introduction to logic programming, Prolog
9. Lists, cut operator, and sorting in Prolog
10. Data structures, text strings, operators - extensions of SWI Prolog
11. Searching state space, clause management, and parsing in Prolog
12. Goedel - logic programming language not using Horn clauses
13. Implementation of logic languages, CLP, conclusion

Syllabus of computer exercises

1. Haskell - basic language features, recursion, lists, partial application, higher-order functions (map, filter, foldX), infinite lists, partial evaluation
2. Haskell - data types, monads, I/O
3. Haskell - demonstration - construction of a simple interpreter using library Parsec
4. Prolog - program structure, recursion, lists
5. Prolog - dynamic predicates, advanced example on dynamic predicates
6. Prolog - more advanced examples, tests on variable instantiation, state space search

Syllabus - others, projects and individual work of students

1. A simple program in Haskell programming language (Hugs, GHC, GHCi).
2. A simple program in Prolog/Gödel/CLP(R) (SWIPL, Gödel, CiaoProlog).

Progress assessment

• Mid-term exam, for which there is only one schedule and, thus, there is no possibility to have another trial.
• Two projects should be solved and delivered in a given date during a term.

• Mid-term exam - written form, questions and exercises to be answered and solved, no possibility to have a second/alternative trial - 20 points.
• Projects realization - 2 projects, implementation of a simple program according to the given specification - one in a functional programming language the other in a logic programming language - 20 points all projects together.
• Final exam - written form, questions and exercises to be answered and solved, 2 another corrections trials possible (60 points - the minimal number of points which can be obtained from the final exam is 25, otherwise, no points will be assigned to a student).

Schedule

DayTypeWeeksRoomStartEndCapacityLect.grpGroupsInfo
Mon lecture 1., 2., 3., 4., 5., 6., 7., 8., 12., 13. of lectures E104 E105 E112 13:0015:50294 1MIT 2MIT NBIO - NSPE NEMB xx Kolář
Mon lecture 9., 10., 11. of lectures E104 E105 E112 13:0015:50294 1MIT 2MIT NBIO - NSPE NEMB xx
Mon comp.lab lectures N204 N205 16:0017:5020 1MIT 2MIT xx
Mon comp.lab lectures N204 N205 18:0019:5020 1MIT 2MIT xx
Tue comp.lab lectures N204 N205 16:0017:5020 1MIT 2MIT xx
Tue comp.lab lectures N204 N205 18:0019:5020 1MIT 2MIT xx
Thu comp.lab lectures N204 N205 16:0017:5020 1MIT 2MIT xx
Thu comp.lab lectures N204 N205 18:0019:5020 1MIT 2MIT xx
Fri comp.lab lectures N204 N205 09:0010:5020 1MIT 2MIT xx
Fri comp.lab lectures N204 N205 11:0012:5020 1MIT 2MIT xx

Course inclusion in study plans

Back to top