Relational Parametricity for References and Recursive Types

Proceedings of the 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation, TLDI'09

Volumn , Issue , 2009, Pages 91-103

  Birkedal, Lars ^a   Stovring, Kristian ^a   Thamsborg, Jacob ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Denotational Semantics, Possible World Semantics,Relational Parametricity, Impredicative Polymorphism, General References, Recursive Types

Indexed keywords

CONTEXTUAL EQUIVALENCE; DENOTATIONAL SEMANTICS, POSSIBLE WORLD SEMANTICS,RELATIONAL PARAMETRICITY, IMPREDICATIVE POLYMORPHISM, GENERAL REFERENCES, RECURSIVE TYPES; HIGHER-ORDER LANGUAGES; LOGICAL RELATIONS; NON-TRIVIAL; PARAMETERIZED; PARAMETRIC MODELS; PARAMETRICITY; POSSIBLE WORLD SEMANTICS; PROGRAMMING LANGUAGE; RECURSIVE TYPES; RELATIONAL PARAMETRICITY;

LINGUISTICS; POLYMORPHISM; PROBLEM ORIENTED LANGUAGES; RECURSIVE FUNCTIONS;

SEMANTICS;

EID: 67650088559     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1481861.1481873     Document Type: Conference Paper

References (37)

1. M. Abadi and G. Plotkin. A per model of polymorphism and recursive types. In Proceedings of LICS, pages 355-365, 1990.
2. A. Ahmed. Step-indexed syntactic logical relations for recursive and quantified types. In Proc. of ESOP, pages 69-83, 2006. (Pubitemid 44019552)
3. A. Ahmed, D. Dreyer, and A. Rossberg. State-dependent representation independence. To appear at POPL 2009.
4. R. M. Amadio. Recursion over realizability structures. Information and Computation, 91(1):55-85, 1991.
5. A. W. Appel and D. McAllester. An indexed model of recursive types for foundational proof-carrying code. TOPLAS, 23(5):657-683, 2001. (Pubitemid 33609124)
6. A. W. Appel, P.-A. Melliès, C. D. Richards, and J. Vouillon. A very modal model of a modern, major, general type system. In Proc. of POPL, pages 109-122, 2007. (Pubitemid 46160758)
7. N. Benton and B. Leperchey. Relational reasoning in a nominal semantics for storage. In Proc. of TLCA, volume 3461 of LNCS, 2005. (Pubitemid 41312710)
8. G. M. Bierman, A. M. Pitts, and C. V. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. In Proc. of HOOTS, volume 41 of ENTCS, 2000.
9. L. Birkedal and R. E. Møgelberg. Categorical models of Abadi-Plotkin's logic for parametricity. Mathematical Structures in Computer Science, 15(4):709-772, 2005. (Pubitemid 41121742)
10. L. Birkedal, R. E. Møgelberg, and R. L. Petersen. Linear Abadi & Plotkin logic. Logical Methods in Computer Science, 2(5:1):1-33, 2006.
11. N. Bohr and L. Birkedal. Relational reasoning for recursive types and references. In Proc. of APLAS, pages 79-96, 2006. (Pubitemid 46030583)
12. N. Bohr and L. Birkedal. Relational parametricity for recursive types and references of closed types. Technical report, IT University of Copenhagen, 2007. A Chapter in Nina Bohr's Ph.D. dissertation 2007.
13. K. Crary and R. Harper. Syntactic logical relations for polymorphic and recursive types. ENTCS, 172:259-299, 2007. (Pubitemid 46367779)
14. A. Filinski. On the relations between monadic semantics. Theoretical Computer Science, 375(1-3):41-75, 2007. (Pubitemid 46528646)
15. M. Hasegawa. Relational parametricity and control. Logical Methods in Computer Science, 2(3):1-22, 2006.
16. P. Johann. On proving the correctness of program transformations based on free theorems for higher-order polymorphic calculi. Mathematical Structures in Computer Science, 10(2):201-229, 2005. (Pubitemid 44707036)
17. P. Johann and J. Voigtlaender. The impact of seq on free theorems-based program transformations. Fundamenta Informaticae, 69(1-2):63-102, 2006. (Pubitemid 43317261)
18. V. Koutavas and M. Wand. Bisimulations for untyped imperative objects. In Proc. of ESOP, pages 146-161, 2006. (Pubitemid 44019557)
19. V. Koutavas and M. Wand. Small bisimulations for reasoning about higher-order imperative programs. In Proc. of POPL, pages 141-152, 2006. (Pubitemid 44032269)
20. S. B. Lassen and P. B. Levy. Normal form bisimulation for parametric polymorphism. To appear at LICS 2008.
21. S. B. Lassen and P. B. Levy. Typed normal form bisimulation. In Proc. of CSL, volume 4646 of LNCS, pages 283-297, 2007.
22. P. Levy. Possible world semantics for general storage in call-by-value. In Proc. of CSL, volume 2471 of LNCS, pages 232-246, 2002.
23. P.-A. Melliès and J. Vouillon. Recursive polymorphic types and parametricity in an operational framework. In Proc. of LICS, pages 82-91, 2005. (Pubitemid 41462555)
24. R. Møgelberg. Interpreting polymorphic FPC into domain theoretic models of parametric polymorphism. In Proc. of ICALP, pages 372-383, 2006. (Pubitemid 44113262)
25. R. Møgelberg and A. Simpson. Relational parametricity for computational effects. In Proc. of LICS, pages 346-355, 2007.
26. R. Møgelberg and A. Simpson. Relational parametricity for control considered as a computational effect. In Proc. of MFPS, ENTCS, pages 295-312, 2007. (Pubitemid 46367807)
27. B. C. Pierce. Types and Programming Languages. MIT Press, 2002.
28. A. M. Pitts. Relational properties of domains. Information and Computation, 127:66-90, 1996. (Pubitemid 126411496)
29. A. M. Pitts. Parametric polymorphism and operational equivalence. Mathematical Structures in computer Science, 10:321-359, 2000.
30. A. M. Pitts. Advanced Topics in Types and Programming Languages, chapter Typed Operational Reasoning. The MIT Press, 2005.
31. A. M. Pitts and I. Stark. Observable properties of higher order functions that dynamically create local names, or: What's new? In Proceedings of MFPS, volume 711 of LNCS, pages 122-141, 1993.
32. G. Plotkin. Second order type theory and recursion. Notes for a talk at the Scott Fest, Feb. 1993.
33. G. Plotkin and M. Abadi. A logic for parametric polymorphism. In Proc. of TLCA, volume 664 of LNCS, pages 361-375, 1993.
34. J. Reynolds. Types, abstraction, and parametric polymorphism. Information Processing, 83:513-523, 1983. (Pubitemid 14559917)
35. K. Støvring and S. B. Lassen. A complete, co-inductive syntactic theory of sequential control and state. In Proc. of POPL, pages 161-172, 2007. (Pubitemid 46160764)
36. E. Sumii and B. C. Pierce. A bisimulation for type abstraction and recursion. In Proc. of POPL, pages 63-74, 2005. (Pubitemid 40493967)
37. P. Wadler. Theorems for free! In 4th Symposium on Functional Programming Languages and Computer Architecture, pages 347-359, 1989.