Relational properties of domains

DOI10.1006/INCO.1996.0052zbMath0868.68037OpenAlexW2060852846MaRDI QIDQ1923093

Andrew M. Pitts

Publication date: 17 August 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0620b9ab85303605a39f6f3a4e2edeb763972771

zbMATH Keywords

denotational semanticsrecursively defined domains

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (42)

Logical relations and parametricity -- a Reynolds programme for category theory and programming languages ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ A Kripke logical relation for effect-based program transformations ⋮ Some Domain Theory and Denotational Semantics in Coq ⋮ Unnamed Item ⋮ Denotational aspects of untyped normalization by evaluation ⋮ The category-theoretic solution of recursive metric-space equations ⋮ On the relations between monadic semantics ⋮ Unnamed Item ⋮ On Normalization by Evaluation for Object Calculi ⋮ A domain-theoretic semantics of lax generic functions. ⋮ Interleaving data and effects ⋮ Correctness of compiling polymorphism to dynamic typing ⋮ A relational realizability model for higher-order stateful ADTs ⋮ A specification structure for deadlock-freedom of synchronous processes ⋮ Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation ⋮ Denotational semantics of recursive types in synthetic guarded domain theory ⋮ Unnamed Item ⋮ Logical relations for monadic types ⋮ Semantics and logic of object calculi ⋮ A step-indexed Kripke model of hidden state ⋮ Infinite trace equivalence ⋮ An operational domain-theoretic treatment of recursive types ⋮ Realisability semantics of parametric polymorphism, general references and recursive types ⋮ Game semantics and linear CPS interpretation ⋮ A relational account of call-by-value sequentiality ⋮ Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types ⋮ An axiomatic account of a fully abstract game semantics for general references ⋮ Logical predicates in higher-order mathematical operational semantics ⋮ Two guarded recursive powerdomains for applicative simulation ⋮ From parametric polymorphism to models of polymorphic FPC ⋮ Semantical analysis of perpetual strategies in \(\lambda\)-calculus ⋮ Structural induction and coinduction in a fibrational setting ⋮ Nested Hoare Triples and Frame Rules for Higher-Order Store ⋮ A Categorical Semantics of Higher Order Store ⋮ On a monadic semantics for freshness ⋮ Universal coalgebra: A theory of systems ⋮ Relational interpretations of recursive types in an operational setting. ⋮ Games and full abstraction for FPC. ⋮ Syntactic Logical Relations for Polymorphic and Recursive Types ⋮ Not by equations alone: Reasoning with extensible effects ⋮ A calculus of coroutines

This page was built for publication: Relational properties of domains