Lectures related to Agda (programming language)

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: Overview

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

Inductive Propositions: Reasoning and Evaluation Techniques

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

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.

Logic Programming Techniques: Automated Proof Search and Unification

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

Verifying Programs with Stainless

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

Propositions as Types: Logic and Programming Correspondence

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

Data Abstraction: Modules and Specifications in Coq

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

LISA proof assistant: Formalisation and Verification

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

Coq Workshop: Inductive Data Types and Proofs

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

Introduction to Coq: Arithmetic Expressions and Evaluators

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

Polymorphism in Coq: Data Structures and Functions

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

Hoare Logic: Foundations and Applications

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

Automated Reasoning: Formal Verification with LISA

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

Untitled

Proofs and Computations: A Journey Through Mathematical Theory

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

Untitled

Lie Algebra: Representations

Explores Lie algebra representations, emphasizing SU(2) and traceless matrices, explained by Alfredo Glioti.