|
ABSTRACT
An experimental system for declaring and inferring type in Smalltalk is described. (In the current Smalltalk language, the programmer supplies no type declarations.) The system provides the benefits of type declaration in regard to compile-time checking and documentation, while still retaining Smalltalk's flexibility. A type hierarchy, which is integrated with the existing Smalltalk class hierarchy, allows one type to inherit the traits of another type. A type may also have parameters, which are in turn other types.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
| |
2
|
{Cannon 80} Cannon, H.I. Flavors. Technical Report, MIT Artificial Intelligence Lab, 1980.
|
 |
3
|
|
| |
4
|
{DOD 80} United States Department of Defense. Reference Manual for the Ada Programming Language 1980.
|
| |
5
|
|
 |
6
|
|
 |
7
|
|
 |
8
|
|
| |
9
|
{LRG 81} The Xerox Learning Research Group. The Smalltalk-80 System. Byte 6(8):36--48, August, 1981.
|
| |
10
|
{Milner 78} Milner, R. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences 17:348--375, 1978.
|
| |
11
|
{Mitchell 79} Mitchell, J., Maybury, W., and Sweet, R. Mesa Language Manual. Technical Report CSL-79-3, Xerox Palo Alto Research Center, April, 1979.
|
 |
12
|
|
| |
13
|
{Tesler 81} Tesler, L. The Smalltalk Environment. Byte 6(8):90--147, August, 1981.
|
| |
14
|
{Wulf 76} Wulf, W., London, R., and Shaw, M. An Introduction to the Construction and Verification of Alphard Programs. IEEE Transactions on Software Engineering SE-2(4):253--264, December, 1976.
|
CITED BY 31
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Peter Canning , William Cook , Walter Hill , Walter Olthoff , John C. Mitchell, F-bounded polymorphism for object-oriented programming, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.273-280, September 11-13, 1989, Imperial College, London, United Kingdom
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Niklaus Haldiman , Marcus Denker , Oscar Nierstrasz, Practical, pluggable types for a dynamic language, Computer Languages, Systems and Structures, v.35 n.1, p.48-62, April, 2009
|
|