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 & Semantics for Dummies > Weighted relational semantics for PCF
Weighted relational semantics for PCFAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Ian Orton. I will start with the category of sets and relations, and show how from it we can derive a model for the functional language PCF . I will then present a generalised version of the model where morphisms carry weights. In this new category we can give semantics to extensions of PCF with various additional features, for example probabilistic or non-deterministic primitives. It will be helpful to know some category theory and be familiar with basic operational semantics of programming languages. 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 listsIoA Stellar Pops Directions in Research Talks Druggability and the Genome (EBI, Hinxton, 4th February 2008)Other talksMysteries of the solar chromosphere explored using the high-resolution observations NatHistFest: the 99th Conversazione and exhibition on the wonders of the natural world. Cambridge-Lausanne Workshop 2018 - Day 1 Surface meltwater ponding and drainage causes ice-shelf flexure High-Dimensional Collocation for Lognormal Diffusion Problems |