The extended probabilistic powerdomain monad over stably compact spaces

Ben Cohen*, Martin Escardo, Klaus Keimel

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For the semantics of probabilistic features in programming mainly two approaches are used for building models. One is the Giry monad of Borel probability measures over metric spaces, and the other is Jones' probabilistic powerdomain monad [6] over dcpos (directed complete partial orders). This paper places itself in the second domain theoretical tradition. The probabilistic power-domain monad is well understood over continuous domains. In this case the algebras of the monad can be described by an equational theory [6,9,5]. It is the aim of this work to obtain similar results for the (extended) probabilistic powerdomain monad over stably compact spaces. We mainly want to determine the algebras of this powerdomain monad and the algebra homomorphisms.

Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation - Third International Conference, TAMC 2006, Proceedings
Pages566-575
Number of pages10
DOIs
Publication statusPublished - 2006
Event3rd International Conference on Theory and Applications of Models of Computation, TAMC 2006 - Beijing, China
Duration: 15 May 200620 May 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3959 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Theory and Applications of Models of Computation, TAMC 2006
Country/TerritoryChina
CityBeijing
Period15/05/0620/05/06

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'The extended probabilistic powerdomain monad over stably compact spaces'. Together they form a unique fingerprint.

Cite this