default search action
Klaus Keimel
Person information
- affiliation: Technische Universität Darmstadt, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j18]Klaus Keimel, Gordon D. Plotkin:
Mixed powerdomains for probability and nondeterminism. Log. Methods Comput. Sci. 13(1) (2017) - [j17]Klaus Keimel:
The Cuntz semigroup and domain theory. Soft Comput. 21(10): 2485-2502 (2017) - [c11]Klaus Keimel:
Domain Theory its Ramifications and Interactions. ISDT 2017: 3-16 - 2015
- [j16]Klaus Keimel:
Weak upper topologies and duality for cones. Log. Methods Comput. Sci. 11(3) (2015) - [j15]Ulrich Berger
, Jens Blanck, Martín Escardó, Klaus Keimel:
Preface. J. Log. Algebraic Methods Program. 84(1): 107 (2015) - [c10]Klaus Keimel:
Healthiness Conditions for Predicate Transformers. MFPS 2015: 255-270 - 2014
- [j14]Ingo Battenfeld, Klaus Keimel, Thomas Streicher:
Observationally-induced algebras in Domain Theory. Log. Methods Comput. Sci. 10(3) (2014) - [i1]Klaus Keimel:
On the equivalence of state transformer semantics and predicate transformer semantics. CoRR abs/1410.7930 (2014) - 2013
- [c9]Reinhold Heckmann, Klaus Keimel:
Quasicontinuous Domains and the Smyth Powerdomain. MFPS 2013: 215-232 - 2012
- [j13]Klaus Keimel, Jimmie D. Lawson:
Extending algebraic operations to D-completions. Theor. Comput. Sci. 430: 73-87 (2012) - 2011
- [j12]Jean Goubault-Larrecq, Klaus Keimel:
Choquet-Kendall-Matheron theorems for non-Hausdorff spaces. Math. Struct. Comput. Sci. 21(3): 511-561 (2011) - [j11]Klaus Keimel, Artus Ph. Rosenbusch, Thomas Streicher:
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language. Theor. Comput. Sci. 412(25): 2701-2713 (2011) - 2010
- [j10]Bernhard Reus
Preface for the special issue on domains. Math. Struct. Comput. Sci. 20(2): 105-106 (2010)
2000 – 2009
- 2009
- [j9]Yuri Leonidovich Ershov, Klaus Keimel, Ulrich Kohlenbach, Andrei S. Morozov
Preface. Ann. Pure Appl. Log. 159(3): 249-250 (2009) - [j8]Klaus Keimel, Jimmie D. Lawson:
D-completions and the d-topology. Ann. Pure Appl. Log. 159(3): 292-306 (2009) - [j7]Klaus Keimel, Artus Ph. Rosenbusch, Thomas Streicher:
A Minkowski type duality mediating between state and predicate transformer semantics for a probabilistic nondeterministic language. Ann. Pure Appl. Log. 159(3): 307-317 (2009) - [j6]Klaus Keimel, Gordon D. Plotkin:
Predicate transformers for extended probability and non-determinism. Math. Struct. Comput. Sci. 19(3): 501-539 (2009) - [c8]Klaus Keimel:
Bicontinuous Domains and Some Old Problems in Domain Theory. ISDT 2009: 35-54 - [c7]Klaus Keimel, Jimmie D. Lawson:
Extending Algebraic Operations to D-Completions. MFPS 2009: 93-116 - 2007
- [j5]Ulrich Berger, Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove, Dana S. Scott:
Continuous Lattices and Domains. Stud Logica 86(1): 137-138 (2007) - 2006
- [j4]Samy Abbes
Projective topology on bifinite domains and applications. Theor. Comput. Sci. 365(3): 171-183 (2006) - [c6]Ben Cohen, Martín Hötzel Escardó, Klaus Keimel:
The Extended Probabilistic Powerdomain Monad over Stably Compact Spaces. TAMC 2006: 566-575 - 2005
- [c5]Klaus Keimel:
Topological Cones: Foundations for a Domain Theoretical Semantics Combining Probability and Nondeterminism. MFPS 2005: 423-443 - 2004
- [j3]Maurizio Alvarez-Manilla, Achim Jung, Klaus Keimel:
The probabilistic powerdomain for stably compact spaces. Theor. Comput. Sci. 328(3): 221-244 (2004) - 2003
- [c4]Klaus Keimel:
The Probabilistic Powerdomain for Stably Compact Spaces via Compact Ordered Spaces. DTMPP 2003: 225-238 - 2000
- [j2]Michael Huth, Achim Jung, Klaus Keimel:
Linear types and approximation. Math. Struct. Comput. Sci. 10(6): 719-745 (2000) - [j1]Klaus Keimel, Michael W. Mislove, Constantine Tsinakis:
Modern Algebra - Foreword. Theor. Comput. Sci. 249(1): 1 (2000)
1990 – 1999
- 1997
- [c3]Abbas Edalat, Achim Jung, Klaus Keimel, Marta Z. Kwiatkowska:
Preface. COMPROX 1997: 1 - [c2]Klaus Keimel:
Bi-continuous valuations. COMPROX 1997: 119-123 - [e1]Abbas Edalat, Achim Jung, Klaus Keimel, Marta Z. Kwiatkowska:
Third Workshop on Computation and Approximation, COMPROX 1997, Birmingham, UK, September 11-13, 1997. Electronic Notes in Theoretical Computer Science 13, Elsevier 1997 [contents] - 1994
- [c1]Michael Huth, Achim Jung, Klaus Keimel:
Linear Types, Approximation, and Topology. LICS 1994: 110-114
1980 – 1989
- 1980
- [b1]Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael W. Mislove:
A compendium of continous lattices. Springer 1980, ISBN 978-3-540-10111-6, pp. I-XX, 1-371
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: