Lectures related to Matita | EPFL Graph Search

Introduces Coq and focuses on proving the theorem and_comm step by step.

Covers logic programming concepts, focusing on automated proof search and unification techniques in Coq.

Introduces the basics of proof scripting in Coq, focusing on the Ltac language and its tactics for managing proofs effectively.

Covers the LISA proof assistant's codebase organization, kernel package, FOL formalization, and proof package.

Covers the definition of an inductive data type in Coq and how to build proofs interactively using tactics.

Discusses data abstraction in programming, focusing on modules and specifications in Coq.

Introduces Coq, covering defining propositions, proving theorems, and using tactics.