T. A. Kovats
- Van Wijngaarden, A., Mailloux, B., Peck, J., Koster, C., Singtzoff, M., Lindsey, C., Meertens, L., and Fisker, R. (eds.) Revised report on the algorithmic language Algol 68. SIGPLAN Notices 12 (May 1977), 1--70.Google Scholar
- Tanenbaum, A. S. A. tutorial on Algol 68. ACM Computing Surveys 8 (June 1976), 155--190. Google ScholarDigital Library
- Baumann, R., Feliciano, M., Bauer, F. and Samelson, K. Introduction to Algol. Prentice-Hall, Englewood Cliffs, New Jersey, 1964. Google ScholarDigital Library
- Jensen, K. and Wirth, N. PASCAL User Manual and Report. Springer-Verlag, New York, 1974. Google ScholarDigital Library
- Knuth, D. E. Structured programming with go to statements. ACM Computing Surveys 6 (Dec. 1974), 261--301. Google ScholarDigital Library
- Wirth, N. The design of a PASCAL complier. Software Practice and Experience 1 (1971), 309--333.Google ScholarCross Ref
- Wirth, N. MODULA: a language for modular multi-programming. Software Practice and Experience 7 (1977), 3--35.Google ScholarCross Ref
- Wirth, N. The use of MODULA. Software Practice and Experience 7 (1977), 37--65.Google ScholarCross Ref
- Wirth, N. Design and Implementation of MODULA. Software Practice and Experience 7 (1977), 67--84.Google ScholarCross Ref
- Wirth, N. Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs, New Jersey, 1976. Google ScholarDigital Library
- McCarthy, J., Abrahams, P., Edwards, D., Hart, T. and Levin, M. LISP 1.5 Programmer's Manual. MIT Press, Cambridge, Massachusetts, 1965. Google ScholarDigital Library
- Geller, D. and Weinberg, G. The principle of sufficient reason: a guide to language design for parallel proceessing. SIGPLAN Notices 10 (Mar. 1975), 34--38. Google ScholarDigital Library
- Meissner, L. P. Proposed control structures for extended FORTRAN. SIGPLAN Notices 11 (Jan. 1976), 16--21. Google ScholarDigital Library
- Kou, L. T. On live-dead analysis for global data flow problems. J. ACM 24 (July 1977), 473--483. Google ScholarDigital Library
Index Terms
- Program readability, closing keywords and prefix-style intermediate keywords
Recommendations
Finding competitive keywords from query logs to enhance search engine advertising
A novel method is proposed to find competitive keywords for search engine advertising.The method can explore the keyword associations and their topic information hidden in query logs to identify effective keywords for advertisers.Extensive experiments ...
Effective Keyword Search over Relational Databases Considering Keywords Proximity and Keywords N-grams
DEXA '11: Proceedings of the 2011 22nd International Workshop on Database and Expert Systems ApplicationsThe current amount of text data in relational databases is massive and is growing fast. This increases the importance and need for non-technical users to be able to search for such information using a simple keyword search. Researchers have studied and ...
Filtering XML Streams by XPath and Keywords
iiWAS '14: Proceedings of the 16th International Conference on Information Integration and Web-based Applications & ServicesWith the rise of Web search engines, processing keyword search over XML and XML streams has drawn much attention from many researchers. Compared to conventional query methods, keyword search has several benefits for its simplicity and its user-...
Comments