Logical Relations for Monadic Types
<|reference_start|>Logical Relations for Monadic Types: Logical relations and their generalizations are a fundamental tool in proving properties of lambda-calculi, e.g., yielding sound principles for observational equivalence. We propose a natural notion of logical relations 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 factorization systems, and monad morphisms. Our approach has a number of interesting applications, including cases for lambda-calculi with non-determinism (where being in logical relation means being bisimilar), dynamic name creation, and probabilistic systems.<|reference_end|>
@article{goubault-larrecq2005logical,
    title={Logical Relations for Monadic Types},
    author={Jean Goubault-Larrecq, Slawomir Lasota and David Nowak},
    journal={Mathematical Structures in Computer Science, 18(6):1169-1217,
  December 2008},
    year={2005},
    doi={10.1017/S0960129508007172},
    archivePrefix={arXiv},
    eprint={cs/0511006},
    primaryClass={cs.LO}
}