"Propositions as Types" by Philip Wadler

Channel:Strange Loop Conference · Length:42:43 · Published:2015-09-26 · Views:143868

Watch on YouTube

Summary

Philip Wadler's Strange Loop talk on Propositions as Types, the link between logic and computation (the Curry-Howard correspondence). He traces its history through Church, Godel and Turing and shows how it shaped theorem provers and programming languages.

Why HN recommends it

HN regards it as an entertaining and eye-opening introduction to why logic and functional programming are connected, and it is a frequent pick in favorite-tech-talk threads.

best ~40 minutes I've ever spent. — HN, 2017

Programming language design · Computability & complexity theory · Logic & formal methods

Subtitles (excerpt)

are you ready to learn about the hilarious subject of computability [Applause] theory an algorithm is a sequence of instructions followed by a computer now you all think of computers as machines but for an awful long time what a computer meant was a person the person who executed the algorithm algorithms go back to ID's elements in Classical Greece and to eponymously Alaris in 9th century Persia but a formal mathematical definition doesn't appear until the 20th century when you have proposals by Alonzo Church Kurt girdle and Alan Turing all appearing within a year of each other it's like buses you wait 2,000 years for a definition of effective computability and then three come along at once why did this happen so at the dawn of the 20th century one of the foremost proponents of formal logic was David Hilbert in goodan and what he wanted to do was put all mathematicians out of business what he wanted was an algorithm that given a statement in formal logic would determine if that statement was true or false this was called the an problem because it sounds a lot better in German it just means decision problem and what Hilbert was depending upon was the idea that logic is complete meaning every provable statement is true and every true statement

On Hacker News

Professor Philip Wadler has a fantastic talk titled "Propositions as Types" that introduces the Curry-Howard correspondence, some history behind it and ideas following it. In fact it's one of my favorite talks. Well worth a watch if you haven't seen it: [VIDEO] — jgautsch, 2018-08
curry-howard and Wadler's "Propositions as Types" talk at StrangeLoop* opened my eyes pretty early on to the sweet, sweet utility of logic in my every day programming. it sounds odd to start with but I never realized why these things mattered prior to viewing this talk. props to wadler. best ~40 minutes I've ever spent. * [VIDEO] — imode, 2017-01
Propositions as Types: [VIDEO] I think this can really really change how we look at everyday programming tasks everywhere from the type of tooling we choose to how we approach problems. — runT1ME, 2016-10
+1 Probably my favorite talk at Strange Loop this year. It's worth watching just for the minute or so starting here: [VIDEO] — jcox92, 2015-11
This is nice and genuinely entertaining [VIDEO] (Propositions as types by phil wadler). Its true focus is the 1-1 mapping between type systems and logic systems, but it's well worth the watch. This is good reading - it demystifies the funny typing rules in their mathematical form. [LINK] (Neither of these tell you how to implement the checker yourself though) — mrkeen, 2024-06

Related videos