The following pages link to A Powerdomain Construction (Q4127356):
Displaying 50 items.
- QRB, QFS, and the probabilistic powerdomain (Q283758) (← links)
- The coinductive resumption monad (Q283770) (← links)
- Cartesian closed subcategories of \(\mathrm{CONT}_\ll^\ast\) (Q304184) (← links)
- Cartesian closed categories of \(F\mathcal Z\)-domains (Q383664) (← links)
- A relational semantics for parallelism and non-determinism in a functional setting (Q408545) (← links)
- Function spaces from Lawson compact continuous domains to continuous B-domains (Q438698) (← links)
- Consistent Hoare powerdomains. (Q471444) (← links)
- Consistent Plotkin powerdomains. (Q471476) (← links)
- Observationally-induced lower and upper powerspace constructions (Q492906) (← links)
- On the resolution-based family of abstract argumentation semantics and its grounded instance (Q543626) (← links)
- Probabilistic coherence spaces as a model of higher-order probabilistic computation (Q550253) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- Convex powerdomains. I (Q581432) (← links)
- Cartesian closed categories of algebraic cpos (Q584381) (← links)
- The largest cartesian closed category of stable domains (Q671652) (← links)
- Duality beyond sober spaces: Topological spaces and observation frames (Q671991) (← links)
- Filter models for conjunctive-disjunctive \(\lambda\)-calculi (Q672044) (← links)
- Elements of generalized ultrametric domain theory (Q672055) (← links)
- Computable concurrent processes (Q673972) (← links)
- Logical foundations for programming semantics (Q685420) (← links)
- On stable domains (Q685428) (← links)
- Power domains and second-order predicates (Q685429) (← links)
- Exponentials in a Cartesian closed category which contains all algebraic domains (Q748705) (← links)
- A note on inconsistencies caused by fixpoints in a cartesian closed category (Q749648) (← links)
- Non-well-founded sets modeled as ideal fixed points (Q757360) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Distributive semantics for nondeterministic typed \(\lambda\)-calculi (Q760418) (← links)
- The largest Cartesian closed category of domains (Q761042) (← links)
- Port automata and the algebra of concurrent porcesses (Q791319) (← links)
- A denotational semantics for shared-memory parallelism and nondeterminism (Q792754) (← links)
- Total objects of domains (Q800730) (← links)
- Denotational semantics of CSP (Q801677) (← links)
- Comparative semantics for flow of control in logic programming without logic (Q805247) (← links)
- Using information systems to solve recursive domain equations (Q808273) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Projective topology on bifinite domains and applications (Q854172) (← links)
- Discrete Lawvere theories and computational effects (Q860883) (← links)
- Continuity of function spaces from pointwise directed families of characteristic functions. (Q890017) (← links)
- QC-continuity of posets and the Hoare powerdomain of QFS-domains (Q897978) (← links)
- Issues in the design of a parallel object-oriented language (Q909434) (← links)
- Two-level semantics and abstract interpretation (Q911319) (← links)
- Equational reasoning about nondeterministic processes (Q911801) (← links)
- The Hoare and Symth power domain constructors commute under composition (Q912880) (← links)
- Non-deterministic information systems and their domains (Q914401) (← links)
- Step semantics for ``true'' concurrency with recursion (Q916408) (← links)
- Contractions in comparing concurrency semantics (Q919834) (← links)
- Modelling higher-order dual nondeterminacy (Q938301) (← links)
- CPO semantics of timed interactive actor networks (Q959824) (← links)
- On generic context lemmas for higher-order calculi with sharing (Q960863) (← links)
- Interpreting a finitary pi-calculus in differential interaction nets (Q979075) (← links)
