scientific article; zbMATH DE number 3423547
From MaRDI portal
Publication:5685626
zbMath0268.68004MaRDI QIDQ5685626
Christopher Strachey, Dana S. Scott
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (73)
Automata-theoretic semantics of idealized Algol with passive expressions ⋮ The asymmetric topology of computer science ⋮ Synthesized and inherited functions. A new computational model for syntax-directed semantics ⋮ The regular-language semantics of second-order idealized ALGOL ⋮ On bisimilarity in lambda calculi with continuous probabilistic choice ⋮ Unnamed Item ⋮ Pushdown machines for the macro tree transducer ⋮ An algebraic approach to semantics of programming languages ⋮ Compositional Reasoning ⋮ Algebraic solutions to recursion schemes ⋮ Building Specifications in the Event-B Institution ⋮ An Action Semantics Based on Two Combinators ⋮ A presheaf environment for the explicit fusion calculus ⋮ The rewriting logic semantics project ⋮ Unified Algebras and action semantics ⋮ The common order-theoretic structure of version spaces and ATMSs ⋮ Compositional meaning in logic ⋮ The rewriting logic semantics project: a progress report ⋮ Unnamed Item ⋮ Programming language semantics: It’s easy as 1,2,3 ⋮ Semantics of nondeterminism, concurrency, and communication ⋮ Orthogonality of information structures ⋮ A Category of Explicit Fusions ⋮ The congruence of two programming language definitions ⋮ Mechanised wire-wise verification of Handel-C synthesis ⋮ More on advice on structuring compilers and proving them correct ⋮ Theory construction in psychology: The interpretation and integration of psychological data ⋮ Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable ⋮ Fixed point theorems and semantics: A folk tale ⋮ Sequential algorithms on concrete data structures ⋮ Abstract data types and algebraic semantics of programming languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A denotational semantics for the generalized ER model and a simple ER algebra ⋮ Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations ⋮ A theory for program and data type specification ⋮ Unnamed Item ⋮ VDM semantics of programming languages: Combinators and monads ⋮ Proving a compiler correct: A simple approach ⋮ Mechanised Wire-wise Verification of Handel-C Synthesis ⋮ A fully abstract denotational model for observational precongruence ⋮ SEMANOL (73), a metalanguage for programming the semantics of programming languages ⋮ Call-by-name, call-by-value and the \(\lambda\)-calculus ⋮ Functional parallel typified language and its implementation on clusters ⋮ Completeness results for the equivalence of recursive schemas ⋮ A brief history of process algebra ⋮ Least fixed points revisited ⋮ Computability concepts for programming language semantics ⋮ PASCAL in LCF: Semantics and examples of proof ⋮ From Logic to Theoretical Computer Science – An Update ⋮ Whither semantics? ⋮ Fully abstract models of typed \(\lambda\)-calculi ⋮ Proof, meaning and paradox: some remarks ⋮ On paradoxes in normal form ⋮ A theory of type polymorphism in programming ⋮ Abstract Interpretation From a Denotational-semantics Perspective ⋮ Program transformations and algebraic semantics ⋮ A rewriting logic approach to operational semantics ⋮ The Rewriting Logic Semantics Project: A Progress Report ⋮ On Scott's thesis for domains of information and well-quasi-orderings ⋮ Fixed points with respect to the L-slice homomorphism $\sigma _{a} $ ⋮ Differential logical relations, Part I: The simply-typed case ⋮ A representation of FS-domains by formal concept analysis ⋮ Expressive power of typed and type-free programming languages ⋮ A game-semantic model of computation ⋮ Unnamed Item ⋮ A category of quantum posets ⋮ Implementation of data types by algebraic methods ⋮ Toward an infinitary logic of domains: Abramsky logic for transition systems ⋮ An abstract approach to stratification in linear logic ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ Modular tree transducers ⋮ Analysis and synthesis of structured parallel programs
This page was built for publication:
