Principals in programming languages: A syntactic proof technique

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 197-207

  Zdancewic, Steve ^a   Grossman, Dan ^a   Morrisett, Greg ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); SEMANTICS; SYNTACTICS;

INTERACTIVE AGENTS; LARGE PROGRAMS; SEMANTIC ARGUMENTS; SIMPLY TYPED LAMBDA CALCULUS;

CALCULATIONS;

EID: 17144422518     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317799     Document Type: Article

References (25)

1. Martín Abadi, Luca Cardelli, and Pierre-Louis Curien. Formal parametric polymorphism. In Principles of Programming Languages, volume 20, pages 157-167, January 1993.
2. Godmar Back, Patrick Tullmann, Leigh Stoller, Wilson C. Hseih, and Jay Lepreau. Java operating systems: Design and implementation. Technical Report UUCS-98-015, University of Utah, August 1998.
3. Brian N. Bershad, Stefan Savage, Przemyslaw Pardyak, Emin Gün Sirer, Marc Fiuczynski, David Becker, Susan Eggers, and Craig Chambers. Extensibility, safety and performance in the SPIN operating system. In Proceedings of the Fifteenth ACM Symposium on Operating Systems Principles, pages 267-283, Copper Mountain, CO, December 1995.
4. Karl Crary. A simple proof technique for certain parametricity results. In Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming, Paris, France, September 1999. This volume.
5. Jean-Yves Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge University Press, 1989.
6. Michael Godfrey, Tobias Mayr, Praveen Seshadri, and Thorsten von Eicken. Secure and portable database extensibility. In Proceedings of the 1997 ACM-SIGMOD Conference on the Management of Data, pages 390-401, Seattle, WA, June 1998.
7. Chris Hawblitzel, Chi-Chao Chang, Grzegorz Czajkowski, Deyu Hu, and Thorston von Eiken. Implementing multiple protection domains in Java. In 1998 USENIX Annual Technical Conference, New Orleans, LA, June 1998.
8. Nevin Heintze and Jon G. Riecke. The SLam calculus: programming with secrecy and integrity. In Conference Record of the Twenty-Fifth Annual ACM Symposium on Principles of Programming Languages, pages 365-377. ACM Press, 1998.
9. Xavier Leroy and François Rouaix. Security properties of typed applets. In Principles of Programming Languages, January 1998.
10. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). The MIT Press, 1997.
11. J.C. Mitchell. On the equivalence of data representations. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pages 305-330. Academic Press, 1991.
12. John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. ACM Transactions on Programming Languages and Systems, 10(3):470-502, July 1988.
13. Andrew C. Myers. JFlow: Practical mostly-static information flow control. In Proceedings of the 26th ACM Symposium on Principles of Programming Languages, pages 228-241, San Antonio, TX, January 1999.
14. Flemming Nielson and Hanne Riis Nielson. Two-Level Functional Languages. Number 34 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.
15. John Peterson, Kevin Hammond, Lennart Augustsson, Brian Boutel, Warren Burton, Joseph Fasel, Andrew D. Gordon, John Hughes, Paul Hudak, Thomas Johnsson, Mark Jones, Erik Meijer, Simon Peyton Jones, Alastair Reid, and Philip Wadler. Report on the programming language Haskell, version 1.4. http://www.haskell.org/report.
16. Benjamin C. Pierce and Davide Sangiorgi. Behavioral equivalence in the polymorphic pi-calculus. Technical Report MS-CIS-99-10, University of Pennsylvania, April 1999.
17. John Hamilton Reppy. Higher-order Concurrency. PhD thesis, Cornell University, Ithaca, NY, June 1992. TR 92-1852.
18. John C. Reynolds. Towards a theory of type structure. In Programming Symposium, volume 19 of Lecture Notes in Computer Science, pages 408-425. Springer-Verlag, Paris, France, April 1974.
19. John C. Reynolds. Types, abstraction, and parametric polymorphism. In R.E.A Mason, editor, Information Processing, pages 513-523. Elsevier Science Publishers B.V., 1983.
20. C. Strachey. Fundamental concepts in programming languages. Unpublished Lecture Notes, Summer School in Computer Programming, August 1967.
21. Dennis Volpano and Geoffrey Smith. A type-based approach to program security. In Proceedings of TAPSOFT '97, Colloquium on Formal Approaches to Software Engineering, Lille, France, April 1997.
22. Dan S. Wallach and Edward W. Felten. Understanding Java stack inspection. In Proceedings of 1998 IEEE Symposium on Security and Privacy, Oakland, CA, May 1998.
23. Dan Seth Wallach. A New Approach to Mobile Code Security. PhD thesis, Princeton University, 1999.
24. Andrew K. Wright and Mattias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38-94, 1994. Preliminary version in Rice TR 91-160.
25. Steve Zdancewic and Dan Grossman. Syntax and semantics for multiple agents and abstract types. Technical Report 99-1752, Cornell University, March 1999.