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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science s. 301 - 310
Hlavní autoři: Laird, Jim, Manzonetto, Giulio, McCusker, Guy, Pagani, Michele
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.01.2013
Témata:
Coherence
Computational modeling
denotational semantics
Equalizers
Games
lambda-calculus
linear logic
Probabilistic logic
quantitative semantics
Semantics
Tensile stress
ISBN:1479904139, 9781479904136
ISSN:1043-6871
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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