FI:IB000 Induction and Recursion - Course Information
IB000 Induction and Recursion
Faculty of InformaticsAutumn 2002
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
- Teacher(s)
- prof. RNDr. Jiří Zlatuška, CSc. (lecturer)
doc. RNDr. Tomáš Brázdil, Ph.D. (seminar tutor)
Mgr. Jan Holeček (assistant)
RNDr. Pavel Šimeček, Ph.D. (assistant)
Mgr. Jitka Žídková (assistant) - Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Jiří Zlatuška, CSc. - Timetable
- Mon 9:00–10:50 D2, Mon 9:00–10:50 D1
- Prerequisites (in Czech)
- ! I000 Induction and Recursion
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Applied Informatics (programme FI, B-AP)
- Economic Information Systems (programme ESF, B-SI)
- Informatics with another discipline (programme FI, B-IO)
- Informatics (programme FI, B-IN)
- Course objectives
- This course is focused on understanding basic mathematical constructions necessary for derscribing program semantics and formalization of the relationship between intuitive program constructs and their mathematical meaning. This is essential for building up a set of basic concepts needeed fom other courses which fit theoretical essentials of the dicipline.
- Syllabus
- Proposotional and first order logics (an introduction).
- Basic notions: functions, graphs, equivalence relation, trees.
- Induction and its applications: defining sets and functions using induction.
- Data types, lists, and implementation of general data types using lists.
- Languages over data types and their semantics: terms, conditionals, functions; semantics of call-by-value and call-by-name.
- Programming using induction, proving recursive programs correct.
- Universal machine for the language of recursive programs, undecidability of the Halting Problem.
- Literature
- WAND, Mitchell. Induction, recursion, and programming. New York: North Holland, 1980, 202 s. ISBN 0444003223. info
- Language of instruction
- Czech
- Further Comments
- The course is taught annually.
- Listed among pre-requisites of other courses
- Enrolment Statistics (Autumn 2002, recent)
- Permalink: https://is.muni.cz/course/fi/autumn2002/IB000