 |
Communication dans un congrès
Weighted Relational Models of Typed Lambda-Calculi
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).
https://hal-univ-paris13.archives-ouvertes.fr/hal-01144064
Contributeur : Giulio Manzonetto Connectez-vous pour contacter le contributeur
Soumis le : lundi 20 avril 2015 - 17:54:44
Dernière modification le : mardi 8 décembre 2020 - 09:51:09
Contributeur : Giulio Manzonetto Connectez-vous pour contacter le contributeur
Soumis le : lundi 20 avril 2015 - 17:54:44
Dernière modification le : mardi 8 décembre 2020 - 09:51:09
Lien texte intégral
