#28 Formally Verifying Smart Contracts
February 15th 2023
Pruvendo
#27 Formalizing an OS: The seL4
February 4th 2023
Gerwin Klein
#26 Mechanizing Modern Mathematics
January 16th 2023
Kevin Buzzard
#25 Formally Verifying the Tezos Codebase
November 21st 2022
Formal Land
#24 The History of Isabelle
October 6th 2022
Lawrence Paulson
#23 What is the SIGPLAN?
September 23th 2022
Jens Palsberg and Jonathan Aldrich
#22 Impredicativity, LEM, Realizability and more
August 12th 2022
Cody Roux
#21 Denotational Design
August 4th 2022
Conal Elliott
#20 Huaweii, String Diagrams, Game Semantics
June 27th 2022
Dan R. Ghica
#19 Experience Report: Learning Coq
June 4th 2022
Patrick and Supun
#18 Gödel's Incompleteness Theorems
May 19th 2022
Cody Roux
#17 The Lost Elegance of Computation
May 9th 2022
Conal Elliott
#16 Agda, K Axiom, HoTT, Rewrite Theory
April 2nd 2022
Jesper Cockx
In this episode we interview Jesper Cockx, one of the core developers on Agda. We talk about the philosophy behind Agda, his work on pattern matching, the Uniqueness of Identity of Proofs, UIP for short, and why it is inconsistent with Homotopy Type Theory.
Links
- Jesper’s Website
- Jesper’s Twitter: @agdakx
- Jesper’s PhD Thesis
- Rewrite Theory paper
- Pattern matching without K paper (Check his website for more)
- EuroProofNet
- WITS Talks on Youtube (Workshop on the Implementation of Type Systems)
- Agda Zulip
- Agda Mailing List
- Ataca Github
- Wadler’s book on Agda
- Stump’s book on Agda
Tweet
