Weighted relational models of typed Lambda-Calculi

J D Laird, Giulio Manzonetto, Guy Mccusker, Michele Pagani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)
135 Downloads (Pure)

Abstract

The category Rel of sets and relations yields one of the simplest denotational semantics of Linear Logic (LL). It is known that Rel is the biproduct completion of the Boolean ring. We consider the generalization of this construction to an arbitrary continuous semiring R, producing a cpo-enriched category which is a semantics of LL, and its (co)Kleisli category is an adequate model of an extension of PCF, parametrized by 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).
Original languageEnglish
Title of host publication2013 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)
Place of PublicationLos Alamitos, California
PublisherIEEE
Pages301-310
Number of pages10
ISBN (Print)9781479904136
DOIs
Publication statusPublished - 1 Jun 2013
Event2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013) - New Orleans, LA, USA, UK United Kingdom
Duration: 25 Jun 201328 Jun 2013

Publication series

NameAnnual IEEE/ACM Symposium on Logic in Computer Science (LICS)
ISSN (Print)1043-6871

Conference

Conference2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013)
CountryUK United Kingdom
CityNew Orleans, LA, USA
Period25/06/1328/06/13

Fingerprint Dive into the research topics of 'Weighted relational models of typed Lambda-Calculi'. Together they form a unique fingerprint.

  • Projects

  • Cite this

    Laird, J. D., Manzonetto, G., Mccusker, G., & Pagani, M. (2013). Weighted relational models of typed Lambda-Calculi. In 2013 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS) (pp. 301-310). (Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)). IEEE. https://doi.org/10.1109/LICS.2013.36