skip to main content
Skip header Section
A programming languageJanuary 1962
Publisher:
  • John Wiley & Sons, Inc.
  • 605 Third Ave. New York, NY
  • United States
ISBN:978-0-471-43014-8
Published:01 January 1962
Pages:
315
Skip Bibliometrics Section
Bibliometrics
Skip Abstract Section
Abstract

From the Preface

Applied mathematics is largely concerned with the design and analysis of explicit procedures for calculating the exact or approximate values of various functions. Such explicit procedures are called algorithms or programs. Because an effective notation for the description of programs exhibits considerable syntactic structure, it is called a programming language.

Much of applied mathematics, particularly the more recent computer-related areas which cut across the older disciplines, suffers from the lack of an adequate programming language. It is the central thesis of this book that the descriptive and analytic power of an adequate programming language amply repays the considerable effort required for its mastery. This thesis is developed by first presenting the entire language and then applying it in later chapters to several major topics.

The areas of application are chosen primarily for their intrinsic interest and lack of previous treatment, but they are also designed to illustrate the universality and other facets of the language. For example, the microprogramming of Chapter 2 illustrates the divisibility of the language, i.e., the ability to treat a restricted area using only a small portion of the complete language. Chapter 6 (Sorting) shows its capacity to compass a relatively complex and detailed topic in a short space. Chapter 7 (The Logical Calculus) emphasizes the formal manipulability of the language and its utility in theoretical work.

The material was developed largely in a graduate course given for several years at Harvard and in a later course presented repeatedly at the IBM Systems Research Institute in New York. It should prove suitable for a two-semester course at the senior or graduate level. Although for certain audiences an initial presentation of the entire language may be appropriate, I have found it helpful to motivate the development by presenting the minimum notation required for a given topic, proceeding to its treatment (e.g., microprogramming), and then returning to further notation. The 130-odd problems not only provide the necessary finger exercises but also develop results of general interest.

Chapter 1 or some part of it is prerequisite to each of the remaining "applications" chapters, but the applications chapters are virtually independent of one another. A complete appreciation of search techniques (Chapter 4) does, however, require a knowledge of methods of representation (Chapter 3). The cross references which do occur in the applications chapters are either nonessential or are specific to a given figure, table, or program. The entire language presented in Chapter 1 is summarized for reference at the end of the book.

References

  1. Birkhoff, G., and S. MacLane (1941), A Survey of Modern Algebra, Macmillan, New York.Google ScholarGoogle Scholar
  2. Burks, A. W., D. W. Warren, and J. B. Wright (1954), "An Analysis of a Logical Machine Using Parenthesis-free Notation," Mathematical Tables and Other Aids to Computation, vol. VIII, pp. 53--57.Google ScholarGoogle ScholarCross RefCross Ref
  3. Dickson, L. E. (1939), New First Course in the Theory of Equations, Wiley, New York.Google ScholarGoogle Scholar
  4. Garner, Harvey L. (1959),"The Residue Number System," IRE Transactions, vol. EC-8, pp. 140--147.Google ScholarGoogle Scholar
  5. Goldstine, H. H., and J. von Neumann (1947), "Planning and Coding of Problems for an Electronic Computing Instrument," Report on the Mathematical and Logical Aspects of an Electronic Computing Instrument, Part II, vol. 1, Institute for Advanced Study, Princeton.Google ScholarGoogle Scholar
  6. Iverson, K. E. (1954), "Machine Solutions of Linear Differential Equations," Doctoral Thesis, Harvard University.Google ScholarGoogle Scholar
  7. Jacobson, N. (1951), Lectures in Abstract Algebra, vol. 1, Van Nostrand, New York.Google ScholarGoogle Scholar
  8. Kunz, K. S. (1957), Numerical Analysis, McGraw-Hill, New York.Google ScholarGoogle Scholar
  9. Margenau, H., and G. M. Murphy (1943), The Mathematics of Physics and Chemistry, Van Nostrand, New York.Google ScholarGoogle Scholar
  10. Phaister, M. (1958), Logical Design of Digital Computers, Wiley, New York.Google ScholarGoogle Scholar
  11. Richards, R. K. (1955), Arithmetic Operations in Digital Computers, Van Nostrand, New York.Google ScholarGoogle Scholar
  12. Riordan, J. (1958), An Introduction to Combinatorial Analysis, Wiley, New York.Google ScholarGoogle Scholar
  13. Rutishauser, H. (1959), "Zur Matrizeninversion nach Gauss-Jordan," Zeitschrift für Angewandte Mathematik und Physik, vol. X, pp. 281--291.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Wright, H. N. (1939), First Course in Theory of Numbers, Wiley, New York.Google ScholarGoogle Scholar
  15. Falkoff, A., (1962) "Algorithms for Parallel-Search Memories," J.A.C.M. (to appear).Google ScholarGoogle Scholar
  16. IBM Reference Manual, 7090 Data Processing System, (1960), Form # A-22-6528, International Business Machines Corporation.Google ScholarGoogle Scholar
  17. Phister, M., (1958), Logical Design of Digital Computers, Wiley, New York.Google ScholarGoogle Scholar
  18. Blaauw, G. A., (1959), "Indexing and Control-Word Techniques," IBM Journal of Research and Development, vol. 3, pp. 288--301.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Brooks, F. P., Jr., and K. E. Iverson, (1962), (in press) Automatic Data Processing, Wiley, New York.Google ScholarGoogle Scholar
  20. Burks, A. W., D. W. Warren, and J. B. Wright, (1954), "An Analysis of a Logical Machine Using Parenthesis-free Notation," Mathematical Tables and Other Aids to Computation, vol. VIII, pp. 53--57.Google ScholarGoogle ScholarCross RefCross Ref
  21. Dewey, Godfrey, (1923), Relativ Frequency of English Speech Sounds, Cambridge University Press, p. 185.Google ScholarGoogle ScholarCross RefCross Ref
  22. Huffman, D. A., (1952), "A Method for the Construction of Minimum Redundancy Codes," Proc. IRE, vol. 40, pp. 1098--1101.Google ScholarGoogle Scholar
  23. Iverson, K. E., (1955), "Report by the Staff of the Computation Laboratory to the American Gas Association and Edison Electric Institute," Section III, Report No. 1, Harvard Computation Laboratory.Google ScholarGoogle Scholar
  24. Johnson, L. R., (1962), "On Operand Structure, Representation, Storage, and Search," Research Report # RC-603, IBM Corp.Google ScholarGoogle Scholar
  25. Lukasiewicz, Jan, (1951), Aristotle's Syllogistic from the Standpoint of Modern Formal Logic, Clarendon Press, Oxford, England, p. 78.Google ScholarGoogle Scholar
  26. Marimont, R. B., (1959), "A New Method of Checking the Consistency of Precedence Matrices," J. ACM, vol. 6, pp. 164--171.Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Ross, I. C., and F. Harary, (1960), "The Square of a Tree," Bell System Tech. J., vol. XXXIX, pp. 641--8.Google ScholarGoogle ScholarCross RefCross Ref
  28. Shaw, J. C., A. Newell, H. A. Simon, and T. O. Ellis, (1958), "A Command structure for complex information processing," Proc. Western Joint Computer Conference, pp. 119--128.Google ScholarGoogle Scholar
  29. Burks, A. W., D. W. Warren, and J. B. Wright, (1954) "An Analysis of a Logical Machine Using Parenthesis-free Notation," Mathematical Tables and Other Aids to Computation, vol. VIII, pp. 53--57.Google ScholarGoogle ScholarCross RefCross Ref
  30. Cramèr, Harald, (1951), Mathematical Methods of Statistics, Princeton University Press.Google ScholarGoogle Scholar
  31. Johnson, L. R., (1961), "An Indirect Chaining Method for Addressing on Secondary Keys," Communications of the Association for Computing Machinery, vol. 4, No. 5, pp. 218--222.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Lamb, S. M. and W. H. Jacobsen, Jr., (1961), "A High-Speed Large Capacity Dictionary System," Mechanical Translation, vol. 6, pp. 76--107.Google ScholarGoogle Scholar
  33. Lukasiewicz, Jan, (1951), Aristotle's Syllogistic from the Standpoint of Modern Formal Logic, Clarendon Press, Oxford, England, p. 78.Google ScholarGoogle Scholar
  34. Peterson, W. W., (1957), "Addressing for Random-Access Storage," IBM Journal of Research and Development, vol. 1, pp. 130--146.Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Schay, G., Jr., and W. G. Spruth, (1961) "Analysis of a File Addressing Method," Technical Memorandum 17-051, Advanced Systems Development Division, IBM Corporation, New York.Google ScholarGoogle Scholar
  36. Burks, A. W., D. W. Warren, and J. B. Wright, (1954), "An Analysis of a Logical Machine Using Parenthesis-free Notation," Mathematical Tables and Other Aids to Computation, vol. VIII, pp. 53--57.Google ScholarGoogle ScholarCross RefCross Ref
  37. Carr, J. W., III, (1959), "Digital Computer Programming," Chapter 2 of Grabbe, Ramo, and Wooldridge (Eds.), Handbook of Automation, Computation, and Control, vol. 2, Wiley, New York.Google ScholarGoogle Scholar
  38. Lukasiewicz, Jan, (1951), Aristotle's Syllogistic from the Standpoint of Modern Formal Logic, Clarendon Press, Oxford, England, p. 78.Google ScholarGoogle Scholar
  39. Oettinger, A. G., (1961), "Automatic Syntactic Analysis and the Pushdown Store," Proc. Twelfth Symposium in Appl. Math., April 1960, published by American Mathematical Society.Google ScholarGoogle Scholar
  40. Ashenhurst, R. L., (1953), "Sorting and Arranging," Theory of Switching, Report No. BL-7, Harvard Computation Laboratory, Section I.Google ScholarGoogle Scholar
  41. Betz, B. K., and W. C. Carter, (1959) "New Methods of Merge Sorting," 14th A.C.M. Conference, Cambridge, Mass.Google ScholarGoogle Scholar
  42. Carter, W. C., (1962), "Mathematical Analysis of Merge Sorting Techniques," Congress of International Federation of Information Processing Societies, Munich.Google ScholarGoogle Scholar
  43. Cramèr, H., (1951), Mathematical Methods of Statistics, Princeton University Press.Google ScholarGoogle Scholar
  44. Friend, E. H., (1956), "Sorting on Electronic Computer Systems," J.AC.M., vol. 3, pp. 134--168Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Gassner, Betty Jane, (1958), "Proof of a Conjecture Concerning Sorting by Replacement Selecting," unpublished.Google ScholarGoogle Scholar
  46. Gilstad, R. L., (1960), "Polyphase Merge Sorting---An Advanced Technique," Proc. Eastern Joint Computer Conference.Google ScholarGoogle Scholar
  47. Goldstine, H. H., and J. von Neumann, (1948), "Planning and Coding Problems for an Electronic Computing Instrument," Part 2, vol. 2, Institute for Advanced Study, Princeton University Press.Google ScholarGoogle Scholar
  48. Hildebrandt, P., and H. Isbitz, (1959), "Radix Exchange---An Internal Sorting Method for Digital Computers," J.A.C.M., vol. 6, pp. 156--163.Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. Margenau, H., and G. M. Murphy, (1943), The Mathematics of Physics and Chemistry, Van Nostrand, New York.Google ScholarGoogle Scholar
  50. Mauchly, J. W., (1948), "Sorting and Collating," Theory and Techniques for Design of Electronic Digital Computers. Lectures given at the Moore School, July 8-August 31, 1946, vol. III, University of Pennsylvania.Google ScholarGoogle Scholar
  51. McCracken, D. D., H. Weiss, and Tsai-Hwa Lee, (1959), Programming Business Computers, Wiley, New York.Google ScholarGoogle Scholar
  52. Nagler, H., (1959), "Amphisbaenic Sorting," J.A.C.M., vol. 6, pp. 459--468.Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. Woods, F. S., (1926), Advanced Calculus, Ginn & Company, Boston, Mass.Google ScholarGoogle Scholar
  54. Ashenhurst, R. L., (1957), "The Decomposition of Switching Functions," Proc. of an International Symposium on the Theory of Switching, Harvard University, pp. 74--116.Google ScholarGoogle Scholar
  55. Calingaert, P., (1960), "Switching Function Canonical Forms Based on Commutative and Associative Binary Operations," presented at the October meeting of the American Institute of Electrical Engineers.Google ScholarGoogle Scholar
  56. Muller, D. E., (1954), "Application of Boolean Algebra to Switching Circuit Design and to Error Detection," Trans. Institute of Radio Engineers, New York, vol. EC-3, pp. 6--12.Google ScholarGoogle Scholar

