首页    期刊浏览 2024年09月19日 星期四
登录注册

文章基本信息

  • 标题:QRB-Domains and the Probabilistic Powerdomain
  • 本地全文:下载
  • 作者:Jean Goubault-Larrecq
  • 期刊名称:Logical Methods in Computer Science
  • 印刷版ISSN:1860-5974
  • 电子版ISSN:1860-5974
  • 出版年度:2012
  • 卷号:8
  • 期号:1
  • 页码:1
  • DOI:10.2168/LMCS-8(1:14)2012
  • 出版社:Technical University of Braunschweig
  • 摘要: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-continuous dcpos instead. We introduce a natural class of such quasi-continuous dcpos, the omega-QRB-domains. We show that they form a category omega-QRB with pleasing properties: omega-QRB is closed under the probabilistic powerdomain functor, under finite products, under taking bilimits of expanding sequences, under retracts, and even under so-called quasi-retracts. But... omega-QRB is not Cartesian closed. We conclude by showing that the QRB domains are just one half of an FS-domain, merely lacking control.
  • 其他关键词:Domain theory, quasi-continuous domains, probabilistic powerdomain.
国家哲学社会科学文献中心版权所有