
Sign up to save your podcasts
Or


In this episode, I begin discussing the question and history of formalizing results in Programming Languages Theory using interactive theorem provers like Rocq (formerly Coq) and Agda.
By Aaron Stump5
1919 ratings
In this episode, I begin discussing the question and history of formalizing results in Programming Languages Theory using interactive theorem provers like Rocq (formerly Coq) and Agda.

289 Listeners

4,170 Listeners

7,230 Listeners

577 Listeners

576 Listeners

15,950 Listeners

14 Listeners

29 Listeners

65 Listeners