![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Context Equivalences and Metrics in Probabilistic Lambda-Calculi
Context Equivalences and Metrics in Probabilistic Lambda-CalculiAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Dominic Mulligan. Probabilistic models are more and more pervasive in computer science, and randomized algorithms are the ones offering the best performances in many domains. Higher-order probabilistic computation ā in which probabilistic functions may be passed as a parameters and returned as results ā is on the other hand a relatively underdeveloped field, which is however receiving more and more attention. We give a survey of what is known about the probabilistic lambda-calculi, later focusing on some of our recent results on coinductive techniques for proving program equivalent and for evaluating their distance. Finally, we hint at how all this could be useful when structuring proofs of security for cryptographic primitives. This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsVisual Rhetoric and modern South Asian History, Michaelmas 2017 CRASSH Gut feeling: how bacteria influence our wellbeingOther talksThe homelands of the plague: Soviet disease ecology in Central Asia, 1920sā1950s HE@Cam Seminar: Christian Hill - Patient Access Scheme, Managed Access Agreements and their influence on the approval trends on new medicines, devices and diagnostics Climate Change: Protecting Carbon Sinks Constructing datasets for multi-hop reading comprehension across documents Carers and Careers: The Impact of Caring on Academic Careers Improving on Nature: Biotechnology and the Ethics of Animal Enhancement |