scientific article; zbMATH DE number 555217

Publication date: 19 April 1994

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

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Representations of algebraic domains and algebraic L-domains by information systems, On the symmetry of sequentiality, Computational adequacy via ‘mixed’ inductive definitions, Linear domains and linear maps, An operational semantics for TOOPLE: A statically-typed object-oriented programming language, Generalised information systems capture L-domains, Pattern matching as cut elimination, Nominal unification, Parametrized fixed points and their applications to session types, Continuous monads, Nominal logic, a first order theory of names and binding, Towards patterns for heaps and imperative lambdas, Simply typed lambda calculus with first-class environments, Binding in Nominal Equational Logic, Certain answers as objects and knowledge, Variations on the bagdomain theme, Computational adequacy of the FIX-logic, PCF extended with real numbers, On representation and querying incomplete information in databases with bags, Building Specifications in the Event-B Institution, A Purely Definitional Universal Domain, Term-Generic Logic, Kripke models and the (in)equational logic of the second-order \(\lambda\)-calculus, A calculus and logic of resources and processes, Fully abstract translations between functional languages, Full abstraction for the second order subset of an Algol-like language, Strong normalisation in the \(\pi\)-calculus, Game theoretic analysis of call-by-value computation, On the relations between monadic semantics, On fixpoint objects and gluing constructions, Entailment-based actions for coordination, Models of approximation in databases, Domain-independent queries on databases with external functions, Intuitionistic completeness of first-order logic, The common order-theoretic structure of version spaces and ATMSs, Trees and semantics, Limiting semantics of numerical programs, Some results related to the continuity problem, A representation of L-domains by information systems, Semantic embedding for quantum algorithms, Inverse-limit and topological aspects of abstract interpretation, On the semantics of parsing actions, Game-theoretic analysis of call-by-value computation, Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^†, Note on Algol and conservatively extending functional programming, A characterization of partial metrizability: Domains are quantifiable., Hybrid I/O automata., Higher-order processes and their models, Metric completion versus ideal completion, Proving properties of typed \(\lambda\)-terms using realizability, covers, and sheaves, Information systems revisited -- the general continuous case, Two models of synthetic domain theory, A characterization of the least-fixed-point operator by dinaturality, Angelic semantics of fine-grained concurrency, Roles, stacks, histories: A triple for Hoare, Lifting non-finite axiomatizability results to extensions of process algebras, Observational heterarchy enhancing active coupling, On the reification of semantic linearity, The origin of universality: making and invalidating a free category, An introduction to metric semantics: Operational and denotational models for programming and specification languages, Type system in programming languages, Subtyping recursion and parametric polymorphism in kernel Fun, A relational account of call-by-value sequentiality, Two applications of analytic functors, Abstract Interpretation From a Denotational-semantics Perspective, Categories of Timed Stochastic Relations, Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting, Operational domain theory and topology of sequential programming languages, Orthomodular lattice obtained from addressing a fixed point, Induction and recursion on the partial real line with applications to Real PCF, On functions preserving levels of approximation: A refined model construction for various lambda calculi, Formalizing Operational Semantic Specifications in Logic, Two-level languages for program optimization, The correspondence between partial metrics and semivaluations, Dynamic game semantics, A game-semantic model of computation, A behavioural theory of first-order CML, Decidability of behavioural equivalence in unary PCF, Local properties of query languages, Properly injective spaces and function spaces, Topology, domain theory and theoretical computer science, Encoding FIX in Object Calculi, Basic theory of \(F\)-bounded quantification., Relational interpretations of recursive types in an operational setting., Games and full abstraction for FPC., Integration in Real PCF, Assigning types to processes, Systems Modelling via Resources and Processes: Philosophy, Calculus, Semantics, and Logic, Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin, A type-theoretical alternative to ISWIM, CUCH, OWHY, A paradigmatic object-oriented programming language: Design, static typing and semantics, Baby Modula-3 and a theory of objects, A fully abstract denotational semantics for the \(\pi\)-calculus, On the Yoneda completion of a quasi-metric space, Negative Knowledge for Certain Query Answers, Complete Laziness: a Natural Semantics, Nondeterministic semantics of compound diagrams

Uses Software

Miranda