[CoqPL'24] Mastering Well-Founded Recursion for Reliable Formal Proofs 🔍
Discover how to implement well-founded recursion correctly in Coq with insights from Xavier Leroy. Learn about advanced techniques to define non-structural recursive functions with confidence.
![[CoqPL'24] Mastering Well-Founded Recursion for Reliable Formal Proofs 🔍](https://i.ytimg.com/vi/4jLQh013pJU/default.jpg)
ACM SIGPLAN
155 views • Jun 17, 2024
![[CoqPL'24] Mastering Well-Founded Recursion for Reliable Formal Proofs 🔍](https://www.ostreamhub.com/image/i.ytimg.com/vi/4jLQh013pJU/maxresdefault.jpg)
About this video
[CoqPL'24] Well-founded recursion done right
Xavier Leroy
Several Coq libraries and extensions support the definition of non-structural recursive functions using well-founded orderings for termination. After pointing out some drawbacks of these existing approaches, we advocate going back to the basics and defining recursive functions by explicit structural induction on a proof of accessibility of the principal recursive argument.
Xavier Leroy
Several Coq libraries and extensions support the definition of non-structural recursive functions using well-founded orderings for termination. After pointing out some drawbacks of these existing approaches, we advocate going back to the basics and defining recursive functions by explicit structural induction on a proof of accessibility of the principal recursive argument.
Video Information
Views
155
Likes
6
Duration
21:03
Published
Jun 17, 2024
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.