Relational parametricity for a polymorphic linear lambda calculus

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6461 LNCS, Issue , 2010, Pages 344-359

  Zhao, Jianzhou ^a   Zhang, Qi ^a   Zdancewic, Steve ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXTUAL EQUIVALENCE; ENCODINGS; LINEAR LAMBDA CALCULUS; LOGICAL RELATIONS; OPEN TERMS; RELATIONAL PARAMETRICITY; SYSTEM F; SOUND AND COMPLETE;

DIFFERENTIATION (CALCULUS); COMPUTATIONAL MECHANICS; THEOREM PROVING;

CALCULATIONS;

EID: 78650740252     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17164-2_24     Document Type: Conference Paper

References (25)

1. Ahmed, A.: Step-indexed syntactic logical relations for recursive and quantified types. In: Sestoft, P. (ed.) ESOP 2006. LNCS, vol. 3924, pp. 69-83. Springer, Heidelberg (2006)
2. Ahmed, A., Dreyer, D., Rossberg, A.: State-dependent representation independence. SIGPLAN Not. 44(1), 340-353 (2009)
3. Aydemir, B., Charguéraud, A., Pierce, B.C., Pollack, R., Weirich, S.: Engineering formal metatheory. In: POPL 2008: Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2008)
4. Barber, A.: Linear Type Theories, Semantics and Action Calculi. PhD thesis, Edinburgh University (1997)
5. Bierman, G.M.: Program equivalence in a linear functional language. J. Funct. Program. 10(2), 167-190 (2000)
6. Bierman, G.M., Pitts, A.M., Russo, C.V.: Operational properties of lily, a polymorphic linear lambda calculus with recursion. In: Proc. of HOOTS. ENTCS, vol. 41. Elsevier, Amsterdam (2000)
7. Birkedal, L., Møgelberg, R.E., Petersen, R.L.: Linear Abadi and Plotkin logic. Logical Methods in Computer Science 2(5:1), 1-33 (2006)
8. Birkedal, L., Støvring, K., Thamsborg, J.: Relational parametricity for references and recursive types. In: TLDI 2009: Proceedings of the 4th International Workshop on Types in Language Design and Implementation, pp. 91-104. ACM, New York (2009)
9. The Coq Development Team. The Coq Proof Assistant Reference Manual, Version 8.2 (2009), http://coq.inria.fr
10. Crary, K.: Logical Relations and a Case Study in Equivalence Checking. In: Advanced Topics in Types and Programming Languages. MIT Press, Cambridge (2005)
11. Crole, R.L.: Completeness of bisimilarity for contextual equivalence in linear theories. Logic Jnl IGPL 9(1), 27-51 (2001)
12. Donnelly, K., Xi, H.: A formalization of strong normalization for simply-typed lambda-calculus and System F. Electron. Notes Theor. Comput. Sci. 174(5), 109-125 (2007)
13. Girard, J.-Y.: Interprétation fonctionnelle et élimination des coupures de l'arith mé tique d'ordre supérieur. Thèse d'état (1972); Summary in Fenstad, J.E. (ed.): Scandinavian Logic Symposium, pp. 63-92. North-Holland, Amsterdam (1971)
14. Hasegawa, M.: Logical predicates for intuitionistic linear type theories. In: Girard, J.-Y. (ed.) TLCA 1999. LNCS, vol. 1581, pp. 198-213. Springer, Heidelberg (1999)
15. Mason, I., Talcott, C.: Equivalence in functional languages with effects. J. Funct. Program. 1(3), 245-285 (1991)
16. Mazurak, K., Zhao, J., Zdancewic, S.: Lightweight linear types in system F. In: TLDI 2010: Proceedings of the 4th InternationalWorkshop on Types in Language Design and Implementation (2010)
17. Pitts, A.: Typed Operational Reasoning. In: Advanced Topics in Types and Programming Languages. MIT Press, Cambridge (2005)
18. Reynolds, J.C.: Types, abstraction, and parametric polymorphism. In: Mason, R.E.A. (ed.) Information Processing, pp. 513-523. Elsevier Science Publishers B.V., Amsterdam (1983)
19. Schürmann, C., Sarnat, J.: Towards a judgmental reconstruction of logical relation proofs. Technical report, Yale University (2006)
20. Sewell, P., Nardelli, F.Z., Owens, S., Peskine, G., Ridge, T., Sarkar, S., Strniša, R.: Ott: Effective Tool Support for theWorking Semanticist. J. Funct. Program. 20(1), 71-122 (2010)
21. Tait, W.W.: Intensional interpretations of functionals of finite type I. Journal of Symbolic Logic 32(2), 198-212 (1967)
22. Vytiniotis, D., Weirich, S.: Free theorems and runtime type representations. Electron. Notes Theor. Comput. Sci. 173, 357-373 (2007)
23. Wadler, P.: Theorems for free! In: Proceedings of the 4th International Symposium on Functional Programming and Computer Architecture (September 1989)
24. Walker, D.: Substructural Type Systems. In: Advanced Topics in Types and Programming Languages. MIT Press, Cambridge (2005)
25. Zhao, J., Zhang, Q., Zdancewic, S.: Relational parametricity for a polymorphic linear lambda calculus. Technical report (2010), http://www.cis.upenn.edu/~jianzhou/parametricity4linf