| Another defence of enumerated types |
| Full text |
Pdf
(530 KB)
|
| Source
|
ACM SIGPLAN Notices
archive
Volume 26 , Issue 8 (August 1991)
table of contents
Pages: 37 - 41
Year of Publication: 1991
ISSN:0362-1340
|
|
Author
|
|
Markku Sakkinen
|
Department of Computer Science and Information Systems, University of Jyväskylä, PL 35, SF-40351 Jyväskylä, Finland
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 1, Downloads (12 Months): 13, Citation Count: 1
|
|
|
ABSTRACT
I claim that enumerations, while of course not strictly necessary, are an elegant and useful facility in modern programming languages. I try to show that arguments recently given against them are weak at best and bogus a t worst, for general-purpose programming. Some related issues on types in programming languages are touched as well. These make it even more questionable whether Oberon marks progress or regress in language design.
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
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
[5] Luca Cardelli, James Donahue, Lucille Glassman, Mick Jordan, Bill Kalsow, Greg Nelson. Modula-3 Report (revised). Digital Systems Research Center and Olivetti Research Center, 1989.
|
 |
6
|
|
 |
7
|
|
| |
8
|
[8] C. Lins. Author's Response to [7]. ACM SIGPLAN Notices, 26:2 (February 1991), 40.
|
|