Logical Relations for Monadic Types-Reference-Cited by-同舟云学术

Logical Relations for Monadic Types

Published:2002 Issue: Volume: Page:553-568
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Goubault-Larrecq Jean,Lasota Slawomir,Nowak David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45793-3_37

Reference26 articles.

1. J. Adamek, H. Herrlich, and G. Strecker. Abstract and Concrete Categories. Wiley, New York, 1990.

2. M. Alimohamed. A characterization of lambda definability in categorical models of implicit polymorphism. Theoretical Computer Science, 146:5–23, 1995.

3. R. Crole and A. Pitts. New foundations for fixpoint computations: Fix-hyperdoctrines and the fix-logic. Information and Computation, 98:171–210, 1992.

4. Lect Notes Comput Sci;M. Fiore,1999

5. J. Goubault-Larrecq and E. Goubault. On the geometry of intuitionistic S4 proofs. Research Report LSV-01-8, LSV, CNRS & ENS Cachan, 2001. To appear in Homology, Homotopy and Applications.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Versatility of Open Logical Relations;Programming Languages and Systems;2020

2. Preorders on Monads and Coalgebraic Simulations;Lecture Notes in Computer Science;2013

3. A Provably Correct Translation of the λ-Calculus into a Mathematical Model of C++;Theory of Computing Systems;2007-10-13

4. On Completeness of Logical Relations for Monadic Types;Advances in Computer Science - ASIAN 2006. Secure Software and Related Issues;2007

5. Reducibility and ⊤ ⊤-Lifting for Computation Types;Lecture Notes in Computer Science;2005