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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

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

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.

Other lists

neuroscience Cambridge Energy Conference Darwin Society

Other talks

"Mechanosensitive regulation of cancer epigenetics and pluripotency" Beacon Salon # 8 The Dawn of the Antibiotic Age Ancient DNA studies of early modern humans and late Neanderthals Hornby Model Railways Lipschitz Global Optimization Microsporidia: diverse, opportunistic and pervasive pathogens The role of the oculomotor system in visual attention and visual short-term memory Asclepiadaceae Sneks long balus Investigating the Functional Anatomy of Motion Processing Pathways in the Human Brain EU LIFE Lecture - "Histone Chaperones Maintain Cell Fates and Antagonize Reprogramming in C. elegans and Human Cells" Prescribing step counts in type 2 diabetes and hypertension:Results of the Step Monitoring to improve ARTERial health trial
 

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