Coq

Related lectures (29)

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

Explores formal verification using the LISA proof assistant and the OCBSL Equivalence Checker.

Explores practical automated reasoning systems like TPTP, TSTP, and CASC, emphasizing the importance of consistency and future developments.

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

Covers the simply typed lambda calculus, focusing on its syntax, semantics, and type system properties such as progress and preservation.

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

Introduces Stainless, an open-source tool for verifying Scala programs, covering language, modeling, verification tips, and inner workings.

Page 2 of 2