Quantified types in an imperative language

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 3, 2006, Pages 429-475

  Grossman, Dan ^a,b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b University of Washington   (United States)

Author keywords

Cyclone; Existential types; Polymorphism; Type variables

Indexed keywords

CYCLONE; EXISTENTIAL TYPES; POLYMORPHISM; TYPE VARIABLES;

ABSTRACTING; INFORMATION RETRIEVAL;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33745400931     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1133651.1133653     Document Type: Article

References (71)

1. ABADI, M. AND CARDELLI, L. 1996. A Theory of Objects. Springer-Verlag, New York, NY.
2. APPEL, A. 1992. Compiling with Continuations. Cambridge University Press, Cambridge, U.K.
3. AUSTIN, T., BREACH, S., AND SOHI, G. 1994. Efficient detection of all pointer and array access errors. In Proceedings of the ACM Conference on Programming Language Design and Implementation (Orlando, FL). 290-301.
4. BENTON, N., KENNEDY, A., AND RUSSELL, G. 1998. Compiling Standard ML to Java bytecodes. In Proceedings of the 3rd ACM International Conference on Functional Programming (Baltimore, MD). 129-140.
5. Bos, H. AND SAMWEL, B. 2002. Safe kernel programming in the OKE. In Proceedings of the 5th IEEE International Conference on Open Architectures and Network Programming (New York, NY). 141-152.
6. BOTLAN, D. L. AND RÉMY, D. 2003. MLF: Raising ML to the power of System-F. In Proceedings of the ACM International Conference on Functional Programming (Uppsala, Sweden). 27-38.
7. BRACHA, G., ODERSKY, M., STOUTAMIRE, D., AND WADLER, P. 1998. Making the future safe for the past: Adding genericity to the Java programming language. In Proceedings of the 13th ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (Vancouver, B.C., Canada). 183-200.
8. BRUCE, K., CARDELLI, L., AND PIERCE, B. 1999. Comparing object encodings. Inform. Computat. 155, 108-133.
9. CARDELLI, L. AND WEGNER, P. 1985. On understanding types, data abstraction, and polymorphism. ACM Comput. Surv. 17, 4, 471-522.
10. CEJTIN, H., JAGANNATHAN, S., AND WEEKS, S. 2000. Flow-directed closure conversion for typed languages. In 9th European Symposium on Programming. Lecture Notes in Computer Science, vol. 1782. Springer-Verlag, Berlin, Germany, 56-71.
11. CHAILLOUX, E., MANOURY, P., AND PAGANO, B. 2000. Développement d'Applications avec Objective Caml. O'Reilly, Paris, France. An English translation is currently freely available online at http://caml.inria.fr/ oreilly-book/.
12. CHANDRA, S. AND REPS, T. 1999. Physical type checking for C. In Proceedings of the ACM Workshop on Program Analysis for Software Tools and Engineering (Toulouse, France). 66-75.
13. CONDIT, J., HARREN, M., McPEAK, S., NECULA, G., AND WEIMER, W. 2003. CCured in the real world. In Proceedings of the ACM Conference on Programming Language Design and Implementation. San Diego, CA. 232-244.
14. CRARY, K. 2003. Toward a foundational typed assembly language. In Proceedings of the 30th ACM Symposium on Principles of Programming Languages (New Orleans, LA). 198-212.
15. CYCLONE. 2001. Cyclone user's manual. Tech. rep. 2001-1855. Department of Computer Science, Cornell University, Ithaca, NY. The current version is available online at http://wwv.es.Cornell.edu/projects/cyclone/.
16. DELINE, R. AND FÄHNDRICH, M. 2001. Enforcing high-level protocols in low-level software. In Proceedings of the ACM Conference on Programming Language Design and Implementation (Snowbird, UT). 59-69.
17. DITCHFIELD, G. 1994. Contextual polymorphism. Ph.D. dissertation. University of Waterloo, Waterloo, Onto., Canada.
18. GARRIGUE, J. AND RÉMY, D. 1999. Semi-explicit first-class polymorphism for ML. Inform, Comput. 155, 1/2, 134-169.
19. GIRARD, J.-Y., TAYLOR, P., AND LAFONT, Y. 1989. Proofs and Types. Cambridge University Press, Cambridge, U.K.
20. GROSSMAN, D. 2002. Existential types for imperative languages. In 11th European Symposium on Programming. Lecture Notes in Computer Science, vol. 2305. Springer-Verlag, Berlin, Germany, 21-35.
21. GROSSMAN, D. 2003a. Safe programming at the C level of abstraction. Ph.D. dissertation. Cornell University, Ithaca, NY.
22. GROSSMAN, D. 2003b. Type-safe multithreading in Cyclone. In Proceedings of the ACM International Workshop on Types in Language Design and Implementation (New Orleans, LA). 13-25.
23. GROSSMAN, D., MORRISETT, G., JIM, T., HICKS, M., WANG, Y., AND CHENEY, J. 2002. Region-based memory management in Cyclone. In Proceedings of the ACM Conference on Programming Language Design and Implementation (Berlin, Germany). 282-293.
24. GROSSMAN, D., ZDANCEWIC, S., AND MORRISETT, G. 2000. Syntactic type abstraction. ACM Trans. Programm. Lang. Syst. 22, 6 (Nov.), 1037-1080.
25. HARPER, R. 1994. A simplified account of polymorphic references. Inform. Process. Lett. 51, 4 (Aug.), 201-206.
26. HENGLEIN, F. 1998. Type inference with polymorphic recursion. ACM Trans. Programm. Lang. Syst. 15, 2 (Apr.), 253-289.
27. HICKS, M., MORRISETT, G., GROSSMAN, D., AND JIM, T. 2004. Experience with safe manual memory-management in Cyclone. In. Proceedings of the International Symposium on Memory Management (Vancouver, B.C., Canada).
28. HICKS, M., NAGARAJAN, A., AND VAN RENESSE, R. 2003. User-specified adaptive scheduling in a streaming media network. In Proceedings of the 6th IEEE International Conference on Open Architectures and Network Programming (San Francisco, CA). 87-96.
29. ISO. 1999. ISO/IEC 9899:1999, International Standard - Programming Languages - C. International Standards Organization, Geneva, Switzerland.
30. JIM, T., MORRISETT, G., GROSSMAN, D., HICKS, M., CHENEY, J., AND WANG, Y. 2002. Cyclone: A safe dialect of C. In Proceedings of the USENIX Annual Technical Conference (Monterey, CA). 275-288.
31. JONES, R. AND KELLY, P. 1997. Backwards-compatible bounds checking for arrays and pointers in C programs. In Proceedings of the AADEBUG'97. Third International Workshop on Automatic Debugging. Linköping Electronic Articles in Computer and Information Science, vol. 2(9). Linköping, Sweden.
32. JONES, S. P. AND HUGHES, J., Eds. 1999. Haskell 98: A Non-Strict, Purely Functional Language. Available online at http://www.haskell.org/onlinereport/.
33. KFOURY, A. J., TIURYN, J., AND URZYCZYN, P. 1993. Type reconstruction in the presence of polymorphic recursion. ACM Trans. Programm. Lang. Syst. 15, 2 (Apr.), 290-311.
34. KOWSHIK, S., DHURJATI, D., AND ADVE, V. 2002. Ensuring code safety without runtime checks for real-time control systems. In Proceedings of the ACM International Conference on Compilers, Architectures and Synthesis for Embedded Systems (Grenoble, France). 288-297.
35. LÄUFER, K. 1996. Type classes with existential types. J. Funct. Programm. 6, 3 (May), 485-517.
36. LEROY, X. 1992. Unboxed objects and polymorphic typing. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages (Albuquerque, NM). 177-188.
37. LEROY, X. 1997. The effectiveness of type-based unboxing. In Proceedings of the Workshop on Types in Compilation (Amsterdam, The Netherlands). Also published as Tech. rep. BCCS-97-03. Computer Science Department, Boston College, Boston, MA.
38. LEROY, X. 2002a. The Objective Caml System Release 3.05, Documentation and User's Manual. Available online at http://caml.inria.fr/ocaml/htmlman/index. html.
39. LEROY, X. 2002b. Writing efficient numerical code in Objective Caml. Available online at http://caml.inria.fr/ocaml/numerical.html.
40. LISKOV, B. ET AL. 1984. CLU Reference Manual. Springer-Verlag, Berlin, Germany.
41. LOGINOV, A., YONG, S. H., HORWITZ, S., AND REPS, T. 2001. Debugging via run-time type checking. In 4th International Conference on Fundamental Approaches to Software Engineering. Lecture Notes in Computer Science, vol. 2029. Springer-Verlag, Berlin, Germany, 217-232.
42. MILNER, R., TOFTE, M., HARPER, R., AND MACQUEEN, D. 1997. The Definition of Standard ML (Revised), MIT Press, Cambridge, MA.
43. MINAMIDE, Y., MORRISETT, G., AND HARPER, R. 1996. Typed closure conversion. In Proceedings of the 23rd ACM Symposium on Principles of Programming Languages (St. Petersburg, FL). 271-283.
44. MITCHELL, J. 1988. Polymorphic type inference and containment. Inform. Computat. 76, 11-249.
45. MITCHELL, J. AND PLOTKIN, G. 1988. Abstract types have existential type. ACM Trans. Programm. Lang. Syst. 10, 3 (July), 470-502.
46. MORHISETT, G. 1995. Compiling with types. Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA.
47. MORRISETT, G., CRARY, K., GLEW, N., GROSSMAN, D., SAMUELS, R., SMITH, F., WALKER, D., WEIRICH, S., AND ZDANCEWIC, S. 1999a. TALx86: A realistic typed assembly language. In Proceedings of the 2nd ACM Workshop on Compiler Support for System, Software (Atlanta, GA). 25-35. Published as INRIA Tech. Rep. 0288. (March 1999), Rocquencourt, France.
48. MORRISETT, G., CRARY, K., GLEW, N., AND WALKER, D. 2002. Stack-based typed assembly language. J. Funct. Programm. 12, 1 (Jan.), 43-88.
49. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1999b. From System F to typed assembly language. ACM Trans. Programm. Lang. Syst. 21, 8 (May), 528-569.
50. NECULA, G., MCPEAK, S., AND WEIMER, W. 2002. CCured: Type-safe retrofitting of legacy code. In Proceedings of the 29th ACM Symposium on Principles of Programming Languages (Portland, OR). 128-139.
51. PATEL, P. AND LEPREAU, J. 2003. Hybrid resource control of active extensions. In Proceedings of the 6th IEEE International Conference on Open Architectures and Network Programming (San Francisco, CA). 23-31.
52. PATEL, P., WHITAKER, A., WETHERALL, D., LEPREAU, J., AND STACK, T. 2003. Upgrading transport protocols using untrusted mobile code. In Proceedings of the 19th ACM Symposium on Operating System Principles (New York, NY). 1-14.
53. PIERCE, B. 1991. Programming with intersection types and bounded polymorphism. Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA.
54. PIERCE, B. AND SANGIORGI, D. 2000. Behavioral equivalence in the polymorphic pi-calculus. J. Assoc. Comp. Mach. 47, 3, 531-584.
55. PIERCE, B. AND TURNER, D. 1998. Local type inference. In Proceedings of the 25th ACM Symposium on Principles of Programming Languages (San Diego, CA). 252-265.
56. REYNOLDS, J. 1974. Towards a theory of type structure. In Programming Symposium, Lecture Notes in Computer Science, vol. 19. Springer-Verlag, Berlin, Germany, 408-425.
57. REYNOLDS, J. 1983. Types, abstraction and parametric polymorphism. In Information Processing 83. Elsevier Science Publishers, Amsterdam, The Netherlands, 513-523.
58. SMITH, G. AND VOLPANO, D. 1996. Towards an ML-style polymorphic type system for C. In 6th European Symposium on Programming. Lecture Notes in Computer Science, vol. 1058. Springer-Verlag, Berlin, Germany, 341-355.
59. SMITH, G. AND VOLPANO, D. 1998. A sound polymorphic type system for a dialect of C. Sci. Comput. Programm. 32, 2-3, 49-72.
60. STRACHEY, C. 1967. Fundamental concepts in programming languages. Unpublished lecture notes, Summer School in Computer Programming, Copenhagen, Denmark. Eventually published in 2003 in High. Ord. Symbol. Computat. 13, 1-2, 5-6.
61. STROUSTRUP, B. 2000. The C++ Programming Language, spec. ed. Addison-Wesley, Reading, MA.
62. TARDITI, D. 1996. Design and implementation of code optimizations for a type-directed compiler for Standard ML. Ph.D. dissertation. Carnegie Mellon University, Pittsburgh, PA.
63. THE GHC TEAM. 2003. The Glasgow Haskell Compiler User's Guide, Version 6.0. Available online at http://www.haskell.org/ghc.
64. THE HUGS 98 USER MANUAL. 2002. The Hugs 98 User Manual. Available online at http://haskell.cs.yale.adu/hugs.
65. TOFTE, M. 1990. Type inference for polymorphic references. Inform. Computat. 89, 1-34.
66. WADLER, P. 1989. Theorems for free! In Proceedings of the 4th International Conference on Functional Programming Languages and Computer Architecture. ACM Press, New York, NY, 347-359.
67. WALKER, D. AND MORRISETT, G. 2000. Alias types for recursive data structures. In Workshop on Types in Compilation. Lecture Notes in Computer Science, vol. 2071. Springer-Verlag, Berlin, Germany, 177-206.
68. WELLS, J. 1999. Typability and type checking in System F are equivalent and undecidable. Ann. Pure Appl. Logic 98, 1-3 (June), 111-156.
69. WELLS, J., DIMOCK, A., MULLER, R., AND TURBAK, F. 2002. A calculus with polymorphic and polyvariant flow types. J. Funct. Programm. 12, 3 (May), 183-227.
70. WRIGHT, A. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Inform. Computat. 115, 1, 38-94.
71. Xi, H. 2000. Imperative programming with dependent types. In Proceedings of the 15th IEEE Symposium on Logic in Computer Science (Santa Barbara, CA). 375-387.