University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Computational content of coinductive proofs (Interest Group in Formal Mathematics)

  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

Computational content of coinductive proofs (Interest Group in Formal Mathematics)

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

If you have a question about this talk, please contact Mustapha Amrani.

Semantics and Syntax: A Legacy of Alan Turing

2012/03/15

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge Comparative Syntax Conference (CamCoS) Paediatric Endocrinology & Diabetes Postgraduate Seminar series India in the Global Age

Other talks

Cambridge - Corporate Finance Theory Symposium September 2017 - Day 1 Finding alternatives: when circumstances suddenly change Description: Olfaction of biologically relevant vapors by secondary electrospray ionization mass spectrometry Why Do We Need Another Biography of Hitler? Mandatory Madness: Colonial Psychiatry and British Mandate Palestine, 1920-48 Slaying (or at least taming) a dreadful monster: Louis de Serres' treatise of 1625 for women suffering from infertility A rose by any other name Formation and disease relevance of axonal endoplasmic reticulum, a "neuron within a neuron”. Graded linearisations for linear algebraic group actions 70th Anniversary Celebration An intellectual history of the universal basic income
 

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