YoVDO

Explicit Refinement Types - A Type Theory with Embedded Proofs

Offered By: ACM SIGPLAN via YouTube

Tags

Type Theory Courses Functional Programming Courses Proof Theory Courses Formal Verification Courses SMT Solvers Courses Lambda Calculus Courses Denotational Semantics Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a groundbreaking presentation from the ICFP 2023 conference on Explicit Refinement Types. Delve into the innovative λert type theory, which introduces refinement types with explicit proofs. Learn how this system empowers programmers to embed property proofs directly into program text, supporting a rich logic including quantifiers and induction. Discover the advantages of this approach over traditional SMT solver-based systems like DML and Liquid Haskell. Examine the soundness of the type system through erasure to simply-typed programs and denotational semantics. Gain insights into the formalized proofs developed in Lean 4. Presented by Jad Elkhaleq Ghalayini and Neel Krishnaswami from the University of Cambridge, this 29-minute video offers a deep dive into advanced concepts in refinement types, first-order logic, and denotational semantics.

Syllabus

[ICFP'23] Explicit Refinement Types


Taught by

ACM SIGPLAN

Related Courses

Functional Programming Principles in Scala
École Polytechnique Fédérale de Lausanne via Coursera
Functional Program Design in Scala
École Polytechnique Fédérale de Lausanne via Coursera
Paradigms of Computer Programming
Université catholique de Louvain via edX
Introduction to Functional Programming
Delft University of Technology via edX
Paradigms of Computer Programming – Fundamentals
Université catholique de Louvain via edX