Type-safe linking with recursive DLLs and shared libraries

ACM Transactions on Programming Languages and Systems

Volumn 24, Issue 6, 2002, Pages 711-804

  Duggan, Dominic ^a  

^a Stevens Institute of Technology   (United States)

Author keywords

Dynamic Linking; Formal Definitions and Theory Semantics; Language Constructs and Features Data Types and Structures; Languages; Module Interconnection Languages; Recursive Modules; Shared Libraries

Indexed keywords

EID: 0038893903     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/586088.586093     Document Type: Article

References (58)

1. ABADI, M. AND CARDELLI, L. 1996. A Theory of Objects. Springer-Verlag.
2. ABADI, M., CARDELLI, L., PIERCE, B., AND PLOTKIN, G. 1991. Dynamic typing in a statically typed language. ACM Trans. Prog. Lang. Systems 13, 2, 237-268.
3. ABADI, M., CARDELI, L., PIERCE, B., AND REMY, D. 1992. Dynamic typing in polymorphic languages. In Proceedings of the ACM SIGPLAN Workshop on ML and its Applications, P. Lee, Ed. San Francisco, CA. Carnegie-Mellon University Technical Report CMU-CS-93-105.
4. ANCONA, D. AND ZUCCA, E. 1998. A theory of mixin modules: Basic and derived operators. Mathematical Structures in Computer Science 8, 4, 401-446.
5. ANCONA, D. AND ZUCCA, E. 1999. A primitive calculus for module systems. In Proceedings of the International Conference on Principles and Practice of Declarative Programming. Springer-Verlag, Paris, France.
6. APPEL, A. 1997. Modern Compiler Implementation in ML. Cambridge University Press.
7. BIAGIONI, E., HARPER, R., LEE, P., AND MILNES, B. G. 1994. Signatures for a network protocol stack: A systems application of Standard ML. In Proceedings of ACM Symposium on Lisp and Functional Programming. ACM Press, Orlando, Florida, 55-64.
8. BIRTWISTLE, G. M., DAHL, O.-J., MYHRHAUG, B., AND NYGAARD, K. 1979. Simula Begin. Studentlitteratur (Lund, Sweden), Bratt Institute Fuer Neues Lerned (Goch, FRG), Chartwell-Bratt Ltd, Kent, England.
9. BOX, D. 1998. Essential COM. Addison-Wesley.
10. 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 ACM Symposium on Object-Oriented Programming: Systems, Languages and Applications, C. Chambers, Ed. ACM Press, Vancouver, British Columbia, 183-200.
11. CARDELLI, L. 1986. Amber. In Combinators and Functional Programming Languages, P.-L. C. Guy Cousineau and B. Robinet, Eds. Springer-Verlag, 22-70. Lecture Notes in Computer Science 242.
12. CARDELLI, L. 1997. Program fragments, linking and modularization. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, 266-277.
13. CARDELLI, L., DONANUE, J., JORDAN, M., KALSOW, B., AND NELSON, G. 1989. The Modula-3 type system. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, Austin, Texas, 202-212.
14. CARTWRIGHT, R. AND STEELE, G. 1998. Compatible genericity with run-time types for the Java programming language. In Proceedings of ACM Symposium on Object-Oriented Programming: Systems, Languages and Applications, C. Chambers, Ed. ACM Press, Vancouver, British Columbia, 201-215.
15. CRARY, K., HARPER, R., AND PURI, S. 1999. What is a recursive module? In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, Atlanta, GA.
16. DUGGAN, D. 1999. Dynamic typing for distributed programming in polymorphic languages. ACM Trans. Prog. Lang. Syst. 21, 1 (January), 11-45.
17. DUGGAN, D. 2000. Sharing in typed module assembly language. In Workshop on Types in Compilation. Lecture Notes in Computer Science. Springer-Verlag, Montreal, Quebec, Canada.
18. DUGGAN, D. 2001. Type-based hot swapping of running modules. In Proceedings of ACM International Conference on Functional Programming. ACM Press, Florence, Italy.
19. DUGGAN, D. AND SOURELIS, C. 1996. Mixin modules. In Proceedings of ACM International Conference on Functional Programming. 262-273.
20. DUGGAN, D. AND TECHAUBOL, C. C. 2001. Modular mixin-based inheritance for application frameworks. In Proceedings of ACM Symposium on Object-Oriented Programming: Systems, Languages and Applications. ACM Press, Tampa, Florida.
21. FISHER, K. AND REPPY, J. 1999.T he design of a class mechanism for Moby. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM Press, Atlanta, Georgia, 37-49.
22. FISHER, K. AND REPPY, J. H. 2000. A calculus for compiling and linking classes. In European Symposium on Programming. ACM Press.
23. FLATT, M. AND FELLEISEN, M. 1998. Units: Cool modules for HOT languages. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation.
24. GIRARD, J.-Y. 1972. Interprétation fonctionelle et elimination des coupures dans l'arithmétique d'ordre supérieur. Ph.D. thesis, Thèse de Doctorat d'État, Paris.
25. GLEW, N. AND MORRISETT, G. 1999. Type-safe linking and modular assembly languages. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, San Antonio, Texas.
26. GOSLING, J., JOY, B., AND STEELE, G. 1997. The Java Language Specification. The Java Series. Addison-Wesley.
27. HARPER, R. AND LILLIBRIDGE, M. 1994. A type-theoretic approach to higher-order modules with sharing. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, Portland, Oregon, 123-137.
28. HARPER, R., MITCHELL, J., AND MOGGI, E. 1990. Higher-order modules and the phase distinction. In Proceedings of ACM Symposium on Principles of Programming Languages, P. Hudak, Ed. Association for Computing Machinery, 341-354.
29. HIRSCHOWITZ, T. AND LEROY, X. 2002. Mixin modules in a call-by-value setting. In Programming Languages and Systems, ESOP'2002, D. Le Métayer, Ed. Lecture Notes in Computer Science, vol. 2305. 6-20.
30. HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall.
31. ICHBIACH, J. D., BARNES, J. G. P., FIRTH, R. J., AND WOODGER, M. 1979. Rationale for the design of the Ada programming language. SIGPLAN Notices 14, 6B. Special issue.
32. Intermetrics 1995. Ada-95 Reference Manual. Intermetrics, Cambridge, Mass. International standard ISO/IEC 8652:1995(E).
33. LAMPSON, B. 1983. A description of the Cedar language. Tech. Rep. CSL-83-15, Xerox Palo Alto Research Center.
34. LEROY, X. 1994. Manifest types, modules, and separate compilation. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, Portland, Oregon, 109-122.
35. LEROY, X. 1995. Applicative functors and fully transparent higher-order modules. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, San Francisco, California, 154-163.
36. LEROY, X. AND MAUNY, M. 1993. Dynamics in ML. J. Func. Prog. 3, 4, 431-463.
37. LIANG, S. AND BRACHA, G. 1998. Dynamic class loading in the Java virtual machine. In Proceedings of ACM Symposium on Object-Oriented Programming: Systems, Languages and Applications. ACM Press.
38. LILLIBRIDGE, M. 1997. Translucent sums: A foundation for higher-order module systems. Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA. Technical Report CMU-CS-97-122.
39. LISKOV, B., ATKINSON, R., BLOOM, T., MOSS, E., SCHAFFERT, J. C., SCHEIFLER, R., AND SNYDER, A. 1981. CLU Reference Manual. Lecture Notes in Computer Science. Springer-Verlag.
40. MCDIRMID, S., FLATT, M., AND HSIEH, W. C. 2001. Jiazzi: New-age components for old-fashioned Java. In Proceedings of ACM Symposium on Object-Oriented Programming: Systems, Languages and Applications.
41. MILNER, R. 1989. Communication and Concurrency. Prentice-Hall.
42. MILNER, R., TOFTE, M., AND HARPER, R. 1990. The Definition of Standard ML. The MIT Press.
43. MILNER, R., TOFTE, M., HARPER, R., AND MACQUEEN, D. 1997. The Revised Definition of Standard ML. The MIT Press.
44. NELSON, G. 1991. Systems Programming in Modula-3. Prentice-Hall Series in Innovative Technology. Prentice-Hall.
45. OBJECT MANAGEMENT GROUP. 1995. The Common Object Request Broker: Architecture and Specification 2.0. Object Management Group.
46. O'MALLEY, S. W. AND PETERSON, L. L. 1992. A dynamic network architecture. ACM Trans. Comput. Syst. 10, 2 (May).
47. RÉMY, D. AND VOUILLON, J. 1997. Objective ML: A simple object-oriented extension of ML. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, Paris, France.
48. ROVNER, P. 1986. On extending Modula-2+ to build large, integrated systems. IEEE Software 3, 6 (November), 46-57.
49. RUSSO, C. 2000. Adding first-class modules to Standard ML. In European Symposium on Programming. Springer-Verlag, Berlin, Germany.
50. RUSSO, C. 2001. Recursive structures for Standard ML. In Proceedings of ACM International Conference on Functional Programming. ACM Press, Florence, Italy, 50-61.
51. SÉNIZERGUES, G. 1997. The equivalence problem for deterministic pushdown automata is decidable. In Proceedings of the International Conference on Automata, Languages and Programming. Lecture Notes in Computer Science. Springer-Verlag, 671-681.
52. SHAO, Z. 1999. Transparent modules with fully syntactic signatures. In Proceedings of ACM International Conference on Functional Programming. Paris, France.
53. SHIELDS, M., SHEARD, T., AND PEYTON-JONES, S. 1998. Dynamic typing as staged type inference. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, San Diego, California, 289-302.
54. SOLOMON, M. 1978. Type definitions with parameters. In Proceedings of ACM Symposium on Principles of Programming Languages. ACM Press, 31-38.
55. STONE, C. AND HARPER, R. 1996. A type-theoretic account of Standard ML (version 1). Tech. Rep. CMU-CS-FOX-96-02, Carnegie-Mellon University, Pitsburgh, Pennsylvania.
56. STONE, C. AND HARPER, R. 2000. Decidable type equivalence with singleton kinds. In Proceedings of ACM Symposium on Principles of Programming Languages, T. Reps, Ed. ACM Press, Boston, MA.
57. WELLS, J. AND VESTERGAARD, R. 2000. Equational reasoning for linking with first-class primitive modules. In European Symposium on Programming. Springer-Verlag, Berlin, Germany.
58. WRIGHT, A. AND FELLEISEN, M. 1994. A syntactic approach to type soundness. Information and Computation 115, 1, 38-94.