scientific article; zbMATH DE number 3557184
From MaRDI portal
zbMath0357.68004MaRDI QIDQ4133080
Christopher Strachey, Robert Milne
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items
Continuation semantics for flowgraph equations, The origins of structural operational semantics, On merging software extensions, On the transformation between direct and continuation semantics, Stability, sequentiality and demand driven evaluation in dataflow, Two-level semantics and code generation, Fully abstract submodels of typed lambda calculi, Strictness analysis and denotational abstract interpretation, Equivalence of formal semantics definition methods, Recursive programs and denotational semantics in absolute logics of programs, Order-Sorted Parameterization and Induction, A domain equation for bisimulation, The semantics of lazy functional languages, The congruence of two programming language definitions, Some primitives for the portable programming of array and vector processors, Two-level semantics and abstract interpretation, A complete logic for reasoning about programs via nonstandard model theory. II, The IO- and OI-hierarchies, Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable, A short proof of the lexical addressing algorithm, Fixed point theorems and semantics: A folk tale, Sequential algorithms on concrete data structures, Domain theory in logical form, Unnamed Item, Continuations in possible-world semantics, Denotational semantics of mixed computation processes for a structural programming language, Language design methods based on semantic principles, PASCAL in LCF: Semantics and examples of proof, Abstract Interpretation From a Denotational-semantics Perspective, Semantics of interference control, Semantics of algorithmic languages, Expressive power of typed and type-free programming languages, Incorporating static analysis in a combinator-based compiler, Direct semantics and exceptions define jumps and coroutines, A Theory of Pointers for the UTP, On infinite computations in denotational semantics, On a generalized product for domains, A type-theoretical alternative to ISWIM, CUCH, OWHY, Kleene's Logic with equality
