Lightning Talk: Curry-Howard Correspondence
summary
Shows the Curry–Howard mapping by encoding propositions as types and proofs as programs, using C++ templates and constexpr functions to build a tiny type-level proof checker. Implements implication and product types, gives two concrete examples (an implication proof and a pair introduction/elimination) that compile as evidence, and reports compile-time checking works for these small cases. Demonstrates reduction via a simple lambda-calculus evaluator and a few lines of runnable C++ code.
AI-written summary · about
related talks
01h 12mTruth about Types
55mProving Theorems and Certifying Programs with Coq
57mPropositions as Types
43mPropositions as Types
41mWar Time Proofs and Futuristic Programs
13mTyped Abstractions for Causal Probabilistic Programming
59mA Welcome to Causal Probabilistic Programming
38mPropositions as Types for Beginners in Haskell