Title:

Functional and Logic Programming

Code:FLP
Ac.Year:ukončen 2003/2004
Term:Winter
Study plans:
ProgramBranchYearDuty
EI-BC-3VTB2nd Stage/2nd YearElective
EI-MSC-3VTN2ndElective
EI-MSC-5VTI2nd Stage/2nd YearElective
Language:Czech
Public info:http://www.fit.vutbr.cz/study/courses/FLP/public/
Private info:http://www.fit.vutbr.cz/study/courses/FLP/private/
Credits:6
Completion:examination (written)
Type of
instruction:
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Hours:39001214
 ExaminationTestsExercisesLaboratoriesOther
Points:60200020
Guarantee:Kolář Dušan, doc. Dr. Ing., DIFS
Lecturer:Kolář Dušan, doc. Dr. Ing., DIFS
Instructor:Kolář Dušan, doc. Dr. Ing., DIFS
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Prerequisites: 
Programming Languages (PRJ), DIFS
 
Learning objectives:
Obtaining of basic knowledge and experience in functional and logic programming. Introduction into formal concepts used as a theoretical basis for both paradigms.
Description:
Practical applications and broader introduction into lambda calculus and predicate logic within the context of functional and logic programming languages. It will be discussed abstract data types, use of recursion and induction, manipulation of lists and infinite data structures. Experience in programming is gained in programming languages Haskell, Prolog, and Goedel. Moreover, principles of their implementation are mentioned too.
Learning outcomes and competences:
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.
Syllabus of lectures:
  1. Introduction to functional programming, lambda calculus
  2. Programming language Haskell, introduction, lists
  3. User-defined data types, type classes, arrays
  4. Input/Ouput
  5. Simple applications/programs
  6. Proofs in functional programming
  7. Denotational semantics, implementation of functional languages
  8. Introduction to logic programming, Prolog
  9. Lists, cut operator, sorting
  10. Data structures, text strings, operators
  11. Searching state space, clause management, parsing
  12. Goedel
  13. Implementation of logic languages, CLP, conclusion
Syllabus of computer exercises:
  1. Introduction to Haskell environment (Hugs), simple functions, recursion, lists
  2. Infinite data structures
  3. User defined data types, input/output
  4. Practical problem
  5. Introduction to Prolog environment (Hugs), lists
  6. Practical problem
Syllabus - others, projects and individual work of students:
  1. A simple program in Haskell (Hugs)
  2. A simple program in Prolog
Fundamental literature:
  1. Thompson, S.: Haskell, Tha Craft of Functional Programming, ADDISON-WESLEY, 1999, ISBN 0-201-34275-8
  2. Hill, P., Lloyd, J.: The Gödel Programming Language, MIT Press, 1994, ISBN 0-262-08229-2
Study literature:
  1. Lecture notes in electronic format
  2. Haskell (Hugs) language tutorial, <A HREF=http://www.haskell.org>http://www.haskell.org
  3. SWI-Prolog language tutorial, <A HREF=http://www.swi-prolog.org>http://www.swi-prolog.org
Controlled instruction:
Mid-term exam, projects realization.
Progress assessment:
Mid-term exam, submission of 2 projects within give time schedule.
Exam prerequisites:
Not designated.