FI:IA011 Semantics - Course Information

IA011 Programming Language Semantics

Extent and Intensity

2/1. 3 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: z (credit).

Teacher(s)

prof. RNDr. Antonín Kučera, Ph.D. (lecturer)

Guaranteed by

prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: prof. RNDr. Antonín Kučera, Ph.D.

Timetable

Tue 10:00–12:50 A107

Prerequisites

Students should be familiar with basic notions of set theory and formal logic (validity and provability, correctness and completeness of deductive systems, etc.)

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

• Applied Informatics (programme FI, N-AP)
• Information Technology Security (programme FI, N-IN)
• Bioinformatics (programme FI, N-AP)
• Information Systems (programme FI, N-IN)
• Informatics (programme FI, M-IN)
• Informatics (programme FI, N-IN)
• Parallel and Distributed Systems (programme FI, N-IN)
• Computer Graphics (programme FI, N-IN)
• Computer Networks and Communication (programme FI, N-IN)
• Computer Systems (programme FI, N-IN)
• Embedded Systems (eng.) (programme FI, N-IN)
• Embedded Systems (programme FI, N-IN)
• Service Science, Management and Engineering (eng.) (programme FI, N-AP)
• Service Science, Management and Engineering (programme FI, N-AP)
• Theoretical Informatics (programme FI, N-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
• Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
• Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
• Image Processing (programme FI, N-AP)

Course objectives

An introduction to the theory of formal semantics of programming languages (operational, denotational, and axiomatic semantics).
Main objectives of the course can be summarized as follows: to understand basic types of formal semantics of programming languages; to be able to reason about properties of programs using formal semantics; to understand basic notions of temporal logics.

Syllabus

• Formal semantics of programming languages, basic paradigms (operational, denotational, and axiomatic approach).
• Structural operational semantics and its variants (small-step and big-step semantics).
• Denotational semantics. Complete partial orders, continuous functions. The fixed-point theorem and its applications, semantics of recursion. Equivalence of operational and denotational semantics.
• Axiomatic semantics. Hoare's deductive system, its correctness and completeness.
• Temporal logics; the semantics of non-terminating and parallel programs.

Literature

• SCHMIDT, David A. The structure of typed programming languages. Cambridge: MIT Press, 1994, viii, 367. ISBN 0262193493. info
• WINSKEL, Glynn. The formal semantics of programming languages : an introduction. Cambridge: MIT Press, 1993, xi, 361 s. ISBN 0-262-23169-7. info

Teaching methods

Lectures, tutorials.

Assessment methods

Lectures: 2 hours/week. Tutorials: 1 hour/week.
Written exam.

Language of instruction

Czech

Further Comments

Study Materials
The course is taught annually.

Teacher's information

http://www.fi.muni.cz/usr/kucera/teaching.html

• Enrolment Statistics (Spring 2010, recent)
  
• Permalink: https://is.muni.cz/course/fi/spring2010/IA011