Typed closure conversion preserves observational equivalence

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2008, Pages 157-168

  Ahmed, Amai ^a   Blume, Matthias ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Equivalence preserving compilation; Full abstraction; Step indexed logical relations; Typed closure conversion

Indexed keywords

EQUIVALENCE-PRESERVING COMPILATION; FULL ABSTRACTION; LANGUAGE-BASED SECURITIES; OBSERVATIONAL EQUIVALENCES; OPERATIONAL TECHNIQUES; POTENTIAL ATTACKS; RECURSIVE TYPES; STEP-INDEXED LOGICAL RELATIONS; TARGET VALUES; TRANSLATION PROCESS; TYPED CLOSURE CONVERSION;

COMPUTER PROGRAMMING; FUNCTIONAL PROGRAMMING; LINGUISTICS; PROGRAM TRANSLATORS; PROGRAMMING THEORY;

ABSTRACTING;

EID: 59249097625     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1411204.1411227     Document Type: Conference Paper

References (29)

1. M. Abadi. Protection in programming-language translations. In ICALP '98, pages 868-883, London, UK, 1998.
2. S. Abramsky, R. Jagadeesan, and P. Malacaria. Full abstraction for PCF. Inf. Comput., 163(2):409-470, 2000.
3. A. Ahmed. Step-indexed syntactic logical relations for recursive and quantified types. Technical Report TR-01-06, Harvard University, Mar. 2006. ttic.uchicago.edu/~amal.
4. A. Ahmed. Step-indexed syntactic logical relations for recursive and quantified types. In ESOP '06, Mar. 2006.
5. A. Ahmed and M. Blume. Typed closure conversion preserves observational equivalence. Technical Report TR-2008-07, Department of Computer Science, University of Chicago, July 2008.
6. K. Arnold, J. Gosling, and D. Holmes. Java(TM) Programming Language, The (4th Edition). Addison-Wesley, 2005.
7. M. Blume and D. McAllester. Sound and complete models of contracts. J. Funct. Prog., 16(4-5):375-414, 2006.
8. R. Cartwright and M. Felleisen. Observable sequentiality and full abstraction. In POPL '92, pages 328-342, 1992.
9. ECMA. ECMA-335: Common Language Infrastructure (CLI). ECMA (European Association for Standardizing Information and Communication Systems), Geneva, Switzerland, third edition, June 2005.
10. M. Felleisen and R. Hieb. A revised report on the syntactic theories of sequential control and state. Theor. Comput. Sci., 103(2):235-271, 1992.
11. R. B. Findler and M. Felleisen. Contracts for higher-order functions. In ICFP '02, pages 48-59. ACM Press, 2002.
12. N. Glew. Object closure conversion. In Higher-Order Operational Techniques in Semantics (HOOTS '99), Sept. 1999.
13. A. Jeffrey. A fully abstract semantics for a concurrent functional language with monadic types. In LICS '95, 1995.
14. A. Kennedy. Securing the .NET programming model. Theor. Comput. Sci., 364(3):311-317, 2006.
15. X. Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In POPL'06, Jan. 2006.
16. X. Leroy. Unboxed objects and polymorphic typing. In POPL '92, pages 177-188. ACM Press, Jan. 1992.
17. I. A. Mason and C. L. Talcott. Equivalence in functional languages with effects. J. Funct. Prog., 1(3):287-327, 1991.
18. J. Matthews and R. B. Findler. Operational semantics for multi-language programs. In POPL '07, Jan. 2007.
19. A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables. In POPL '88, pages 191-203, 1988.
20. Y. Minamide, G. Morrisett, and R. Harper. Typed closure conversion. In POPL '96, pages 271-283, Jan. 1996.
21. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to Typed Assembly Language. In POPL '98, pages 85-97, Jan. 1998.
22. K. Mulmuley. Full abstraction and semantic equivalence. MIT Press, 1987.
23. A. Nanevski, A. Ahmed, G. Morrisett, and L. Birkedal. Abstract predicates and mutable ADTs in Hoare Type Theory. In ESOP '07, pages 189-204, 2007.
24. A. M. Pitts. Existential types: Logical relations and operational equivalence. In ICALP '98, pages 309-326, 1998.
25. G. D. Plotkin. Lambda-definability and logical relations. Memorandum SAI-RM-4, Univ. of Edinburgh, Oct. 1973.
26. J. C. Reynolds. Types, abstraction, and parametric polymorphism. Information Processing, pages 513-523, 1983.
27. J. G. Riecke. Fully abstract translations between functional languages. In POPL '91, pages 245-254, 1991.
28. Z. Shao. Flexible representation analysis. In ICFP '97, pages 85-98. ACM Press, 1997.
29. W. W. Tait. Intensional interpretations of functionals of finite type I. J. of Symbolic Logic, 32(2):198-212, June 1967.