Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting

DOI10.1016/j.entcs.2009.07.092zbMath1337.68068OpenAlexW2014952600MaRDI QIDQ2805159

Martín Hötzel Escardó

Publication date: 10 May 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.092

zbMATH Keywords

operational semanticspowerdomainsdenotational semanticsprobabilistic computationnondeterministic computationexhaustible setshigher-type computability theorymay and must testing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (4)

Unnamed Item ⋮ Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases ⋮ Computable de Finetti measures ⋮ QPCF: higher-order languages and quantum circuits

Cites Work

• Retracted: Semantic domains for combining probability and non-determinism
• Power domains and second-order predicates
• Representing probability measures using probabilistic processes
• Operational domain theory and topology of sequential programming languages
• Effectively given domains
• A mathematical semantics for a nondeterministic typed lambda-calculus
• Domain theory in logical form
• LCF considered as a programming language
• Power domains
• Induction and recursion on the partial real line with applications to Real PCF
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• PCF extended with real numbers
• Exact real number computations relative to hereditarily total functionals.
• Integration in Real PCF
• Monads for which structures are adjoint to units
• A Convenient Category of Domains
• Domain-Theoretic Foundations of Functional Programming
• Exhaustible sets in higher-type computation
• Algebraic laws for nondeterminism and concurrency
• On the non-sequential nature of the interval-domain model of real-number computation
• Continuous Lattices and Domains
• On the Non-sequential Nature of Domain Models of Real-number Computation
• A Functional Algorithm for Exact Real Integration with Invariant Measures
• Distributing probability over non-determinism
• Partial correctness for probabilistic demonic programs
• An upper power domain construction in terms of strongly compact sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting