scientific article
From MaRDI portal
Publication:3907039
zbMath0457.68006MaRDI QIDQ3907039
Matthew C. B. Hennessy, Gordon D. Plotkin
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Continuous semilattices, The origins of structural operational semantics, Merging regular processes by means of fixed-point theory, Termination, deadlock and divergence, Free semiring-representations and nondeterminism, Discrete random variables over domains, Universal profinite domains, A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources, The convex powerdomain in a category of posets realized by cpos, Stable power domains, Algebraic solutions to recursion schemes, A domain equation for bisimulation, Transition systems, metric spaces and ready sets in the semantics of uniform concurrency, Designing equivalent semantic models for process creation, A generalization of Owicki-Gries's Hoare logic for a concurrent while language, Discrete Lawvere theories and computational effects, Semantics of production systems, Metric semantics for concurrency, Sequential and concurrent behaviour in Petri net theory, Convex powerdomains. II, SOS formats and meta-theory: 20 years after, Autonomous posets and quantales, Terminal metric spaces of finitely branching and image finite linear processes, A coinductive calculus for asynchronous side-effecting processes, Recursive assertions and parallel programs, Remarks on hyperspaces for Priestley spaces, A simple language supporting angelic nondeterminism and parallel composition, An upper power domain construction in terms of strongly compact sets, A fully abstract model for the \(\pi\)-calculus., The order-K-ification monads, Comparaison et équivalence de sémantiques pour les schémas de programmes non déterministes, Issues in the design of a parallel object-oriented language, Denotational semantics of a parallel object-oriented language, Comparative metric semantics for concurrent PROLOG, Contractions in comparing concurrency semantics, Domain theory in logical form, Correctness of concurrent processes, Domain theory for concurrency, Control machines: A new model of parallelism for compositional specifications and their effective compilation, Semantic models for concurrent logic languages, Generalizing finiteness conditions of labelled transition systems, Modelling higher-order dual nondeterminacy, Lower and upper power domain constructions commute on all cpos, Moduloïds and pseudomodules. I: Dimension theory, From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic, A logical view of composition, Power domains and second-order predicates, The mixed powerdomain, Presenting Dcpos and Dcpo Algebras, Continuous Domain Theory in Logical Form, An introduction to metric semantics: Operational and denotational models for programming and specification languages, Combining effects: sum and tensor, A process calculus BigrTiMo of mobile systems and its formal semantics, Dual unbounded nondeterminacy, recursion, and fixpoints, On the construction of free algebras for equational systems, A Coinductive Calculus for Asynchronous Side-Effecting Processes, The semantics of the combination of atomized statements and parallel choice, Semantics of algorithmic languages, Distributive semantics for nondeterministic typed \(\lambda\)-calculi, The largest Cartesian closed category of domains, Well-behaved Translations between Structural Operational Semantics, Topology, domain theory and theoretical computer science, Denotational models for programming languages: Applications of Banach's fixed point theorem, Universal coalgebra: A theory of systems, Fair termination revisited - with delay, Ten years of Hoare's logic: A survey. II: Nondeterminism, A Convenient Category of Domains, Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic, Retracing CSP, Comparative semantics for flow of control in logic programming without logic, On powerdomains and modality, A truly concurrent semantics for a process algebra using resource pomsets, Process algebra and constraint programming for modeling interactions in MAS
