"Propositions as Types" by Philip Wadler

Strange Loop Conference · 42:43 · Watch on YouTube

This talk traces computability from Hilbert's Entscheidungsproblem through Gödel, Church and Turing to Gentzen, arguing that propositions-as-types / proofs-as-programs is a deep discovered correspondence, not an inven...

Read the full summary on retube

한국어