Weighted Relational Models of Typed Lambda-Calculi

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science S. 301 - 310
Hauptverfasser: Laird, Jim, Manzonetto, Giulio, McCusker, Guy, Pagani, Michele
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.01.2013
Schlagworte:
Coherence
Computational modeling
denotational semantics
Equalizers
Games
lambda-calculus
linear logic
Probabilistic logic
quantitative semantics
Semantics
Tensile stress
ISBN:1479904139, 9781479904136
ISSN:1043-6871
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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).
ISBN:1479904139
9781479904136
ISSN:1043-6871
DOI:10.1109/LICS.2013.36