COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
Agda: a practical tutorialAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Nathanael Arkor. Ever get the feeling that you don’t quite believe your own proofs? Wouldn’t it be nice if there was some infallible person always available to check them for you? Well, help is on hand: Agda is a dependently-typed language in which you can write both classical functional programs and mathematical proofs. By the Curry–Howard correspondence, Agda is capable of deciding if your proof is correct by type-checking your Agda program. This talk will go through the basics of getting started in Agda, provide an introduction to the standard library and will involve some (dangerously) live coding. This talk is part of the Logic & Semantics for Dummies series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsRequired lists for MLG Computer Vision Reading Group @ CUED AMOP Quantum Journal ClubOther talksTaking the planet to the IMAX: Diving into the volcano and other stories T.H.E. G.A.P.P.P, i.e. (re) Thinking Human Evolution: Gorongosa African Paleo-Primate Project Cross-Species Genetic Mapping of Targets in Mitochondria, Metabolism and Aging Fractionating the human frontoparietal cortex: Combining meta-analytic and real-time optimization approaches The Absolute Faker: The Extraordinary Adventures of a Russian Con Man in the Land of the Capitalists |