HackerTube 中文?

"Propositions as Types" by Philip Wadler

Strange Loop ConferenceYouTube ↗

Further reading 1

What can a language express, and what can it guarantee? →Factorial can be written without naming the function. That trick raises a harder question: if every program must terminate, can unrestricted recursion be allowed? Take that distinction into slides, libraries and language extensions.This video helps answer · Can anonymous functions recurse and still guarantee termination?

Caption notes

Under Curry–Howard, propositions correspond to types and proofs to programs. Wadler shows the parallel between simplifying proofs and evaluating terms.

Original passages · 6
need a formal definition of algorithm so you can show that no algorithm is going to work
"Propositions as Types" by Philip Wadler · ▶ 4:17–4:27
proofs in the logic correspond to terms programs in the programming language
"Propositions as Types" by Philip Wadler · ▶ 23:07–23:51
if you've typed it and you're not using What's called the fixo operator that is unlimited General recursion
"Propositions as Types" by Philip Wadler · ▶ 21:57–22:07
linear Logic on the left seems to correspond to things called session Types
"Propositions as Types" by Philip Wadler · ▶ 38:07–38:33
an algorithm is a sequence of instructions followed by a computer
"Propositions as Types" by Philip Wadler · ▶ 0:16–0:27
propositions in logic correspond to types in a programming language
"Propositions as Types" by Philip Wadler · ▶ 23:07–23:24

Hacker News comments

View original on HN ↗