riveron Lobsters • Recommends
The Hardest Problem in Type Theory Uniqueness of Identity Proofs
0:00 / 0:00
#typetheory#homotopytypetheory#uniquenessofidentityproofs
The Hardest Problem in Type Theory - Computerphile
Computerphile
2.6M subscribers • 66 videos on Hallway
- Recommended by 1 person: 1 on Lobsters.
- Presented by Thorsten Altenkirch, Professor of Computer Science
Advanced. Deep dive for people who know the field.
140K views5 years ago1 recommendation
Computer scienceProgramming languagesComputation and complexityMath for programmers
Thorsten Altenkirch explains the problem of equality in type theory and how Martin Hofmann solved the uniqueness of identity proofs.
Equality sounds a straightforward idea, but there are subtle problems in theoretical computer science. Professor Thorsten Altenkirch explains how his late friend Martin Hofmann solved one of the biggest problems. More of Thorsten on Type Theory: bit.ly/C_Thor_playlist Thorsten's paper dedicated to Martin: bit.ly/C_Thor_Paper facebook.com/computerphile twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: bit.ly/nottscomputer Computerphile is a sister project to Brady Haran's Numberphile. More at bradyharan.comWhy it's here
1 person recommends thisWhat people say. Recommended for its accessible introduction to the complex mathematical and logical challenges of defining equality in type theory.