University of Cambridge > > Trinity Mathematical Society > Dependent Type Theory - Proving Theorems by Writing Programs

Dependent Type Theory - Proving Theorems by Writing Programs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mary Fortune.

Part of the TMS Symposium

A quick tutorial about writing programs in Agda, a language with dependently typed values. In Agda we can write a program, and then a mathematical proof that the program behaves correctly, in exactly the same language, through the magic of dependent types.

This talk is part of the Trinity Mathematical Society series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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