Partial correctness for probabilistic demonic programs
Theoretical Computer Science
The Wave Propagator Is Turing Computable
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Measuring the Probabilistic Powerdomain
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis
Semantic Characterisations of Second-Order Computability over the Real Numbers
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Real PCF extended with integration
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
The Scott Topology Induces the Weak Topology
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Approximating Labeled Markov Processes
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Approximating labelled Markov processes
Information and Computation
Riemann and Edalat integration on domains
Theoretical Computer Science - Topology in computer science
Theoretical Computer Science - Topology in computer science
Mathematical Structures in Computer Science
Measuring the probabilistic powerdomain
Theoretical Computer Science - Special issue on automata, languages and programming
Domain theory and differential calculus (functions of one variable)
Mathematical Structures in Computer Science
Domains, integration and ‘positive analysis’
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Probabilistic event structures and domains
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Notions of Probabilistic Computability on Represented Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
On computational environments of topological spaces
Theoretical Computer Science
Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Reducibility of domain representations and cantor–weihrauch domain representations
Mathematical Structures in Computer Science
A computable approach to measure and integration theory
Information and Computation
A quantitative computational model for complete partial metric spaces via formal balls†
Mathematical Structures in Computer Science
Computable Exchangeable Sequences Have Computable de Finetti Measures
CiE '09 Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Labelled Markov Processes: Stronger and Faster Approximations
Electronic Notes in Theoretical Computer Science (ENTCS)
Prevision domains and convex powercones
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
De groot duality and models of choice: Angels, demons and nature†
Mathematical Structures in Computer Science
Domain theoretic characterisations of quasi-metric completeness in terms of formal balls†
Mathematical Structures in Computer Science
The formal ball model for -categories
Mathematical Structures in Computer Science
Domain-Theoretic formulation of linear boundary value problems
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability on random events and variables in a computable probability space
Theoretical Computer Science
Continuous capacities on continuous state spaces
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |