Abstract and concrete categories
Abstract and concrete categories
Notions of computation and monads
Information and Computation
Bisimulation through probabilistic testing
Information and Computation
Probabilistic non-determinism
New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
A characterization of lambda definability in categorical models of implicit polymorphism
Theoretical Computer Science
Handbook of logic in computer science (vol. 3)
Foundations of programming languages
Foundations of programming languages
Names, equations, relations: practical ways to reason about new
Fundamenta Informaticae - Special issue: typed lambda-calculi and applications, selected papers
Stochastic lambda calculus and monads of probability distributions
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Combining a monad and a comonad
Theoretical Computer Science
Information and Computation
Types, Abstractions, and Parametric Polymorphism, Part 2
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
A New Characterization of Lambda Definability
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Logical Relations for Monadic Types
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Mathematical Structures in Computer Science
A Semantics For Evaluation Logic
Fundamenta Informaticae
Relating computational effects by ⊤⊤-lifting
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Program equivalence in a simple language with state
Computer Languages, Systems and Structures
Relating computational effects by ττ-lifting
Information and Computation
| Hi-index | 0.00 |
Logical relations and their generalisations are a fundamental tool in proving properties of lambda calculi, for example, for yielding sound principles for observational equivalence. We propose a natural notion of logical relations that is able to deal with the monadic types of Moggi's computational lambda calculus. The treatment is categorical, and is based on notions of subsconing, mono factorisation systems and monad morphisms. Our approach has a number of interesting applications, including cases for lambda calculi with non-determinism (where being in a logical relation means being bisimilar), dynamic name creation and probabilistic systems.