Type Theory Forall

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

In this episode me, Eric and Nitin continues our conversation started in the last episode. This time we move our attention to the cool projects happening in Coq, in particular commenting through the projects mentioned in Andrew Appel’s keynote “Coq’s Vibrant Ecosystem for verification engineering” that took place in CPP’22 which is colocated with POPL and towards the end we also talk about agda, idris and Kind. Links Nitin Twitter @NitinJohnRaj2 Eric Twitter @EricBond10 Appel's CPP Talk Proof Assistants Stack Exchange Coq Community Leo de Moura Interview

In this episode I gather with two good friends Eric and Nitin to randomly talk random subjects that pops up. Among them we talked about POPL, Scala, Isabelle, Parametricity, Dependent Object Types (DOT, for short) and more! Links Nitin Twitter @NitinJohnRaj2 Eric Twitter @EricBond10 Collection of links on logical relations Theorems for Free Reynolds Paper Practical Foundations for Programming Languages

This episode is about the journey of a programmer that converted himself into a Haskell developer after working with C/C++ for more than 10years. Here are a few questions that you'll find the answer to in this episode: What does he find so compelling about Haskell? Why did it make him dive deeper into the Theoretical Computer Science? Why did it make him learn Coq and Category Theory? How does Coq compare with ACL2? How do both Coq and ACL2 compares to TLA+? Did learning Coq make John a better programmer? Links John's Email: johnw@newartisans.com John's Twitter: @jwiegley

Talia Ringer is an Assistant Professor at University of Illinois Urbana-Champaign. She did her PhD at University of Washington with her thesis on Proof Repair. She’s very active on twitter @taliaringer. And in this episode we will talk about her transition from PhD to Professor, her work on diversity, her ADHD and how it has affected her career so far, and we also touch on the delicate topic of sexism in academia. Links Talia's Twitter Sigplan Mentoring TIL: a type-directed, optimizing compiler for ML Neuro Divergent in CS Neuro Divergent in CS - Slack Overblur

In this episode we have talk with Alejandro Serrano Mena, he works on 47 degrees and is a published author of two books about Haskell: The Book of Monads and Practical Haskell. We talk about many interesting features behind functional programming such as adts, pattern matching, impredicativity, monads, effects, hacking the ghc and how all this comes together to grab industry attention to adopt functional programming features over the past decade. Links Our new twitter @ttforall Alejandro's twitter Book of Monads Practical Haskell The Haskell Interlude Tweag's youtube channel on the GHC

In this episode we host a discussion between Anupam Das and Thorsten Altenkirch on the role of constructivism in mathematics, logic and computer science. Anupam is a lecturer in the University of Birmingham in the UK, and Thorsten Altenkirch is a CS Professor at the University of Nottingham. We discuss why constructive content in proofs matters, the law of excluded middle, the axiom of choice, category theory, and much more! Links Thorsten's website Anupam's website Thorsten's Book on Python The Proof Theory Blog High School Algebra Stanford Encyclopedia of Philosophy

In this episode I have a nice conversation with Chris Jenkins to talk about the Cedille theorem prover, based on a very concise type theory called CDLE. The main selling point of Cedille is that the theory is so small that the typing rules fit one page. And yet it is strong enough to do relevant theorem proving. This is probably the most technical episode so far. Links Leroy Jenkins Cedille Cast The Iowa Type Theory Commute Cedille Page Github Page

In this episode we dive into Isabelle, the interactive theorem prover based on Higher Order Logic directly from someone who spent quite some time hacking on its internals. Me and Daniel also talk about Mizar, Isar, the seL4, and how it is formalized. Torwards the end of the episode we also talk a little about his current work on the binary analysis of Aarch32 Arm Archtecture at Galois.