Weighted Relational Models of Typed Lambda-Calculi - Université Sorbonne Paris Nord Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

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

Dates et versions

hal-01144064 , version 1 (20-04-2015)



Jim Laird, Manzonetto Giulio, Guy Mccusker, Michele Pagani. Weighted Relational Models of Typed Lambda-Calculi. 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013, Jun 2013, New Orleans, LA, United States. ⟨10.1109/LICS.2013.36⟩. ⟨hal-01144064⟩
70 Consultations
0 Téléchargements



Gmail Facebook X LinkedIn More