Lecture

Propositions as Types: Logic and Programming Correspondence

Related lectures (30)

Concept of Proof in Mathematics

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

Introduction to Coq: Arithmetic Expressions and Evaluators

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

Hoare Logic: Foundations and Applications

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

Termination Analysis using Dependency Pairs

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

Introduction to Types and Inductive Relations

Explores the significance of types in programming and discusses unsound type systems and inductively defined relations.

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.

Lambda Calculus and Type Safety: An Overview

Provides an overview of lambda calculus, type safety, and type inference in programming languages.

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.

Propositional Logic: Basics and Applications

Covers the basics of propositional logic, its history, language, and computing applications.

Records and Variants

Introduces records, variants, evaluation rules, typing rules, aliasing challenges, and benefits in programming languages.

Variables & Operators

Covers the basics of C programming, including variables, operators, and system-oriented programming, emphasizing differences from Java.

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.

Taming Null References

Explores the challenges of null references in programming languages and proposes solutions to mitigate their drawbacks while ensuring compatibility with existing codebases.

Propositions and Proofs

Explores propositions, proofs, and contraposition in mathematical theory, emphasizing logical rules and proof methods.

Sequent Calculus: Basics and Applications

Covers the basics and applications of Sequent Calculus in Logic and Proof Theory, including Cut Elimination and practical proof analysis.

Variables and Types: Introduction to C Programming

Introduces the fundamentals of variables and types in C programming, covering declaration, initialization, and the differences from Java.

Logic: Proof Techniques

Explores proof techniques in logic, demonstrating how to prove or disprove propositions using negations and assumptions.

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.

Coq Workshop: Introduction to Interactive Theorem Proving

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

Solving Type Constraints

Explains the process of solving type constraints using the unification algorithm and generalization for flexible type inference.