University of Cambridge > Talks.cam > Logic & Semantics for Dummies >  Weighted relational semantics for PCF

Weighted relational semantics for PCF

Add 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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