Lecture 1: Introduction
Teacher: Paul-André Melliès
Models of programming languages: Domains, Categories, Games (M2 MPRI)
Lecture 2: Introduction to Domain theory
Teacher: Paul-André Melliès
Lecture 3: Cartesian closed categories
Teacher: Paul-André Melliès
Execises 2: Stable models of $λ$-calculus
Teacher: Paul-André Melliès
Lecture 4: Simply typed λ-calculus as CCC
Teacher: Paul-André Melliès
Lecture 5: Coherence spaces
Teacher: Paul-André Melliès
Lecture 6: Monoidal Categories
Teacher: Paul-André Melliès
Lecture 7: Step functions and exponential modalities
Teacher: Paul-André Melliès
Lecture 8:
Teacher: Paul-André Melliès
Lecture 9: Lazy PCF
Teacher: Thomas Ehrhard
Execises 3: Coherence spaces and lazy integers
Teacher: Thomas Ehrhard
Lecture 10: Categorical combinators, Categorical Abstract Machines
Teacher: Pierre-Louis Curien
Lecture 11: Categorical model of LL and Eilenberg-Moore category of $!$
Teacher: Thomas Ehrhard
Lecture 12: $PoL$, $PoLR$, $PoC$ categories
Lecture 12
Lecture 13: Scott semantics
Lecture 13
Lecture 14: Sequentiality, Concrete Data Structures
Full Abstraction
Lecture 16: Sequential Algorithms
Lecture 16
Lecture 17: Or-tester, Abstract algorithms
Lecture 17