Proving the Undecidability of Higher-Order Unification in Coq 🧠
Explore Simon Spies' presentation at CPP'20, where he formalizes the undecidability of higher-order unification using Coq, shedding light on fundamental limits in automated reasoning.
ACM SIGPLAN
264 views • Jan 20, 2020
About this video
Presenter: Simon Spies
Presented at CPP'20, colocated with POPL 2020.
Presented at CPP'20, colocated with POPL 2020.
Video Information
Views
264
Likes
4
Duration
20:40
Published
Jan 20, 2020
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now