David V. Moffat
- K. Jensen, and N. Wirth, Pascal--User Manual and Report, Springer-Verlag, New York (1974) Google Scholar
Digital Library
- J. D. Ichbiah, et al., "Preliminary ADA Reference Manual", SIGPLAN Notices, 14, 6A, all (1979) Google ScholarDigital Library
- J. D. Ichbiah, et al., "Rationale for the Design of the ADA Programming Language", SIGPLAN Notices, 14, 6B, all (1979) Google ScholarDigital Library
- J. Welsh, W. J. Sneeringer and C. A. R. Hoare, "Ambiguities and Insecurities in Pascal", Software--Practice and Experience, 7, 685--696 (1977)Google ScholarCross Ref
- R. D. Tennent, "Another Look at Type Compatibility in Pascal", Software--Practice and Experience, 8, 429--437 (1978)Google ScholarCross Ref
- R. T. Boute, "Simplifying Ada by Removing Limitations", SIGPLAN Notices, 15, 2, 17--28 (1980) Google ScholarDigital Library
Index Terms
- Enumerations in Pascal, ADA, and beyond
Recommendations
Beyond concurrent Pascal
We take the view that operating systems should not be written in assembly language. Alternatives are machine oriented high-level languages and “safe” languages in the style of Concurrent Pascal and MODULA. A serious drawback of the Concurrent Pascal ...
Beyond concurrent Pascal
SOSP '77: Proceedings of the sixth ACM symposium on Operating systems principlesWe take the view that operating systems should not be written in assembly language. Alternatives are machine oriented high-level languages and “safe” languages in the style of Concurrent Pascal and MODULA. A serious drawback of the Concurrent Pascal ...
On cyclic 〈m,n〉-enumerations
A word is called cyclic if each letter occurs in it an even number of times. A cyclic word X on the n-letter alphabet is called a cyclic 〈m,n〉-word if there is a letter in each subword of X occurring in it an odd number of times, and in each subword of ...
Comments