CoRecursive: Coding Stories cover image

Tech Talk: The Little Typer With Daniel Friedman and David Thrane Christiansen

CoRecursive: Coding Stories

00:00

How to Write a Programmable Programmable Theorem

Curry and howard both observed that statements written in intuitionistic logic map directly to types. They also found that normalizing expressions in simply type lemdic calculus corresponds to cut elimination. So not only do we have t every proof corresponds to a programme, but also that writing our proofs out is the same as running them until they're done.

Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app