
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,174 Listeners

7,217 Listeners

571 Listeners

507 Listeners

16,019 Listeners

13 Listeners

29 Listeners

63 Listeners