QR-kod

QRB-Domains and the Probabilistic Powerdomain

Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages. We relax the question, and look for quasi-co...

Full beskrivning

Sparad:
Bibliografiska uppgifter
Huvudupphov: Jean Goubault-Larrecq
Materialtyp: Artigo
Språk:Inglês
Utgiven: Logical Methods in Computer Science e.V. 2012-02-01
Serie:Logical Methods in Computer Science
Ämnen:
Länkar:https://lmcs.episciences.org/956/pdf
Taggar: Lägg till en tagg
Inga taggar, Lägg till första taggen!