Cited By

  1. ACM
    Batz K, Biskup T, Katoen J and Winkler T (2024). Programmatic Strategy Synthesis: Resolving Nondeterminism in Probabilistic Programs, Proceedings of the ACM on Programming Languages, 8:POPL, (2792-2820), Online publication date: 5-Jan-2024.
  2. Olliaro D, Ajmone Marsan M, Balsamo S and Marin A (2023). The saturated Multiserver Job Queuing Model with two classes of jobs, Performance Evaluation, 162:C, Online publication date: 1-Nov-2023.
  3. Huang X and Ma T (2023). On the approximation of Euclidean SL via geometric method, Information Sciences: an International Journal, 648:C, Online publication date: 1-Nov-2023.
  4. ACM
    Fumero J, Rethy G, Stratikopoulos A, Foutris N and Kotselidis C Beehive SPIR-V Toolkit: A Composable and Functional API for Runtime SPIR-V Code Generation Proceedings of the 15th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages, (61-72)
  5. ACM
    Lisper B and Källberg L HERO-ML: A Very High-Level Array Language for Executable Modelling of Data Parallel Algorithms Proceedings of the 9th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (13-21)
  6. ACM
    Ahrens W, Donenfeld D, Kjolstad F and Amarasinghe S Looplets: A Language for Structured Coiteration Proceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization, (41-54)
  7. ACM
    Hoekstra C Combinatory logic and combinators in array languages Proceedings of the 8th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (46-57)
  8. ACM
    Šinkarovs A and Scholz S Parallel scan as a multidimensional array problem Proceedings of the 8th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (1-11)
  9. ACM
    Westrick S, Rainey M, Anderson D and Blelloch G Parallel block-delayed sequences Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, (61-75)
  10. ACM
    Liu A, Bernstein G, Chlipala A and Ragan-Kelley J (2022). Verified tensor-program optimization via high-level scheduling rewrites, Proceedings of the ACM on Programming Languages, 6:POPL, (1-28), Online publication date: 16-Jan-2022.
  11. ACM
    Bangaru S, Michel J, Mu K, Bernstein G, Li T and Ragan-Kelley J (2021). Systematically differentiating parametric discontinuities, ACM Transactions on Graphics, 40:4, (1-18), Online publication date: 31-Aug-2021.
  12. ACM
    Aguirre A, Barthe G, Gaboardi M, Garg D, Katsumata S and Sato T (2021). Higher-order probabilistic adversarial computations: categorical semantics and program logics, Proceedings of the ACM on Programming Languages, 5:ICFP, (1-30), Online publication date: 22-Aug-2021.
  13. ACM
    Paszke A, Johnson D, Duvenaud D, Vytiniotis D, Radul A, Johnson M, Ragan-Kelley J and Maclaurin D (2021). Getting to the point: index sets and parallelism-preserving autodiff for pointful array programming, Proceedings of the ACM on Programming Languages, 5:ICFP, (1-29), Online publication date: 22-Aug-2021.
  14. ACM
    Šinkarovs A, Vießmann H and Scholz S Array languages make neural networks fast Proceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (39-50)
  15. ACM
    Chetioui B, Abusdal O, Haveraaen M, Järvi J and Mullin L Padding in the mathematics of arrays Proceedings of the 7th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (15-26)
  16. ACM
    Batz K, Kaminski B, Katoen J and Matheja C (2021). Relatively complete verification of probabilistic programs: an expressive language for expectation-based reasoning, Proceedings of the ACM on Programming Languages, 5:POPL, (1-30), Online publication date: 4-Jan-2021.
  17. ACM
    Shah S, Zarghami M and Muyan-Özçelik P Accelerating Forward-Backward Sweep Power Flow Computation on the GPU Workshop Proceedings of the 49th International Conference on Parallel Processing, (1-9)
  18. ACM
    Brijder R, Geerts F, Bussche J and Weerwag T (2019). On the Expressive Power of Query Languages for Matrices, ACM Transactions on Database Systems, 44:4, (1-31), Online publication date: 31-Dec-2020.
  19. ACM
    Brijder R, Geerts F, Van den Bussche J and Weerwag T (2019). MATLANG, ACM SIGMOD Record, 48:1, (60-67), Online publication date: 5-Nov-2019.
  20. Gibbons J The School of Squiggol Formal Methods. FM 2019 International Workshops, (35-53)
  21. Addazi L, Ciccozzi F and Lisper B Executable modelling for highly parallel accelerators Proceedings of the 22nd International Conference on Model Driven Engineering Languages and Systems, (318-321)
  22. ACM
    Slepak J, Shivers O and Manolios P Records with rank polymorphism Proceedings of the 6th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (80-92)
  23. ACM
    Rink N and Castrillon J TeIL: a type-safe imperative tensor intermediate language Proceedings of the 6th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (57-68)
  24. ACM
    Chetioui B, Mullin L, Abusdal O, Haveraaen M, Järvi J and Macià S Finite difference methods fengshui: alignment through a mathematics of arrays Proceedings of the 6th ACM SIGPLAN International Workshop on Libraries, Languages and Compilers for Array Programming, (2-13)
  25. Kjolstad F, Ahrens P, Kamil S and Amarasinghe S Tensor algebra compilation with workspaces Proceedings of the 2019 IEEE/ACM International Symposium on Code Generation and Optimization, (180-192)
  26. ACM
    Elsman M, Henriksen T, Annenkov D and Oancea C (2018). Static interpretation of higher-order modules in Futhark: functional GPU programming in the large, Proceedings of the ACM on Programming Languages, 2:ICFP, (1-30), Online publication date: 30-Jul-2018.
  27. ACM
    Slepak J, Manolios P and Shivers O Rank polymorphism viewed as a constraint problem Proceedings of the 5th ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, (34-41)
  28. Heisig M Petalisp: A Common Lisp Library for Data Parallel Programming Proceedings of the 11th European Lisp Symposium on European Lisp Symposium, (4-11)
  29. ACM
    Matsuda M, Fukuda K and Maruyama N A Portability Layer of an All-pairs Operation for Hierarchical N-Body Algorithm Framework Tapas Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region, (241-250)
  30. Shin B, Lee D and Qadir J (2018). An Efficient Local Repair-Based Multi-Constrained Routing for Congestion Control in Wireless Mesh Networks, Wireless Communications & Mobile Computing, 2018, Online publication date: 1-Jan-2018.
  31. ACM
    Nehab D and Maximo A (2016). Parallel recursive filtering of infinite input extensions, ACM Transactions on Graphics, 35:6, (1-13), Online publication date: 11-Nov-2016.
  32. ACM
    Gibbons J APLicative programming with Naperian functors (extended abstract) Proceedings of the 1st International Workshop on Type-Driven Development, (13-14)
  33. ACM
    Henriksen T, Dybdal M, Urms H, Kiehn A, Gavin D, Abelskov H, Elsman M and Oancea C APL on GPUs: a TAIL from the past, scribbled in Futhark Proceedings of the 5th International Workshop on Functional High-Performance Computing, (38-43)
  34. ACM
    Maleki S, Yang A and Burtscher M (2016). Higher-order and tuple-based massively-parallel prefix sums, ACM SIGPLAN Notices, 51:6, (539-552), Online publication date: 1-Aug-2016.
  35. ACM
    Kaler T, Hasenplaugh W, Schardl T and Leiserson C (2016). Executing Dynamic Data-Graph Computations Deterministically Using Chromatic Scheduling, ACM Transactions on Parallel Computing, 3:1, (1-31), Online publication date: 28-Jun-2016.
  36. ACM
    Andreetta C, Bégot V, Berthold J, Elsman M, Henglein F, Henriksen T, Nordfang M and Oancea C (2016). FinPar, ACM Transactions on Architecture and Code Optimization, 13:2, (1-27), Online publication date: 27-Jun-2016.
  37. ACM
    Maleki S, Yang A and Burtscher M Higher-order and tuple-based massively-parallel prefix sums Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, (539-552)
  38. Kuper J, Schubert L, Kempf K, Glass C, Bonilla D and Carro M Program transformations in the POLCA project Proceedings of the 2016 Conference on Design, Automation & Test in Europe, (882-887)
  39. D'Oliveira R and Firer M (2015). The packing radius of a code and partitioning problems, Discrete Mathematics, 338:12, (2143-2167), Online publication date: 6-Dec-2015.
  40. ACM
    Nguyen L and Kay A The cuneiform tablets of 2015 2015 ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), (297-307)
  41. ACM
    Bernecky R and Scholz S Abstract expressionism for parallel performance Proceedings of the 2nd ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, (54-59)
  42. Varando G, Bielza C and Larrañaga P (2015). Decision boundary for discrete Bayesian network classifiers, The Journal of Machine Learning Research, 16:1, (2725-2749), Online publication date: 1-Jan-2015.
  43. Chen J and Edelman A Parallel prefix polymorphism permits parallelization, presentation & proof Proceedings of the 1st First Workshop for High Performance Technical Computing in Dynamic Languages, (47-56)
  44. ACM
    Henriksen T, Elsman M and Oancea C Size slicing Proceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing, (31-42)
  45. ACM
    Penkler D An Array and List Processing System Proceedings of ILC 2014 on 8th International Lisp Conference, (22-30)
  46. ACM
    Kaler T, Hasenplaugh W, Schardl T and Leiserson C Executing dynamic data-graph computations deterministically using chromatic scheduling Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, (154-165)
  47. ACM
    Elsman M and Dybdal M Compiling a Subset of APL Into a Typed Intermediate Language Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, (101-106)
  48. ACM
    Hsu A Co-dfns Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, (62-67)
  49. ACM
    Stojanov A, Ofenbeck G, Rompf T and Püschel M Abstracting Vector Architectures in Library Generators Proceedings of ACM SIGPLAN International Workshop on Libraries, Languages, and Compilers for Array Programming, (14-19)
  50. Slepak J, Shivers O and Manolios P An Array-Oriented Language with Static Rank Polymorphism Proceedings of the 23rd European Symposium on Programming Languages and Systems - Volume 8410, (27-46)
  51. ACM
    Leißa R, Haffner I and Hack S Sierra Proceedings of the 2014 Workshop on Programming models for SIMD/Vector processing, (17-24)
  52. ACM
    Herhut S, Hudson R, Shpeisman T and Sreeram J (2013). River trail, ACM SIGPLAN Notices, 48:10, (729-744), Online publication date: 12-Nov-2013.
  53. ACM
    Würthinger T, Wimmer C, Wöß A, Stadler L, Duboscq G, Humer C, Richards G, Simon D and Wolczko M One VM to rule them all Proceedings of the 2013 ACM international symposium on New ideas, new paradigms, and reflections on programming & software, (187-204)
  54. ACM
    Herhut S, Hudson R, Shpeisman T and Sreeram J River trail Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications, (729-744)
  55. ACM
    Bracha G Does thought crime pay? Proceedings of the 2013 companion publication for conference on Systems, programming, & applications: software for humanity, (7-8)
  56. ACM
    Hackett J, Hutton G and Jaskelioff M The Under-Performing Unfold Proceedings of the 25th symposium on Implementation and Application of Functional Languages, (4321-4332)
  57. ACM
    Leißa R, Hack S and Wald I (2012). Extending a C-like language for portable SIMD programming, ACM SIGPLAN Notices, 47:8, (65-74), Online publication date: 11-Sep-2012.
  58. ACM
    Dershowitz N and Reingold E (2012). Modulo intervals, ACM SIGACT News, 43:3, (60-64), Online publication date: 27-Aug-2012.
  59. Bailes P and Brough L Making sense of recursion patterns Proceedings of the First International Workshop on Formal Methods in Software Engineering: Rigorous and Agile Approaches, (16-22)
  60. ACM
    Leißa R, Hack S and Wald I Extending a C-like language for portable SIMD programming Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming, (65-74)
  61. ACM
    Nehab D, Maximo A, Lima R and Hoppe H GPU-efficient recursive filtering and summed-area tables Proceedings of the 2011 SIGGRAPH Asia Conference, (1-12)
  62. ACM
    Nehab D, Maximo A, Lima R and Hoppe H (2011). GPU-efficient recursive filtering and summed-area tables, ACM Transactions on Graphics, 30:6, (1-12), Online publication date: 1-Dec-2011.
  63. ACM
    McDirmid S Coding at the speed of touch Proceedings of the 10th SIGPLAN symposium on New ideas, new paradigms, and reflections on programming and software, (61-76)
  64. Kaczmarski K and Rudny T MOLAP cube based on parallel scan algorithm Proceedings of the 15th international conference on Advances in databases and information systems, (125-138)
  65. Grelck C Single assignment C (SAC) high productivity meets high performance Proceedings of the 4th Summer School conference on Central European Functional Programming School, (207-278)
  66. Marin A and Bulò S Explicit solutions for queues with hypo-exponential service time and applications to product-form analysis Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, (166-175)
  67. Lameed N and Hendren L Staged static techniques to efficiently implement array copy semantics in a MATLAB JIT compiler Proceedings of the 20th international conference on Compiler construction: part of the joint European conferences on theory and practice of software, (22-41)
  68. ACM
    Nobari S, Lu X, Karras P and Bressan S Fast random graph generation Proceedings of the 14th International Conference on Extending Database Technology, (331-342)
  69. ACM
    Frigo M, Halpern P, Leiserson C and Lewin-Berlin S Reducers and other Cilk++ hyperobjects Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, (79-90)
  70. Trojahner K and Grelck C Descriptor-free representation of arrays with dependent types Proceedings of the 20th international conference on Implementation and application of functional languages, (100-117)
  71. ACM
    Dotsenko Y, Govindaraju N, Sloan P, Boyd C and Manferdelli J Fast scan algorithms on graphics processors Proceedings of the 22nd annual international conference on Supercomputing, (205-213)
  72. ACM
    Cooke D, Rushton J, Nemanich B, Watson R and Andersen P (2008). Normalize, transpose, and distribute, ACM Transactions on Programming Languages and Systems, 30:2, (1-49), Online publication date: 1-Mar-2008.
  73. Duc L, Sidhu A and Chaudhari N (2008). Hierarchical pathfinding and AI-based learning approach in strategy game design, International Journal of Computer Games Technology, 2008, (1-11), Online publication date: 10-Jan-2008.
  74. ACM
    Kromberg M Arrays of objects Proceedings of the 2007 symposium on Dynamic languages, (20-28)
  75. ACM
    Massingill B, Mattson T and Sanders B SIMD Proceedings of the 14th Conference on Pattern Languages of Programs, (1-15)
  76. Sengupta S, Harris M, Zhang Y and Owens J Scan primitives for GPU computing Proceedings of the 22nd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware, (97-106)
  77. ACM
    Chowdhury R and Ramachandran V The cache-oblivious gaussian elimination paradigm Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, (71-80)
  78. ACM
    Iverson K (2007). Notation as a tool of thought, ACM SIGAPL APL Quote Quad, 35:1-2, (2-31), Online publication date: 1-Mar-2007.
  79. ACM
    Grelck C and Scholz S SAC Proceedings of the 2007 workshop on Declarative aspects of multicore programming, (25-33)
  80. ACM
    Iverson K Notation as a tool of thought ACM Turing award lectures
  81. ACM
    Backus J Can programming be liberated from the von Neumann style? ACM Turing award lectures
  82. Liao S Parallelizing user-defined and implicit reductions globally on multiprocessors Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture, (189-202)
  83. Gibbons J Datatype-generic programming Proceedings of the 2006 international conference on Datatype-generic programming, (1-71)
  84. Goldberg M (2005). A Variadic Extension of Curry's Fixed-Point Combinator, Higher-Order and Symbolic Computation, 18:3-4, (371-388), Online publication date: 1-Dec-2005.
  85. ACM
    Weiher M and Ducasse S Higher order messaging Proceedings of the 2005 symposium on Dynamic languages, (23-34)
  86. Grelck C, Hinckfuß K and Scholz S With-Loop fusion for data locality and parallelism Proceedings of the 17th international conference on Implementation and Application of Functional Languages, (178-195)
  87. ACM
    de Almeida P (2004). Typesetting APL dialects, ACM SIGAPL APL Quote Quad, 34:2, (28-31), Online publication date: 1-Mar-2004.
  88. Ruiz S and Ariff A (2004). A basic characteristic of twin primes and its generalization, Smarandache Notions Journal, 14:1, (357-362), Online publication date: 1-Jan-2004.
  89. ACM
    Mougin P and Ducasse S (2003). OOPAL, ACM SIGPLAN Notices, 38:11, (65-77), Online publication date: 26-Nov-2003.
  90. Scholz S (2003). Single Assignment C: efficient support for high-level array operations in a functional setting, Journal of Functional Programming, 13:6, (1005-1059), Online publication date: 1-Nov-2003.
  91. ACM
    Mougin P and Ducasse S OOPAL Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications, (65-77)
  92. ACM
    Deitz S, Chamberlain B, Choi S and Snyder L (2003). The design and implementation of a parallel array operator for the arbitrary remapping of data, ACM SIGPLAN Notices, 38:10, (155-166), Online publication date: 1-Oct-2003.
  93. ACM
    Deitz S, Chamberlain B, Choi S and Snyder L The design and implementation of a parallel array operator for the arbitrary remapping of data Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming, (155-166)
  94. Taylor S Extreme terseness Proceedings of the 4th international conference on Extreme programming and agile processes in software engineering, (334-336)
  95. Stachniak Z (2003). The Making of the MCM/70 Microcomputer, IEEE Annals of the History of Computing, 25:2, (62-75), Online publication date: 1-Apr-2003.
  96. ACM
    Si Y, Edmond D, Hofstede A and Dumas M A model for the configurable composition and synchronization of complex trading activities Proceedings of the 2003 ACM symposium on Applied computing, (595-602)
  97. ACM
    Astrachan O Bubble sort Proceedings of the 34th SIGCSE technical symposium on Computer science education, (1-5)
  98. ACM
    Astrachan O (2003). Bubble sort, ACM SIGCSE Bulletin, 35:1, (1-5), Online publication date: 11-Jan-2003.
  99. ACM
    Cockshott P (2002). Vector pascal reference manual, ACM SIGPLAN Notices, 37:6, (59-81), Online publication date: 2-Jun-2002.
  100. Grelck C Implementing the NAS Benchmark MG in SAC Proceedings of the 16th International Parallel and Distributed Processing Symposium
  101. ACM
    Otto T An APL ompiler Proceedings of the international conference on APL-Berlin-2000 conference, (186-193)
  102. ACM
    Otto T (2000). An APL ompiler, ACM SIGAPL APL Quote Quad, 30:4, (186-193), Online publication date: 1-Jun-2000.
  103. ACM
    Grelck C and Scholz S Accelerating APL programs with SAC Proceedings of the conference on APL '99 : On track to the 21st century: On track to the 21st century, (50-57)
  104. ACM
    Chamberlain B, Lewis E, Lin C and Snyder L Regions Proceedings of the conference on APL '99 : On track to the 21st century: On track to the 21st century, (41-49)
  105. Hutton G (1999). A tutorial on the universality and expressiveness of fold, Journal of Functional Programming, 9:4, (355-372), Online publication date: 1-Jul-1999.
  106. ACM
    Chamberlain B, Lewis E and Snyder L Problem space promotion and its evaluation as a technique for efficient parallel computation Proceedings of the 13th international conference on Supercomputing, (311-318)
  107. ACM
    Scholz S (1998). On defining application-specific high-level array operations by means of shape-invariant programming facilities, ACM SIGAPL APL Quote Quad, 29:3, (32-38), Online publication date: 1-Mar-1999.
  108. ACM
    Grelck C and Scholz S (1998). Accelerating APL programs with SAC, ACM SIGAPL APL Quote Quad, 29:2, (50-57), Online publication date: 1-Dec-1998.
  109. ACM
    Chamberlain B, Lewis E, Lin C and Snyder L (1998). Regions, ACM SIGAPL APL Quote Quad, 29:2, (41-49), Online publication date: 1-Dec-1998.
  110. ACM
    Scholz S On defining application-specific high-level array operations by means of shape-invariant programming facilities Proceedings of the APL98 conference on Array Processing Languages, (32-38)
  111. ACM
    Giloi W (1998). Konrad Zuse, ACM SIGNUM Newsletter, 33:2, (11-16), Online publication date: 1-Apr-1998.
  112. Cooke D (1998). SequenceL provides a different way to view programming, Computer Languages, 24:1, (1-32), Online publication date: 1-Apr-1998.
  113. Cooke D Abstraction, concurrency, and communal computing in SequenceL Proceedings of the 21st International Computer Software and Applications Conference, (188-191)
  114. Giloi W (1997). Konrad Zuse's Plankalkül, IEEE Annals of the History of Computing, 19:2, (17-24), Online publication date: 1-Apr-1997.
  115. Falkenroth E Computational Indexes for Time Series Proceedings of the Eighth International Conference on Scientific and Statistical Database Management, (242-251)
  116. ACM
    Libkin L, Machlin R and Wong L (1996). A query language for multidimensional arrays, ACM SIGMOD Record, 25:2, (228-239), Online publication date: 1-Jun-1996.
  117. ACM
    Libkin L, Machlin R and Wong L A query language for multidimensional arrays Proceedings of the 1996 ACM SIGMOD international conference on Management of data, (228-239)
  118. ACM
    Griswold R and Griswold M History of the Icon programming language History of programming languages---II, (599-624)
  119. ACM
    Steele G and Gabriel R The evolution of Lisp History of programming languages---II, (233-330)
  120. ACM
    McIntyre D (1995). The role of composition in computer programming, ACM SIGAPL APL Quote Quad, 25:4, (116-133), Online publication date: 8-Jun-1995.
  121. ACM
    McIntyre D The role of composition in computer programming Proceedings of the international conference on Applied programming languages, (116-133)
  122. ACM
    Sykes D Culturing objects to achieve efficient implementations and entity interactions in object-oriented programming Proceedings of the 33rd annual on Southeast regional conference, (64-72)
  123. ACM
    Langlet G (1994). The APL theory of human vision, ACM SIGAPL APL Quote Quad, 25:1, (105-121), Online publication date: 1-Oct-1994.
  124. ACM
    Langlet G The APL theory of human vision Proceedings of the international conference on APL : the language and its applications: the language and its applications, (105-121)
  125. ACM
    van Gemund A Compiling performance models from parallel programs Proceedings of the 8th international conference on Supercomputing, (303-312)
  126. ACM
    Redon X and Feautrier P Scheduling reductions Proceedings of the 8th international conference on Supercomputing, (117-125)
  127. ACM
    Cai J and Paige R Towards increased productivity of algorithm implementation Proceedings of the 1st ACM SIGSOFT symposium on Foundations of software engineering, (71-78)
  128. ACM
    Cai J and Paige R (1993). Towards increased productivity of algorithm implementation, ACM SIGSOFT Software Engineering Notes, 18:5, (71-78), Online publication date: 1-Dec-1993.
  129. ACM
    Steinbrook D and McDonnell E (1993). From trees into boxes, ACM SIGAPL APL Quote Quad, 24:1, (267-276), Online publication date: 1-Sep-1993.
  130. ACM
    Bernecky R (1993). The role of APL and J in high-performance computation, ACM SIGAPL APL Quote Quad, 24:1, (17-32), Online publication date: 1-Sep-1993.
  131. ACM
    Steinbrook D and McDonnell E From trees into boxes Proceedings of the international conference on APL, (267-276)
  132. ACM
    Bernecky R The role of APL and J in high-performance computation Proceedings of the international conference on APL, (17-32)
  133. ACM
    Prins J and Palmer D Transforming high-level data-parallel programs into vector operations Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, (119-128)
  134. ACM
    Prins J and Palmer D (1993). Transforming high-level data-parallel programs into vector operations, ACM SIGPLAN Notices, 28:7, (119-128), Online publication date: 1-Jul-1993.
  135. ACM
    Griswold R and Griswold M History of the Icon programming language The second ACM SIGPLAN conference on History of programming languages, (53-68)
  136. ACM
    Chatterjee S, Gilbert J, Schreiber R and Teng S Automatic array alignment in data-parallel programs Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (16-28)
  137. ACM
    Griswold R and Griswold M (1993). History of the Icon programming language, ACM SIGPLAN Notices, 28:3, (53-68), Online publication date: 1-Mar-1993.
  138. Parker D, Simon E and Valduriez P SVP Proceedings of the 18th International Conference on Very Large Data Bases, (115-126)
  139. ACM
    McIntyre D (1991). Mastering J, ACM SIGAPL APL Quote Quad, 21:4, (264-273), Online publication date: 1-Jul-1991.
  140. ACM
    McIntyre D Mastering J Proceedings of the international conference on APL '91, (264-273)
  141. ACM
    Chatterjee S, Blelloch G and Fisher A (1991). Size and access inference for data-parallel programs, ACM SIGPLAN Notices, 26:6, (130-144), Online publication date: 1-Jun-1991.
  142. ACM
    Chatterjee S, Blelloch G and Fisher A Size and access inference for data-parallel programs Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, (130-144)
  143. ACM
    Bernecky R (1991). Fortran 90 arrays, ACM SIGPLAN Notices, 26:2, (83-98), Online publication date: 2-Jan-1991.
  144. Chatterjee S, Blelloch G and Zagha M Scan primitives for vector computers Proceedings of the 1990 ACM/IEEE conference on Supercomputing, (666-675)
  145. ACM
    De Man J (1990). Making languages more powerful by removing limitations, ACM SIGSOFT Software Engineering Notes, 15:4, (18-24), Online publication date: 1-Sep-1990.
  146. ACM
    Fordyce K (1990). A bibliography of APL articles on modeling and KBES, ACM SIGAPL APL Quote Quad, 21:1, (12-18), Online publication date: 1-Sep-1990.
  147. ACM
    Anderson S and Hudak P (1990). Compilation of Haskell array comprehensions for scientific computing, ACM SIGPLAN Notices, 25:6, (137-149), Online publication date: 1-Jun-1990.
  148. ACM
    Anderson S and Hudak P Compilation of Haskell array comprehensions for scientific computing Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, (137-149)
  149. ACM
    De Man J Making languages more powerful by removing limitations Conference proceedings on Formal methods in software development, (18-24)
  150. Blelloch G (1989). Scans as Primitive Parallel Operations, IEEE Transactions on Computers, 38:11, (1526-1538), Online publication date: 1-Nov-1989.
  151. ACM
    Agrawal A, Blelloch G, Krawitz R and Phillips C Four vector-matrix primitives Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, (292-302)
  152. ACM
    Furtado A (1988). Towards functional programming in Prolog, ACM SIGPLAN Notices, 23:3, (43-52), Online publication date: 1-Mar-1988.
  153. ACM
    Chen M, Choo Y and Li J Crystal: from functional description to efficient parallel code Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1, (417-433)
  154. ACM
    Rys M Scope and access classes in APL Proceedings of the international conference on APL, (278-282)
  155. ACM
    Rys M (1987). Scope and access classes in APL, ACM SIGAPL APL Quote Quad, 18:2, (278-282), Online publication date: 1-Dec-1987.
  156. ACM
    Robison A (1987). The Illinois functional programming interpreter, ACM SIGPLAN Notices, 22:7, (64-73), Online publication date: 1-Jul-1987.
  157. ACM
    Robison A The Illinois functional programming interpreter Papers of the Symposium on Interpreters and interpretive techniques, (64-73)
  158. ACM
    Benkard J (1987). Replicate each, anyone?, ACM SIGAPL APL Quote Quad, 17:4, (245-252), Online publication date: 1-May-1987.
  159. ACM
    Iverson K (1987). APL87, ACM SIGAPL APL Quote Quad, 17:4, (64-68), Online publication date: 1-May-1987.
  160. ACM
    Amer K (1987). A computerized test for conformance to the APL standard, ACM SIGAPL APL Quote Quad, 17:3, (4-22), Online publication date: 1-Mar-1987.
  161. ACM
    Benkard J Replicate each, anyone? Proceedings of the international conference on APL: APL in transition, (245-252)
  162. ACM
    Iverson K APL87 Proceedings of the international conference on APL: APL in transition, (64-68)
  163. ACM
    Hillis W and Steele G (1986). Data parallel algorithms, Communications of the ACM, 29:12, (1170-1183), Online publication date: 1-Dec-1986.
  164. ACM
    Steele G and Hillis W Connection Machine Lisp Proceedings of the 1986 ACM conference on LISP and functional programming, (279-297)
  165. ACM
    Berry P Integrating ordinary type and many languages with the APL alphabet and keyboard Proceedings of the international conference on APL: APL and the future, (68-76)
  166. ACM
    Wells M (1986). A potpourri of notational pet peeves (and their resolution in modcap), ACM SIGPLAN Notices, 21:3, (21-30), Online publication date: 1-Mar-1986.
  167. ACM
    Berry P (1985). Integrating ordinary type and many languages with the APL alphabet and keyboard, ACM SIGAPL APL Quote Quad, 15:4, (68-76), Online publication date: 12-May-1985.
  168. ACM
    Iverson K, Pesch R and Schueler J An operator calculus Proceedings of the international conference on APL, (213-218)
  169. ACM
    Benkard J Syntactic experiments with arrays of functions and operators Proceedings of the international conference on APL, (41-51)
  170. ACM
    Iverson K, Pesch R and Schueler J (1984). An operator calculus, ACM SIGAPL APL Quote Quad, 14:4, (213-218), Online publication date: 1-Jun-1984.
  171. ACM
    Benkard J (1984). Syntactic experiments with arrays of functions and operators, ACM SIGAPL APL Quote Quad, 14:4, (41-51), Online publication date: 1-Jun-1984.
  172. Pitchumani V and Stabler E (1983). An Inductive Assertion Method for Register Transfer Level Design Verification, IEEE Transactions on Computers, 32:12, (1073-1080), Online publication date: 1-Dec-1983.
  173. ACM
    Wagner R (1983). The Boolean Vector Machine [BVM], ACM SIGARCH Computer Architecture News, 11:3, (59-66), Online publication date: 30-Jun-1983.
  174. ACM
    Cormack G Extensions to static scoping Proceedings of the 1983 ACM SIGPLAN symposium on Programming language issues in software systems, (187-191)
  175. ACM
    Wagner R The Boolean Vector Machine [BVM] Proceedings of the 10th annual international symposium on Computer architecture, (59-66)
  176. ACM
    Cormack G (1983). Extensions to static scoping, ACM SIGPLAN Notices, 18:6, (187-191), Online publication date: 1-Jun-1983.
  177. ACM
    Touretzky D A comparison of reduction in APL with polyarity in LISP Proceedings of the international conference on APL, (259-263)
  178. ACM
    Iverson K APL syntax and semantics Proceedings of the international conference on APL, (223-231)
  179. ACM
    Touretzky D (1983). A comparison of reduction in APL with polyarity in LISP, ACM SIGAPL APL Quote Quad, 13:3, (259-263), Online publication date: 1-Mar-1983.
  180. ACM
    Iverson K (1983). APL syntax and semantics, ACM SIGAPL APL Quote Quad, 13:3, (223-231), Online publication date: 1-Mar-1983.
  181. ACM
    Sussenguth E (1983). Use of tree structures for processing files, Communications of the ACM, 26:1, (17-20), Online publication date: 1-Jan-1983.
  182. ACM
    Ruehr K (1982). A survey of extensions to APL, ACM SIGAPL APL Quote Quad, 13:1, (277-314), Online publication date: 1-Sep-1982.
  183. ACM
    Brocklebank D (1982). APLNET, a local computer network, ACM SIGAPL APL Quote Quad, 13:1, (61-66), Online publication date: 1-Sep-1982.
  184. ACM
    Ruehr K A survey of extensions to APL Proceedings of the international conference on APL, (277-314)
  185. ACM
    Brocklebank D APLNET, a local computer network Proceedings of the international conference on APL, (61-66)
  186. ACM
    Moor I An applicative compiler for a parallel machine Proceedings of the 1982 SIGPLAN symposium on Compiler construction, (284-293)
  187. ACM
    Moor I (1982). An applicative compiler for a parallel machine, ACM SIGPLAN Notices, 17:6, (284-293), Online publication date: 1-Jun-1982.
  188. Lincoln N (1982). Technology and Design Tradeoffs in the Creation of a Modern Supercomputer, IEEE Transactions on Computers, 31:5, (349-362), Online publication date: 1-May-1982.
  189. Pitchumani V and Stabler E A formal method for computer design verification Proceedings of the 19th Design Automation Conference, (809-814)
  190. ACM
    Pesch R Indexing and indexed replacement in APL Proceedings of the international conference on APL, (258-261)
  191. ACM
    Pesch R (1981). Indexing and indexed replacement in APL, ACM SIGAPL APL Quote Quad, 12:1, (258-261), Online publication date: 1-Sep-1981.
  192. ACM
    Hankin C and Glaser H (1981). The data flow programming language CAJOLE - an informal introduction, ACM SIGPLAN Notices, 16:7, (35-44), Online publication date: 1-Jul-1981.
  193. Baba T and Hagiwara H (1981). The MPG System, IEEE Transactions on Computers, 30:6, (373-395), Online publication date: 1-Jun-1981.
  194. ACM
    Lowney P Carrier arrays Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (1-13)
  195. ACM
    Burstall R, MacQueen D and Sannella D HOPE Proceedings of the 1980 ACM conference on LISP and functional programming, (136-143)
  196. ACM
    Iverson K (1980). Notation as a tool of thought, Communications of the ACM, 23:8, (444-465), Online publication date: 1-Aug-1980.
  197. ACM
    Ormancioglu L An information base for procedure independent design of information systems Proceedings of the May 19-22, 1980, national computer conference, (817-821)
  198. ACM
    Porter G (1980). Aplanar, two-dimensional geometry in APL, ACM SIGAPL APL Quote Quad, 10:3, (11-17), Online publication date: 1-Mar-1980.
  199. ACM
    Holmes W (1980). Of noughts and if's and matrices, ACM SIGAPL APL Quote Quad, 10:3, (7-11), Online publication date: 1-Mar-1980.
  200. ACM
    Moffat D (1980). An ASL dictionary in APL, ACM SIGLASH Newsletter, 13:1, (2-20), Online publication date: 1-Mar-1980.
  201. ACM
    Wright W An empirical evaluation of algorithms for dynamically maintaining binary search trees Proceedings of the ACM 1980 annual conference, (505-515)
  202. ACM
    Martin J FAD, a functional programming language that supports abstract data types Proceedings of the ACM 1980 annual conference, (247-262)
  203. ACM
    MacLennan B (1979). Observations on the differences between formulas and sentences and their application to programming language design, ACM SIGPLAN Notices, 14:7, (51-61), Online publication date: 1-Jul-1979.
  204. ACM
    Foster G (1979). On the locus of program flow within and among secondary functions, ACM SIGAPL APL Quote Quad, 9:4-P1, (333-339), Online publication date: 1-Jun-1979.
  205. ACM
    Lathwell R (1979). Some implications of APL order-of-execution rules, ACM SIGAPL APL Quote Quad, 9:4-P1, (329-332), Online publication date: 1-Jun-1979.
  206. ACM
    Breidbart S (1979). APL and the Grzegorczyk hierarchy, ACM SIGAPL APL Quote Quad, 9:4-P1, (271-273), Online publication date: 1-Jun-1979.
  207. ACM
    Iverson K (1979). The role of operators in APL, ACM SIGAPL APL Quote Quad, 9:4-P1, (128-133), Online publication date: 1-Jun-1979.
  208. ACM
    Pierre M and Pierre P (1979). GESOP, ACM SIGAPL APL Quote Quad, 9:4-P1, (102-109), Online publication date: 1-Jun-1979.
  209. ACM
    More T (1979). The nested rectangular array as a model of data, ACM SIGAPL APL Quote Quad, 9:4-P1, (55-73), Online publication date: 1-Jun-1979.
  210. ACM
    McDonnell E (1979). Fuzzy residue, ACM SIGAPL APL Quote Quad, 9:4-P1, (42-46), Online publication date: 1-Jun-1979.
  211. ACM
    Foster G On the locus of program flow within and among secondary functions Proceedings of the international conference on APL: part 1, (333-339)
  212. ACM
    Breidbart S APL and the Grzegorczyk hierarchy Proceedings of the international conference on APL: part 1, (271-273)
  213. ACM
    Iverson K The role of operators in APL Proceedings of the international conference on APL: part 1, (128-133)
  214. ACM
    Pierre M and Pierre P GESOP Proceedings of the international conference on APL: part 1, (102-109)
  215. ACM
    More T The nested rectangular array as a model of data Proceedings of the international conference on APL: part 1, (55-73)
  216. ACM
    McDonnell E Fuzzy residue Proceedings of the international conference on APL: part 1, (42-46)
  217. ACM
    Gull W and Jenkins M (1979). Recursive data structures in APL, Communications of the ACM, 22:2, (79-96), Online publication date: 1-Feb-1979.
  218. ACM
    Rau B (1978). Levels of representation of programs and the architecture of universal host machines, ACM SIGMICRO Newsletter, 9:4, (67-79), Online publication date: 1-Dec-1978.
  219. Rau B Levels of representation of programs and the architecture of universal host machines Proceedings of the 11th annual workshop on Microprogramming, (67-79)
  220. ACM
    Falkoff A and Iverson K (1978). The evolution of APL, ACM SIGAPL APL Quote Quad, 9:1, (30-44), Online publication date: 1-Sep-1978.
  221. ACM
    Falkoff A and Iverson K (1978). The evolution of APL, ACM SIGPLAN Notices, 13:8, (47-57), Online publication date: 1-Aug-1978.
  222. ACM
    Backus J (1978). Can programming be liberated from the von Neumann style?, Communications of the ACM, 21:8, (613-641), Online publication date: 1-Aug-1978.
  223. ACM
    Falkoff A and Iverson K The evolution of APL History of programming languages, (661-674)
  224. ACM
    Giloi W and Berg H Data structure architectures - a major operational principle Proceedings of the 5th annual symposium on Computer architecture, (175-181)
  225. ACM
    Middleton T (1978). A language for regular operations in graphics, ACM SIGGRAPH Computer Graphics, 11:4, (39-57), Online publication date: 1-Mar-1978.
  226. Atkins D A suggested approach to computer arithmetic for designers of multi-valued logic processors Proceedings of the eighth international symposium on Multiple-valued logic, (33-46)
  227. ACM
    Williams M Yet another conversational programming language - BPL Proceedings of the 1978 annual conference - Volume 2, (516-521)
  228. Wegner P (1976). Programming Languages The First 25 Years, IEEE Transactions on Computers, 25:12, (1207-1225), Online publication date: 1-Dec-1976.
  229. Patterson D (1976). Strum, IEEE Transactions on Computers, 25:10, (974-985), Online publication date: 1-Oct-1976.
  230. ACM
    Schober F and Spielberg K APL Econometric Planning Language (EPLAN) Proceedings of the eighth international conference on APL, (359-387)
  231. ACM
    Ganapathy I and Hobson R GPMS, a general purpose memory management system—user's memory—that is. Proceedings of the eighth international conference on APL, (155-165)
  232. ACM
    Peelle H (1976). Encoding gray codes in APL, ACM SIGAPL APL Quote Quad, 7:3, (17-24), Online publication date: 1-Sep-1976.
  233. ACM
    Kaplow R and Molnar M (1976). A computer-terminal, hardware/software system with enhanced user input capabilities, ACM SIGGRAPH Computer Graphics, 10:2, (116-124), Online publication date: 1-Aug-1976.
  234. ACM
    Kaplow R and Molnar M A computer-terminal, hardware/software system with enhanced user input capabilities Proceedings of the 3rd annual conference on Computer graphics and interactive techniques, (116-124)
  235. ACM
    Mavaddat F (1976). An experiment in teaching programming languages, ACM SIGCSE Bulletin, 8:2, (45-59), Online publication date: 1-Jun-1976.
  236. ACM
    Cohen D and Liu M (1976). Bridging the gap between principles and practices in microprogramming, ACM SIGMICRO Newsletter, 7:2, (43-60), Online publication date: 1-Jun-1976.
  237. ACM
    Peelle H (1976). Learning mathematics with recursive computer programs, ACM SIGCUE Outlook, 10:SI, (116-130), Online publication date: 1-Feb-1976.
  238. ACM
    Peelle H (1976). Learning mathematics with recursive computer programs, ACM SIGCSE Bulletin, 8:1, (116-130), Online publication date: 1-Feb-1976.
  239. ACM
    Peelle H Learning mathematics with recursive computer programs Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education, (116-130)
  240. ACM
    Thomasian A and Avizienis A A design study of a shared resource computing system Proceedings of the 3rd annual symposium on Computer architecture, (105-112)
  241. ACM
    Moalla M, Saucier G, Sifakis J and Zachariades M A design tool for the multilevel description and simulation of systems of interconnected modules Proceedings of the 3rd annual symposium on Computer architecture, (20-27)
  242. ACM
    Thomasian A and Avizienis A (1976). A design study of a shared resource computing system, ACM SIGARCH Computer Architecture News, 4:4, (105-112), Online publication date: 17-Jan-1976.
  243. ACM
    Moalla M, Saucier G, Sifakis J and Zachariades M (1976). A design tool for the multilevel description and simulation of systems of interconnected modules, ACM SIGARCH Computer Architecture News, 4:4, (20-27), Online publication date: 17-Jan-1976.
  244. ACM
    Wegbreit B Goal-directed program transformation Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, (153-170)
  245. ACM
    Fisher D (1975). Simulators and assemblers for minicomputers, ACM SIGSIM Simulation Digest, 7:1, (31-34), Online publication date: 1-Oct-1975.
  246. ACM
    Patterson D The design of a system for the synthesis of correct microprograms Proceedings of the 8th annual workshop on Microprogramming, (13-17)
  247. Fisher D Simulators and assemblers for minicomputers Proceedings of the 3rd symposium on Simulation of computer systems, (55-59)
  248. ACM
    Shastry S A generalized APL shared variable system Proceedings of seventh international conference on APL, (306-312)
  249. ACM
    Andronico A, Leoni G and Luciani E A portable APL translator Proceedings of seventh international conference on APL, (20-25)
  250. ACM
    Abrams P What's wrong with APL? Proceedings of seventh international conference on APL, (1-8)
  251. ACM
    Falkoff A and Iverson K (1975). The design of APL, ACM SIGAPL APL Quote Quad, 6:1, (5-14), Online publication date: 1-Apr-1975.
  252. ACM
    Donegan M and Kartzke S (1975). Lexical analysis and parsing techniques for a vector machine, ACM SIGPLAN Notices, 10:3, (138-145), Online publication date: 1-Mar-1975.
  253. ACM
    Zwakenberg R (1975). Vector extensions to LRLTRAN, ACM SIGPLAN Notices, 10:3, (77-86), Online publication date: 1-Mar-1975.
  254. ACM
    Basili V and Knight J (1975). A language design for vector machines, ACM SIGPLAN Notices, 10:3, (39-43), Online publication date: 1-Mar-1975.
  255. Barbacci M (1975). A Comparison of Register Transfer Languages for Describing Computers and Digital Systems, IEEE Transactions on Computers, 24:2, (137-150), Online publication date: 1-Feb-1975.
  256. ACM
    Elliott P and Peelle H (1975). Computer augmented teacher training, ACM SIGCUE Outlook, 9:SI, (19-30), Online publication date: 1-Jan-1975.
  257. ACM
    Donegan M and Kartzke S Lexical analysis and parsing techniques for a vector machine Proceedings of the conference on Programming languages and compilers for parallel and vector machines, (138-145)
  258. ACM
    Zwakenberg R Vector extensions to LRLTRAN Proceedings of the conference on Programming languages and compilers for parallel and vector machines, (77-86)
  259. ACM
    Basili V and Knight J A language design for vector machines Proceedings of the conference on Programming languages and compilers for parallel and vector machines, (39-43)
  260. ACM
    Mallett P and Lewis T Approaches to design of high level languages for microprogramming Conference record of the 7th annual workshop on Microprogramming, (66-73)
  261. ACM
    Giloi W and Encarnacao J APLG-An APL based system for interactive computer graphics Proceedings of the May 6-10, 1974, national computer conference and exposition, (521-528)
  262. ACM
    Purcell C The control data STAR-100 Proceedings of the May 6-10, 1974, national computer conference and exposition, (385-387)
  263. ACM
    Levy S, Doyle R and Heller R APL as a development tool for special-purpose processors Proceedings of the May 6-10, 1974, national computer conference and exposition, (279-284)
  264. ACM
    Goldsmith C (1974). The design of a procedureless programming language, ACM SIGPLAN Notices, 9:4, (13-24), Online publication date: 1-Apr-1974.
  265. ACM
    Goldsmith C The design of a procedureless programming language Proceedings of the ACM SIGPLAN symposium on Very high level languages, (13-24)
  266. ACM
    Folinus J, Madnick S and Schutzman H (1974). Virtual information in data-base systems, ACM SIGMOD Record, 6:2, (1-15), Online publication date: 1-Mar-1974.
  267. ACM
    Konstam A and Howland J (1974). APL as a lingua franca in the computer science curriculum, ACM SIGCSE Bulletin, 6:1, (21-27), Online publication date: 1-Feb-1974.
  268. ACM
    D'Dell M and Thompson J APL\XAD Proceedings of the sixth international conference on APL, (405-413)
  269. ACM
    Juran W, Moore C, Orndorff C and Rice L The PCS APL shared file system Proceedings of the sixth international conference on APL, (354-363)
  270. ACM
    Grant C, Greenberg M and Redell D A computer system providing microcoded APL Proceedings of the sixth international conference on APL, (173-179)
  271. ACM
    Crayton J APL unary matrix operators as represented by the eighth order Dihedral group Proceedings of the sixth international conference on APL, (112-116)
  272. ACM
    Konstam A and Howland J APL as a lingua franca in the computer science curriculum Proceedings of the fourth SIGCSE technical symposium on Computer science education, (21-27)
  273. ACM
    Noonan R Dynamic algebra Proceedings of the 1974 annual conference - Volume 1, (326-334)
  274. ACM
    Lipovski G (1973). A varistructured fail-soft cellular computer, ACM SIGARCH Computer Architecture News, 2:4, (161-165), Online publication date: 17-Dec-1973.
  275. ACM
    Omohundro W and Tracey J (1973). Flowware—a flow charting procedure to describe digital networks, ACM SIGARCH Computer Architecture News, 2:4, (91-97), Online publication date: 17-Dec-1973.
  276. ACM
    Jordan H and Smith B (1973). Structure of digital system description languages, ACM SIGARCH Computer Architecture News, 2:4, (31-34), Online publication date: 17-Dec-1973.
  277. ACM
    Lipovski G A varistructured fail-soft cellular computer Proceedings of the 1st annual symposium on Computer architecture, (161-165)
  278. ACM
    Omohundro W and Tracey J Flowware—a flow charting procedure to describe digital networks Proceedings of the 1st annual symposium on Computer architecture, (91-97)
  279. ACM
    Jordan H and Smith B Structure of digital system description languages Proceedings of the 1st annual symposium on Computer architecture, (31-34)
  280. ACM
    Couger J (1973). Curriculum recommendations for undergraduate programs in information systems, Communications of the ACM, 16:12, (727-749), Online publication date: 1-Dec-1973.
  281. ACM
    Schutte L A report on the value of some advanced high level language operators on current sequential computers Proceedings of a symposium on High-level-language computer architecture, (117-123)
  282. ACM
    Schutte L A report on the value of some advanced high level language operators on current sequential computers Proceedings of the ACM-IEEE symposium on High-level-language computer architecture, (117-123)
  283. ACM
    Schutte L (1973). A report on the value of some advanced high level language operators on current sequential computers, ACM SIGPLAN Notices, 8:11, (117-123), Online publication date: 1-Nov-1973.
  284. ACM
    Zosel M A parallel approach to compilation Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (59-70)
  285. ACM
    Noguez G Design of a microprogramming language Conference record of the 6th annual workshop on Microprogramming, (145-155)
  286. ACM
    Hassitt A, Lageschulte J and Lyon L (1973). Implementation of a high level language machine, Communications of the ACM, 16:4, (199-212), Online publication date: 1-Apr-1973.
  287. ACM
    Engel G (1973). A computer science course program for small colleges, Communications of the ACM, 16:3, (139-147), Online publication date: 1-Mar-1973.
  288. ACM
    Teichroew D A survey of languages for stating requirements for computer-based information systems Proceedings of the December 5-7, 1972, fall joint computer conference, part II, (1203-1224)
  289. ACM
    Bauer W and Rosenberg A Software Proceedings of the December 5-7, 1972, fall joint computer conference, part II, (993-1007)
  290. ACM
    Bayer R and Witzgall C (1972). Index ranges for matrix calculi, Communications of the ACM, 15:12, (1033-1039), Online publication date: 1-Dec-1972.
  291. ACM
    Phillips J and Adams H (1972). Dynamic partitioning for array languages, Communications of the ACM, 15:12, (1023-1032), Online publication date: 1-Dec-1972.
  292. ACM
    Fisher D (1972). A survey of control structures in programming languages, ACM SIGPLAN Notices, 7:11, (1-13), Online publication date: 1-Nov-1972.
  293. ACM
    Peterson T and Shields R Computer-aided schema for instructional gaming Proceedings of the ACM annual conference - Volume 1, (330-343)
  294. ACM
    Rosen S (1972). Programming systems and languages 1965-1975, Communications of the ACM, 15:7, (591-600), Online publication date: 1-Jul-1972.
  295. ACM
    Ashenhurst R (1972). Curriculum recommendations for graduate professional programs in information systems, Communications of the ACM, 15:5, (363-398), Online publication date: 1-May-1972.
  296. ACM
    Austing R and Engel G Computer science education in small colleges - a report with recommendations Proceedings of the annual ACM SIGUCCS symposium on The administration and management of small-college computing centers, (62-71)
  297. ACM
    Charmonman S and Bell J A PL/1 batch processor for APL Proceedings of the fourth international conference on APL, (123-134)
  298. ACM
    Rault J and Demars G Is APL epidemic? or a study of its growth through an extended bibliography Proceedings of the fourth international conference on APL, (1-21)
  299. ACM
    Boudreau P and Steen R Cyclic redundancy checking by program Proceedings of the November 16-18, 1971, fall joint computer conference, (9-15)
  300. ACM
    Bingham H Use of APL in microprogrammable machine modeling Proceedings of the SIGPLAN symposium on Languages for system implementation, (105-109)
  301. ACM
    Bingham H (1971). Use of APL in microprogrammable machine modeling, ACM SIGPLAN Notices, 6:9, (105-109), Online publication date: 1-Oct-1971.
  302. ACM
    Katzan H (1971). Representation and manipulation of data structures in APL, ACM SIGPLAN Notices, 6:2, (366-397), Online publication date: 1-Feb-1971.
  303. ACM
    Lipovski G (1971). On data structures in associative memories, ACM SIGPLAN Notices, 6:2, (346-365), Online publication date: 1-Feb-1971.
  304. ACM
    Johnson D and Mihal W The computerized statesman Proceedings of the 1971 26th annual conference, (156-168)
  305. ACM
    Black N (1970). Optimum merging from mass storage, Communications of the ACM, 13:12, (745-749), Online publication date: 1-Dec-1970.
  306. Stabler E (1970). System Description Languages, IEEE Transactions on Computers, 19:12, (1160-1173), Online publication date: 1-Dec-1970.
  307. ACM
    McFarland C A language-oriented computer design Proceedings of the November 17-19, 1970, fall joint computer conference, (629-640)
  308. ACM
    Lincoln N (1970). Parallel programming techniques for compilers, ACM SIGPLAN Notices, 5:10, (18-31), Online publication date: 1-Oct-1970.
  309. Stabler E (1970). Microprogram Transformations, IEEE Transactions on Computers, 19:10, (908-916), Online publication date: 1-Oct-1970.
  310. Berndt H (1970). Functional Microprogramming as a Logic Design Aid, IEEE Transactions on Computers, 19:10, (902-907), Online publication date: 1-Oct-1970.
  311. ACM
    Charmonman S (1970). Sixty-character representation of APL symbols, ACM SIGPLAN Notices, 5:9, (29-34), Online publication date: 1-Sep-1970.
  312. ACM
    Friedman T and Yang S Quality of designs from an automatic logic generator (ALERT) Proceedings of the 7th Design Automation Workshop, (71-89)
  313. ACM
    Lipovski G The architecture of a large associative processor Proceedings of the May 5-7, 1970, spring joint computer conference, (385-396)
  314. ACM
    Potts G Natural language inquiry to an open-ended data library Proceedings of the May 5-7, 1970, spring joint computer conference, (333-342)
  315. ACM
    Bayer R and Witzgall C (1970). Some complete calculi for matrices, Communications of the ACM, 13:4, (223-237), Online publication date: 1-Apr-1970.
  316. Thurber K and Myrna J (1970). System Design of a Cellular APL Computer, IEEE Transactions on Computers, 19:4, (291-303), Online publication date: 1-Apr-1970.
  317. Mukhopadhyay A and Schmitz G (1970). Minimization of Exclusive or and Logical Equivalence Switching Circuits, IEEE Transactions on Computers, 19:2, (132-140), Online publication date: 1-Feb-1970.
  318. ACM
    Charmonman S (1970). Sixty-character representation of APL symbols, ACM SIGPLAN Notices, 5:1-2, (28-31), Online publication date: 1-Jan-1970.
  319. Grelck C Single Assignment C (SAC) Central European Functional Programming School, (207-282)
  320. Minnick R (1969). B69-1 Digital Computer System Principles, IEEE Transactions on Computers, 18:12, (1146-1146), Online publication date: 1-Dec-1969.
  321. Friedman T and Sih-Chin Yang (1969). Methods Used in an Automatic Logic Design Generator (ALERT), IEEE Transactions on Computers, 18:7, (593-614), Online publication date: 1-Jul-1969.
  322. ACM
    Metzger R Computer generated graphic segments in a raster display Proceedings of the May 14-16, 1969, spring joint computer conference, (161-172)
  323. ACM
    Abel N, Budnik P, Kuck D, Muraoka Y, Northcote R and Wilhelmson R TRANQUIL Proceedings of the May 14-16, 1969, spring joint computer conference, (57-73)
  324. ACM
    Katzan H Batch, conversational, and incremental compilers Proceedings of the May 14-16, 1969, spring joint computer conference, (47-56)
  325. Hall C and Kahne S (1969). Automated Scaling for Hybrid Computers, IEEE Transactions on Computers, 18:5, (416-423), Online publication date: 1-May-1969.
  326. ACM
    McKellar A and Coffman E (1969). Organizing matrices and matrix operations for paged memory systems, Communications of the ACM, 12:3, (153-165), Online publication date: 1-Mar-1969.
  327. ACM
    Salton G (1969). Information science in a Ph.D. computer science program, Communications of the ACM, 12:2, (111-117), Online publication date: 1-Feb-1969.
  328. ACM
    Arden B (1969). The role of programming in a Ph.D. computer science program, Communications of the ACM, 12:1, (31-37), Online publication date: 1-Jan-1969.
  329. ACM
    Darringer J A language for the description of digital computer processors Proceedings of the 5th annual Design Automation Workshop, (15.1-15.18)
  330. ACM
    Bayes A (1968). A generalized partial pass block sort, Communications of the ACM, 11:7, (491-492), Online publication date: 1-Jul-1968.
  331. ACM
    Atchison W, Conte S, Hamblen J, Hull T, Keenan T, Kehl W, McCluskey E, Navarro S, Rheinboldt W, Schweppe E, Viavant W and Young D (1968). Curriculum 68: Recommendations for academic programs in computer science, Communications of the ACM, 11:3, (151-197), Online publication date: 1-Mar-1968.
  332. ACM
    Gotlieb C and Corneil D (1967). Algorithms for finding a fundamental set of cycles for an undirected linear graph, Communications of the ACM, 10:12, (780-783), Online publication date: 1-Dec-1967.
  333. ACM
    Senzig D Observations on high-performance machines Proceedings of the November 14-16, 1967, fall joint computer conference, (791-799)
  334. ACM
    Seitz R, Wood L and Ely C AMTRAN Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium, (44-66)
  335. ACM
    Falkoff A and Iverson K The APL\360 terminal system Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium, (22-37)
  336. ACM
    Klerer M Interactive programming and automated mathematics Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium, (3-10)
  337. ACM
    Halstead M, Uber G and Gielow K An algorithmic search procedure for program generation Proceedings of the April 18-20, 1967, spring joint computer conference, (657-662)
  338. ACM
    Forsythe G (1967). A university's educational program in computer science, Communications of the ACM, 10:1, (3-11), Online publication date: 1-Jan-1967.
  339. ACM
    Mandell R and Estrin G A meta-compiler as a design automation tool Proceedings of the SHARE design automation project, (13.1-13.40)
  340. ACM
    Brown J Change control in automated design Proceedings of the SHARE design automation project, (3.1-3.23)
  341. ACM
    Senzig D and Smith R Computer organization for array processing Proceedings of the November 30--December 1, 1965, fall joint computer conference, part I, (117-128)
  342. ACM
    Rosen S, Spurgeon R and Donnelly J (1965). PUFFT—The Purdue University fast FORTRAN translator, Communications of the ACM, 8:11, (661-666), Online publication date: 1-Nov-1965.
  343. ACM
    Chu Y (1965). An ALGOL-like computer design language, Communications of the ACM, 8:10, (607-615), Online publication date: 1-Oct-1965.
  344. ACM
    Conte S, Hamblen J, Kehl W, Navarro S, Rheinboldt W, Young D and Atchinson W (1965). An undergraduate program in computer science—preliminary recommendations, Communications of the ACM, 8:9, (543-552), Online publication date: 1-Sep-1965.
  345. ACM
    Foster C Information retrieval Proceedings of the 1965 20th national conference, (192-205)
  346. Tabory R and Zarnfaller F Specifications for a tree processing language Proceedings of the 1965 conference on Computational linguistics, (1-26)
  347. ACM
    Falkoff A Formal description of processes—the first step in design automation Proceedings of the SHARE design automation project, (5.1-5.12)
  348. ACM
    Mandell R and Estrin G Specifications for a design automation system Proceedings of the SHARE design automation project, (3.1-3.15)
  349. ACM
    Ramamoorthy C (1965). Code structures for protection and manipulation of variable-length items, Communications of the ACM, 8:1, (35-38), Online publication date: 1-Jan-1965.
  350. ACM
    Radin G and Rogoway H (1965). NPL, Communications of the ACM, 8:1, (9-17), Online publication date: 1-Jan-1965.
  351. ACM
    Kinslow H The time-sharing monitor system Proceedings of the October 27-29, 1964, fall joint computer conference, part I, (443-454)
  352. ACM
    Brian W (1964). A parts breakdown technique using list structures, Communications of the ACM, 7:6, (362-365), Online publication date: 1-Jun-1964.
  353. ACM
    Keller J, Strum E and Yang G Remote computing--an experimental system Proceedings of the April 21-23, 1964, spring joint computer conference, (425-443)
  354. ACM
    Gorn S (1964). Mechanical languages, Communications of the ACM, 7:4, (219-222), Online publication date: 1-Apr-1964.
  355. ACM
    Keenan T (1964). Computers and education, Communications of the ACM, 7:4, (205-209), Online publication date: 1-Apr-1964.
  356. ACM
    Brooker R (1964). A programming package for some general modes of arithmetic, Communications of the ACM, 7:2, (119-127), Online publication date: 1-Feb-1964.
  357. ACM
    Iverson K (1964). Formalism in programming languages, Communications of the ACM, 7:2, (80-88), Online publication date: 1-Feb-1964.
  358. ACM
    Carlson C The mechanization of a push-down stack Proceedings of the November 12-14, 1963, fall joint computer conference, (243-250)
  359. ACM
    Bock R An interrupt control for the B5000 data processor system Proceedings of the November 12-14, 1963, fall joint computer conference, (229-241)
  360. ACM
    Sussenguth E (1963). Use of tree structures for processing files, Communications of the ACM, 6:5, (272-279), Online publication date: 1-May-1963.
  361. ACM
    Goetz M and Toth G (1963). A comparison between the polyphase and oscillating sort techniques, Communications of the ACM, 6:5, (223-225), Online publication date: 1-May-1963.
  362. ACM
    Goetz M (1963). Internal and tape sorting using the replacement-selection technique, Communications of the ACM, 6:5, (201-206), Online publication date: 1-May-1963.
  363. ACM
    Iverson K A common language for hardware, software, and applications Proceedings of the December 4-6, 1962, fall joint computer conference, (121-129)
  364. ACM
    Galler B and Perlis A (1962). Compiling matrix operations, Communications of the ACM, 5:12, (590-594), Online publication date: 1-Dec-1962.
  365. ACM
    Iverson K A programming language Proceedings of the May 1-3, 1962, spring joint computer conference, (345-351)
  366. ACM
    Hellerman H (1962). Addressing multidimensional arrays, Communications of the ACM, 5:4, (205-207), Online publication date: 1-Apr-1962.
Contributors
  • IBM Thomas J. Watson Research Center

Recommendations