Relational properties of domains
From MaRDI portal
Recommendations
Cited in
(54)- Relative consistency and accessible domains
- Semantical analysis of perpetual strategies in -calculus
- Structural induction and coinduction in a fibrational setting
- A co-induction principle for recursively defined domains
- A domain-theoretic semantics of lax generic functions.
- Semantics and logic of object calculi
- Universal coalgebra: A theory of systems
- Game semantics and linear CPS interpretation
- Relational interpretations of recursive types in an operational setting.
- Games and full abstraction for FPC.
- Computational adequacy for recursive types in models of intuitionistic set theory
- A specification structure for deadlock-freedom of synchronous processes
- Infinite trace equivalence
- A relational account of call-by-value sequentiality
- On a monadic semantics for freshness
- A Kripke logical relation for effect-based program transformations
- Logical relations and parametricity -- a Reynolds programme for category theory and programming languages
- A categorical semantics of higher order store
- An operational domain-theoretic treatment of recursive types
- Syntactic logical relations for polymorphic and recursive types
- scientific article; zbMATH DE number 431772 (Why is no real title available?)
- Some Domain Theory and Denotational Semantics in Coq
- From parametric polymorphism to models of polymorphic FPC
- On Normalization by Evaluation for Object Calculi
- Logical relations for monadic types
- Realisability semantics of parametric polymorphism, general references and recursive types
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- Nested Hoare Triples and Frame Rules for Higher-Order Store
- scientific article; zbMATH DE number 3938531 (Why is no real title available?)
- scientific article; zbMATH DE number 1231621 (Why is no real title available?)
- A relational realizability model for higher-order stateful ADTs
- Denotational semantics of recursive types in synthetic guarded domain theory
- A step-indexed Kripke model of hidden state
- LNL-FPC: the linear/non-linear fixpoint calculus
- Not by equations alone. Reasoning with extensible effects
- Call-by-name gradual type theory
- Denotational aspects of untyped normalization by evaluation
- Interleaving data and effects
- Correctness of compiling polymorphism to dynamic typing
- An operational domain-theoretic treatment of recursive types
- Computational adequacy via ‘mixed’ inductive definitions
- The category-theoretic solution of recursive metric-space equations
- Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation
- 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
- Bialgebraic reasoning on higher-order program equivalence
- A logical approach to type soundness
- Automatic differentiation for ML-family languages: correctness via logical relations
- A domain-theoretic approach to statistical programming languages
- The Worker/Wrapper Transformation
- Logical Relations for PCF
- A calculus of coroutines
- On the relations between monadic semantics
This page was built for publication: Relational properties of domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923093)
