University of Cambridge > Talks.cam > Logic & Semantics for Dummies > Agda: a practical tutorial

Agda: a practical tutorial

Add 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity