scientific article

zbMath0538.68064MaRDI QIDQ3325069

Samson Abramsky

Publication date: 1983

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

category theorysemantics of programming languagesunbounded nondeterminism in non-discrete data domains

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) General topics in the theory of software (68N01)

Related Items (16)

A category-theoretic semantics for unbounded indeterminacy ⋮ Algebraic solutions to recursion schemes ⋮ A domain equation for bisimulation ⋮ Inferring probability comparisons ⋮ Interpretations of recursion under unbounded nondeterminacy ⋮ A presheaf semantics of value-passing processes ⋮ Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes ⋮ Domain theory in logical form ⋮ An extensional fixed-point semantics for nondeterministic data flow ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ Infinite trace equivalence ⋮ The expressive power of indeterminate dataflow primitives ⋮ Whither semantics? ⋮ On the completeness of order-theoretic models of the \(\lambda \)-calculus ⋮ Nonexpressibility of fairness and signaling ⋮ The Bicategory-Theoretic Solution of Recursive Domain Equations

This page was built for publication: