Isomorphism theorems between models of mixed choice

DOI10.1017/S0960129515000547zbMath1378.68111OpenAlexW2556537482MaRDI QIDQ5360215

Jean Goubault-Larrecq

Publication date: 28 September 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129515000547

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Related Items (8)

Domain-complete and LCS-complete spaces ⋮ Algebras of the extended probabilistic powerdomain monad ⋮ Kantorovich-Rubinstein quasi-metrics IV: lenses, quasi-lenses and forks ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Causal Unfoldings ⋮ Explicit Identifiers and Contexts in Reversible Concurrent Calculus ⋮ Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular ⋮ Kantorovich-Rubinstein quasi-metrics. III: Spaces of sublinear and superlinear previsions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantic domains for combining probability and non-determinism
• Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
• Domain theory and integration
• The probabilistic powerdomain for stably compact spaces
• Topological cones: functional analysis in a \(T_{0}\)-setting
• Topology, domain theory and theoretical computer science
• Locally convex cones and the Schröder-Simpson theorem
• QRB-Domains and the Probabilistic Powerdomain
• De Groot duality and models of choice: angels, demons and nature
• Continuous Previsions
• Predicate transformers for extended probability and non-determinism
• Coproducts of Ideal Monads
• Continuous Lattices and Domains
• Prevision Domains and Convex Powercones
• A short proof of the Schröder–Simpson Theorem
• Demonic, angelic and unbounded probabilistic choices in sequential programs

This page was built for publication: Isomorphism theorems between models of mixed choice