Principles of Programming Languages

Private info:http://www.fit.vutbr.cz/study/courses/IPP/private/
Completion:accreditation+exam (written)
Type of
Hour/semLecturesSem. ExercisesLab. exercisesComp. exercisesOther
Guarantee:Kolář Dušan, doc. Dr. Ing., DIFS
Lecturer:Kolář Dušan, doc. Dr. Ing., DIFS
Křivka Zbyněk, Ing., Ph.D., DIFS
Instructor:Křivka Zbyněk, Ing., Ph.D., DIFS
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Formal Languages and Compilers (IFJ), DIFS
Monlecture - Reklamace hodnocení zkoušky2017-05-22C23614:0015:502BIA
Monlecture - Reklamace hodnocení zkoušky2017-05-22C23614:0015:502BIB
Wedexam - 2. oprava2017-06-07D10513:0015:502BIA
Wedexam - 2. oprava2017-06-07D10513:0015:502BIB
Wedexam - 2. oprava2017-06-07D10513:0015:503BIT
Wedexam - 2. oprava2017-06-07D020613:0015:502BIA
Wedexam - 2. oprava2017-06-07D020613:0015:502BIB
Wedreklamace zkoušky (2. opravný)2017-06-14C22813:0013:502BIA
Wedreklamace zkoušky (2. opravný)2017-06-14C22813:0013:502BIB
WedReklamace PZK2017-04-05C22815:0016:502BIA
WedReklamace PZK2017-04-05C22815:0016:502BIB
WedReklamace PZK2017-04-05C22815:0016:503BIT
Thuexam - náhradní termín2017-06-15C22809:0011:50
Thureklamace zkoušky (1. opravný)2017-06-01C22815:0015:502BIA
Thureklamace zkoušky (1. opravný)2017-06-01C22815:0015:502BIB
Friexam - řádná2017-05-12D10513:0015:502BIA
Friexam - řádná2017-05-12D10513:0015:502BIB
Friexam - řádná2017-05-12D10513:0015:503BIT
Friexam - řádná2017-05-12D020613:0015:502BIA
Friexam - řádná2017-05-12D020613:0015:502BIB
Friexam - řádná2017-05-12D020713:0015:502BIA
Friexam - řádná2017-05-12D020713:0015:502BIB
Friexam - řádná2017-05-12E11213:0015:502BIA
Friexam - řádná2017-05-12E11213:0015:502BIB
Friexam - řádná2017-05-12E10413:0015:502BIA
Friexam - řádná2017-05-12E10413:0015:502BIB
Friexam - řádná2017-05-12E10513:0015:502BIA
Friexam - řádná2017-05-12E10513:0015:502BIB
Friexam - řádná2017-05-12G20213:0015:502BIA
Friexam - řádná2017-05-12G20213:0015:502BIB
Friexam - řádná2017-05-12A11213:0015:502BIA
Friexam - řádná2017-05-12A11213:0015:502BIB
Friexam - řádná2017-05-12A11313:0015:502BIA
Friexam - řádná2017-05-12A11313:0015:502BIB
Friexam - 1. oprava2017-05-26D10513:0015:502BIA
Friexam - 1. oprava2017-05-26D10513:0015:502BIB
Friexam - 1. oprava2017-05-26D10513:0015:503BIT
Friexam - 1. oprava2017-05-26D020613:0015:502BIA
Friexam - 1. oprava2017-05-26D020613:0015:502BIB
Friexam - 1. oprava2017-05-26D020713:0015:502BIA
Friexam - 1. oprava2017-05-26D020713:0015:502BIB
Friexam - řádná2017-05-12C22813:0015:502BIA
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 usage, analysis, and translation.
  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. Design patterns are presented as a programming technique. A brief introduction into functional and logic programming will be studied during explanation of declarative paradigm. The underlying theories are discussed too. Students will also be given an introduction to processing (translation) of presented programming paradigms/languages.
Knowledge and skills required for the course:
  Formal languages and their models, grammars, automata; translation/analysis of formal languages. Focus on regular and context-free languages and their models, grammars, automata and processing.
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.
Generic learning outcomes and competences:
  Usage of selected design patterns.
Syllabus of lectures:
  1. Introduction, definition of used terms
  2. Imperative languages, non-structured programming languages
  3. Block-structured programming languages
  4. Modular languages
  5. Object-oriented languages
  6. Some specialities of object-oriented programming languages
  7. Design patterns
  8. Declarative languages, lambda calculus
  9. Functional programming languages
  10. Logical programming languages
  11. Another declarative programming languages, their comparison
  12. Main differences in usage and implementation of declarative and imperative programming languages
  13. Conclussion, discussion of the follow-up courses
Syllabus - others, projects and individual work of students:
 A simple program or programs/scripts implemented in the given programming language together with relevant documentation.
Fundamental literature:
  • Sebesta R.W.: Concepts of Programming Languages, 4th edition, ADDISON-WESLEY, 1999, ISBN 0-201-38596-1
  • MacLennan, B.J.: Principles of Programming Languages: Design, Evaluation, and Implementation (3rd Edition). Oxford University Press, 1999.
Study literature:
  • Lecture notes in PDF file
  • Kolář, D.: Principy programovacích jazyků a objektově orientovaného programování - I, studijní opora pro kombinované studium, modul IPP I, VUT FIT, 2006
  • Křivka, Z., Kolář, D.: Principy programovacích jazyků a objektově orientovaného programování - II, studijní opora pro kombinované studium, modul IPP II, VUT FIT, 2008
  • Kolář, D.: Principy programovacích jazyků a objektově orientovaného programování - III, studijní opora pro kombinované studium, modul IPP III, VUT FIT, 2006
Controlled instruction:
  • Mid-term exam - written form, a test, where answers are given in full sentences, no possibility to have a second/alternative trial. (20 points)
  • Projects realization - 1 project (program(s) development according to a given specification) with appropriate documentation. (20 points)
  • Final exam - written form, a test, where answers are given in full sentences, 2 another corrections trials possible. (60 points - the minimal number of points which can be obtained from the final exam is 25, otherwise, no points will be assigned to a student.)
Progress assessment:
  • Mid-term exam, for which there is only one schedule and, thus, there is no possibility to have another trial - 20 points.
  • One project should be solved and delivered in given deadlines during a term - 20 points.
Exam prerequisites:
  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.
Plagiarism and not allowed cooperation will cause that involved students are not classified and disciplinary action can be initiated.