Game Semantics and Program

Formal semantics of programming languages PDF

Slides and Files

Slides (21.1.: p. 442)


If you use the Mercurial version control system, you can synchronize these files automatically: hg clone
[ view changelog ]


Homework is the heart and soul of this course.

  • Solved homeworks should be submitted via e-mail to one of the tutors: or

    The latest submission date is given on each exercise sheet. Late submissions will not be graded! If you have a good excuse (such as being very sick), you should contact the tutors before the deadline.
  • Each homework will get two, one or zero points, depending on the solution being correct, improvable or incorrect, respectively.
  • Discussing ideas and problems with others is encouraged. When working on homework problems, however, you need to solve and write up the actual solutions alone. If you misuse the opportunity for collaboration, we will consider this as cheating. Cheating on one homework will result in zero points for that homework. If you cheat repeatedly, you will fail the course immediately. This applies for both parties, that is, the one who cheated and the one who provided his/her solution.
  • Important: homeworks are graded and have a 40% share on the final grade.


The aim of this course will be to introduce the structural, operational approach to programming language semantics. It will show how this formalism is used to specify the meaning of some simple programming language constructs and to reason formally about semantic properties of programs and of tools like program analyzers and compilers. For the reasoning part the theorem prover will be used.

At the end of the course students should
  • be familiar with rule-based presentations of the operational semantics of some simple imperative program constructs,
  • be able to prove properties of an operational semantics using various forms of induction and
  • be able to write precise formal proofs with the theorem prover Isabelle.
See also:
  • C# try catch you will learn about exception handling in using try.
You might also like
Download Space and Quantification in Languages of China
Download Space and Quantification in Languages of China ...
4. Logic Lecture: Predicate Logic: Formal Proofs of
4. Logic Lecture: Predicate Logic: Formal Proofs of ...
Compilers 03-04: Formal Languages
Compilers 03-04: Formal Languages
Amazon Kubuntu 10.04 Desktop Edition
Software (Amazon)
  • Kubuntu 10.04 LTS brings you a stable, innovative and attractive platform for all your desktop needs
  • Latest version of the popular Plasma Desktop provides improved system tray with widgets, improved semantic search, new features such as window grouping
  • Amarok 2.3 media player features many bugfixes, enhancements, and visual changes, such as the new main toolbar and better podcast support
  • New touchpad configuration section of System Settings allows you to fine-tune how your laptop s touchpad behaves
  • Improved Firefox integration, with native file dialogs and compliance to default application choices for opening files
Related Posts