Logical Relations for Monadic Types

Details Logical Relations for Monadic Types Logical Relations for Monadic Types

2005-11-02

arxiv.org/abs/cs/0511006v2

Mathematical Structures in Computer Science, 18(6):1169-1217, December 2008

Computer Science

Logic in Computer Science

83 pages

Scientific paper

10.1017/S0960129508007172

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.

Affiliated with

Also associated with

No associations

Rating

Logical Relations for Monadic Types does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logical Relations for Monadic Types, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logical Relations for Monadic Types will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-639397