Course details
Principles of Programming Languages
IPPe Acad. year 2016/2017 Summer semester 5 credits
The course offers basic classification of programming languages with more detailed explanation of imperative and declarative languages. Explaining imperative paradigm, it will be presented non-structured, structured (both block and modular), and object-oriented programming languages. A brief introduction into functional and logic programming will be studied during explanation of declarative paradigm. The underlying theories are discussed too. Students will be also given an introduction to processing (translation) of presented programming paradigms/languages.
Guarantor
Language of instruction
Completion
Time span
- 39 hrs lectures
- 13 hrs projects
Assessment points
- 60 pts final exam (written part)
- 20 pts mid-term test (written part)
- 20 pts projects
Department
Subject specific learning outcomes and competences
Students will be able to classify programming languages. They will be able to use a given programming paradigm on a certain level too. Moreover, basic analysis and compilation issues will be clarified as well.
Learning objectives
To give an overview: of existing programming paradigms, of range of existing programming languages and their classification, and of requirements on programming language analysis and translation.
Recommended prerequisites
Prerequisite knowledge and skills
Formal languages and their models (regular and context-free grammars, finite and pushdown automata); processing of formal languages such as analysis (parsers) and translation (compilers).
Study literature
- Lecture notes in PDF file
Fundamental literature
- Sebesta R.W.: Concepts of Programming Languages, 4th edition, ADDISON-WESLEY, 1999, ISBN 0-201-38596-1
Syllabus of lectures
- Introduction, definition of used terms
- Imperative languages, non-structured programming languages
- Block-structured programming languages
- Modular languages
- Object-oriented languages
- Some specialties of object-oriented programming languages
- Comparison of various kinds of imperative programming languages
- Declarative languages, lambda calculus
- Functional programming languages
- Logical programming languages
- Other declarative programming languages, their comparison
- Main differences in usage and implementation of declarative and imperative programming languages
- Conclusion, discussion of the follow-up courses
Progress assessment
At the end of a term, a student should have at least 50% of points that he or she could obtain during the term; that means at least 20 points out of 40.
Controlled instruction
- Mid-term exam - written form, a test, where answers are given in sentences, by selection of appropriate answer from offered ones, and by combination of both of these possibilities, no possibility to have a second/alternative trial. (20 points)
- Projects realization - 1 project (program development according to a given specification) with appropriate documentation. (20 points)
- Final exam - written form, a test, where answers are given in sentences, by selection of appropriate answer from offered ones, and by combination of both of these possibilities, 2 another corrections trials possible. (60 points)