Subject description - AE4B33FLP

Summary of Study | Summary of Branches | All Subject Groups | All Subjects | List of Roles | Explanatory Notes               Instructions
AE4B33FLP Functional and Logic Programming
Roles:PO, P, V Extent of teaching:2P+2C
Department:13136 Language of teaching:EN
Guarantors:  Completion:Z,ZK
Lecturers:  Credits:6
Tutors:  Semester:L

Anotation:

This course introduces students into the techniques of functional programming in the LISP (or more precisely SCHEME) and HASKELL language and logic programming in the PROLOG language. Both languages are declarative in that the programmer symbolically describes the problem to be solved, rather than enumerating the exact sequence of actions to be taken. In PROLOG, one describes the problem by specifying properties of objects and relations thereamong through logic formulas. In LISP, the problem description takes the form of function definitions. Both languages have found significant applications in artificial intelligence fields, such as agent systems or symbolic machine learning.

Study targets:

Learn principles of functional and logic programming in the respective languages LISP and PROLOG.

Course outlines:

1. Introduction to declarative programming languages. Comparison to classical imperative languages. Introduction to programming for artificial intelligence.
2. Lisp and Scheme: basic language idioms, atoms, lists, recursion.
3. Scheme: lambda abstraction, built-in functions, advanced data structures.
4. Scheme: relations between iterations and tail recursion optimisations guaranteed by the language standard, built-in high-order functions.
5. Scheme: state space search, applications in artificial intelligence.
6. Haskell: types, patterns, built-in functions, lambda abstraction.
7. Haskell: advanced properties of the language in comparison to Scheme.
8. Prolog: facts, rules and queries. Recursion. Query answering.
9. Functions, unification, list operations.
10. Prolog and logic: clauses, Herbrand base, interpretation, model, closed-world assumption, decidability.
11. Cut and negation. Extralogical operators, arithmetics.
12. Combinatorial search in Prolog.
13. Constraint logic programming.
14. Programming practices, debugging, built-in predicates.

Exercises outline:

1. Scheme. First look at Scheme and its environment. Program debugging. Basic examples.
2. Recursion. Accumulator.
3. Lambda abstraction.
4. Tail recursion. High-order function.
5. Haskell.
6. Prolog as a database. Facts, rules, queries.
7. Recursion. Program debugging.
8. Unificaton. List operations.
9. List, cut and negation operations.
10. Search algorithms,
11. Search algorithms
12. Constraint logic programming
13. Constraint logic programming
14. Credits

Literature:

P. Flach: Simply Logical, John Wiley 1994
I. Bratko: Prolog programing for AI, Addison Wesley 2001 (3rd edition)
V. Mařík et al: Umělá
inteligence I, II, Academia 1993 (In Czech)
P. Jirků, P. Štěpánek, O. Štěpánková: Programování v Jazyku Prolog, SNTL 1991 (In Czech)
B. O'Sullivan, D. Stewart, and J. Goerzen: Real World Haskell, O'Reilly, November 2008, English, ISBN-10: 0596514980, ISBN-13: 978-0596514983
B. Harvey and M. Wright: Simply Scheme, Introducing Computer Science, MIT Press, 1999

Requirements:

Discrete Mathematics, Logic and Graphs, Programming 1+2.

Webpage:

http://cw.felk.cvut.cz/doku.php/courses/ae4b33flp/start

Keywords:

LISP, PROLOG, functional programming, logic programming

Subject is included into these academic programs:

Program Branch Role Recommended semester
BEKME1 Communication Technology V 4
BEKME5 Komunikace a elektronika V 4
BEKME_BO Common courses V 4
BEKME4 Network and Information Technology V 4
BEKME3 Applied Electronics V 4
BEKME2 Multimedia Technology V 4
BEEEM1 Applied Electrical Engineering V 4
BEEEM_BO Common courses V 4
BEEEM2 Electrical Engineering and Management V 4
BEKYR1 Robotics V 4
BEKYR_BO Common courses V 4
BEKYR3 Systems and Control V 4
BEKYR2 Sensors and Instrumentation V 4
BPOI1 Computer Systems P
BPOI_BO Common courses P
BPOI3 Software Systems P
BPOI2 Computer and Information Science P
BEOI2 Computer and Information Science PO 4


Page updated 14.6.2021 19:52:31, semester: L/2021-2, L/2020-1, Z,L/2022-3, Z/2021-2, Send comments about the content to the Administrators of the Academic Programs Proposal and Realization: I. Halaška (K336), J. Novák (K336)