Typed memory management via static capabilities

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 4, 2000, Pages 701-771

  Walker, David ^a   Crary, Karl ^a   Morrisett, Greg ^b  

^a Carnegie Mellon University   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

D.3.1 Programming Languages : Formal Definitions and Theory Semantics, Syntax; D.3.4 Programming Languages : Processors Compilers; F.3.2 Logics and Meanings of Programs : Semantics of Programming Languages Operational Semantics

Indexed keywords

EID: 0000189545     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/363911.363923     Document Type: Article

References (58)

1. ABRAMSKY, S. 1993. Computational interpretations of linear logic. Theoretical Computer Science 111, 3-57.
2. AIKEN, A., FÄHNDRICH, M., AND LEVIEN, R. 1995. Better static memory management: Improving region-based analysis of higher-order languages. In ACM Conference on Programming Language Design and Implementation. ACM Press, La Jolla, California, 174-185.
3. ALPERN, B. AND SCHNEIDER, F. 1987. Recognizing safety and liveness. Distributed Computing 2, 117-126.
4. BAKER, H. G. 1978. List processing in real-time on a serial computer. Communications of the ACM 21, 4, 280-294.
5. BERSHAD, B., SAVAGE, S., PARDYAK, P., SIRER, E., FIUCZYNSKI, M., BECKER, D., CHAMBERS, C., AND EGGERS, S. 1995. Extensibility, safety and performance in the SPIN operating system. In Fifteenth ACM Symposium on Operating Systems Principles. ACM Press, Copper Mountain, 267-284.
6. BIRKEDAL, L., ROTHWELL, N., TOFTE, M., AND TURNER, D. N. 1993. The ML Kit (version 1). Tech. Rep. 93/14, Department of Computer Science, University of Copenhagen.
7. BIRKEDAL, L., TOFTE, M., AND VEJLSTRUP, M. 1996. From region inference to von Neumann machines via region representation inference. In Twenty-Third ACM Symposium on Principles of Programming Languages. ACM Press, St. Petersburg, 171-183.
8. BLELLOCH, G. AND GREINER, J. 1996. A provably time and space efficient implementation of NESL. In ACM International Conference on Functional Programming. ACM Press, Philadelphia, 213-225.
9. CRARY, K., WALKER, D., AND MORRISETT, G. 1999. Typed memory management in a calculus of capabilities. In Twenty-Sixth ACM Symposium on Principles of Programming Languages. ACM Press, San Antonio, 262-275.
10. CRARY, K., WEIRICH, S., AND MORRISETT, G. 1998. Intensional polymorphism in type-erasure semantics. In ACM International Conference on Functional Programming. ACM Press, Baltimore, 301-312.
11. DANVY, O. AND FILINSKI, A. 1992. Representing control: a study of the CPS transformation. Mathematical Structures in Computer Science 2, 4 (Dec.), 361-391.
12. DANVY, O., DZAFIC, B., AND PFENNING, F. 1999. On proving syntactic properties of CPS programs. In Third International Workshop on Higher-Order Operational Techniques in Semantics, A. Gordon and A. Pitts, Eds. Electronic Notes in Computer Science, vol. 26. Elsevier, Paris, 19-31.
13. FILINSKI, A. 1996. Controlling effects. Ph.D. thesis, Carnegie Mellon University, School of Computer Science, Pittsburgh, Pennsylvania.]
14. FISCHER, M. J. 1972. Lambda calculus schemata. In Proceedings of the ACM Conference on Proving Assertions about Programs. 104-109.
15. FLANAGAN, C. AND ABADI, M. 1999. Types for safe locking. In Lecture Notes in Computer Science, S. Swierstra, Ed. Vol. 1576. Springer-Verlag, Amsterdam, 91-108. Appeared in the Eighth European Symposium on Programming.
16. GAY, D. AND AIKEN, A. 1998. Memory management with explicit regions. In ACM Conference on Programming Language Design and Implementation. ACM Press, Montreal, 313-323.
17. GIFFORD, D. K. AND LUCASSEN, J. M. 1986. Integrating functional and imperative programming. In ACM Conference on Lisp and Functional Programming. ACM Press, Cambridge, Massachusetts, 28-38.
18. GIRARD, J.-Y. 1987. Linear logic. Theoretical Computer Science 50, 1-102.
19. HARPER, R. AND LILLIBRIDGE, M. 1993. Explicit polymorphism and CPS conversion. In Twentieth ACM Symposium on Principles of Programming Languages. ACM Press, Charleston, 206-219.
20. HARPER, R. AND MORRISETT, G. 1995. Compiling polymorphism using intensional type analysis. In Twenty-Second ACM Symposium on Principles of Programming Languages. ACM Press, San Francisco, 130-141.
21. HAWBLITZEL, C., CHANG, C.-C., CZAJKOWSKI, G., HU, D., AND VON EICKEN, T. 1998. Implementing multiple protection domains in Java. In 1998 USENIX Annual Technical Conference. USENIX, New Orleans.
22. HAWBLITZEL, C. AND VON EICKEN, T. 1999. Type system support for dynamic revocation. In ACM SIGPLAN workshop on Compiler Support for System Software. ACM Press, Atlanta.
23. JOUVELOT, P. AND GIFFORD, D. K. 1991. Algebraic reconstruction of types and effects. In Eighteenth ACM Symposium on Principles of Programming Languages. ACM Press, Orlando, 303-310.
24. KOZEN, D. 1998. Efficient code certification. Tech. Rep. TR98-1661, Cornell University. Jan.
25. LAFONT, Y. 1988. The linear abstract machine. Theoretical Computer Science 59, 157-180.
26. LAUNCHBURY, J. AND PEYTON JONES, S. L. 1995. State in Haskell. LISP and Symbolic Computation 8, 4 (Dec.), 293-341.
27. LINDHOLM, T. AND YELLIN, F. 1996. The Java Virtual Machine Specification. Addison-Wesley, Menlo Park, California.
28. LUCASSEN, J. M. 1987. Types and effects - towards the integration of functional and imperative programming. Ph.D. thesis, MIT Laboratory for Computer Science.
29. MILNER, R., TOFTE, M., HARPER, R., AND MACQUEEN, D. 1997. The Definition of Standard ML (Revised). MIT Press, Boston.
30. MINAMIDE, Y. 1999. Space-profiling semantics of the call-by-value lambda calculus and the CPS transformation. In Third International Workshop on Higher-Order Operational Techniques in Semantics, A. D. Gordon and A. Pitts, Eds. Electronic Notes in Computer Science, vol 26. Elsevier, Paris, 103-118.
31. MOGGI, E. 1991. Notions of computation and monads. Information and Computation 93, 55-92.
32. MORRISETT, G. AND HARPER, R. 1997. Semantics of memory management for polymorphic languages. In Higher-Order Operational Techniques in Semantics, A. Gordon and A. Pitts, Eds. Publications of the Newton Institute. Cambridge University Press, Cambridge, UK.
33. MORRISETT, G., CRARY, K., GLEW, N., GROSSMAN, D., SAMUELS, R., SMITH, F., WALKER, D., WEIRICH, S., AND ZDANCEWIC, S. 2000. Typed Assembly Language for the Intel IA32 architecture. See http://www.cs.cornell.edu/talc for the latest implementation.
34. MORRISETT, G., FELLEISEN, M., AND HARPER, R. 1995. Abstract models of memory management. In ACM Conference on Functional Programming and Computer Architecture. ACM Press, La Jolla, 66-77.
35. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1998. From System F to Typed Assembly Language. In Twenty-Fifth ACM Symposium on Principles of Programming Languages. ACM Press, San Diego, 85-97.
36. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1999. From System F to Typed Assembly Language. ACM Transactions on Progamming Languages and Systems 21, 3 (May), 528-569.
37. NECULA, G. 1997. Proof-carrying code. In Twenty-Fourth ACM Symposium on Principles of Programming Languages. ACM Press, Paris, 106-119.
38. NECULA, G. AND LEE, P. 1996. Safe kernel extensions without run-time checking. In Proceedings of Operating System Design and Implementation. USENIX assoc., Seattle, 229-243.
39. NECULA, G. AND LEE, P. 1998. The design and implementation of a certifying compiler In ACM Conference on Programming Language Design and Implementation. ACM Press, Montreal 333 -344.
40. PEYTON JONES, S. L. AND WADLER, P. 1993. Imperative functional programming. In Twentieth ACM Symposium on Principles of Programming Languages. ACM Press, Charleston, South Carolina.
41. PLOTKIN, G. D. 1975. Call-by-name, call-by-value, and the lambda calculus. Theoretical Computer Science 1, 125-159.
42. REYNOLDS, J. C. 1972. Definitional interpreters for higher-order programming languages. In Conference Record of the 25th National ACM Conference. Boston, 717-740.
43. REYNOLDS, J. C. 1978. Syntactic control of interference. In Fifth ACM Symposium on Principles of Programming Languages. ACM Press, Tucson, Arizona, 39-46.
44. th International Colloquium. Lecture Notes in Computer Science, vol. 372. Springer-Verlag, Stresa, Italy, 704-722.
45. SABRY, A. AND FELLEISEN, M. 1993. Reasoning about programs in continuation-passing style. LISP and Symbolic Computation 6, 3/4, 289-360.
46. SCHNEIDER, F. 2000. Enforceable security policies. ACM Transactions on Information and System Security 3, 1 (Feb.).
47. SMITH, F., WALKER, D., AND MORRISETT, G. 2000. Alias types. In Lecture Notes in Computer Science, G. Smolka, Ed. Vol. 1782. Springer-Verlag, Berlin, 366-381. Appeared in the Ninth European Symposium on Programming.
48. TOFTE, M. AND BIRKEDAL, L. 1998. A region inference algorithm. Transactions on Programming Languages and Systems 20, 4 (Nov.), 734-767.
49. TOFTE, M. AND TALPIN, J.-P. 1994. Implementation of the typed call-by-value λ-calculus using a stack of regions. In Twenty-First ACM Symposium on Principles of Programming Languages. ACM Press, Portland, Oregon, 188-201.
50. TOFTE, M. AND TALPIN, J.-P. 1997. Region-based memory management. Information and Computation 132, 2, 109-176.
51. WADLER, P. 1990. Linear types can change the world! In Programming Concepts and Methods, M. Broy and C. Jones, Eds. North Holland, Sea of Galilee, Israel. IFIP TC 2 Working Conference.
52. WADLER, P. 1993. A taste of linear logic. In Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 711. Springer-Verlag, Gdansk, Poland.
53. WAHBE, R., LUCCO, S., ANDERSON, T., AND GRAHAM, S. 1993. Efficient software-based fault isolation. In Fourteenth ACM Symposium on Operating Systems Principles. ACM Press, Asheville, 203-216.
54. WALKER, D. 2000. A type system for expressive security policies. In Twenty-Seventh ACM Symposium on Principles of Programming Languages. ACM Press, Boston, 254-267.
55. WALKER, D. AND MORRISETT, G. 2000. Alias types for recursive data structures. In Workshop on Types in Compilation. Montreal.
56. WILSON, P. R. 1992. Uniprocessor garbage collection techniques. In International Workshop on Memory Management, Y. Bekkers and J. Cohen, Eds. Number 637 in Lecture Notes in Computer Science. Springer-Verlag, St. Malo, 1-42.
57. WRIGHT, A. K. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Information and Computation 115, 1, 38-94.
58. WULF, W. A., LEVIN, R., AND HARBISON, S. P. 1981. Hydra/C.mmp: An Experimental Computer System. McGraw-Hill, New York, NY.