Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting (Q2805159): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.092 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014952600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theory in logical form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Non-sequential Nature of Domain Models of Real-number Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Convenient Category of Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4260387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration in Real PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exhaustible sets in higher-type computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operational domain theory and topology of sequential programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the non-sequential nature of the interval-domain model of real-number computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCF extended with real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2844075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induction and recursion on the partial real line with applications to Real PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Lattices and Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper power domain construction in terms of strongly compact sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domains and second-order predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic laws for nondeterminism and concurrency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical semantics for a nondeterministic typed lambda-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731958 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monads for which structures are adjoint to units / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial correctness for probabilistic demonic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact real number computations relative to hereditarily total functionals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2852372 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing probability measures using probabilistic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A type-theoretical alternative to ISWIM, CUCH, OWHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Algorithm for Exact Real Integration with Invariant Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effectively given domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Power domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain-Theoretic Foundations of Functional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retracted: Semantic domains for combining probability and non-determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributing probability over non-determinism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4870815 / rank
 
Normal rank

Latest revision as of 22:14, 11 July 2024

scientific article
Language Label Description Also known as
English
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
scientific article

    Statements

    Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting (English)
    0 references
    10 May 2016
    0 references
    nondeterministic computation
    0 references
    probabilistic computation
    0 references
    higher-type computability theory
    0 references
    exhaustible sets
    0 references
    may and must testing
    0 references
    operational semantics
    0 references
    denotational semantics
    0 references
    powerdomains
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references