Inductive Propositions: Understanding Evaluation in Coq

Related lectures (28)

Page 1 of 3

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

Covers the basics of Coq, focusing on arithmetic expressions, evaluation, and proof techniques.

Introduces Coq, an interactive theorem assistant based on the Curry-Howard isomorphism.

Covers Hoare Logic, its foundations, applications, and significance in program verification.

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

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

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

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

Covers polymorphism in Coq, focusing on data structures and functions like lists, length, and append.

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