scientific article; zbMATH DE number 3635472
From MaRDI portal
Publication:4195918
zbMath0408.68017MaRDI QIDQ4195918
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01) General theory of categories and functors (18A99)
Related Items
Quasicontinuous domains and the Smyth powerdomain, Probabilistic Ianov's schemes, Universal profinite domains, Algebraic solutions to recursion schemes, Semantics of production systems, Consistent Smyth powerdomains of topological spaces and quasicontinuous domains, Convex powerdomains. II, Leanest quasi-orderings, Consistent Hoare powerdomains over dcpos, \(\mathbb{T}^\omega\) as a universal domain, Effectively given domains, CPO's of measures for nondeterminism, A semantic theory for value-passing processes based on the late approach, The order-K-ification monads, Inverse-limit and topological aspects of abstract interpretation, A mathematical semantics for a nondeterministic typed lambda-calculus, On correct refinement of programs, Two-level semantics and abstract interpretation, A continuous semantics for unbounded nondeterminism, On \(FS_+\)-domains, Consistent Hoare powerdomains., Consistent Plotkin powerdomains., The equivalence in the DCP model, Nondeterminism and infinite computations in constraint programming, Bitopology and four-valued logic, Characterizing consistent Smyth powerdomains by \textit{FS-}\(\land^{\uparrow}\)-domains, Combining angels, demons and miracles in program specifications, Consistent Smyth powerdomains., Model-Checking View-Based Partial Specifications, Cartesian closed categories of separable Scott domains, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Abstract canonical presentations, Convex powerdomains. I, Infinite hypergraphs. I: Basic properties, Distributive semantics for nondeterministic typed \(\lambda\)-calculi, A unifying theorem for algebraic semantics and dynamic logics, Domain semantics of possibility computations, Algebraic domain equations, Clausal logic and logic programming in algebraic domains, Probabilistic Completion of Nondeterministic Models, Extracting Program Logics From Abstract Interpretations Defined by Logical Relations, On powerdomains and modality, Truly concurrent constraint programming
