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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Agda: a practical tutorial

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 lists

SPIE Cambridge Student Chapter Average on weekdays: 9210.55857488 kWh https://zoom.us/j/92316143946?pwd=RmFpcnlrNWkrUldWbzZRazhxRjM2QT09

Other talks

Unveiling the curtain with ukubuyisa or go lata: complicated roles of museums and nation states in the cultural repatriation discourse and practice in southern Africa Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Title abstract tbc Cooperation for Nature CSaP Annual Cleevely Lecture 2026 Chemical strategies for biomolecule functionalisation, and biomaterial conjugation
 

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