Coq: Overview

Related lectures (27)

Page 2 of 3

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 the basics of proof scripting in Coq, focusing on the Ltac language and its tactics for managing proofs effectively.

Delves into the concept of proof in mathematics, emphasizing the importance of evidence and logical reasoning.

Covers the definition of a simple programming language and its big-step semantics, including arithmetic expressions and imperative commands.

Explores the verification of programs using Stainless, focusing on functional correctness, proof assistants, and automation of reasoning tasks.

Discusses inductive propositions, their definitions, and applications in reasoning and evaluation techniques in Coq.

Covers the concept of outer measure and properties of measurable sets.

Explores historical mathematical proofs, decision problems, deductive systems, probabilistic and quantum proofs, and interactive proof systems.

Explores the relationship between logic proofs and programming evidence through the Curry-Howard Correspondence.