Translating dependency into parametricity

ACM SIGPLAN Notices

Volumn 39, Issue 9, 2004, Pages 115-125

  Tse, Stephen ^a   Zdancewic, Steve ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

DCC; Dependency; Haskell; Information flow; Lambda calculus; Logical relations; Monads; Noninterference; Parametricity; Polymorphism; Protection contexts; Security; Translation

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; PARAMETER ESTIMATION; RECURSIVE FUNCTIONS; SECURITY OF DATA;

DCC; DEPENDENCY; INFORMATION FLOW; LAMDA; MONADS; NONINTERFERENCE; PARAMETRICITY; POLYMORPHISM; SECURITY; TRANSLATION;

INFORMATION ANALYSIS;

EID: 9744265826     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/1016848.1016868     Document Type: Conference Paper

References (25)

1. Martín Abadi, Anindya Banerjee, Nevin Heintze, and Jon Riecke. A core calculus of dependency. In Proc. 26th ACM Symp. on Principles of Programming Languages (POPL), pages 147-160, San Antonio, TX, January 1999.
2. Nick Benton. Simple relational correctness proofs for static analyses and program transformations. In Proc. 31 st ACM Symp. on Principles of Programming Languages (POPL), pages 14-25. ACM Press, 2004.
3. Matthew Fluet and Greg Morrisett. Monadic regions. In Proc. ACM SIGPLAN International Conference on Functional Programming (ICFP), 2004.
4. Matthew Fluet and Riccardo Pucella. Phantom types and subtyping. In Proc. of the 2nd IFIP International Conference on Theoretical Computer Science, 2002.
5. J.-Y. Girard. Interprétation Functionelle et Élimination des Coupures dans l'Arithmétique d'Order Supérieure. PhD thesis, Université Paris VII, 1972.
6. Nevin Heintze and Jon G. Riecke. The SLam calculus: Programming with secrecy and integrity. In Proc. 25th ACM Symp. on Principles of Programming Languages (POPL), San Diego, California, 1998.
7. Patricia Johann and Janis Voigtländer. Free theorems in the presence of seq. In Proc. 31st ACM Symp. on Principles of Programming Languages (POPL), 2004.
8. J. Launchbury and R. Paterson. Parametricity and unboxing with pointed types. In Proc. of the 9th European Symposium on Programming, 1996.
9. John C. Mitchell. Foundations for Programming Languages. The MIT Press, 1996.
10. Eugenio Moggi. Notions of computation and monads. Information and Computation, 1:55-92, 1991.
11. Benjamin C. Pierce. Types and Programming Languages. The MIT Press, 2002.
12. François Pottier and Vincent Simonet. Information flow inference for ML. In Proc. 29th ACM Symp. on Principles of Programming Languages (POPL), 2002.
13. John C. Reynolds. Towards a theory of type structure. In Programming Symposium, volume 19 of Lecture Notes in Computer Science. Springer-Verlag, 1974.
14. John C. Reynolds. Types, abstraction, and parametric polymorphism. In Information Processing. Elsevier Science Publishers B.V., 1983.
15. Andrei Sabelfeld and Andrew C. Myers. Language-based information-flow security. IEEE Journal on Selected Areas in Communications, 21(1):5-19, January 2003.
16. Andrei Sabelfeld and David Sands. A PER model of secure information flow in sequential programs. Higher-Order and Symbolic Computation, 14(1):59-91, March 2001.
17. Eijiro Sumii and Benjamin C. Pierce. Logical relations for encryption. In Proc. of the 14th IEEE Computer Security Foundations Workshop, 2001.
18. Eijiro Sumii and Benjamin C. Pierce. A bisimulation for dynamic sealing. In Proc. 31st ACM Symp. on Principles of Programming Languages (POPL). ACM Press, 2004.
19. Stephen Tse and Steve Zdancewic. Run-time principals in information-flow type systems. In Proc. IEEE Symposium on Security and Privacy, 2004. To Appear.
20. Stephen Tse and Steve Zdancewic. Translating dependency into parametricity. Technical report, University of Pennsylvania, January 2004.
21. Dennis Volpano, Geoffrey Smith, and Cynthia Irvine. A sound type system for secure flow analysis. Journal of Computer Security, 4(3):167-187, 1996.
22. Philip Wadler. Theorems for free! In Proceedings of the 4th International Symposium on Functional Programming and Computer Architecture, September 1989.
23. Geoffrey Washburn and Stephanie Weirich. Boxes go bananas: Encoding higher-order abstract syntax with parametric polymorphism. In Proc. of the 8th ACM SIGPLAN International Conference on Functional Programming, Upsala, Sweden, August 2003.
24. Stephan Zdancewic. Programming Languages for Information Security. PhD thesis, Cornell University, 2002.
25. Steve Zdancewic and Andrew C. Myers. Secure information flow and CPS. In Proc. of the 10th European Symposium on Programming, 2001.