Year: 2008
Type: article
Abstract: 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.
Institutions: École Normale Supérieure Paris-Saclay, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire Spécification et Vérification, University of Warsaw, National Institute of Advanced Industrial Science and Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2619086274