YoVDO

Peter Dybjer - Intuitionistic Type Theory - Lecture I

Offered By: Hausdorff Center for Mathematics via YouTube

Tags

Theoretical Computer Science Courses Mathematics Courses Dependent Types Courses

Course Description

Overview

Explore the foundations of Intuitionistic Type Theory in this comprehensive lecture by Peter Dybjer, delivered as part of the Hausdorff Trimester Program: Types, Sets and Constructions. Delve into the historical context and key concepts of this mathematical framework, including types, applications, material systems, and type systems. Examine the role of recursion combinators, paper formats, and System E in the development of the theory. Investigate dependent types, existential quantification, and the concept of the universe within Intuitionistic Type Theory. Analyze free systems, the abortion of choice, and various models. Gain insights into the openness of this theoretical approach and its implications for mathematical reasoning and computation.

Syllabus

Introduction
Historical Intuitionistic Type Theory
Types
Application
Material System
Type System
Recursion Combinator
Paper Format
System E
Dependent Types
Existential Quantification
What is the Universe
Intuitionistic Type Theory
Free Systems
Abortion of Choice
Models
Openness


Taught by

Hausdorff Center for Mathematics

Related Courses

Automata Theory
Stanford University via edX
Intro to Theoretical Computer Science
Udacity
Computing: Art, Magic, Science
ETH Zurich via edX
理论计算机科学基础 | Introduction to Theoretical Computer Science
Peking University via edX
Quantitative Formal Modeling and Worst-Case Performance Analysis
EIT Digital via Coursera