### Abstract

Language | English |
---|---|

Title of host publication | 2013 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS) |

Place of Publication | Los Alamitos, California |

Publisher | IEEE |

Pages | 301-310 |

Number of pages | 10 |

ISBN (Print) | 9781479904136 |

DOIs | |

Status | Published - 1 Jun 2013 |

Event | 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013) - New Orleans, LA, USA, UK United Kingdom Duration: 25 Jun 2013 → 28 Jun 2013 |

### Publication series

Name | Annual IEEE/ACM Symposium on Logic in Computer Science (LICS) |
---|---|

ISSN (Print) | 1043-6871 |

### Conference

Conference | 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013) |
---|---|

Country | UK United Kingdom |

City | New Orleans, LA, USA |

Period | 25/06/13 → 28/06/13 |

### Fingerprint

### Cite this

*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)). Los Alamitos, California: IEEE. DOI: 10.1109/LICS.2013.36

**Weighted relational models of typed Lambda-Calculi.** / Laird, J D; Manzonetto, Giulio; Mccusker, Guy; Pagani, Michele.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2013 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS).*Annual IEEE/ACM Symposium on Logic in Computer Science (LICS), IEEE, Los Alamitos, California, pp. 301-310, 2013 Twenty-Eighth Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013), New Orleans, LA, USA, UK United Kingdom, 25/06/13. DOI: 10.1109/LICS.2013.36

}

TY - GEN

T1 - Weighted relational models of typed Lambda-Calculi

AU - Laird,J D

AU - Manzonetto,Giulio

AU - Mccusker,Guy

AU - Pagani,Michele

PY - 2013/6/1

Y1 - 2013/6/1

N2 - 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).

AB - 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).

UR - http://dx.doi.org/10.1109/LICS.2013.36

U2 - 10.1109/LICS.2013.36

DO - 10.1109/LICS.2013.36

M3 - Conference contribution

SN - 9781479904136

T3 - Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)

SP - 301

EP - 310

BT - 2013 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS)

PB - IEEE

CY - Los Alamitos, California

ER -