Skip to main content

Principles of Programming Languages

2026/2027
Programme:
Interdisciplinary University Study Programme Computer Science and Mathematics
Year:
2 year
Semester:
second
Kind:
mandatory
ECTS:
6
Language:
slovenian
Course director:
Lecturer (contact person):
Hours per week – 2. semester:
Lectures
3
Seminar
0
Tutorial
0
Lab
2
Prerequisites

There are no prerequisites.

Content (Syllabus outline)
  • Computational models and programming paradigms: imperative, procedural programming; declarative, non-procedural programming; functional programming; logic and relational programming; programming with constraints; parallel programming; genetic programming; programming by examples; etc.
  • Overview of programming languages for various programming paradigms
  • Elements of languages for imperative programming
  • Declarative programming, logic programming and the Prolog language: logic as a programming language, procedural meaning of programs as automatic theorem proving, examples of symbolic programming and declarative program design
  • Programming with constraints: ideas, principles and examples, constraint logic programming (CLP)
  • Handling of syntax and semantics of programming languages: grammars, operational, translational, denotational and axiomatic semantics
  • Denotational semantics, relation to the the grammar of a language, examples of denotational definitions
  • Axiomatic semantics and proving correctness of programs: partial and total correctness, invariant conditions, techniques of proving program correctness, using weakest preconditions, automatic correctness proving
Readings
  1. I. Bratko: Prolog programming for artificial intelligence, 2nd ed., Wokingham [etc.] : Addison-Wesley, cop. 1990.
  2. I. Bratko: Prolog in umetna inteligenca, Ljubljana : Društvo matematikov, fizikov in astronomov SR Slovenije : Zveza organizacij za tehnično kulturo Slovenije, 1989.
  3. R. Harper: Practical foundations for programming languages, 2nd ed., Cambridge : Cambridge University Press, cop. 2016.
  4. B. C. Pierce: Types and programming languages, Cambridge (Massachusetts) ; London : The MIT Press, cop. 2002.
  5. P. Van Roy, S. Haridi: Concepts, techniques, and models of computer programming, Cambridge (Massachusetts) ; London : The MIT Press, cop. 2004.
  6. R. W. Sebesta: Concepts of programming language, 11th ed., global ed., Harlow [etc.] : Pearson, cop. 2016.
Objectives and competences

To introduce the principles and types of programming languages, including models of computation, formal treatment of the syntacs and semantics of languages and program correctness;

Understanding of various programming paradigms and their use in corresponding programming languages;

Practical applications of symbolic, declarative and constraint programming.

Intended learning outcomes

Knowledge and understanding:

Understanding of various approaches to programming and suitability of these approaches to solving various problems;

Overview of the principles and mechanisms of types of programming languages;

Understanding ways of defining the syntax and semantics of languages, and formal proofs of program correctness.

Application:

Skill of symbolic programming, logic and constrain programming

Reflection:

Ability of thinking about alternative formulations of problems and approaches to their solution;

How different computational models, programming paradigms and languages, support alternative approaches to computer problem solving

Transferable skills:

Enhanced skills of program design.

Learning and teaching methods

Lectures, practical work and exercises, home work.

Assessment

Type (examination, oral, coursework, project):

Continuing (homework)
Final (written and oral exam)
5 - 10, a student passes the exam if he is graded from 6 to 10

Lecturer's references

BAUER, Andrej, PRETNAR, Matija. Programming with algebraic effects and handlers. V: Journal of logical and algebraic methods in programming : Special Issue on Domains X, International workshop on Domain Theory and applications, Swansea, 5-7 September, 2011, (Journal of logical and algebraic methods in programming, ISSN 2352-2208, Vol. 84, iss. 1, 2015). http://dx.doi.org/10.1016/j.jlamp.2014.02.001

BAUER, Andrej, PRETNAR, Matija. An effect system for algebraic effects and handlers. Logical methods in computer science, ISSN 1860-5974, 2014, vol. 10, iss. 4, paper 9 (str. 1-29). http://arxiv.org/pdf/1306.6316.

BAUER, Andrej, PLOTKIN, Gordon, SCOTT, Dana S. Cartesian closed categories of separable Scott domains. Theoretical computer science, ISSN 0304-3975, 2014, vol. 546, str. 17-29.

BAUER, Andrej, HOFMANN, Martin, KARBYSHEV, Aleksandr. On monadic parametricity of second-order functionals. V: PFENNING, Frank (ur.). Foundations of software science and computation structures : 16th International Conference, FOSSACS 2013, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013 : proceedings, 16th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2013, Rome, Italy, March 16-24, 2013, (Lecture notes in computer science, ISSN 0302-9743, 7794). Berlin; Heidelberg: Springer, cop. 2013, str. 225-240. http://dx.doi.org/10.1007/978-3-642-37075-5_15.

BAUER, Andrej, STONE, Christopher A. RZ: a tool for bringing constructive and computable mathematics closer to programming practice. Journal of logic and computation, ISSN 0955-792X, 2009, vol. 19, no. 1, str. 17-43. http://dx.doi.org/10.1093/logcom/exn026

BAUER, Andrej, HÖTZEL ESCARDÓ, Martín, SIMPSON, Alex. Comparing functional paradigms for exact real-number computation. V: WIDMAYER, Peter (ur.). Automata, languages and programming : 29th international colloquium, ICALP 2002, Málaga, Spain, July 8-13, 2002 : proceedings, (Lecture notes in computer science, ISSN 0302-9743, 2380). Berlin; London: Springer, cop. 2002, str. 488-500.