activity
20132017
most citedMixed powerdomains for probability and nondeterminism

38 citations · 50 across the 5 of their papers we have counts for

collaborators

6 papers

cs.LO2017★ 38 cited

Mixed powerdomains for probability and nondeterminism

Klaus Keimel, Gordon D. Plotkin

We consider mixed powerdomains combining ordinary nondeterminism and probabilistic nondeterminism. We characterise them as free algebras for suitable (in)equation-al theories; we e…

math.OA2016

The Cuntz semigroup and domain theory

Klaus Keimel

Domain theory has its origins in Mathematics and Theoretical Computer Science. Mathematically it combines order and topology. Its central concepts have their origin in the idea of…

cs.LO2015

Weak upper topologies and duality for cones

Klaus Keimel

In functional analysis it is well known that every linear functional defined on the dual of a locally convex vector space which is continuous for the weak topology is the evaluatio…

cs.LO2014★ 5 cited

On the equivalence of state transformer semantics and predicate transformer semantics

Klaus Keimel

G. Plotkin and the author have worked out the equivalence between state transformer semantics and predicate transformer semantics in a domain theoretical setting for programs combi…

cs.LO2014★ 3 cited

Observationally-induced algebras in Domain Theory

Ingo Battenfeld, Klaus Keimel, Thomas Streicher

In this paper we revise and simplify the notion of observationally induced algebra introduced by Simpson and Schroeder for the purpose of modelling computational effects in the par…

math.HO2013★ 4 cited

Sheaf Representations for Algebraic Systems. A personal historical account

Klaus Keimel

From personal experience, I report about the development of sheaf representations for algebraic structures between the years 1966 and 1976. Starting with rings, lattice-ordered gro…