Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (Q478400): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Full abstraction for PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The probabilistic powerdomain for stably compact spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An abstract framework for environment machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic game semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic coherence spaces are fully abstract for probabilistic PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: The way-below relation of function spaces over semantic domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Lattices and Domains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuous Previsions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prevision Domains and Convex Powercones / rank
 
Normal rank
Property / cites work
 
Property / cites work: De Groot duality and models of choice: angels, demons and nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Hausdorff Topology and Domain Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism theorems between models of mixed choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On full abstraction for PCF: I, II and III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3203061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demonic, angelic and unbounded probabilistic choices in sequential programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully abstract models of typed \(\lambda\)-calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology, domain theory and theoretical computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notions of computation and monads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kripke logical relations and PCF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametricity and local variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LCF considered as a programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relational account of call-by-value sequentiality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain-Theoretic Foundations of Functional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488202 / 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: Q3999364 / rank
 
Normal rank

Revision as of 09:12, 9 July 2024

scientific article
Language Label Description Also known as
English
Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases
scientific article

    Statements

    Full abstraction for non-deterministic and probabilistic extensions of PCF. I: The angelic cases (English)
    0 references
    3 December 2014
    0 references
    domain theory
    0 references
    PCF
    0 references
    full abstraction
    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