Logical relations for monadic types
From MaRDI portal
Publication:3545276
DOI10.1017/S0960129508007172zbMATH Open1156.03014MaRDI QIDQ3545276FDOQ3545276
David Nowak, Sławomir Lasota, Jean Goubault-Larrecq
Publication date: 10 December 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1948186
- scientific article; zbMATH DE number 1342222
- Relations in monadic third-order logic
- On the relations between monadic semantics
- Syntactic logical relations for polymorphic and recursive types
- Logical relations and the typed λ-calculus
- Logical Relations as Types: Proof-Relevant Parametricity for Program Modules
- Monads on Categories of Relational Structures.
- scientific article; zbMATH DE number 3285192
Cites Work
- Categories of continuous functors. I
- Notions of computation and monads
- Bisimulation through probabilistic testing
- Combining a monad and a comonad
- Relational properties of domains
- Logical relations and the typed λ-calculus
- Adjoint Lifting Theorems for Categories of Algebras
- On the geometry of intuitionistic S4 proofs
- Proceedings of the Conference on Categorical Algebra
- A characterization of lambda definability in categorical models of implicit polymorphism
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Extensions of valuations
- Prelogical relations
Cited In (25)
- Effectful applicative similarity for call-by-name lambda calculi
- A fibrational tale of operational logical relations: pure, effectful and differential
- Title not available (Why is that?)
- Title not available (Why is that?)
- Program equivalence in linear contexts
- Graded Hoare logic and its categorical semantics
- Weakest preconditions in fibrations
- Title not available (Why is that?)
- Deriving logical relations from interpretations of predicate logic
- On bisimilarity in lambda calculi with continuous probabilistic choice
- Weakest preconditions in fibrations
- Bisimulation as a logical relation
- Title not available (Why is that?)
- Relating Computational Effects by ⊤ ⊤-Lifting
- Cryptographic logical relations
- Program equivalence in a simple language with state
- Logical predicates in higher-order mathematical operational semantics
- Mechanizing logical relations
- Computer Science Logic
- Title not available (Why is that?)
- A categorical framework for congruence of applicative bisimilarity in higher-order languages
- Codensity Lifting of Monads and its Dual
- Bimonoidal structure of probability monads
- Logical relations and the typed λ-calculus
- Relations in monadic third-order logic
This page was built for publication: Logical relations for monadic types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545276)
