First-class structures for standard ML

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1782, Issue , 2000, Pages 336-350

  Russo, Claudio V ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALGORITHMS AND DATA STRUCTURES; CLASS STRUCTURES; EXPRESSIVE POWER; HIGHER-ORDER; LARGE PROGRAMS; SOFTWARE SYSTEMS; STANDARD ML; TYPE INFERENCES;

ARTIFICIAL INTELLIGENCE;

EID: 84947237938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46425-5_22     Document Type: Conference Paper

References (18)

1. R. Harper, M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In 21st ACM Symp. Principles of Prog. Lang., 1994.
2. R. Harper, J. C. Mitchell. On the type structure of Standard ML. In ACM Trans. Prog. Lang. Syst., volume 15(2), pages 211-252, 1993.
3. J. R. Hindley. The principal type scheme of an object in combinatory logic. Trans. of the American Mathematical Society, 146:29-40, 1969.
4. M. Jones. Using Parameterized Signatures to Express Modular Structure. In 23rd ACM Symp. Principles of Prog. Lang., 1996.
5. D. Katiyar, D. Luckham, J. Mitchell. A type system for prototyping languages. In 24th ACM Symp. Principles of Prog. Lang., 1994.
6. X. Leroy. Manifest types, modules, and separate compilation. In Proc. 21st Symp. Principles of Prog. Lang., pages 109-122. ACM Press, 1994.
7. X. Leroy. Applicative functors and fully transparent higher-order modules. In Proc. 22nd Symp. Principles of Prog. Lang., pages 142-153. ACM Press, 1995.
8. M. Lillibridge. Translucent Sums: A Foundation for Higher-Order Module Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, 1997.
9. R. Milner. A theory of type polymorphism in programming languages. Journal of Computer and System Sciences, 17:348-375, 1978.
10. R. Milner, M. Tofte, R. Harper, D. MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
11. J. C. Mitchell, S. Meldal, N. Madhav. An extension of Standard ML modules with subtyping and inheritance. In 18th ACM Symp. Principles of Prog. Lang., 1991.
12. J. C. Mitchell and G. D. Plotkin. Abstract types have existential type. ACM Transactions on Programming Languages and Systems, 10(3):470-502, July 1988.
13. M. Odersky, K. Läufer. Putting Type Annotations To Work In 23rd ACM Symp. Principles of Prog. Lang., 1996.
14. C. Okasaki. Purely Functional Data Structures. Cambridge University Press, 1998.
15. S. Romanenko, P. Sestoft. Moscow ML. (www.dina.kvl.dk/~sestoft/mosml).
16. C. V. Russo. Types For Modules. PhD Thesis, Laboratory for Foundations of Computer Science, University of Edinburgh, 1998.
17. C. V. Russo. Non-Dependent Types For Standard ML Modules. In 1999 Int'l Conf. on Principles and Practice of Declarative Programming.
18. C. V. Russo. First-Class Structures for Standard ML (long version). Forthcoming Technical Report, LFCS, Division of Informatics, University of Edinburgh, 2000.