Faculty of Information Technology, BUT

Course details

Programming Language Semantics

SPJ Acad. year 2009/2010 Winter semester 3 credits

Course is not open in this year
Close
Types of semantic programming languages semantic definition: denotational, operational and axiomatic. Lambda calculus and its use for the denotational semantic. Formal definition of basic types, structures a constructions using denotational semantic. Axiomatic semantic and its use for program correctness proving. Examples of axiomatic definitions. The semantic of languages for functional and logic programming.

Guarantor

Language of instruction

Czech, English

Completion

Examination (written)

Time span

26 hrs lectures

Assessment points

70 exam, 30 half-term test

Department

Lecturer

Subject specific learning outcomes and competences

Ability of formally defining programming languages sematic and  using this definition in praxis. Ability and practical use of the program correctness proving.

Learning objectives

In-depth grasp of theoretical foundations of the programming languages construction semantic definition. Obtaining the ability to define this semantic and use this definition in praxis.

Prerequisites

Study literature

  • Gordon, J.C.: Programming Language Theory and its Implementation, Prentice Hall - Series in Computer Science, Prentice Hall New York 1988, 255 str., ISBN 0-13-730409-9

Fundamental literature

  • Gordon, J.C.: Programming Language Theory and its Implementation, Prentice Hall - Series in Computer Science, Prentice Hall New York 1988, 255 p., ISBN 0-13-730409-9
  • Sebesta, R.,W.: Concepts of Programming Languages, Addison Wesley, Massachusetts 1999, 670 p., ISBN 9-780201-385960

Syllabus of lectures

  1. History of programming languages construction development.
  2. Kinds of syntax and semantic definition.
  3. Basics of non-typed lambda calculus.
  4. Expresssion notation, evaluation.
  5. Recursive functions formal semantics.
  6. Name spaces and type checking.
  7. Data types simple and structured, type equivalence, polymorphism.
  8. Denotational semantics.
  9. Floyd-Hoare logic and its use for program correcntess proving.
  10. Axiomatic semantics and program correctness proving.
  11. Subroutine calling and parameter passing.
  12. Object-oriented programming.
  13. Functional programming, logic programming.

Progress assessment

Mid-term test.
Back to top