Power domains
From MaRDI portal
Publication:1251475
DOI10.1016/0022-0000(78)90048-XzbMath0391.68011OpenAlexW4213381987MaRDI QIDQ1251475
Publication date: 1978
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(78)90048-x
Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01) General theory of categories and functors (18A99)
Related Items
A fixed-point semantics for feature type systems, Structured algebraic specifications: A kernel language, A theory for nondeterminism, parallelism, communication, and concurrency, Merging regular processes by means of fixed-point theory, A category-theoretic semantics for unbounded indeterminacy, Unnamed Item, Non-deterministic effects in a realizability model, Concurrent histories: a basis for observing distributed systems, Specification and top-down design of distributed systems, Semantics of a sequential language for exact real-number computation, Infinite streams and finite observations in the semantics of uniform concurrency, The weakest precondition calculus: Recursion and duality, Testing equivalences for processes, Linear time and branching time semantics for recursion with merge, Predicate transformers as power operations, Trace, failure and testing equivalences for communicating processes, Applications of compactness in the Smyth powerdomain of streams, A calculus of refinements for program derivations, On the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Unnamed Item, Hiding in stream semantics of uniform concurrency, The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces, Imperative abstractions for functional actions, Parameter passing in nondeterministic recursive programs, Generated models and the ω-rule: The nondeterministic case, A representable approach to finite nondeterminism, Metric interpretations of infinite trees and semantics of non deterministic recursive programs, Lazy Relations, Specification and verification of concurrent systems by causality and realizability, Semantics of nondeterminism, concurrency, and communication, An upper power domain construction in terms of strongly compact sets, Scott topology on Smyth power posets, Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes, On systems of equations defining infinite graphs, Compositional refinement in agent-based security protocols, Compositional noninterference from first principles, Issues in the design of a parallel object-oriented language, Lattice-valued Scott topology on dcpos, The Hoare and Symth power domain constructors commute under composition, Unnamed Item, Semantics of types for database objects, Step semantics for ``true concurrency with recursion, Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable, The shadow knows: refinement and security in sequential programs, A semantics for complex objects and approximate answers, How to Brew-up a Refinement Ordering, A universal characterization of the double powerlocale, Modelling higher-order dual nondeterminacy, Using powerdomains to generalize relational databases, Observationally-induced lower and upper powerspace constructions, Duality beyond sober spaces: Topological spaces and observation frames, Filter models for conjunctive-disjunctive \(\lambda\)-calculi, Computable concurrent processes, Completeness of ASM Refinement, Towards a theory of parallel algorithms on concrete data structures, Logical foundations for programming semantics, Power domains and second-order predicates, Domains for Computation in Mathematics, Physics and Exact Real Arithmetic, The mixed powerdomain, Truly concurrent constraint programming, Semantics of non-deterministic possibility computation, Completeness of fair ASM refinement, Characterising FS domains by means of power domains, Priestley spaces, quasi-hyperalgebraic lattices and Smyth powerdomains, Dual unbounded nondeterminacy, recursion, and fixpoints, Abstracting Nash equilibria of supermodular games, Unnamed Item, Formal computations of non deterministic recursive program schemes, Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Hoare's logic and VDM, On denotational versus predicative semantics, Algebraic specification of data types: A synthetic approach, Semantics of algorithmic languages, The connected Vietoris powerlocale, In Scott-Strachey style denotational semantics, parallelism implies nondeterminism, Port automata and the algebra of concurrent porcesses, A denotational semantics for shared-memory parallelism and nondeterminism, On the Herbrand-Kleene universe for nondeterministic computations, Specification-oriented semantics for communicating processes, Deduction with uncertain conditionals, Dualities between alternative semantics for logic programming and nonmonotonic reasoning, A model of concurrency with fair merge and full recursion, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
Cites Work
