FI:IA010 Principles of prog. lang. - Course Information

IA010 Principles of Programming Languages

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), z (credit).

Teacher(s)

Dr. rer. nat. Achim Blumensath (lecturer)

Guaranteed by

Dr. rer. nat. Achim Blumensath
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics

Timetable

Mon 12:00–13:50 A318

Prerequisites

Knowledge of at least one imperative (e.g. C/C++/Java) and one functional language (e.g. Haskell). Knowledge of additional programming languages is an advantage.

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

• Image Processing and Analysis (programme FI, N-VIZ)
• Applied Informatics (programme FI, N-AP)
• Information Technology Security (eng.) (programme FI, N-IN)
• Information Technology Security (programme FI, N-IN)
• Bioinformatics and systems biology (programme FI, N-UIZD)
• Bioinformatics (programme FI, N-AP)
• Computer Games Development (programme FI, N-VIZ_A)
• Computer Graphics and Visualisation (programme FI, N-VIZ_A)
• Computer Networks and Communications (programme FI, N-PSKB_A)
• Cybersecurity Management (programme FI, N-RSSS_A)
• Discrete algorithms and models (programme FI, N-TEI)
• Formal analysis of computer systems (programme FI, N-TEI)
• Graphic design (programme FI, N-VIZ)
• Graphic Design (programme FI, N-VIZ_A)
• Hardware Systems (programme FI, N-PSKB_A)
• Hardware systems (programme FI, N-PSKB)
• Image Processing and Analysis (programme FI, N-VIZ_A)
• Information security (programme FI, N-PSKB)
• Information Systems (programme FI, N-IN)
• Information Security (programme FI, N-PSKB_A)
• Quantum and Other Nonclassical Computational Models (programme FI, N-TEI)
• Parallel and Distributed Systems (programme FI, N-IN)
• Computer graphics and visualisation (programme FI, N-VIZ)
• Computer Graphics (programme FI, N-IN)
• Computer Networks and Communication (programme FI, N-IN)
• Computer Networks and Communications (programme FI, N-PSKB)
• Computer Systems (programme FI, N-IN)
• Principles of programming languages (programme FI, N-TEI)
• Embedded Systems (eng.) (programme FI, N-IN)
• Embedded Systems (programme FI, N-IN)
• Cybersecurity management (programme FI, N-RSSS)
• Services development management (programme FI, N-RSSS)
• Software Systems Development Management (programme FI, N-RSSS)
• Services Development Management (programme FI, N-RSSS_A)
• Software Systems Development Management (programme FI, N-RSSS_A)
• Software Systems (programme FI, N-PSKB_A)
• Software systems (programme FI, N-PSKB)
• Machine learning and artificial intelligence (programme FI, N-UIZD)
• Theoretical Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
• Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
• Computer Games Development (programme FI, N-VIZ)
• Processing and analysis of large-scale data (programme FI, N-UIZD)
• Image Processing (programme FI, N-AP)
• Natural language processing (programme FI, N-UIZD)

Course objectives

By the end of the course, the student will be able:
to understand the various features of a given programming language , including their advantages and disadvantages;
to choose a programming language and programming paradigm suitable for a given problem domain;
to analyse both strong and weak aspects of a given programming language;
to quickly obtain an in-depth understanding a of new programming language;

Learning outcomes

After successfully completing this course students will be familiar with the most common features of programming languages. They will know how these features can be used. They will be able to discuss which features can be used to solve a given programming problem and the advantages and disadvantages of the various options.

Syllabus

• Brief history of programming languages.
• Expressions and functions. Scoping. Functional programming.
• Types and type checking. Polymorphism. Type inference.
• State and side effects. Imperative Programming.
• Modules. Abstract data types.
• Control flow. Continuations. Generators. Exceptions. Algebraic effects.
• Declarative Programming. Single assignment variables. Unification. Backtracking.
• Object oriented programming. Dynamic Dispatch. Subtyping. Encapsulated state. Inheritance.
• Concurrency. Fibres. Message passing. Shared memory.

Literature

recommended literature
• VAN ROY, Peter and Seif HARIDI. Concepts, techniques, and models of computer programming. Cambridge, Massachusetts: MIT Press, 2004, xxvii, 900. ISBN 0262220695. info
• SEBESTA, Robert W. Concepts of Programming Languages. 10th Edition. Addison-Wesley, 2012, 816 pp. ISBN 978-0-13-139531-2. info
• Programming language pragmatics. Edited by Michael Lee Scott. 2nd ed. Oxford: Elsevier Science [distributor], 2006, xxxi, 875. ISBN 9780126339512. info

Teaching methods

The course is organized as a series of lectures.

Assessment methods

Evaluation: final written exam.

Language of instruction

English

Further Comments

Study Materials
The course is taught annually.

• Enrolment Statistics (Autumn 2022, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2022/IA010