An indexed model of recursive types for foundational proof-carrying code

ACM Transactions on Programming Languages and Systems

Volumn 23, Issue 5, 2001, Pages 657-683

  Appel, Andrew W ^a   McAllester, David ^b  

^a Princeton University   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Languages; Theory

Indexed keywords

EID: 0038559204     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/504709.504712     Document Type: Article

References (21)

1. APPEL, A. W. AND FELTEN, E. W. 2001. Models for security policies in proof-carrying code. Tech. Rep. TR-636-01, Computer Science, Princeton University.
2. APPEL, A. W. AND FELTY, A. P. 2000. A semantic model of types and machine instructions for proof-carrying code. In POPL '00: The 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, 243-253.
3. BIRKEDAL, L. AND HARPER, R. 1997. Relational interpretations of recursive types in an operational setting. In Theoretical Aspects of Computer Software. Springer-Verlag, Berlin.
4. COLBY, C., LEE, P., NECULA, G. C., BLAU, F., CLINE, K., AND PLESKO, M. 2000. A certifying compiler for Java. In Proceedings of the 2000 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '00). ACM Press, New York, NY.
5. CONSTABLE, R. L., ALLEN, S. F., BROMLEY, H. M., CLEAVELAND, W. R., CREMER, J. F., HARPER, R. W., HOWE, D. J., KNOBLOCK, T. B., MENDLER, N. P., PANANGADEN, P., SASAKI, J. T., AND SMITH, S. F. 1986. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs, NJ.
6. HARPER, R., HONSELL, F., AND PLOTKIN, G. 1993. A framework for defining logics. J. ACM 40, 1 (Jan.), 143-184.
7. MACQUEEN, D., PLOTKIN, G., AND SETHI, R. 1986. An ideal model for recursive polymophic types. Information and Computation 71, 1/2, 95-130.
8. MICHAEL, N. G. AND APPEL, A. W. 2000. Machine instruction syntax and semantics in higher-order logic. In 17th International Conference on Automated Deduction. Springer-Verlag, Berlin. LNAI 1831.
9. MILNER, R. 1977. Fully abstract models of typed λ-calculi. Theoretical Computer Science 4, 1-22.
10. MINAMIDE, Y., MORRISETT, G., AND HARPER, R. 1996. Typed closure conversion. In POPL '96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, 271-283.
11. MITCHELL, J. C. AND VISWANATHAN, R. 1996. Effective models of polymorphism, subtyping and recursion. In 23rd International Colloquium on Automata, Languages, and Programming. Springer-Verlag, Berlin.
12. MORRISETT, G., CRARY, K., GLEW, N., AND WALKER, D. 1998a. Stack-based typed assembly language. In ACM Workshop on Types in Compilation. Springer-Verlag, Berlin. LNCS 1473.
13. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1998b. From System F to typed assembly language. In POPL '98: 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York NY, 85-97.
14. NECULA, G. 1997. Proof-carrying code. In 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, 106-119.
15. NECULA, G. C. 1998. Compiling with proofs. Ph.D. dissertation, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
16. PFENNING, F. 1994. Elf: A meta-language for deductive systems. In Proceedings of the 12th International Conference on Automated Deduction, A. Bundy, Ed. Springer-Verlag LNAI 814, Nancy, France, 811-815.
17. PFENNING, F. AND SCHÜRMANN, C. 1999. System description: Twelf - a meta-logical framework for deductive systems. In The 16th International Conference on Automated Deduction. Springer-Verlag, Berlin.
18. PITTS, A. M. 1996. Relational properties of domains. Information and Computation 127, 2, 66-90.
19. SCHMIDT, D. A. 1986. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, Boston, MA.
20. SCOTT, D. S. 1976. Data types as lattices. SIAM J. Comput. 5, 3, 522-87.
21. WINSKEL, G. 1993. The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge, MA.