A Powerdomain Construction

DOI10.1137/0205035zbMath0355.68015OpenAlexW2062024564WikidataQ56092888 ScholiaQ56092888MaRDI QIDQ4127356

Publication date: 1976

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0205035

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items

Structured algebraic specifications: A kernel language, Continuous semilattices, A theory for nondeterminism, parallelism, communication, and concurrency, Merging regular processes by means of fixed-point theory, QRB, QFS, and the probabilistic powerdomain, The coinductive resumption monad, Specification and top-down design of distributed systems, Semantics of finite and infinite networks of concurrent communicating agents, Infinite streams and finite observations in the semantics of uniform concurrency, Cartesian closed subcategories of \(\mathrm{CONT}_\ll^\ast\), An algebraic semantics approach to the effective resolution of type equations, Probabilistic Ianov's schemes, Universal profinite domains, Fully abstract submodels of typed lambda calculi, Algebraic solutions to recursion schemes, Projective topology on bifinite domains and applications, Applications of compactness in the Smyth powerdomain of streams, Designing equivalent semantic models for process creation, Discrete Lawvere theories and computational effects, Semantics of production systems, A calculus of refinements for program derivations, Metric semantics for concurrency, Convex powerdomains. II, A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\), Cartesian closed categories of \(F\mathcal Z\)-domains, Enlargements of functional algebras for the lambda calculus, Parameter passing in nondeterministic recursive programs, \(\mathbb{T}^\omega\) as a universal domain, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, Continuity of function spaces from pointwise directed families of characteristic functions., Effectively given domains, CPO's of measures for nondeterminism, Semantics of nondeterminism, concurrency, and communication, A relational semantics for parallelism and non-determinism in a functional setting, On the total correctness of nondeterministic programs, QC-continuity of posets and the Hoare powerdomain of QFS-domains, A mathematical semantics for a nondeterministic typed lambda-calculus, Issues in the design of a parallel object-oriented language, On correct refinement of programs, Function spaces from Lawson compact continuous domains to continuous B-domains, Two-level semantics and abstract interpretation, Equational reasoning about nondeterministic processes, The Hoare and Symth power domain constructors commute under composition, Semantics of probabilistic programs, Non-deterministic information systems and their domains, Step semantics for ``true concurrency with recursion, Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable, Contractions in comparing concurrency semantics, A continuous semantics for unbounded nondeterminism, Consistent Hoare powerdomains., Consistent Plotkin powerdomains., Domain theory in logical form, Continuous completions, Recursive types for Fun, Modelling higher-order dual nondeterminacy, Using powerdomains to generalize relational databases, Observationally-induced lower and upper powerspace constructions, Moduloïds and pseudomodules. I: Dimension theory, The largest cartesian closed category of stable domains, Duality beyond sober spaces: Topological spaces and observation frames, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Elements of generalized ultrametric domain theory, Computable concurrent processes, Logical foundations for programming semantics, On stable domains, Power domains and second-order predicates, The mixed powerdomain, The expressive power of indeterminate dataflow primitives, CPO semantics of timed interactive actor networks, On generic context lemmas for higher-order calculi with sharing, On the synthesis of function inverses, On the resolution-based family of abstract argumentation semantics and its grounded instance, Probabilistic coherence spaces as a model of higher-order probabilistic computation, Interpreting a finitary pi-calculus in differential interaction nets, Observation equivalence as a testing equivalence, Convex powerdomains. I, Cartesian closed categories of algebraic cpos, Backtracking in recursive computations, Dual unbounded nondeterminacy, recursion, and fixpoints, Function spaces from core compact coherent spaces to continuous B-domains, Exponentials in a Cartesian closed category which contains all algebraic domains, A note on inconsistencies caused by fixpoints in a cartesian closed category, Non-well-founded sets modeled as ideal fixed points, Semantics of algorithmic languages, Distributive semantics for nondeterministic typed \(\lambda\)-calculi, The largest Cartesian closed category of domains, Operational semantics: concepts and their expression, Domain semantics of possibility computations, On infinite computations in denotational semantics, Port automata and the algebra of concurrent porcesses, A denotational semantics for shared-memory parallelism and nondeterminism, Algebraic domain equations, On the Herbrand-Kleene universe for nondeterministic computations, Total objects of domains, Denotational semantics of CSP, Comparative semantics for flow of control in logic programming without logic, On powerdomains and modality, Using information systems to solve recursive domain equations, A model of concurrency with fair merge and full recursion, A characterization of Plotkin's order in powerdomains, and some of its properties, A fixed-point semantics for feature type systems, A category-theoretic semantics for unbounded indeterminacy, On function spaces equipped with Isbell topology and Scott topology, Category of Δ-functors, Non-deterministic effects in a realizability model, MODELLING AND ANALYSIS OF PKI-BASED SYSTEMS USING PROCESS CALCULI, Semantics of a sequential language for exact real-number computation, Testing equivalences for processes, Linear time and branching time semantics for recursion with merge, The convex powerdomain in a category of posets realized by cpos, Stable power domains, Formal specification of parallel SIMD execution, Bisimulation as a logical relation, Predicate transformers as power operations, A Purely Definitional Universal Domain, Universal domains and the amalgamation property, A domain equation for bisimulation, On orderings in security models, A concrete realization of the Hoare powerdomain, Full abstraction for the second order subset of an Algol-like language, Unnamed Item, Consistent Smyth powerdomains of topological spaces and quasicontinuous domains, 1994 Annual Meeting of the Association for Symbolic Logic, Consistent Hoare powerdomains over dcpos, Towards reasoning about Hoare relations, Logic of plotkin continuous domain, Generated models and the ω-rule: The nondeterministic case, Processes and hyperuniverses, Denotational semantics of membrane systems by using complete metric spaces, Trees and semantics, A representable approach to finite nondeterminism, Lazy Relations, Specification and verification of concurrent systems by causality and realizability, A semantic theory for value-passing processes based on the late approach, Retracing some paths in process algebra, Streams of approximations, equivalence of recursive effectful programs, The Maude strategy language, An upper power domain construction in terms of strongly compact sets, Scott topology on Smyth power posets, The order-K-ification monads, Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes, Lattice-valued Scott topology on dcpos, Continuation Passing Semantics for Membrane Systems, Unnamed Item, Unnamed Item, Unnamed Item, Linearity, Control Effects, and Behavioral Types, On \(FS_+\)-domains, Domain theory for concurrency, A universal characterization of the double powerlocale, Unnamed Item, Some reasons for generalising domain theory, Characterizing consistent Smyth powerdomains by \textit{FS-}\(\land^{\uparrow}\)-domains, Consistent Smyth powerdomains., Semantics for Algebraic Operations, Cartesian closed categories of separable Scott domains, Truly concurrent constraint programming, Semantics of non-deterministic possibility computation, A static analysis of cryptographic processes: the denotational approach, Uniform Completion versus Ideal Completion of Posets with Projections, Convex power domain and Vietoris space, General correctness: A unification of partial and total correctness, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Combining effects: sum and tensor, A brief history of process algebra, A Relational Model of a Parallel and Non-deterministic λ-Calculus, Functional behavior in data spaces, Abstracting Nash equilibria of supermodular games, Disjunctive systems and L-Domains, A theory of type polymorphism in programming, Formal computations of non deterministic recursive program schemes, Fixed-point constructions in order-enriched categories, Relational Semantics Revisited, A generalized setting for fixpoint theory, Coherence and consistency in domains, Full abstractness for a functional/concurrent language with higher-order value-passing, Domain mu-calculus, Logic of convex order, Algebraic specification of data types: A synthetic approach, Infinite \(\lambda\)-calculus and types, On functions preserving levels of approximation: A refined model construction for various lambda calculi, A unifying theorem for algebraic semantics and dynamic logics, Continuously generated fixed points, Bifinite Chu Spaces, Characterizations of semantic domains for randomized algorithms, In Scott-Strachey style denotational semantics, parallelism implies nondeterminism, Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets, Unnamed Item, Logical Relations and Nondeterminism, A category of compositional domain-models for separable Stone spaces., Closures on CPOs form complete lattices, A Convenient Category of Domains, Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic, Deduction with uncertain conditionals, Probabilistic Completion of Nondeterministic Models, Observational Semantics for a Concurrent Lambda Calculus with Reference Cells and Futures, Kleene's Logic with equality, A co-induction principle for recursively defined domains, Truly concurrent constraint programming