Loengute materjalid / Lectures

  • 05.09 - [VV] Introduction, untyped λ-calculus
  • 07.09 - [VV] Untyped λ-calculus (cont.)
  • 12.09 - [VV] Simply-typed λ-calculus
  • 14.09 - [VV] Simply-typed λ-calculus (cont.)
  • 26.09 - [VV] Propositional logic
  • 28.09 - [VV] Curry-Howard correspondence, 1st- and 2nd-order predicate logic
  • 03.10 - [VV] Second-order λ-calculus
  • 12.10 - [VV] Second-order λ-calculus (cont.)
  • 17.10 - [JC] Introduction to dependently typed programming
  • 18.10 - [JC] Agda syntax and basic definitions
  • 19.10 - [JC] Agda syntax and basic definitions (cont.)
  • 19.10 - [JC] Lab
  • 24.10 - [VV] Type inference; Hindley-Milner type system
  • 26.10 - [VV] Hindley-Milner type system (cont.)
  • 31.10 - [JC] Pairs and vectors
  • 01.11 - [JC] Finite sets; inductively defined relations
  • 02.11 - [JC] Propositional logic
  • 02.11 - [JC] Lab
  • 07.11 - [VV] The λ-cube; pure type systems
  • 14.11 - [JC] Reasoning about programs
  • 15.11 - [JC] Predicate logic
  • 16.11 - [JC] Lab
  • 16.11 - [JC] Lab
  • 21.11 - [VV] The λ-cube; pure type systems (cont.)
  • 23.11 - [VV] The λ-cube; pure type systems (cont.)
  • 28.11 - [JC] Programming language semantics
  • 29.11 - [JC] Working with well scoped and well typed syntax
  • 30.11 - [JC] Evaluating, renaming and substituting lambda terms
  • 30.11 - [JC] Lab
  • 05.12 - [VV] Subtyping
  • 07.12 - [VV] Subtyping (cont.)
  • 12.12 - [VV] Featherweight Java
Sidebar
Page edit