Philip Wadler - Propositions as Types (Lambda Days 2016)

Channel:Erlang Solutions · Length:56:58 · Published:2016-03-02 · Views:20211

Watch on YouTube

Summary

Philip Wadler's Lambda Days talk on propositions as types, the link between logic and computation that underlies theorem provers and programming language design.

Why HN recommends it

Recommended as an exceptional whirlwind tour of the foundations of computer science.

This is a very good lecture series[4]. — HN, 2021

Programming language design · Functional programming · Logic & formal methods

Subtitles (excerpt)

let me do the important thing first smile I wanted to do that because this is absolutely an amazing audience how nice to come to krao and see a room full of smiling eager faces so um I'd like you to all give yourselves a round of applause this is really amazing so thank you to the organizers for inviting me and thank you to you for showing up and are you ready to learn about the hilarious subject of computability theory see I told you it was hilarious so let's do this an algorithm is a sequence of instructions executed by a computer now today we think of a computer as a machine but computer used to be the name for a person the man or the woman who executed the algorithm algorithms can be found in ucd's elements in Classical Greece and aonly in the work of Alaris in 9 Century Persia but it wasn't until the 20th century that we get a formal definition of algorithm when proposals by Alonzo Church Kurt girdle and Alan Turing all appeared within a year of each other it's like buses you wait 2,000 years for a formal definition of 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 he had a

On Hacker News

I suggest a combination of theory (videos/books/papers) and practice. For practice; I highly recommend learning Haskell. If you are new to functional programming then learning Haskell is challenging and frustrating but as with any new topic the key is to not give up but keep probing. A good recent development is lot of mainstream languages are beginning to include functional paradigms such as lam… — vishnugupta, 2021-05
> Neither is static typing. It's a layer of protection, much like tests. Not true. The curry-howard correspondence shows the relationship between typed programs and proofs. I recommend you watch a Phillip Wadler talk about this: [VIDEO] Note: This doesn't mean that type systems can prove _all assertions_ about a program, but type systems do indeed work as provers. > I don't think that's necessari… — knucklesandwich, 2016-05
just to note this talk briefly alludes to another subject, the Curry–Howard isomorphism, something Philip Wadler had similarly given a talk about at Lambda Days (2016) titled 'Propositions as Types'[1] (slides [2] and the video recording[3]). [1]: [LINK] [2]: [LINK] [3]: [VIDEO] — irfansharif, 2017-04

Related videos