BSc: Advanced Compilers Construction and Program Analysis
Advanced Compilers Construction and Program Analysis
- Course name: Advanced Compilers Construction and Program Analysis
- Code discipline: XYZ
- Subject area: Programming Languages and Software Engineering
Short Description
This course covers the following concepts: Advanced Compilers Construction and Program Analysis concepts:
Key concepts of the class
- Type Systems
- Lambda calculi as the core representation
- Type checking and type inference
- Simple types and derived forms
- Subtyping
- Imperative objects
- Recursive types
- Universal polymorphism
- Compiling lazy functional languages
Prerequisites
Prerequisite subjects
Prerequisite topics
Course Topics
Section | Topics within the section |
---|---|
Introduction to subject, computer networks basics, transport layer protocols, and socket programming |
|
Coordination, consistency, and replication in distributed systems | |
Fault tolerance and security in distributed systems |
Course Sections
Section Title | Lecture Hours | Seminars (labs) | Selfstudy | Knowledge evaluation |
---|---|---|---|---|
Lambda Calculus and Simple Types | 10 | 10 | 10 | 2 |
References, Exceptions, Imperative Objects, Featheweight Java | 8 | 8 | 8 | 1 |
Recursive Types, Type Reconstruction, Universal Polymorphism | 6 | 6 | 6 | 1 |
Compiling Lazy Functional Languages | 8 | 8 | 8 | 1 |
Project Presentation | 2 |
Section 1 Section title: Lambda calculus and simple types
Topics covered in this section:
- The history of typed languages. Type systems and language design.
- Basic notions: untyped lambda calculus, nameless representation, simple types.
Form of evaluation | Usage | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Development of individual parts of software product code | 1 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Homework and group projects | 1 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Midterm evaluation | 0 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Testing (written or computer based) | 0 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Reports | 1 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Essays | 0 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Oral polls | 1 | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Discussions | 1 |
Typical questions for ongoing performance evaluation within this section
Typical questions for seminar classes (labs) within this section
Test questions for final assessment in this section
calculus. Section 2 Section title: References, exceptions, imperative objects, Featherweight Java
Typical questions for ongoing performance evaluation within this section
Typical questions for seminar classes (labs) within this section
lambda calculus with references and exceptions.
Test questions for final assessment in this section
Topics covered in this section:
Typical questions for ongoing performance evaluation within this section
Typical questions for seminar classes (labs) within this section
Test questions for final assessment in this section
Section 4 Section title: Compiling lazy functional languages Topics covered in this section:
Typical questions for ongoing performance evaluation within this section
Typical questions for seminar classes (labs) within this section
Test questions for final assessment in this section
calculus. Intended Learning Outcomes (ILOs)What is the main purpose of this course?This course partially covers two major topics: 1. Theory and Implementation of Typed Programming Languages and 2. Compilation of Lazy Functional Languages. We will study different type system features in detail, starting from an untyped language of lambda calculus and gradually adding new types and variations along the way. The course assumes familiarity with basics of compiler construction, basics of functional programming and familiarity with some static type systems (C++ and Java would suffice, but knowing type systems of Haskell or Scala will help). Even though the most obvious benefit of static type systems is that it allows programmers to detect some errors early, it is by far not the only application. Types are used also as a tool for abstraction, documentation, language safety, efficiency and more. In this course we will look at features of type systems occurring in many programming languages, like C++, Java, Scala and Haskell. After we have reached System F, a type system at the core of languages like Haskell, we will look into how lazy functional languages are implemented. We will in particular look in detail at Spineless Tagless Graph reduction machine (also known as STG machine) that is used to compile Haskell code. Evaluation of the course consists of Lecture Quizzes, Lab Participation and the Final Project (split into several stages). The Final Project is a team project where students build a complete interpreter or compiler for a statically typed programming language, incorporating some of the features covered in this course. Course Objectives Based on Bloom’s TaxonomyWhat should a student remember at the end of the course?
What should a student be able to understand at the end of the course?
What should a student be able to apply at the end of the course?
Course evaluation:
ILOs defined at three levelsLevel 1: What concepts should a student know/remember/explain?By the end of the course, the students should be able to ...
Level 2: What basic practical skills should a student be able to perform?By the end of the course, the students should be able to ...
Level 3: What complex comprehensive skills should a student be able to apply in real-life scenarios?By the end of the course, the students should be able to ... GradingCourse grading range
Course activities and grading breakdown
Recommendations for students on how to succeed in the courseResources, literature and reference materialsOpen access resources
Closed access resourcesSoftware and tools used within the courseResources and reference material
Teaching Methodology: Methods, techniques, & activitiesActivities and Teaching Methods
Formative Assessment and Course ActivitiesOngoing performance assessmentSection 1
Section 2
Section 3
Section 4
Final assessmentSection 1
Section 2 Section 3 Section 4
The retake examSection 1 Section 2 Section 3 Section 4 |