scientific article

zbMath0467.68011MaRDI QIDQ3920613

Gordon D. Plotkin

Publication date: 1980

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

zbMATH Keywords

operational semanticsdenotational semanticspredicate transformer semanticsstate transformation semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)

Related Items (24)

Structured algebraic specifications: A kernel language ⋮ The origins of structural operational semantics ⋮ A metrized duality theorem for Markov processes ⋮ Infinite streams and finite observations in the semantics of uniform concurrency ⋮ A categorical treatment of pre- and post-conditions ⋮ Generalized metric spaces: Completion, topology, and powerdomains via the Yoneda embedding ⋮ Equational properties of iteration in algebraically complete categories ⋮ The equational logic of fixed points ⋮ A representable approach to finite nondeterminism ⋮ A general adequacy result for a linear functional language ⋮ Completeness of Park induction ⋮ On correct refinement of programs ⋮ A Hofmann-Mislove theorem for bitopological spaces ⋮ Fixed-point operations on ccc's. I ⋮ Predicate transformers and higher-order programs ⋮ Combining angels, demons and miracles in program specifications ⋮ Power structures ⋮ Inverse image analysis generalises strictness analysis ⋮ Categorical fixed point semantics ⋮ Category Theoretic Models of Data Refinement ⋮ Domain semantics of possibility computations ⋮ On a generalized product for domains ⋮ A Hofmann-Mislove theorem for Bitopological Spaces ⋮ Soundness of data refinement for a higher-order imperative language

This page was built for publication: