# Type theory, 7.5 ECTS

Second level## Facts

No available facts**Course code**MM8036

## Syllabus

## Description

The course provides an introduction to type theory with simple and dependent types, how it can be used to represent logical systems and proofs, and how proofs give rise to computable functions. The final part of the course covers applications of type theory. The following topics are covered:

Type theory: lambda calculus, contexts, forms of judgement, simple types, inductive types. Operational semantics: confluence and normalization. The Curry-Howard isomorphism. Martin-Löf type theory: dependent types, induction and elimination rules, identity types, universes. The Brouwer-Heyting-Kolmogorov interpretation of logic. Meaning explanations. Semantics of dependent types. Explicit substitution. Category theoretical models. One or more of the following areas of application of type theory are covered: homotopy theory, models for (constructive) set theory and proof assistants.

## Area of interests: Information only in Swedish

## Subject

### Mathematics

As a mathematical theory always implies that certain conclusions hold under certain given conditions, it can in principle say nothing about the physical reality. None the less mathematics has become an indispensable tool for a large number of subjects like astronomy, physics, chemistry, statistics and the technical sciences and in later times also for economy, biology, various social sciences and computor science. The role of mathematics in the applied sciences is both to supply notions for exact and adequate formulations of empirical laws but also from these laws to derive consequences, which can be used to find better models of the reality one has to describe. These tasks have lately become more important. Mathematics is in continual progress by intensive international research, new theories are created and already existing theories are simplified and augmented.