Experimenting a proof-assistant design based on refinement types: refactoring session
Channel:
Subscribers:
29
Published on ● Video Link: https://www.youtube.com/watch?v=MwtuVhhGFfk
Sound is bad for the first hour or so.
We discover an interesting way to traverse two `Taversable` things in lockstep. Generically.
The code is hosted on github at https://github.com/aspiwack/peppermint-prover/ .
Original video at https://www.twitch.tv/videos/716075047
-- Watch live at https://www.twitch.tv/notnotarnaud
Other Videos By Arnaud Spiwack
Tags:
twitch
programming
mathematics
proof assistant
refinement types
dependent type
functional programming
haskell