Introduction to Coq: Arithmetic Expressions and Evaluators

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 1 of 3

Introduction to Proof Scripting: Basics of Ltac

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

Inductive Propositions: Understanding Evaluation in Coq

Covers inductive propositions in Coq, focusing on evaluation rules for arithmetic expressions and their applications in defining partial and non-deterministic functions.

Big-step semantics: Defining arithmetic expressions and commands

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

Coq Workshop: Introduction to Interactive Theorem Proving

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

Hoare Logic: Foundations and Applications

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

Logic Programming Techniques: Automated Proof Search and Unification

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

Inductive Propositions: Reasoning and Evaluation Techniques

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

Simply Typed Lambda Calculus: Foundations and Properties

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

Termination Analysis using Dependency Pairs

Explores automated termination analysis using dependency pairs, covering classical and modern techniques, annual competitions, and tools like AProVE.

Propositions as Types: Logic and Programming Correspondence

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