Lambda-Calculus and Type SystemsModule description #40826 / Version 2
- 6 CP
- Oral exam
- Graded
- Winter semester
- German
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v5)
| Module / Version | #40826 / #2 |
|---|---|
| Validity | WS 2019/20 – WS 2019/20 |
| Available language(s) | German |
| Credit points | 6 |
| Person responsible for the module | Nestmann, Uwe |
| Grading | Graded |
| Exam format | Oral exam |
| Language(s) of instruction | German |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Softwaretechnik und Theoretische Informatik |
| Academic chair | 34351900 FG Modelle und Theorie Verteilter Systeme (MTV) |
Contact
| Office | EN 24 |
|---|---|
| Contact person | Nestmann, Uwe |
| E-mail address | uwe.nestmann@tu-berlin.de |
| Website | https://www.tu.berlin/mtv/lehre/module-und-veranstaltungen/mastermodule/latys |
Learning outcomes
Successful participants of this module are able to describe functional programs in the mathematical terms of the lambda-calculus. They know how such programs are evaluated in an abstract machine. They understand the connection between logical systems and computational models, and know how to design a type system to guarantee the safety of functional programs. They can describe standard type systems of various strength, and have a basic knowledge of their applications.
Content
- Lambda-calculus (as a computational model)
- Abstract machines and evaluation order
- Curry-Howard correspondence (logic/computation)
- Simply-typed and polymorphic lambda-calculus
- Types for extended lambda-calculi
optional:
- Dependent type theory
- Applications of type systems (e.g. Haskell, Agda)
- Abstract machines and evaluation order
- Curry-Howard correspondence (logic/computation)
- Simply-typed and polymorphic lambda-calculus
- Types for extended lambda-calculi
optional:
- Dependent type theory
- Applications of type systems (e.g. Haskell, Agda)
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Lambda-Kalkül und Typ-Systeme | Integrated course | 3435 L 9099 | Winter semester | – | 4 | ISIS |
Workload and credit points
Lambda-Kalkül und Typ-Systeme (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Homework | 4 | 15 h | 60 h |
| Presence | 15 | 4 h | 60 h |
| Exam preparation | 1 | 30 h | 30 h |
| Individual study (preparation and consolidation) | 15 | 2 h | 30 h |
| 180 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
The class emphasizes an interactive style of teaching. It consists of a mixture of some classical lectures, intermixed with practical and theoretical exercises. The application and consolidation of the learning content is realized via exercise sheets and the joint working through possible solutions.
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Knowledge and competencies from and affinity to areas in Theoretical Computer Science, in particular Logics.
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Oral exam |
| Language | English, German |
| Duration/Extent | ca. 30 Minuten |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
Participation to the class (not to be confused with registration for the module exam) is run via a course within Moodle-platform ISIS. Access to this course will be provided at the first meeting will be kept open for roughly three to four weeks.
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
- Barendregt, H. : Lambda Calculi with Types. 1992
- Girard, Jean-Yves : Proofs and Types. Cambridge University Press, 1989.
- Hindley, J. Roger : Basic Simple Type Theory. Cambridge Tracts in TCS, 1997.
- Martin-Löf, Per : Intuitionistic Type Theory. Bibliopolis, 1984.
- Pierce, Benjamin C. : Software Foundations. 2016.
- Pierce, Benjamin C. : Types and Programming Languages. MIT Press, 2002.
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified