scientific article

Publication date: 1981

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

denotational semantics lambda calculus reflexive domains sequential programming languages London: The MIT Press. XXXI, 414 p. Pounds 8.75 (1981)Press Series in Computer Science, 1. Cambridge, Massachusetts

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items

Foundations of a theorem prover for functional and mathematical uses ⋮ A formal semantics for sql ⋮ Parallélisation sémantique ⋮ PROPOSITIONAL DYNAMIC LOGIC FOR REASONING ABOUT FIRST-CLASS AGENT INTERACTION PROTOCOLS ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Folding left and right matters: Direct style, accumulators, and continuations ⋮ A denotational semantics for the generalized ER model and a simple ER algebra ⋮ Logic and functional programming by retractions ⋮ Logic and functional programming by retractions : operational semantics ⋮ On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms ⋮ a-Logic With Arrows ⋮ Quantitative Verification of Stochastic Regular Expressions ⋮ Unifying Semantics for Concurrent Programming ⋮ Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice ⋮ Pixel Geometry ⋮ Capsules and Closures ⋮ From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice ⋮ On intuitionistic query answering in description bases ⋮ Unnamed Item ⋮ An order-algebraic definition of knuthian semantics ⋮ A first order logic for partial functions ⋮ Incorporating an implicit time dimension into the relational model and algebra ⋮ Formalizing Operational Semantic Specifications in Logic ⋮ From Reduction-Based to Reduction-Free Normalization ⋮ Characterizations of semantic domains for randomized algorithms ⋮ Qualitative versus quantitative fixed point techniques in computer science ⋮ In Scott-Strachey style denotational semantics, parallelism implies nondeterminism ⋮ Unnamed Item ⋮ Semantics-directed program analysis: A tool-maker's perspective ⋮ Semantics of plan revision in intelligent agents ⋮ A view of programming languages as symbiosis of meaning and computations ⋮ A domain-theoretic model of nominally-typed object-oriented programming ⋮ The origins of structural operational semantics ⋮ On merging software extensions ⋮ Merging regular processes by means of fixed-point theory ⋮ Correct translation of data parallel assignment onto array processors ⋮ Well-founded semantics for Boolean grammars ⋮ An algebraic semantics approach to the effective resolution of type equations ⋮ Testing equivalences for processes ⋮ Strictness analysis and denotational abstract interpretation ⋮ Attribute and unification grammar: A review and analysis of formalisms ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ A domain equation for bisimulation ⋮ Fuzzy semantic analysis and formal specification of conceptual knowledge ⋮ Coupled Meir-Keeler type contraction in metric spaces with an application to partial metric spaces ⋮ Trace semantics and algebraic laws for MCA ARMv8 architecture based on UTP ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ SIMD language design using prescriptive semantics ⋮ Semantics of production systems ⋮ Existential continuation ⋮ The semantics of lazy functional languages ⋮ The use of hoare logic in the verification of horizontal microprograms ⋮ A multi-tier semantics for Hop ⋮ Compositional meaning in logic ⋮ rCOS: Defining Meanings of Component-Based Software Architectures ⋮ Specifying termination in CSP ⋮ A common fixed point theorem for weak contractive maps in \(G_{p}\)-metric spaces ⋮ A reduction semantics for direct-style asynchronous observables ⋮ On the geometry of physical measurements: topological and algebraic aspects ⋮ Petri nets, event structures and domains. I ⋮ Denotational semantics and its algebraic derivation for an event-driven system-level language ⋮ Continuity in Semantic Theories of Programming ⋮ A semantic framework for proof evidence ⋮ The independence of control structures in abstract programming systems ⋮ The congruence of two programming language definitions ⋮ Some primitives for the portable programming of array and vector processors ⋮ Two-level semantics and abstract interpretation ⋮ Free upper regular bands ⋮ A dual problem to least fixed points ⋮ The IO- and OI-hierarchies ⋮ Specifications, models, and implementations of data abstractions ⋮ Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable ⋮ A short proof of the lexical addressing algorithm ⋮ A first order logic for partial functions ⋮ Fixed point theorems and semantics: A folk tale ⋮ A fuzzy language. ⋮ Domain theory in logical form ⋮ Local variable scoping and Kleene algebra with tests ⋮ Verifying of interface assertions for infinite state Mealy machines ⋮ Relation algebraic domain constructions ⋮ The contraction principle as a particular case of Kleene's fixed point theorem ⋮ A compositional semantic basis for the analysis of equational Horn programs ⋮ Applications of the complexity space to the general probabilistic divide and conquer algorithms ⋮ Semantics and reasoning with free procedures ⋮ Using fixed-point semantics to prove retiming lemmas ⋮ A uniform treatment of order of evaluation and aggregate update ⋮ Logical foundations for programming semantics ⋮ Universal algebra in higher types ⋮ A lattice for abstract interpretation of dynamic (LISP-like) structures ⋮ An abstract interface to higher spin gauge field theory ⋮ A trajectory-based strict semantics for program slicing ⋮ Semantics of non-deterministic possibility computation ⋮ Structured meanings and reflexive domains ⋮ Dependent vector types for data structuring in multirate Faust ⋮ An axiomatic treatment of SIMD assignment ⋮ A non-standard semantics for program slicing and dependence analysis ⋮ Building program construction and verification tools from algebraic principles ⋮ Compactness and completeness in partial metric spaces ⋮ A syntactic theory of sequential state ⋮ A demonstrably correct compiler ⋮ Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus ⋮ A ``geometric view of the dynamics of trajectories of computer programs ⋮ On Scott's thesis for domains of information and well-quasi-orderings ⋮ The semantics of incomplete databases as an expression of preferences ⋮ On the completeness of order-theoretic models of the \(\lambda \)-calculus ⋮ An abstract theory of physical measurements ⋮ Semantics of interference control ⋮ Operational semantics: concepts and their expression ⋮ A construction of one-point bases in extended lambda calculi ⋮ Incorporating static analysis in a combinator-based compiler ⋮ Describing semantic domains with sprouts ⋮ Metrizability of partial metric spaces ⋮ Quantitative semantics, topology, and possibility measures ⋮ On fixed point theory in partially ordered sets and an application to asymptotic complexity of algorithms ⋮ From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models ⋮ Axiomatising finite delay operators ⋮ Coalgebras and monads in the semantics of Java ⋮ Computability and realizability for interactive computations ⋮ Specification-oriented semantics for communicating processes ⋮ On a generalized product for domains ⋮ A type-theoretical alternative to ISWIM, CUCH, OWHY ⋮ The description of the characteristics of the structure and the quantity in fixed pansystems theorems ⋮ Closure functions and general iterates as reflectors ⋮ A cost-effective estimation of uncaught exceptions in Standard ML programs ⋮ A Rewrite Framework for Language Definitions and for Generation of Efficient Interpreters ⋮ A characterization of Plotkin's order in powerdomains, and some of its properties ⋮ On conservative extensions of syntax in system development ⋮ A structural operational semantics for an Edison-like language ⋮ A simple fixpoint argument without the restriction to continuity