Title:

Programming Languages

Code:PRJ
Ac.Year:ukončen 2004/2005
Sem:Summer
Language of Instruction:Czech
Public info:http://www.fit.vutbr.cz/study/courses/PRJ/public/
Private info:http://www.fit.vutbr.cz/study/courses/PRJ/private/
Credits:6
Completion:credit+exam (written)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:39120014
 ExamsTestsExercisesLaboratoriesOther
Points:50200030
Guarantor:Hruška Tomáš, prof. Ing., CSc. (DIFS)
Lecturer:Hruška Tomáš, prof. Ing., CSc. (DIFS)
Faculty:Faculty of Information Technology BUT
Department:Department of Information Systems FIT BUT
Prerequisites: 
Theoretical Computer Science 1 (TI1), DITS
Follow-ups:
Compiler Construction (VPR), FIT
Functional and Logic Programming (FLP), DIFS
Principles of Compiler Design (ZAP), DIFS
 
Learning objectives:
  To obtain theoretical foundations of the programming languages construction semantic definition. To obtain the ability to define this semantic and to use this definiction in praxis. To obtain an overview about basic models of programming languages.
Description:
  Types of semantic programming languages semantic definition: denotational, operational and axiomatic. Lambda calculus a its using for the denational semantic. Formal definition of basic types, structures a constructions using denotational semantic. Axiomatic semantic and its using for program correctnes proving. Examples of axiomatic definitions. The semantic of languages for functional and logic programming. Basics of object-oriented programming.
Knowledge and skills required for the course:
  theoretical informatics, formal languages
Learning outcomes and competencies:
  Ability to formally define programming languages sematic a to use this definition in praxis. Ability and practical using of the program correctnes proving.
Syllabus of lectures:
 
  • History of programming languages construction development.
  • Kinds of syntax and semantic definition.
  • Basics of non-typed lambda calculus.
  • Expresssion notation, evaluation.
  • Recursive functions.
  • Name spaces and type checking.
  • Data types simple and structured, type equivalence, polymorphism.
  • Denotational semantics.
  • Floyd-Hoare logic.
  • Axiomatic semantics and program proving.
  • Subroutine calling and parameter passing.
  • Object-oriented programming.
  • Functional programming, logic programming.
Syllabus of numerical exercises:
 
  • Basic constructions and operation of lambda calculus.
  • Simple types reprezentation in lambda calculus.
  • Structured types reprezentation in lambda calculus.
  • Denotational semantics of a simple language.
  • Basics of Floyd-Hoare logic.
  • Program proving.
Syllabus - others, projects and individual work of students:
 
  • Realization of semantic part of various simple languages compilers. In combination with the project from the course Compiler design.
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
Study literature:
 
  • Češka,M., Motyčková, L., Hruška,T.: Vyčíslitelnost a složitost, skriptum VUT Brno, Ediční středisko VUT Brno 1992, 217 str., ISBN 80-214-0441-8
Controlled instruction:
  Presence at the numerical exercises. 14-days cyclus. it is possible to present extraordinary in the other week.
Progress assessment:
  Half semester test. Continuous checking of the project solution by the supervisor.
Exam prerequisites:
  At least half of points obtainable during the semester (tests a project), i.e. 25 points.
 

Your IPv4 address: 54.147.142.16
Switch to IPv6 connection

DNSSEC [dnssec]