Types for modules

Electronic Notes in Theoretical Computer Science

Volumn 60, Issue , 2004, Pages 3-421

  Russo, Claudio V ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Existential types; Generativity; Modules; Polymorphism; Programming languages; Standard ML; Subtyping; Type theory

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SCIENCE; MAPPING; PARAMETER ESTIMATION; SEMANTICS; SYNTACTICS;

EXTENTIAL TYPES; GENERATIVITY; MODULES; POLYMORPHISM; STANDARD ML; SYBTYPING; TYPE THEORY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 23844457375     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)82621-0     Document Type: Article

References (67)

1. [Apo93] María Virginia Aponte. Extending record typing to type parametric modules with sharing. In Proc. 20th Symp. Principles of Prog. Lang., pages 465-478. ACM Press, 1993. 2.3.4
2. [AT 93] AT & T Bell Laboratories. Standard ML of New Jersey, User's Guide, 0.93 edition, February 1993. 2.3.4
3. [Bis95] Sandip K. Biswas. Higher-order functors with transparent signatures. In Proc. 22nd Symp. Principles of Prog. Lang., pages 154-163. ACM Press, 1995. 1.2, 2.3.4, 5, 5.1, 5.2.1, 5.2.2, 10, 5.8, 9.1
4. [BL84] R. M. Burstall and B. Lampson. A kernel language for abstract data types and modules. In Semantics of Data Types, number 173 in LNCS. Springer-Verlag, 1984. 2.3.1
5. [BL88] R. M. Burstall and B. Lampson. Pebble, a kernel language for modules and abstract data types. Information and Computation, 76:278-346, 1988. 2.3.1
6. [Car88a] Luca Cardelli. A Quest Preview. Technical report, Digital Equipment Corporation, Systems Research Center, June 1988. 2.3.1
7. [Car88b] Luca Cardelli. Phase Distinctions in Type Theory. Unpublished manuscript available from http://www.luca.demon.co.uk, 1988. 2.2.2, 2.2.5
8. [Car89] Luca Cardelli. Typeful Programming. In E. J. Neuhold and M. Paul, editors, Formal Description of Programming Concepts, IFIP State of the Art Reports Series. Springer-Verlag, February 1989. 2.3.1
9. [Car91] Luca Cardelli. The Quest Language and System. Digital Equipment Corporation, Systems Research Center, 1991. 2.3.1, 2.3.5
10. [CF58] Haskell Curry and Robert Feys. Combinatory Logic, volume 1. North Holland, 1958. 2.2
11. [CL90] Luca Cardelli and Xavier Leroy. Abstract types and the dot notation. In Programming Concepts and Methods, IFIP State of the Art Reports, pages 479-504. North Holland, March 1990. 2.3.1
12. [CL91] Luca Cardelli and Giuseppe Longo. A Semantic Basis for Quest. Journal of Functional Programming, 1(2):417-458, October 1991. 2.3.1
13. [Coq91] Thierry Coquand. An algorithm for testing conversion in Type Theory. In G. Huet and G. D. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991. 8.3.1
14. [Cou97a] Judicaël Courant. A Module Calculus for Pure Type Systems. In TLCA'97, LNCS, pages 112-128. Springer-Verlag, 1997. 3
15. [Cou97b] Judicaël Courant. An applicative module calculus. In TAP-SOFT'97, LNCS. Springer-Verlag, April 1997. 3, 2.3.5, 11, 6.5.1
16. [Dam85] Luis Manuel Martins Damas. Type Assignment in Programming Languages. PhD thesis, Department of Computer Science, University of Edinburgh, April 1985. 3.2.3, 8.5
17. [DCH02] Derek Dreyer, Karl Crary, and Robert Harper. Moscow ML's higher-order modules are unsound, 17 September 2002. Message to the Types Forum http://www.cis.upenn.edu/bcpierce/types. 10.1.4, 1.0.1.4
18. [deB72] N. G. deBruijn. Lambda calculus notation with nameless dummies: a tool for automatic formula manipulation with application to the Church-Rosser theorem. Indag. Mathematics, 34, 1972. 6.4.1
19. [Els99] Martin Elsman. Program Modules, Separate Compilation, and Intermodule Optimisation. PhD thesis, Dept. of Computer Science, University of Copenhagen, 1999. 10.1.10
20. [HH86] James G. Hook and Douglas J. Howe. Impredicative Strong Existential Equivalent to Type:Type. Technical Report TR 86-760, Department of Computer Science,Cornell University, June 1986. 2
21. [HL94] Robert Harper and Mark Lillibridge. A type-theoretic approach to higher-order modules with sharing. In 21st ACM Symp. Principles of Prog. Lang., 1994. 2.3.3, 3, 3, 2.3.5, 3.3.1, 6.4.1, 7.1, 9.2.1, 9.2.2
22. [HM93] Robert Harper and John C. Mitchell. On the type structure of Standard ML. In ACM Trans. Prog. Lang. Syst., volume 15(2), pages 211-252, 1993. 2, 2.3.2, 2.3.2, 2.3.5, 3.3.1, 9.1, 9.2.1
23. [HMM86] Robert Harper, David MacQueen, and Robin Milner. Standard ML. Technical Report ECS-LFCS-86-2, Laboratory for Foundations of Computer Science, University of Edinburgh, May 1986. 2.3.1, 6.3.2
24. [HMM90] Robert Harper, John C. Mitchell, and Eugenio Moggi. Higher-order modules and the phase distinction. Technical Report ECS-LFCS-90-112, Department of Computer Science, University of Edinburgh, April 1990. 2.2.5, 2.3.2, 2.3.5, 3.3.1, 9.2.1
25. [How80] William Howard. The formulae-as-types notion of construction. In J. Hindley and J. Seldin, editors, To H. B. Curry: Essays on Combinatory Logic. Academic Press, 1980. 2.2
26. [HS97] Robert Harper and Chris Stone. An Interpretation of Standard ML in Type Theory. Technical Report CMU-CS-97-147, School of Computer Science,Carnegie Mellon University, June 1997. 2.3.3, 3, 3, 3.3.1, 7.1, 9.2.1, 9.2.2
27. [Hue75] Gérard Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27-57, 1975. 5.6
28. [Jon96] Mark P. Jones. Using parameterized signatures to express modular structure. In Proc. 23rd Symp. Principles of Prog. Lang. ACM Press, 1996. 2.3.4
29. [KST97] Stefan Kahrs, Donald T. Sannella, and Andrzej Tarlecki. The Definition of Extended ML: A gentle introduction. Theoretical Computer Science, 173:445-484, 1997. 3.2.3
30. [Ler94] Xavier Leroy. Manifest types, modules, and separate compilation. In Proc. 21st Symp. Principles of Prog. Lang., pages 109-122. ACM Press, 1994. 3, 3.3.1, 11, 6.1, 6.5.1, 8.2.1, 9.2.1, 9.2.2
31. [Ler95] Xavier Leroy. Applicative functors and fully transparent higher-order modules. In Proc. 22nd Symp. Principles of Prog. Lang., pages 142-153. ACM Press, 1995. 3, 3.3.1, A. 1.3, 4.1.1, 5.1, 5.2.3, 11, 6.5.1, 8.2.1, 9.2.1, 9.2.2, 9.2.3
32. [Ler96a] Xavier Leroy. A modular module system. Technical Report RR n° 2866, INRIA, Rocquencourt, April 1996. 3
33. [Ler96b] Xavier Leroy. A syntactic theory of type generativity and sharing. Journal of Functional Programming, 6(5):1-32, September 1996. 3, 3.3.1, 5.1, 9.2.1, 9.2.2
34. [Ler97] Xavier Leroy. The Objective Caml system, documentation and user's guide, 1997. Available at http://pauillac.inria.fr/ocaml. 3, 1
35. [Lil97] Mark Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, May 1997. 3, 3, 3.3.1, 5.1, 7.1, 9.2.1, 9.2.2
36. [Luo90] Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, Department of Computer Science, University of Edinburgh, June 1990. 2, 2
37. [Mac86] David MacQueen. Using dependent types to express modular structure. In 13th ACM Symp. on Principles of Prog. Lang., 1986. 2.3.1, 2.3.2, 2.3.5, 3.3.1, 5.2.2, 9.2.1
38. [MG93] Savi Maharaj and Elsa Gunter. Studying the ML Module System in HOL. The Computer Journal, 36(5), 1993. 2.3.4, 7.4.1, 9.3
39. [Mil78] Robin Milner. A theory of type polymorphism in programming languages. Journal of Computer and System Sciences, 17:348-375, 1978. 3.28, 3.2.3, 8.1, 8.1, 8.5
40. [Mil91] Dale Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of Logic and Computation, 2/4:497-536, 1991. 5.6, 5.6
41. [M1192] Dale Miller. Unification under a mixed prefix. Journal of Symbolic Computation, 14:321-358, 1992. 8.3.1
42. [Mit96] John C. Mitchell. Foundations for Programming Languages. MIT Press, 1996. 2.2
43. [MP88] John C. Mitchell and Gordon D. Plotkin. Abstract types have existential type. ACM Transactions on Programming Languages and Systems, 10(3):470-502, July 1988. 2.2.2, 2.3.1, 2.3.5, 7.2
44. [MP93] James McKinna and Robert Pollack. Pure Type Sytems formalized. In Proc. Int'l Conf. on Typed Lambda Calculi and Applications, Utrecht, pages 289-305, 1993. 4.3.2
45. [MT91] Robin Milner and Mads Tofte. Commentary on Standard ML. MIT Press, 1991. 2.1, 2.2, 6.3.2
46. [MT94] David MacQueen and Mads Tofte. A semantics for higher-order functors. In Donald Sannella, editor, Programming Languages and Systems - ESOP '94, volume 788 of LNCS. Springer Verlag, 1994. 2.3.3, 3, 2.3.4, 5.1
47. [MTH90] Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990. 1.2, 2.1, 2.1.2, 2.1.1, 2.2, 2.3.2, 2.3.3, 3, 3, 3.1.2, 3.1.4, 3.3, 3.3.3, .1.0, 6.3.2, 9.3
48. [MTH96] Robin Milner, Mads Tofte, and Robert Harper. The Revised Definition of Standard ML. MIT Press, 1996. 1.2, 2.1, 2.1.2, 2.1.1, 2.2, 2.3.3, 3, 2.3.4, 3, 3.1.2, 3.1.4, 3.3, 3.3.3, 6.3.2, 9.3, 10
49. [NJ96] Jan Nicklish and Simon Peyton Jones. An exploration of modular programs. In The Glasgow Workshop on Functional Programming, 1996. 2.3.4
50. [Pau91] Larry Paulson. ML for the Working Programmer. Cambridge University Press ,1991. 2.1
51. [Pot95] François Pettier. Implémentation d'un système de modules évolué en Caml-Light. Technical Report N° 2449, INRIA,Rocquencourt, January 1995. 3
52. [Rob65] J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965. 8.1, 8.4, 8.3.1
53. [RRS00] Sergei Romanenko, Claudio V. Russo, and Peter Sestoft. Moscow ML Version 2.0, 2000. Available at http://www.dina.kvl.dk/~sestoft/mosml. (document), 1.2, 10
54. [Rus96] Claudio V. Russo. Standard ML Type Generativity as Existential Quantification. Technical Report ECS-LFCS-96-344, Laboratory for Foundations of Computer Science, University of Edinburgh, June 1996. 4
55. [Rus98a] Claudio V. Russo. An Implementation of First-Class Modules, March 1998. Available on request from the author. 1.3, 8.5, 9.3
56. [Rus98b] Claudio V. Russo. types For Modules. PhD thesis, LFCS, University of Edinburgh, 1998. (document), 10
57. [Rus00a] Claudio V. Russo. First-Class Structures for Standard ML. In European Symposium on Programming (ESOP), pages 336-350. Springer Verlag, 2000. 10.1
58. [Rus00b] Claudio V. Russo. First-Class Structures for Standard ML. Nordic Journal of Computing, 7(4):348-374, November 2000. 10.1
59. [Rus00c] Claudio V. Russo. The Definition of Non-Standard ML (Syntax and Static Semantics). Unpublished manuscript available on request, 2000. 10, 10.1.9
60. [Rus01] Claudio V. Russo. Recursive Structures for Standard ML. In International Conference on Functional Programming (ICFP). ACM Press, 2001. 10.1, 10.1.7
61. [SH96] Chris Stone and Robert Harper. A Type-Theoretic Account of Standard ML 1996. Technical Report CMU-CS-96-136, School of Computer Science,Carnegie Mellon University, May 1996. 2.3.3, 3, 3, 3.3.1, 7.1, 9.2.1, 9.2.2
62. [Tho91] Simon Thompson. Type Theory and Functional Programming. Addison-Wesley, 1991. 2.2
63. [Tof88] Mads Tofte. Operational Semantics and Polymorphic Type Inference. PhD thesis, Department of Computer Science, University of Edinburgh, May 1988. 2.3.4, 8.1, 8.1, 8.3.2
64. [Tof89] Mads Tofte. Four Lectures on Standard ML. Technical Report ECS-LFCS-89-73, Department of Computer Science, University of Edinburgh, March 1989. 2.1
65. [Tof92] Mads Tofte. Principal Signatures for Higher-Order Program Modules. In Principles of Programming Languages. ACM Press, January 1992. 2.3.4, 5.1
66. [Tof93] Mads Tofte. Principal Signatures for Higher-order Program Modules. Journal of Functional Programming, January 1993. 2.3.4, 5.1
67. [Wir88] Niklaus Wirth. Programming in Modula-2. Springer-Verlag, 4 edition, 1988. 3, 6.1