Transparent modules with fully syntactic signatures

SIGPLAN Notices (ACM Special Interest Group on Programming Languages)

Volumn 34, Issue 9, 1999, Pages 220-231

  Shao, Zhong ^a  

^a Yale University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DIFFERENTIATION (CALCULUS); SEMANTICS; SYNTACTICS;

EXISTENTIAL TYPES; LAMBDA CALCULUS; LARGE SOFTWARE SYSTEMS; MANIFEST TYPES; MODULE CALCULI; SEPARATE COMPILATION; THEORETIC SEMANTICS; TYPE EQUALITY;

CALCULATIONS;

EID: 17144427752     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/317765.317801     Document Type: Article

References (39)

1. E. Biagioni, R. Harper, P. Lee, and B. Milnes. Signatures for a network protocol stack: A systems application of Standard ML. In 1994 ACM Conference on Lisp and Functional Programming, pages 55-64, New York, June 1994. ACM Press.
2. S. K. Biswas. Higher-order functors with transparent signatures. In Twenty-second Annual ACM Symp. on Principles of Prog. Languages, pages 154-163, New York, Jan 1995. ACM Press.
3. M. Blume. A compilation manager for SML/NJ. as part of SML/NJ User's Guide, 1995.
4. L. Cardelli and X. Leroy. Abstract types and the dot notation. In Proc. Programming Concepts and Methods, pages 479-504. North Holland, 1990.
5. L. Cardelli and D. MacQueen. Persistence and type abstraction. In M. P. Atkinson, P. Buneman, and R. Morrison, editors, Data Types and Persistence, pages 31-41. Springer-Verlag, 1988.
6. S. Corrico, B. Ewbank, T. Griffin, J. Meale, and H. Trickey. A tool for developing safe and efficient database transactions. In 15th International Switching Symposium of the World Telecommunications Congress, pages 173-177, April 1995.
7. J. Courant An applicative module calculus. In M. Bidoit and M. Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development: LNCS Vol 1214, pages 622-636, New York, 1997. Springer-Verlag.
8. K. Crary, R. Harper, and S. Puri. What is a recursive module? In Proc. SIGPLAN '99 Symp. on Prog. Language Design and Implementation, page (to appear). ACM Press, May 1999.
9. M. Flatt and M. Felleisen. Units: Cool modules for HOT languages. In Proc. ACM SIGPLAN '98 Conf. on Prog. Lang. Design and Implementation, pages 236-248. ACM Press, 1998.
10. L. George. MLRISC: Customizable and reusable code generators. Technical memorandum, Lucent Bell Laboratories, Murray Hill, NJ, 1997.
11. J. Y. Girard. Interpretation Fonctionnelle et Elimination des Coupures dans l'Arithmetique d'Ordre Superieur. PhD thesis, University of Paris VII, 1972.
12. R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In Twenty-first Annual ACM Symp. on Principles of Prog. Languages, pages 123-137, New York, Jan 1994. ACM Press.
13. R. Harper and J. C. Mitchell. On the type structure of Standard ML. ACM Trans. on Programming Languages and Systems, 15(2):211-252, April 1993.
14. R. Harper, J. C. Mitchell, and E. Moggi. Higher-order modules and the phase distinction. In Seventeenth Annual ACM Symp. on Principles of Prog. Languages, pages 341-344, New York, Jan 1990. ACM Press.
15. R. Harper and G. Morrisett Compiling polymorphism using intensional type analysis. In Twenty-second Annual ACM Symp. on Principles of Prog. Languages, pages 130-141, New York, Jan 1995. ACM Press.
16. R. Harper and C. Stone. An interpretation of Standard ML in type theory. Technical Report CMU-CS-97-147, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, June 1997.
17. M. P. Jones. Using parameterized signatures to express modular structure. In Twenty-third Annual ACM Symp. on Principles of Prog. Languages, pages 68-78, New York, Jan 1996. ACM Press.
18. X. Leroy. Unboxed objects and polymorphic typing. In Nineteenth Annual ACM Symp. on Principles of Prog. Languages, pages 177-188, New York, Jan 1992. ACM Press. Longer version available as INRIA Tech Report.
19. X. Leroy. Manifest types, modules, and separate compilation. In Twenty-first Annual ACM Symp. on Principles of Prog. Languages, pages 109-122, New York, Jan 1994. ACM Press.
20. X. Leroy. Applicative functors and fully transparent higher-order modules. In Twenty-second Annual ACM Symp. on Principles of Prog. Languages, pages 142-153, New York, Jan 1995. ACM Press.
21. X. Leroy. A syntactic theory of type generativity and sharing. Journal of Functional Programming, 6(5):1-32, September 1996.
22. S. Liang and G. Bracha. Dynamic class loading in the Java virtual machine. In Proc. ACM SIGPLAN '98 Conf. on Object-Oriented Programming Systems, Languages, and applications, pages 36-44, New York, October 1998. ACM Press.
23. M. Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 1997. Tech Report CMU-CS-97-122.
24. D. MacQueen. Modules for Standard ML. In 1984 ACM Conference on Lisp and Functional Programming, pages 198-207, New York, August 1984. ACM Press.
25. D. MacQueen. Using dependent types to express modular structure. In Proc. 13th Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pages 277-286. ACM Press, 1986.
26. D. MacQueen and M. Tofte. A semantics for higher order functors. In The 5th European Symposium on Programming, pages 409-423, Berlin, April 1994. Spinger-Verlag.
27. R. Milner, M. Tofte, and R. Harper. The Definition of Standard ML. MIT Press, Cambridge, Massachusetts, 1990.
28. R. Milner, M. Tofte, R. Harper, and D. MacQueen. The Definition of Standard ML (Revised). MIT Press, Cambridge, Massachusetts, 1997.
29. Y. Minamide, G. Morrisett, and R. Harper. Typed closure conversion. In Proc. 23rd Annual ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pages 271-283, New York, 1996. ACM Press.
30. G. Nelson, editor. Systems programming with Modula-3. Prentice Hall, Englewood Cliffs, NJ, 1991.
31. J. H. Reppy and E. R. Gansner. The eXene library manual. SML/NJ documentations, March 1991.
32. J. C. Reynolds. Towards a theory of type structure. In Proceedings, Colloque sur la Programmation, Lecture Notes in Computer Science, volume 19, pages 408-425. Springer-Verlag, Berlin, 1974.
33. C. V. Russo. Types For Modules. PhD thesis, University of Edinburgh, Edinburgh, UK, June 1998.
34. Z. Shao. Flexible representation analysis. In Proc. 1997 ACM SIGPLAN International Conference on Functional Programming (ICFP'97), pages 85-98, New York, June 1997. ACM Press.
35. Z. Shao. Typed cross-module compilation. In Proc. 1998 ACM SIGPLAN International Conference on Functional Programming (ICFP'98), pages 141-152. ACM Press, September 1998.
36. Z. Shao. Transparent modules with fully syntactic signatures (extended version). Technical Report YALEU/DCS/RR-1181, Dept of Computer Science, Yale Univ., New Haven, CT, June 1999.
37. B. Stroustrup, editor. The C++ Programming Languages, Third Edition. Addison Wesley, Reading, MA, 1998.
38. M. Tofte. Principal signatures for high-order ML functors. In Nineteenth Annual ACM Symp. on Principles of Prog. Languages, pages 189-199, New York, Jan 1992. ACM Press.
39. A. Tolmach. Tag-free garbage collection using explicit type parameters. In Proc. 1994 ACM Conf. on Lisp and Functional Programming, pages 1-11, New York, June 1994. ACM Press.