The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs
Open accessAbstract
Conventional programming languages are growing ever more enormous, but not stronger. Inherent defects at the most basic level cause them to be both fat and weak: their primitive word-at-a-time style of programming inherited from their common ancestor—the von Neumann computer, their close coupling of semantics to state transitions, their division of programming into a world of expressions and a world of statements, their inability to effectively use powerful combining forms for building new programs from existing ones, and their lack of useful mathematical properties for reasoning about programs. An alternative functional style of programming is founded on the use of combining forms for creating programs. Functional programs deal with structured data, are often nonrepetitive and nonrecursive, are hierarchically constructed, do not name their arguments, and do not require the complex machinery of procedure declarations to become generally applicable. Combining forms can use high level programs to build still higher level ones in a style not possible in conventional languages. Associated with the functional style of programming is an algebra of programs whose variables range over programs and whose operations are combining forms. This algebra can be used to transform programs and to solve equations whose “unknowns” are programs in much the same way one transforms equations in high school algebra. These transformations are given by algebraic laws and are carried out in the same language in which programs are written. Combining forms are chosen not only for their programming power but also for the power of their associated algebraic laws. General theorems of the algebra give the detailed behavior and termination conditions for large classes of programs. A new class of computing systems uses the functional programming style both in its programming language and in its state transition rules. Unlike von Neumann languages, these systems have semantics loosely coupled to states—only one state transition occurs per major computation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Dijkstra, E. W. (1976) · CERN Document Server (European Organization for Nuclear Research) · Cited by 4,733
An axiomatic basis for computer programming
Hoare, C. A. R. (1969) · Communications of the ACM · doi:10.1145/363235.363259 · Cited by 4,002
Recursive functions of symbolic expressions and their computation by machine, Part I
McCarthy, J. (1960) · Communications of the ACM · doi:10.1145/367177.367199 · Cited by 1,387
The calculi of lambda-conversion
Rosser, B. (1941) · Medical Entomology and Zoology · Cited by 1,168
Iverson, K. E. (1962) · Proceedings of the May 1-3, 1962, spring joint computer conference on - AIEE-IRE '62 (Spring) · doi:10.1145/1460833.1460872 · Cited by 1,067
The Mechanical Evaluation of Expressions
Landin, P. J. (1964) · The Computer Journal · doi:10.1093/comjnl/6.4.308 · Cited by 926
Outline of a Mathematical Theory of Computation
Scott, D. (1970) · Medical Entomology and Zoology · Cited by 746
First version of a data flow procedure language
Dennis, J. B. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_145 · Cited by 644
Recursive Functions of Symbolic Expressions and Their Computation by Machine (1960)
McCarthy, J. (2021) · Ideas That Created the Future · doi:10.7551/mitpress/12274.003.0023 · Cited by 532
Henderson, P., & Morris, J. H. (1976) · Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76 · doi:10.1145/800168.811543 · Cited by 325
Cited by
A million spiking-neuron integrated circuit with a scalable communication network and interface
Merolla, P. A., Arthur, J. V., Alvarez-Icaza, R., Cassidy, A. S., Sawada, J., Akopyan, F., Jackson, B. L., Imam, N., Guo, C., Nakamura, Y., et al. (2014) · Science · doi:10.1126/science.1254642 · Cited by 4,147
Computation and cognition: issues in the foundations of cognitive science
Pylyshyn, Z. W. (1980) · Behavioral and Brain Sciences · doi:10.1017/s0140525x00002053 · Cited by 1,217
Semantic database modeling: survey, applications, and research issues
Hull, R., & King, R. (1987) · ACM Computing Surveys · doi:10.1145/45072.45073 · Cited by 1,146
MULTILISP: a language for concurrent symbolic computation
Halstead, R. H. (1985) · ACM Transactions on Programming Languages and Systems · doi:10.1145/4472.4478 · Cited by 1,073
Memory and Information Processing in Neuromorphic Systems
Indiveri, G., & Liu, S.-C. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2444094 · Cited by 1,037
Readings in Distributed Artificial Intelligence
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07700-6 · Cited by 986
The functional data model and the data languages DAPLEX
Shipman, D. W. (1981) · ACM Transactions on Database Systems · doi:10.1145/319540.319561 · Cited by 913
Hillis, W. D., & Steele, G. L. (1986) · Communications of the ACM · doi:10.1145/7902.7903 · Cited by 899
Memristor‐Based Analog Computation and Neural Network Classification with a Dot Product Engine
Hu, M., Graves, C. E., Li, C., Li, Y., Ge, N., Montgomery, E., Davila, N., Jiang, H., Williams, R. S., Yang, J. J., et al. (2018) · Advanced Materials · doi:10.1002/adma.201705914 · Cited by 751
Equations and Rewrite Rules: A Survey
Huet, G., & Oppen, D. C. (1980) · Formal Language Theory · doi:10.1016/b978-0-12-115350-2.50017-8 · Cited by 714
Embedded Devices for Neuromorphic Time-Series Assessment
Mazumder, A. N., Hosseini, M., & Mohsenin, T. (2022) · Research Explorer (The University of Manchester) · doi:10.13016/m2ksy0-wxr3 · Cited by 652
Moradi, S., Qiao, N., Stefanini, F., & Indiveri, G. (2018) · IEEE Transactions on Biomedical Circuits and Systems · doi:10.1109/tbcas.2017.2759700 · Cited by 650
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
Emerging Memory Devices for Neuromorphic Computing
Upadhyay, N. K., Jiang, H., Wang, Z., Asapu, S., Xia, Q., & Joshua Yang, J. (2019) · Advanced Materials Technologies · doi:10.1002/admt.201800589 · Cited by 540
Advances in dataflow programming languages
Johnston, W. M., Hanna, J. R. P., & Millar, R. J. (2004) · ACM Computing Surveys · doi:10.1145/1013208.1013209 · Cited by 503
An Oxide Schottky Junction Artificial Optoelectronic Synapse
Gao, S., Liu, G., Yang, H., Hu, C., Chen, Q., Gong, G., Xue, W., Yi, X., Shang, J., & Li, R.-W. (2019) · ACS Nano · doi:10.1021/acsnano.9b00340 · Cited by 494
Google’s MapReduce programming model — Revisited
Lämmel, R. (2008) · Science of Computer Programming · doi:10.1016/j.scico.2007.07.001 · Cited by 489
All‐Solid‐State Synaptic Transistor with Ultralow Conductance for Neuromorphic Computing
Yang, C., Shang, D., Liu, N., Fuller, E. J., Agrawal, S., Talin, A. A., Li, Y., Shen, B., & Sun, Y. (2018) · Advanced Functional Materials · doi:10.1002/adfm.201804170 · Cited by 489
The Future of Memristors: Materials Engineering and Neural Networks
Sun, K., Chen, J., & Yan, X. (2021) · Advanced Functional Materials · doi:10.1002/adfm.202006773 · Cited by 482
Massively parallel parsing: A strongly interactive model of natural language interpretation
WALTZ, D., & POLLACK, J. (1985) · Cognitive Science · doi:10.1016/s0364-0213(85)80009-4 · Cited by 443
GPU Cluster for High Performance Computing
Fan, Z., Qiu, F., Kaufman, A., & Yoakum-Stover, S. (2005) · Proceedings of the ACM/IEEE SC2004 Conference · doi:10.1109/sc.2004.26 · Cited by 434
Programming languages for distributed computing systems
Bal, H. E., Steiner, J. G., & Tanenbaum, A. S. (1989) · ACM Computing Surveys · doi:10.1145/72551.72552 · Cited by 423
Conception, evolution, and application of functional programming languages
Hudak, P. (1989) · ACM Computing Surveys · doi:10.1145/72551.72554 · Cited by 409
Prolog and Natural Language Analysis
Harrison, S. P., Pereira, F. C. N., & Shieber, S. M. (1988) · Language · doi:10.2307/414538 · Cited by 364
Beyond von‐Neumann Computing with Nanoscale Phase‐Change Memory Devices
Wright, C. D., Hosseini, P., & Diosdado, J. A. V. (2013) · Advanced Functional Materials · doi:10.1002/adfm.201202383 · Cited by 363
Neuromorphic device architectures with global connectivity through electrolyte gating.
Gkoupidenis, P., Koutsouras, D. A., & Malliaras, G. G. (2017) · Nature Communications · doi:10.1038/ncomms15448 · Cited by 353
An Organic Nanoparticle Transistor Behaving as a Biological Spiking Synapse
Alibart, F., Pleutin, S., Guérin, D., Novembre, C., Lenfant, S., Lmimouni, K., Gamrat, C., & Vuillaume, D. (2010) · Advanced Functional Materials · doi:10.1002/adfm.200901335 · Cited by 352
A Survey of Neuromorphic Computing and Neural Networks in Hardware
Schuman, C. D., Potok, T. E., Patton, R. M., Birdwell, J. D., Dean, M. E., Rose, G. S., & Plank, J. S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.06963 · Cited by 352
Types and persistence in database programming languages
Atkinson, M. P., & Buneman, O. P. (1987) · ACM Computing Surveys · doi:10.1145/62070.45066 · Cited by 344
Ferroelectric field-effect transistors based on HfO 2 : a review
Mulaosmanovic, H., Breyer, E. T., Dünkel, S., Beyer, S., Mikolajick, T., & Slesazeck, S. (2021) · Nanotechnology · doi:10.1088/1361-6528/ac189f · Cited by 333
Learning Abilities Achieved by a Single Solid‐State Atomic Switch
Hasegawa, T., Ohno, T., Terabe, K., Tsuruoka, T., Nakayama, T., Gimzewski, J. K., & Aono, M. (2010) · Advanced Materials · doi:10.1002/adma.200903680 · Cited by 330
X-SRAM: Enabling In-Memory Boolean Computations in CMOS Static Random Access Memories
Agrawal, A., Jaiswal, A., Lee, C., & Roy, K. (2018) · IEEE Transactions on Circuits and Systems I: Regular Papers · doi:10.1109/tcsi.2018.2848999 · Cited by 325
Stephens, R. (1997) · Acta Informatica · doi:10.1007/s002360050095 · Cited by 322
Photonic Multiply-Accumulate Operations for Neural Networks
Nahmias, M. A., de Lima, T. F., Tait, A. N., Peng, H.-T., Shastri, B. J., & Prucnal, P. R. (2020) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2019.2941485 · Cited by 301
A review of memristor: material and structure design, device performance, applications and prospects
Xiao, Y., Jiang, B., Zhang, Z., Ke, S., Jin, Y., Wen, X., & Ye, C. (2023) · Science and Technology of Advanced Materials · doi:10.1080/14686996.2022.2162323 · Cited by 295
Seo, K., Kim, I., Jung, S., Jo, M., Park, S., Park, J., Shin, J., Biju, K. P., Kong, J., Lee, K., et al. (2011) · Nanotechnology · doi:10.1088/0957-4484/22/25/254023 · Cited by 288
Calculating with light using a chip-scale all-optical abacus
Feldmann, J., Stegmaier, M., Gruhler, N., Ríos, C., Bhaskaran, H., Wright, C. D., & Pernice, W. H. P. (2017) · Nature Communications · doi:10.1038/s41467-017-01506-3 · Cited by 283
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
Associative memory realized by a reconfigurable memristive Hopfield neural network
Hu, S. G., Liu, Y., Liu, Z., Chen, T. P., Wang, J. J., Yu, Q., Deng, L. J., Yin, Y., & Hosaka, S. (2015) · Nature Communications · doi:10.1038/ncomms8522 · Cited by 258
State-of-the-art in Heterogeneous Computing
Brodtkorb, A. R., Dyken, C., Hagen, T. R., Hjelmervik, J. M., & Storaasli, O. O. (2010) · Scientific Programming · doi:10.1155/2010/540159 · Cited by 257
Machine Learning in Nanoscience: Big Data at Small Scales
Brown, K. A., Brittman, S., Maccaferri, N., Jariwala, D., & Celano, U. (2020) · Nano Letters · doi:10.1021/acs.nanolett.9b04090 · Cited by 229
Nanostructured perovskites for nonvolatile memory devices
Liu, Q., Gao, S., Xu, L., Yue, W., Zhang, C., Kan, H., Li, Y., & Shen, G. (2022) · Chemical Society Reviews · doi:10.1039/d1cs00886b · Cited by 163
On the physical properties of memristive, memcapacitive and meminductive systems
Di Ventra, M., & Pershin, Y. V. (2013) · Nanotechnology · doi:10.1088/0957-4484/24/25/255201 · Cited by 130
“Non-traditional computing represents an important research direction with the aim of solving the ‘von Neumann bottleneck’ that plagues our computer architectures [11].”
Background(2013) · Cited by 128
Neural inference at the frontier of energy, space, and time
Modha, D. S., Akopyan, F., Andreopoulos, A., Appuswamy, R., Arthur, J. V., Cassidy, A. S., Datta, P., DeBole, M. V., Esser, S. K., Otero, C. O., et al. (2023) · Science · doi:10.1126/science.adh1174 · Cited by 115
Classification with a disordered dopant-atom network in silicon
Chen, T., van Gelder, J., van de Ven, B., Amitonov, S. V., de Wilde, B., Ruiz Euler, H.-C., Broersma, H., Bobbert, P. A., Zwanenburg, F. A., & van der Wiel, W. G. (2020) · Nature · doi:10.1038/s41586-019-1901-0 · Cited by 95
2022 roadmap on neuromorphic computing and engineering
Christensen, D. V., Dittmann, R., Linares-Barranco, B., Sebastian, A., Le Gallo, M., Redaelli, A., Slesazeck, S., Mikolajick, T., Spiga, S., Menzel, S., et al. (2022) · Neuromorphic Computing and Engineering · doi:10.1088/2634-4386/ac4a83
Metadata
- Authors
- Backus, J.
- Venue
- Communications of the ACM
- Published
- 1978-08
- Volume
- 21
- Issue
- 8
- Pages
- 613-641
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2172307690
- Cited by
- 2,609
- References
- 12
- FWCI
- 78.98
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.