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
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
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
Lambda Definability with Sums via Grothendieck Logical Relations
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Unifying Approach to Data-Independence
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
CSL '92 Selected Papers from the Workshop on Computer Science Logic
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Semantic types: a fresh look at the ideal model for types
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cryptographic logical relations
Theoretical Computer Science
Logical relations for monadic types†
Mathematical Structures in Computer Science
On a semantic definition of data independence
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
On completeness of logical relations for monadic types
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Reducibility and ⊤⊤-lifting for computation types
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
A semantic formulation of ⊤⊤-lifting and logical predicates for computational metalanguage
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Preorders on monads and coalgebraic simulations
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Logical relations andt heir 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 and distributivity laws for monads. 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.