An expressive, scalable type theory for certified code

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

Volumn , Issue , 2002, Pages 191-205

  Crary, Karl ^a   Vanderwaart, Joseph C ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Languages; Security

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; LINEAR PROGRAMMING; LOGIC PROGRAMMING; SECURITY OF DATA; SEMANTICS;

CERTIFIED CODE; LOGICAL TYPE THEORY;

PROGRAMMING THEORY;

EID: 0036954436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/583852.581497     Document Type: Conference Paper

References (28)

1. A. W. Appel and A. P. Felty. A semantic model of types and machine instructions for proof-carrying code. In Twenty-Seventh ACM Symposium on Principles of Programming Languages, pages 243-253, Boston, Jan. 2000.
2. B. Bershad, S. Savage, P. Pardyak, E. Sirer, M. Fiuczynski, D. Becker, C. Chambers, and S. Eggers. Extensibility, safety and performance in the SPIN operating system. In Fifteenth ACM Symposium on Operating Systems Principles, pages 267-284, Copper Mountain, Dec. 1995.
3. I. Cervesato and F. Pfenning. A linear logical framework. In Eleventh IEEE Symposium on Logic in Computer Science, 264-275, New Brunswick, New Jersey, July. 1996.
4. C. Colby, P. Lee, G. Necula, and F. Blau. A certifying compiler for Java. In 2000 SIGPLAN Conference on Programming Language Design and Implementation, pages 95-107, Vancouver, British Columbia, June 2000.
5. K. Crary and S. Weirich. Flexible type analysis. In 1999 ACM International Conference on Functional Programming, pages 233-248, Paris, Sept. 1999.
6. J. Despeyroux, F. Pfenning, and C. Schürmann. Primitive recursion for higher-order abstract syntax. In Third International Conference on Typed Lambda Calculi and Applications, volume 1210 of Lecture Notes in Computer Science, pages 147-163, Nancy, France, Apr. 1997. Springer-Verlag. Extended version published as CMU technical report CMU-CS-96-172.
7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1-102, 1987.
8. R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143-184, Jan. 1993.
9. R. Harper and G. Morrisett. Compiling polymorphism using intensional type analysis. In Twenty-Second ACM Symposium on Principles of Programming Languages, pages 130-141, San Francisco, Jan., 1995.
10. R. Harper and F. Pfenning. On equivalence and canonical forms in the LF type theory. Technical Report CMU-CS-00-148, Carnegie Mellon University, School of Computer Science, July 2000.
11. W. Howard. The formulas-as-types notion of construction. In J. P. Seldin and J. R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda-Calculus and Formalism, pages 479-490. Academic Press, 1980.
12. M. Y. Levin and B. C. Pierce. Tinkertype: A language for playing with formal systems. Technical Report MS-CIS-99-19, Dept. of CIS, University of Pennsylvania, July 1999.
13. T. Lindholm and F. Yellin. The Java Virtual Machine Specification. Addison-Wesley, 1996.
14. R. Miller, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). The MIT Press, Cambridge, Massachusetts, 1997.
15. G. Morrisett, K. Crary, N. Glew, and D. Walker. Stack-based typed assembly language. Journal of Functional Programming, 12(1):43-88, Jan. 2002. An earlier version appeared in the 1998 Workshop on Types in Compilation, volume 1473 of Lecture Notes in Computer Science.
16. G. Morrisett, D. Walker, K. Crary, and N. Glew. From System F to typed assembly language. ACM Transactions on Programming Languages and Systems, 21(3):527-568, May 1999. An earlier version appeared in the 1998 Symposium on Principles of Programming Languages.
17. G. Necula and P. Lee. Safe kernel extensions without runtime checking. In Second Symposium on Operating Systems Design and Implementation, pages 229-243, Seattle, Oct. 1996.
18. C. Paulin-Mohring. Inductive definitions in the system coqrules and properties. In International Conference on Typed Lambda Calculi and Applications, volume 664 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
19. C. Schürmann. Automating the Meta Theory of Deductive Systems. PhD thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania, Oct. 2000.
20. C. Schümann and F. Pfenning. Automated theorem proving in a simple meta-logic for LF. In Fifteenth International Conference on Automated Deduction, volume 1421 of Lecture Notes in Computer Science, Lindau, Germany, July 1998. Springer-Verlag.
21. Z. Shao, B. Saha, V. Trifonov, and N. Papaspyrou. A type system for certified binaries. In Twenty-Ninth ACM Symposium on Principles of Programming Languages, pages 217-232. Portland, Oregon, Jan. 2002.
22. F. Smith, D. Walker, and G. Morrisett. Alias types. In European Symposium on Programming, Berlin, Germany, Mar. 2000.
23. J. C. Vanderwaart and K. Crary. A simplified account of the metatheory of linear LF. Technical Report CMU-CS-01-154, Carnegie Mellon University, School of Computer Science, 2002.
24. P. Wadler. A taste of linear logic. In Mathematical Foundations of Computer Science, volume 711 of Lecture Notes in Computer Science. Springer-Verlag. 1993.
25. D. Walker. A type system for expressive security policies. In Twenty-Seventh ACM Symposium on Principles of Programming Languages, Boston, Jan. 2000.
26. D. Walker, K. Crary, and G. Morrisett. Typed memory management via static capabilities. ACM Transactions on Programming Languages and Systems, 22(4), July 2000. An earlier viersion appeared in the 1999 Symposium on Principles of Programming Languages.
27. H. Xi and R. Harper. A dependently typed assembly language. In 2001 ACM International Conference on Functional Programming, pages 169-180, Florence, Italy, Sept. 2001.
28. H. Xi and F. Pfenning. Eliminating array bound checking through dependent types. In 1998 SIGPLAN Conference on Programming Language Design and Implementation, pages 249-257, Montreal, June 1998.