|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Weighted relational models of typed lambda-calculi
If you have a question about this talk, please contact Jonathan Hayman.
The category Rel of sets and relations yields one of the simplest denotational semantics of Linear Logic. Rel can be viewed as the biproduct completion of the Boolean ring. We consider the generalization of this construction to arbitrary continuous semirings, producing categories that provide cpo-enriched models of linear logic akin to Rel, and investigate models of PCF in their co-Kleisli categories. These models contain quantitative information, provided by the elements of the semiring R. Specific instances of R allow us to compare programs not only with respect to “what they can do”, but also “in how many steps” or “in how many different ways” (for non-deterministic PCF ) or even “with what probability” (for probabilistic PCF ).
Joint work with Jim Laird (Bath) and Giulio Manzonetto and Michele Pagani (LIPN, Paris-Nord)
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 listsBioinformatics jounal club for the -omics National Biology Week talks Soft Condensed MatterTermly Meeting
Other talksDeveloping low carbon supply network: an Influence-Measurement-Improvement Framework Spaces of Exile and Solidarity; Conviviality, Contention and Transnational Activism for Zimbabwe 1965-1980 Realising the full potential of single particle cryomicroscopy Chinese sentence final particles and their behaviour in L2 Chinese ‘“Rivers of Blood”: Illustrating Violence and Virtue in Russia’s Early Modern Empire Parodia and Notocactus