Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Non-procedural Programming - NPRX005

Title:	Neprocedurální programování
Guaranteed by:	Student Affairs Department (32-STUD)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2020
Semester:	summer
E-Credits:	6
Hours per week, examination:	summer s.:2/2, C+Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech
Teaching methods:	full-time
Is provided by:	NPRG005
Additional information:	http://ksvi.mff.cuni.cz/~dvorak/vyuka/NPRG005/

Guarantor:	doc. RNDr. Tomáš Dvořák, CSc. RNDr. Jan Hric
Class:	Informatika Bc. Informatika Mgr. - učitelské studium informatiky
Classification:	Informatics > Programming
Pre-requisite :	{NXXX015, NXXX018, NXXX022, NXXX023, NXXX024, NXXX025, NXXX030, NXXX031, NXXX033, NXXX065}
Incompatibility :	NPRG005
Interchangeability :	NPRG005
Is incompatible with:	NPRG005
Is interchangeable with:	NPRG005

Opinion survey results Examination dates Noticeboard

Annotation -

An introduction to the principles of logical and functional programming, explained in terms of programming languages Prolog and Haskell. The course also provides a basic knowledge of LISP (Scheme).

Last update: T_KSVI (18.04.2012)

Course completion requirements -

The course is concluded with a credit and a final exam. The credit is awarded upon successfully completing the following requirements:

submitting a programming project including the user and developer documentation on a topic assigned by the instructor

obtaining the required score from homework assignments or tests assigned in tutorials

The final exam consists of a written and an oral part. The grade is based on results of both parts. Problems assigned in the written part correspond to the syllabus and the material covered in tutorials. Questions posed in the oral part explore the topics included in the syllabus to the extent that these topics are covered in lectures.

Last update: Dvořák Tomáš, doc. RNDr., CSc. (24.03.2018)

Literature -

Richard Bird, Jeremy Gibbons, Algorithm Design with Haskell, Cambridge University Press, 2020

Patrick Blackburn, Johan Bos, Kristina Striegnitz, Learn Prolog Now!, College Publications, 2006

Ivan Bratko, Prolog Programming for Artificial Intelligence, 4th ed., Pearson, 2012

Graham Hutton, Programming in Haskell, 2nd ed., Cambridge University Press, 2016

Miran Lipovača, Learn You a Haskell for Great Good!: A Beginner's Guide, No Starch Press, 2011

Rebecca Skinner, Effective Haskell: Solving Real-World Problems with Strongly Typed Functional Programming, Pragmatic Bookshelf, 2023

David S. Warren et al., Prolog: The Next 50 Years, Lecture Notes in Artificial Intelligence 13900, Springer, 2023

Last update: Dvořák Tomáš, doc. RNDr., CSc. (17.02.2024)

Syllabus -

1. Syntax of Prolog programs and their interpretation, unification, backtracking. Declarative and operational semantics of program.

2. Lists and recursive data structures. Built-in predicates and their uses.

3. Arithmetic in Prolog. Input and output. Definition of operators.

4. Cut and negation.

5. Efficiency of Prolog programs, incomplete data structures.

6. Functional programming, basics of LISP (Scheme).

7. Haskell: basic syntax, 2D layout, lazy evaluation.

8. Function definition, recursion, pattern matching. List comprehensions.

9. User-defined types and data structures, polymorphism, type classes.

10. Higher-order functions. Infinite data structures.

11. Input and output, monads.

Last update: Dvořák Tomáš, doc. RNDr., CSc. (09.09.2011)