Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
Probabilistic non-determinism
Mathematics for computer graphics
Mathematics for computer graphics
Power domains and second-order predicates
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
A type-theoretical alternative to ISWIM, CUCH, OWHY
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Handbook of logic in computer science (vol. 3)
PCF extended with real numbers
Theoretical Computer Science - Special issue on real numbers and computers
Induction and recursion on the partial real line with applications to Real PCF
Theoretical Computer Science - Special issue on real numbers and computers
Information and Computation - Special issue: LICS 1996—Part 1
Partial correctness for probabilistic demonic programs
Theoretical Computer Science
Exact real number computations relative to hereditarily total functionals
Theoretical Computer Science
An Upper Power Domain Construction in Terms of Strongly Compact Sets
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Call-by-Value and Nondeterminism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Lazy Functional Algorithms for Exact Real Functionals
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On Observing Nondeterminism and Concurrency
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Semantics of Exact Real Arithmetic
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
On the non-sequential nature of the interval-domain model of real-number computation
Mathematical Structures in Computer Science
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Domain-theoretic Foundations of Functional Programming
Domain-theoretic Foundations of Functional Programming
Representing probability measures using probabilistic processes
Journal of Complexity
On the Non-sequential Nature of Domain Models of Real-number Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
A Functional Algorithm for Exact Real Integration with Invariant Measures
Electronic Notes in Theoretical Computer Science (ENTCS)
Operational domain theory and topology of sequential programming languages
Information and Computation
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Observations and Valuations
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We show that, in a fairly general setting including higher-types, may, must and probabilistic testing are semi-decidable. The case of must testing is perhaps surprising, as its mathematical definition involves universal quantification over the infinity of possible outcomes of a non-deterministic program. The other two involve existential quantification and integration. We also perform first steps towards the semi-decidability of similar tests under the simultaneous presence of non-deterministic and probabilistic choice.