Type Theory Forall is a podcast about Type Theory and Programming Language research in general. We interview relevant people in our field.
#28 Formally Verifying Smart Contracts - Pruvendo
1:10:40In this episode we host another company that does formal method in the context of the Everscale Blockchain, and Solidity smart contracts. How and why they use formal methods in this context? Who are their clients? What are the caveats? Links Pruvendo’s Website Pruvendo’s Linkdin Pruvendo’s Twitter
#27 Formalizing an OS: The seL4 - Gerwin Klein
1:58:40In this episode talk with Gerwin Klein about the formal verification of the microkernel seL4 which was done using Isabelle at NICTA / Data61 in Australia. We also talk a little about his PhD Project veryfing a piece of the Java Virtual Machine. Links Gerwin’s Twitter Gerwin’s Website ProofCraft’s Website
Gå ikke glip af nogen episoder af “Type Theory Forall” - abonnér på podcasten med gratisapp GetPodcast.
#26 Mechanizing Modern Mathematics - Kevin Buzzard
2:15:31Kevin Buzzard has been very passionate spreading the word among mathematicians to use theorem provers mechanize theorems of modern mathematics. In this conversation we will talk about his vision in teaching undergrads to use the Lean theorem prover, what is the Xena Project, his view of how theorem provers can change the way we do mathematics, and much more! Links Xena’s Project Twitter Xena Project’s Website Lean’s Website
#25 Formally Verifying the Tezos Codebase - Formal Land
1:01:32In this episode we partner with Formal Land, a company that works in formally verifying the Tezos codebase! I have worked with them in the past developing new features to their source-to-source compiler CoqOfOcaml. In this episode we talk about their work with Tezos and how their techniques are applicable to other codebases as well! For this we talk with Formal Land founder Guillaume Claret and the proof engineers Daniel Hilst and Pierre Vial. Links Formal Land Website Formal Land Email: [email protected] Formal Land Twitter: @LandFooBar CoqOfOcaml The DAO hack
#24 The History of Isabelle - Lawrence Paulson
1:38:02In this episode we interview Lawrence Paulson, one of the creating fathers of Isabelle. We talk about the development process, how it drew inspirations and ideas from LCF and Boyer Moore. What tools were used, it’s strenghts and weaknesses, and all about the historical context at the time! We also briefly talk about his formalization of the Gödel’s Incompletenes theorems in Isabelle Paulson have quite an extensive CV, he is a professor at Cambridge, have published more than 100 papers, is an ACM fellow since 2008, is a member of the royal society since 2017, among many other things! Links Larry’s Website Larry’s Twitter Larry’s Blog
#23 What is the SIGPLAN? - Jens Palsberg and Jonathan Aldrich
1:13:05In this episode we talk about Sigplan, the organization behind the most important conferences and proceedings in our field. What is the SIGPLAN? What exactly does it do? How is it organized? How are things published? To answer these and many other questions we talk with Jens Palsberg, a professor at UCLA, who is the past chair of the SIGPLAN. And also Jonathan Aldrich, a professor at the CMU, who is a member of the ACM publication board. Links Jen’s Website Jonathan’s Website Jonathan’s Twitter Sigplan Blog Post on Hybrid Conferences SIGPlAN-M Mentoring Program
#22 Impredicativity, LEM, Realizability and more - Cody Roux
2:19:23In this episode Cody Roux teaches some interesting concepts that people care about in Mathematics and Logic as a way to try to understand what is going on in the universe around us! In particular we will try to explain concepts such as Impredicativity, Excluded Middle, Group Theory, Model Theory, Kripke Models, Realizability, The Markov Principle, Cut Elimination, and other stuff! Links Cody’s website Cody’s dblp
#21 Denotational Design - Conal Elliott
3:07:26In this episode Conal Elliott gives a more concrete presentation on what is Denotational Design is and how to use it in practice. It is a continuation of episode #17, in which we had an in-depth philosophical conversation to explain why he believes that Denotational Design is a superior form of reasoning in the realm of computer science. We also continue a discussion raised by Dan Ghica on the last episode on the need for Operational Semantics and the role of elegance in reasoning and design. Along the way we also address the questions sent by the listeners in these last episodes. Links Conal’s website Play/work with Conal Conal’s twitter: @conal The simple essence of automatic differentiation Compiling to categories Generic parallel functional programming Denotational design with type class morphisms Quotes “A theory appears beautiful or elegant […] when it’s simple; in other words when it can be expressed very concisely in terms of mathematics that we’ve already learned for some other reasons.” - Murray Gell-Mann, Beauty and Elegance in Physics. “In Galileo’s time, professors of philosophy and theology—the subjects were inseparable—produced grand discourses on the nature of reality, the structure of the universe, and the way the world works, all based on sophisticated metaphysical arguments. Meanwhile, Galileo measured how fast balls roll down inclined planes. How mundane! But the learned discourses, while grand, were vague. Galileo’s investigations were clear and precise. The old metaphysics never progressed, while Galileo’s work bore abundant, and at length spectacular, fruit. Galileo too cared about the big questions, but he realized that getting genuine answers requires patience and humility before the facts.” - Frank Wilczek, (The Lightness of Being: Mass, Ether, and the Unification of Forces) “We must make here a clear distinction between belief and faith, because, in general practice, belief has come to mean a state of mind which is almost the opposite of faith. Belief, as I use the word here, is the insistence that the truth is what one would ‘lief’ or wish it to be. The believer will open his mind to the truth on the condition that it fits in with his preconceived ideas and wishes. Faith, on the other hand, is an unreserved opening of the mind to the truth, whatever it may turn out to be. Faith has no preconceptions; it is a plunge into the unknown. Belief clings, but faith lets go. In this sense of the word, faith is the essential virtue of science, and likewise of any religion that is not self-deception.” - Alan Watts (The Wisdom of Insecurity: A Message for an Age of Anxiety)
#20 Huaweii, String Diagrams, Game Semantics - Dan R. Ghica
1:37:28In this episode, me and Eric Bond have a great conversation with Dan R. Ghica, a professor at Birmingham University and Director of the Programming Language Research Lab of the Huaweii Research Centre Edinburgh. We talk about his work on both institutions, which includes topics such as Category Theory, String Diagrams, and Game Semantics. We also briefly discuss the current publication process of our field and entertain some thoughts on how to make it better. Finally, we touch on more personal topics such as his views about Elegance, making an insightful counterpoint to Conal’s opinions on Denotational Semantics vs. Operational Semantics. Links Dan’s Twitter: @danghica Dan’s Website Job advert for Huawei positions Talks and Lectures Dan’s talk on Syntactic Trinitarianism (terms, graphs, diagrams) Dan’s talk on a similar, more semantics-oriented talk at TERMGRAPH Dan’s OPLSS course on (denotational) game semantics Game semantics lectures Papers Paper on string diagrams and their applications to reverse automatic differentiation (long paper, part of it to appear in FSCD 2020) Paper on automatic differentiation and string diagrams Paper on effect handlers Paper on optimisation with constructive reals Paper on digital circuits and string diagrams Paper on functorial boxes for string diagrams A Game semantics paper mentioned during the conversation Decidability via game semantics Landmark paper on undecidability of observational equivalence Other Links Penrose book Book on type-level string diagrams Proof assistant for higher categories The Programming Journal Midlands Graduate School
#19 Experience Report: Learning Coq - Patrick and Supun
1:51:39In today’s episode I invite two friends of mine Patrick Lafontaine and Supun Abeysinghe. We will talk about their experience learning Coq and we guide ourselves in a survey that I gave all the 83 students in the class. The class was thought by my advisor Benjamin Delaware and I was his TA. Patrick researches compilers and have done work in particular with Rust. And Supun works more along the lines of machine learning in the context of systems.