A syntactic theory of type generativity and sharing

Journal of Functional Programming

Volumn 6, Issue 5, 1996, Pages 667-698

  Leroy, Xavier ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030351282     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0956796800001933     Document Type: Article

References (24)

1. Aponte, M.-V. (1993) Extending record typing to type parametric modules with sharing. 20th symposium Principles of Programming Languages, pp. 465-478. ACM Press.
2. Cardelli, L. (1989) Typeful programming. In Neuhold, E. J. and Paul, M., editors, Formal Description of Programming Concepts, pp. 431-507. Springer-Verlag.
3. Cardelli, L. and Leroy, X. (1990) Abstract types and the dot notation. In Broy, M. and Jones, C. B., editors, Proceedings IFIP TC2 Working Conference on Programming Concepts and Methods, pp. 479-504. North-Holland. (Also available as research report 56, DEC Systems Research Center.)
4. Cardelli, L. and MacQueen, D. B. (1988) Persistence and type abstraction. In Atkinson, M. P., Buneman, P. and Morrison, R., editors, Data Types and Persistence. Springer-Verlag.
5. Cardelli, L. and Wegner, P. (1985) On understanding types, data abstraction, and polymorphism. Computing Surveys, 17(4): 471-522.
6. Gran, G. (1995) An error in rule 55 of the definition of Standard ML. Personal communication, June.
7. Harper, R. and Lillibridge, M. (1994) A type-theoretic approach to higher-order modules with sharing. 21st symposium Principles of Programming Languages, pp. 123-137. ACM Press.
8. Harper, R., Milner, R. and Tofte, M. (1987) A type discipline for program modules. In TAPSOFT 87: Lecture Notes in Computer Science 250, pp. 308-319. Springer-Verlag.
9. Harper, R. and Mitchell, J. C. (1993) On the type structure of Standard ML. ACM Trans. Programming Languages and Systems, 15(2): 211-252.
10. Harper, R., Mitchell, J. C. and Moggi, E. (1990). Higher-order modules and the phase distinction. 17th symposium Principles of Programming Languages, pp. 341-354. ACM Press.
11. Leroy, X. (1994) Manifest types, modules, and separate compilation. 21st symposium Principles of Programming Languages, pp. 109-122. ACM Press.
12. Leroy, X. (1995) Applicative functors and fully transparent higher-order modules. 22nd symposium Principles of Programming Languages, pp. 142-153. ACM Press.
13. Liskov, B. and Guttag, J. (1986) Abstraction and Specification in Program Development. MIT Press.
14. MacQueen, D. B. (1984) Modules for Standard ML. In Lisp and Functional Programming 1984, pp. 198-207. ACM Press.
15. MacQueen, D. B. (1986) Using dependent types to express modular structure. 13th symposium Principles of Programming Languages, pp. 277-286. ACM Press.
16. MacQueen, D. B. and Tofte, M. (1994) A semantics for higher-order functors. In Sannella, D., editor, Programming Languages and Systems - ESOP '94: Lecture Notes in Computer Science 788, pp. 409-423. Springer-Verlag.
17. Milner, R. and Tofte, M. (1991) Commentary on Standard ML. MIT Press.
18. Milner, R., Tofte, M. and Harper, R. (1990) The definition of Standard ML. MIT Press.
19. Mitchell, J. C. and Plotkin, G. D. (1988) Abstract types have existential type. ACM Trans. Programming Languages and Systems, 10(3): 470-502.
20. Russo, C. (1995) Generativity of names in the static semantics of Standard ML. Personal communication, February.
21. Sabry, A. and Felleisen, M. (1992) Reasoning about programs in continuation-passing style. In Lisp and Functional Programming 1992, pp. 288-298.
22. Tofte, M. (1988) Operational semantics and polymorphic type inference. PhD thesis CST-52-88, University of Edinburgh.
23. Tofte, M. (1992) Principal signatures for higher-order program modules. 19th symposium Principles of Programming Languages, pp. 189-199. ACM Press.
24. Wirth, N. (1983) Programming in Modula-2. Springer-Verlag.