- 1981
- Robert Ashworth:
Prettyprinting for power. ACM SIGPLAN Notices 16(2): 16-17 (1981) - S. K. Bandyopadhyay:
A study on program level dependency of implemented algorithms on its potential operands. ACM SIGPLAN Notices 16(2): 18-25 (1981) - S. K. Bandyopadhyay:
Theoretical relationships between potential operands and basic measurable properties of algorithm structure. ACM SIGPLAN Notices 16(2): 26-34 (1981) - David R. Barach, Frederick N. Webb:
The symbol table representation of types in the PROPHET system. ACM SIGPLAN Notices 16(4): 17-26 (1981) - Rodney M. Bates:
A PASCAL prettyprinter with a different purpose. ACM SIGPLAN Notices 16(3): 10-17 (1981) - Mordechai Ben-Ari, Amiram Yehudai:
A methodology for modular use of Ada. ACM SIGPLAN Notices 16(12): 22-26 (1981) - Jan A. Bergstra, John-Jules Ch. Meyer:
I/O-computable data structures. ACM SIGPLAN Notices 16(4): 27-32 (1981) - David C. Bixler:
Los Angeles SIGSPACE/SIGSOFT/SIGPLAN December meeting. ACM SIGPLAN Notices 16(2): 12 (1981) - Rafael Bonet, Antonio Kung, Knut Ripken, Robert K. Yates, Manfred Sommer, Jürgen Winkler:
Ada syntax diagrams for top-down analysis. ACM SIGPLAN Notices 16(9): 29-41 (1981) - Grady Booch:
Describing software design in Ada. ACM SIGPLAN Notices 16(9): 42-47 (1981) - Shimon Cohen:
Simplicity = efficiency = readability a simple infix to prefix algorithm. ACM SIGPLAN Notices 16(9): 83-89 (1981) - Michael L. Cook, Mark G. Arnold:
A structured APL preprocessor. ACM SIGPLAN Notices 16(5): 22-31 (1981) - G. V. Cormack:
An algorithm for the selection of overloaded functions in ADA. ACM SIGPLAN Notices 16(2): 48-52 (1981) - Charles Crowley:
A finite state machine for Western Swing. ACM SIGPLAN Notices 16(4): 33-35 (1981) - Thomas M. Dailey III:
A procedure invocation syntax for enhanced readability. ACM SIGPLAN Notices 16(3): 48-52 (1981) - Frank DeRemer, Thomas J. Pennello, William M. McKeeman:
Ada syntax chart. ACM SIGPLAN Notices 16(9): 48-59 (1981) - Mary S. Van Deusen:
Types in red. ACM SIGPLAN Notices 16(12): 27-38 (1981) - Stephen C. Dewhurst:
An equivalence result for temporal logic. ACM SIGPLAN Notices 16(2): 53-55 (1981) - D. G. Elliott:
FORTRAN 77 and structured design. ACM SIGPLAN Notices 16(12): 7-9 (1981) - Joseph R. Falcone:
A vector programming language. ACM SIGPLAN Notices 16(4): 36-50 (1981) - Patrick A. Fitzhorn, Gearold R. Johnson:
C: toward a concise syntactic description. ACM SIGPLAN Notices 16(12): 14-21 (1981) - António L. Furtado, Paulo A. S. Veloso:
Procedural specifications and implementations for abstract data types. ACM SIGPLAN Notices 16(3): 53-62 (1981) - Joseph A. Goguen, José Meseguer:
Completeness of many-sorted equational logic. ACM SIGPLAN Notices 16(7): 24-32 (1981) - Gaston H. Gonnet:
Coding benchmark for Utopia84. ACM SIGPLAN Notices 16(7): 33-34 (1981) - David A. Gustafson:
Control flow, data flow & data independence. ACM SIGPLAN Notices 16(10): 13-19 (1981) - C. L. Hankin, H. W. Glaser:
The data flow programming language CAJOLE - an informal introduction. ACM SIGPLAN Notices 16(7): 35-44 (1981) - David R. Hanson:
The Y programming language. ACM SIGPLAN Notices 16(2): 59-68 (1981) - Seif Haridi, John-Olof Bauner, Gert Svensson:
An implementation and empirical evaluation of the tasking facilities in ADA. ACM SIGPLAN Notices 16(2): 35-47 (1981) - Warren Harrison, Kenneth I. Magel:
A complexity measure based on nesting level. ACM SIGPLAN Notices 16(3): 63-74 (1981) - Warren Harrison, Kenneth I. Magel:
A topological analysis of the complexity of computer programs with less than three binary branches. ACM SIGPLAN Notices 16(4): 51-63 (1981)
