A Powerdomain Construction
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Function spaces from core compact coherent spaces to continuous B-domains
- Operational semantics: concepts and their expression
- Domain semantics of possibility computations
- On infinite computations in denotational semantics
- Algebraic domain equations
- On the Herbrand-Kleene universe for nondeterministic computations
- On powerdomains and modality
- A characterization of Plotkin's order in powerdomains, and some of its properties
- 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
- 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
- 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
- Applications of compactness in the Smyth powerdomain of streams
- Designing equivalent semantic models for process creation
- 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\)
- 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
- Effectively given domains
- CPO's of measures for nondeterminism
- Semantics of nondeterminism, concurrency, and communication
- On the total correctness of nondeterministic programs
- A mathematical semantics for a nondeterministic typed lambda-calculus
- On correct refinement of programs
- Semantics of probabilistic programs
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable
- A continuous semantics for unbounded nondeterminism
- Domain theory in logical form
- Continuous completions
- Recursive types for Fun
- Using powerdomains to generalize relational databases
- Moduloïds and pseudomodules. I: Dimension theory
- The mixed powerdomain
- The expressive power of indeterminate dataflow primitives
- On the synthesis of function inverses
- Backtracking in recursive computations
- Functional behavior in data spaces
- A theory of type polymorphism in programming
- Fixed-point constructions in order-enriched categories
- A generalized setting for fixpoint theory
- Coherence and consistency in domains
- Full abstractness for a functional/concurrent language with higher-order value-passing
- Infinite \(\lambda\)-calculus and types
- On functions preserving levels of approximation: A refined model construction for various lambda calculi
- Effective domain representations of \({\mathcal H}(X)\), the space of compact subsets
- A co-induction principle for recursively defined domains
- Testing equivalences for processes
- Linear time and branching time semantics for recursion with merge
- Stable power domains
- Formal specification of parallel SIMD execution
- Full abstraction for the second order subset of an Algol-like language
- Trees and semantics
- A representable approach to finite nondeterminism
- A semantic theory for value-passing processes based on the late approach
- Domain theory for concurrency
- A universal characterization of the double powerlocale
- Kleene's Logic with equality
- Truly concurrent constraint programming
- Consistent Hoare powerdomains over dcpos
- Denotational semantics of membrane systems by using complete metric spaces
- On \(FS_+\)-domains
- Characterizing consistent Smyth powerdomains by \textit{FS-}\(\land^{\uparrow}\)-domains
- Semantics of non-deterministic possibility computation
- Convex power domain and Vietoris space
- A brief history of process algebra
- Abstracting Nash equilibria of supermodular games
- A unifying theorem for algebraic semantics and dynamic logics
- Continuously generated fixed points
- A category of compositional domain-models for separable Stone spaces.
- Closures on CPOs form complete lattices
- Deduction with uncertain conditionals
- Predicate transformers as power operations
- Towards reasoning about Hoare relations
- Logic of convex order
- Non-deterministic effects in a realizability model
- On orderings in security models
- Consistent Smyth powerdomains.
- Cartesian closed categories of separable Scott domains
- General correctness: A unification of partial and total correctness
- Semantics of a sequential language for exact real-number computation
- Consistent Smyth powerdomains of topological spaces and quasicontinuous domains
- A static analysis of cryptographic processes: the denotational approach
- Combining effects: sum and tensor
- A domain equation for bisimulation
- A concrete realization of the Hoare powerdomain
- Relational semantics revisited
- QRB, QFS, and the probabilistic powerdomain
This page was built for publication: A Powerdomain Construction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4127356)
