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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

Weighted relational semantics for PCF

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 lists

Christ's College Chapel https://us02web.zoom.us/j/89975312802?pwd=dkpvc0M3RGhtY1JOUm5Hc1dCNm9IZz09 Meeting ID: 899 7531 2802 Passcode: 945323 Average on weekdays: 9068.06738132 kWh

Other talks

Afternoon Break TBC Cambridge AI in Medicine Seminar - July 2026 Studying viruses to understand what makes pandemic viruses special and how innate immunity works Fun experiments you can only do with frogs Synthesizing Diverse Policies for Multi-Agent Coordination
 

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