Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-FLPAcad. year: 2013/2014
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.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Use and understanding of recursion for expression of algorithms.
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
branch MBS , 1 year of study, summer semester, compulsorybranch MIN , 1 year of study, summer semester, compulsorybranch MIS , 1 year of study, summer semester, compulsorybranch MMI , 1 year of study, summer semester, compulsorybranch MMM , 0 year of study, summer semester, compulsorybranch MPV , 0 year of study, summer semester, compulsory-optionalbranch MBI , 0 year of study, summer semester, electivebranch MGM , 0 year of study, summer semester, compulsory-optionalbranch MSK , 0 year of study, summer semester, elective
Lecture
Teacher / Lecturer
Syllabus
Exercise in computer lab
Project