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