INF551 – Computational logic: from Artificial intelligence to Zero bugs


Before beginning with the first TD, you are advised to read getting started with OCaml if you are not so familiar with this language.

  1. Typing a simple programming language
  2. Satisfiability of boolean formulas
  3. The λ-calculus
  4. Implementing a propositional prover
  5. Propositional logic in Agda
  6. Inductive types
  7. Sorting