QR-koodi

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

Täydet tiedot

Tallennettuna:
Bibliografiset tiedot
Päätekijä: Jean Goubault-Larrecq
Aineistotyyppi: Artigo
Kieli:Inglês
Julkaistu: Logical Methods in Computer Science e.V. 2012-02-01
Sarja:Logical Methods in Computer Science
Aiheet:
Linkit:https://lmcs.episciences.org/956/pdf
Tagit: Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!