An extension of Standard ML modules with subtyping and inheritance

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 1991, Pages 270-278

  Mitchell, John ^a   Meldal, Sigurd ^b   Madhav, Neel ^a  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DATA TYPES; FORMAL LANGUAGES; SOFTWARE TESTING; SPECIFICATIONS;

BINARY OPERATIONS; FUNCTION COMPONENTS; INHERITANCE MECHANISMS; INTERNAL INTERFACES; LANGUAGE DESIGN; MODULE SYSTEMS; OBJECT-ORIENTED CONCEPTS; PROGRAMMING STYLES;

OBJECT ORIENTED PROGRAMMING;

EID: 85039573321     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/99583.99620     Document Type: Conference Paper

References (32)

1. A. Black, N. Hutchinson, E. Jul, and H. Levy. Object structure in the Emerald system. In Pvoc. ACM Symp. on Object-Oriented Programming: Systems, Languagesl and Applications, pages 78-86, October 1986.
2. F. Belz ancl D.C. Luckham. A new approach to prototyping ada-based hardware/software systems. In Proc. ACM Tri-Ada 9o Conference, December 1990. To appear.
3. R.L. Constable et al. Implementing Mathematics with the Nuprl Proof Development System, volume 37 of Graduate Texts in Mathematics. Prentice-HaJl, 1986.
4. L. Cardelli. Typeful programming. Technical Report, 45, DEC Systems Research Center, 1989. presented at IFIP Advanced Seminar on Formal Descriptions of Programming Concepts.
5. P. Canning, W. Cook, W. Hill, J. Mitchell, and W. Olthoff. F-bounded quantification for object-oriented programming. In Functional Prog. and Computer Architecture, pages 273-280, 1989.
6. L. Cardelli and J.C. Mitchell. Operations on records. In Math. Foundations of Prog. Lang. Semantics, 1989. To appear. Also available as DEC SRC Technical Report 48, August 1989, 60 pages.
7. W.R. cook. A proposal for making Eiffel type-safe. In European Conf. on Object-Oriented Programming, pages 57-72, 1989.
8. L. Cardelli and P. Wegner. On understanding types, data abstraction, and polymorphism. Computing Szsroeys, 17(4):471-522, 1985.
9. E.W. Dijkstra. Notes on structured programming. In O.J. Dahl, E.W. Dijkstra, and C.A.R. Hoare, editors, Structured Programming. Academic Press, 1972.
10. A. Goldberg and D. Robson. Sm alltal&80: The language and its implementation. Addison Wesley, 1983.
11. R. Harper, D.B. MacQueen, and R. Milner. Standard ML. Technical Report ECS-LFCS-86-2, Lab. for Foundations of Computer Science, University of Edinburgh, March 1986.
12. R. Harper, J.C. Mitchell, and E. Moggi. Higher-order modules and the phase distinction. In Proc. 17-Th ACM Symp. on Principles of Programming Languages, pages 341-354, January 1990.
13. L. Jategaonkar and J.C. Mitchell. ML with extended pattern matching and subtypes. In Proc. ACM Symp. Lisp and Functional Programming Languages, pages 198-212, July 1988.
14. D. C. Luckham, D. P. Helmbold, S. Meldal, D. L. Bryan, and M. A. Haberler. Task sequencing language for specifying distributed ada systems. In Lecture Notes in Computer Science, Number 275, pages 249-305. Springer-Verlag, May 1986.
15. David Luckham, Friedrich W. von Henke, Bernd Krieg-Bruckner, and Olaf Owe. Anna-A Language for Annotating Ada Programs. In Lecture Notes in Computer Science, Number 260. Springer-Verlag, July 1987.
16. D.B. MacQueen. Modules for Standard ML. Polymorphism , 2(2), 1985. 35 pages. An earlier version appeared in Proc. 1984 ACM Symp. on Lisp and Functional Programming.
17. D.B. MacQueen. Using dependent types to express modular structure. In Pr-oc. 13-Th ACM Symp. on Principles of Programming Languages, pages 277-286, 1986.
18. P. Martin-Lof. Intuitionistic Type Theory. Bibliopolis, Napoli, 1984.
19. J.C. Mitchell and R. Harper. The essence of ML. In Proc. 15-Th ACM Symp. on Principles of Programming Languc&ges, pages 28-46, January 1988.
20. J.C. Mitchell. Coercion and type inference (summary). In Proc. 11-Th ACM Symp. on Principles of Programming Languages, pages 175-185, January 1984.
21. J.C. Mitchell. Toward a typed foundation for method specialization and inheritance. In Proc. 17-Th ACM Symp. on Principles of Programming Languages, pages 109-124, January 1990.
22. J.C. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. North-Holland, 1990. (To appear.).
23. J.C. Mitchell and G.D. Plotkin. Abstract types have existential types. ACM Trans. on Programming Languages and Systems, 10(3):470-502, 1988. Preliminary version appeared in Proc. 12-Th ACM Symp. on Principles of Programming Languages, 1985.
24. Robin Milner, Mads Tofte, and Robert Harper. The Definition of Standard ML. MIT Press, 1990.
25. D. Parnas. On the criteria to be used in decomposing systems into modules. Communications of the A CM, 5(12):1053-1058, December 1972.
26. D. Remy. Typechecking records and variants in a natural extension of ML. In 16-Th ACM Symposium on Principles of Programming Languages, pages 60-76, 1989.
27. R. Sethi. Programming Languages: Concepts and Constructs. Addison-Wesley, 1989.
28. A. Snyder. Encapsulation and inherit ante in object-oriented programming languages. In Proc. I-st ACM Symp. on Object-Oriented Programming Systems, Languages, and Applications, pages 38-46, October 1986.
29. D. Sanella and A. Tarlecki. Towards formal development of ML programs: foundations and methodology. Technical Report ECSLFCS-89-71, Laboratory for Foundations of Computer Science, February 1989.
30. B. Stroustrop. The C++ Programming Language. Addison-Wesley#986.
31. US Dept. of Defense. Re}erence Manual for the Ada Programming Language. GPO 008-000-00354-8, 1980.
32. M. Wand. Complete type inference for simple objects. In Proc. 2nd IEEE Symp. on Logic in Computer Science, pages 37-44, 1987. Corrigendum in Proc. 13rd IEEE 2ymp. oa Logic in Computer Science, page 132, 1988.