The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Conception, evolution, and application of functional programming languages
Abstract
The foundations of functional programming languages are examined from both historical and technical perspectives. Their evolution is traced through several critical periods: early work on lambda calculus and combinatory calculus, Lisp, Iswim, FP, ML, and modern functional languages such as Miranda 1 and Haskell. The fundamental premises on which the functional programming methodology stands are critically analyzed with respect to philosophical, theoretical, and pragmatic concerns. Particular attention is paid to the main features that characterize modern functional languages: higher-order functions, lazy evaluation, equations and pattern matching, strong static typing and type inference, and data abstraction. In addition, current research areas—such as parallelism, nondeterminism, input/output, and state-oriented computations—are examined with the goal of predicting the future development and application of functional languages.
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
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,787
Backus, J. (1978) · Communications of the ACM · doi:10.1145/359576.359579 · Cited by 2,609
A theory of type polymorphism in programming
Milner, R. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90014-4 · Cited by 2,205
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
Structure and Interpretation of Computer Programs
Abelson, H., Sussman, G. J., & Sussman, J. (1985) · Cited by 1,435
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
A Transformation System for Developing Recursive Programs
Burstall, R. M., & Darlington, J. (1977) · Journal of the ACM · doi:10.1145/321992.321996 · Cited by 1,300
The calculi of lambda-conversion
Rosser, B. (1941) · Medical Entomology and Zoology · Cited by 1,168
Principal type-schemes for functional programs
Damas, L., & Milner, R. (1982) · Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82 · doi:10.1145/582153.582176 · Cited by 1,097
The implementation of functional programming languages
(1987) · Microprocessors and Microsystems · doi:10.1016/0141-9331(87)90510-2 · Cited by 1,076
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
Revised report on the algorithmic language ALGOL 60
Backus, J. W., Bauer, F. L., Green, J., Katz, C., McCarthy, J., Perlis, A. J., Rutishauser, H., Samelson, K., Vauquois, B., Wegstein, J. H., et al. (1963) · Communications of the ACM · doi:10.1145/366193.366201 · Cited by 900
Formal Reductions of the General Combinatorial Decision Problem
Post, E. L. (1943) · American Journal of Mathematics · doi:10.2307/2371809 · Cited by 850
Towards a theory of type structure
Reynolds, J. C. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_148 · Cited by 815
Jones, S. (1987) · Cited by 812
How to make ad-hoc polymorphism less ad hoc
Wadler, P., & Blott, S. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75283 · Cited by 773
Outline of a Mathematical Theory of Computation
Scott, D. (1970) · Medical Entomology and Zoology · Cited by 746
Why Functional Programming Matters
Hughes, J. (1989) · The Computer Journal · doi:10.1093/comjnl/32.2.98 · Cited by 734
Introduction to functional programming
Bird, R. S. (1988) · Cited by 693
A Basis for a Mathematical Theory of Computation )
(1963) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)72018-4 · Cited by 692
The next 700 programming languages
Landin, P. J. (1966) · Communications of the ACM · doi:10.1145/365230.365257 · Cited by 661
Miranda: A non-strict functional language with polymorphic types
Turner, D. A. (1985) · Lecture notes in computer science · doi:10.1007/3-540-15975-4_26 · Cited by 631
Gordon, M. J., Milner, A. J., & Wadsworth, C. P. (1979) · Lecture Notes in Computer Science · doi:10.1007/3-540-09724-4 · Cited by 628
A new implementation technique for applicative languages
Turner, D. A. (1979) · Software: Practice and Experience · doi:10.1002/spe.4380090105 · Cited by 610
A Set of Postulates for the Foundation of Logic
Church, A. (1932) · The Annals of Mathematics · doi:10.2307/1968337 · Cited by 583
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
Revised 3 report on the algorithmic language scheme
Rees, J., & Clinger, W. (1986) · ACM SIGPLAN Notices · doi:10.1145/15042.15043 · Cited by 509
Lucassen, J. M., & Gifford, D. K. (1988) · Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '88 · doi:10.1145/73560.73564 · Cited by 481
Über die Bausteine der mathematischen Logik
Schönfinkel, M. (1924) · Mathematische Annalen · doi:10.1007/bf01448013 · Cited by 471
The principle type-scheme of an object in combinatory logic
Hindley, R. (1969) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1969-0253905-6 · Cited by 448
LUCID: The data flow programming language
Wadge, W. W., & Ashcroft, E. A. (1985) · Cited by 400
Structure and interpretation of computer programs
Forbus, K. D. (1985) · Artificial Intelligence · doi:10.1016/0004-3702(85)90087-6 · Cited by 395
A preliminary architecture for a basic data-flow processor
Dennis, J. B., & Misunas, D. P. (1998) · 25 years of the international symposia on Computer architecture (selected papers) · doi:10.1145/285930.286058 · Cited by 365
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
Views: a way for pattern matching to cohabit with data abstraction
Wadler, P. (1987) · Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '87 · doi:10.1145/41625.41653 · Cited by 321
A Basis for a Mathematical Theory of Computation
(1959) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(09)70099-0 · Cited by 321
Revised 5 report on the algorithmic language scheme
Adams, N. I., Bartley, D. H., Brooks, G., Dybvig, R. K., Friedman, D. P., Halstead, R., Hanson, C., Haynes, C. T., Kohlbecker, E., Oxley, D., et al. (1998) · ACM SIGPLAN Notices · doi:10.1145/290229.290234 · Cited by 317
Church, A., & Rosser, J. B. (1936) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1936-1501858-0 · Cited by 285
CONS Should Not Evaluate its Arguments.
Friedman, D. P., & Wise, D. S. (1976) · International Colloquium on Automata, Languages and Programming · Cited by 267
λ-definability and recursiveness
Kleene, S. C. (1936) · Duke Mathematical Journal · doi:10.1215/s0012-7094-36-00227-2 · Cited by 267
Computability and λ-definability
Turing, A. M. (1937) · Journal of Symbolic Logic · doi:10.2307/2268280 · Cited by 262
Milner, R. (1984) · doi:10.1145/800055.802035 · Cited by 253
Lucid, a nonprocedural language with iteration
Ashcroft, E. A., & Wadge, W. W. (1977) · Communications of the ACM · doi:10.1145/359636.359715 · Cited by 241
Integrating functional and imperative programming
Gifford, D. K., & Lucassen, J. M. (1986) · Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86 · doi:10.1145/319838.319848 · Cited by 226
(1985) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(85)90017-5 · Cited by 193
Augustsson, L. (1985) · Lecture Notes in Computer Science · doi:10.1007/3-540-15975-4_48 · Cited by 174
Arvind, & Gostelow (1982) · Computer · doi:10.1109/mc.1982.1653940 · Cited by 173
Automata, Languages and Programming
(1974) · Lecture notes in computer science · doi:10.1007/3-540-06841-4 · Cited by 150
Tim: A simple, lazy abstract machine to execute supercombinators
Fairbairn, J., & Wray, S. (1987) · Lecture notes in computer science · doi:10.1007/3-540-18317-5_3 · Cited by 144
Three approaches to type structure
Reynolds, J. C. (1985) · Lecture notes in computer science · doi:10.1007/3-540-15198-2_7 · Cited by 131
Correct and optimal implementations of recursion in a simple programming language
Vuillemin, J. E. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80048-6 · Cited by 123
GRIP — a high-performance architecture for parallel graph reduction
Jones, S., Clack, C. D., Salkild, J., & Hardie, M. (1987) · Lecture notes in computer science · doi:10.1007/3-540-18317-5_7 · Cited by 114
The aggregate update problem in functional programming systems
Hudak, P., & Bloss, A. (1985) · ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) · doi:10.1145/318593.318660 · Cited by 113
Self-citationThe Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Church, A. (1985) · Princeton University Press eBooks · Cited by 92
Partial polymorphic type inference and higher-order unification
Pfenning, F. (1988) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/62678.62697 · Cited by 91
Proceedings of the 9th annual symposium on Computer Architecture
Szygenda, S., Hughes, J., Blanton, M., Wagner, T., Frailey, D. J., Gunter, T., McLeavy, C., Lipovski, J., & Malek, M. (1982) · Cited by 81
McCarthy, J. (1978) · ACM SIGPLAN Notices · doi:10.1145/960118.808387 · Cited by 80
A Computer Capable of Exchanging Processors for Time.
Arvind, A., & Gostelow, K. P. (1977) · IFIP Congress · Cited by 56
VAL -- A Value-Oriented Algorithmic Language (Preliminary Reference Manual),
Ackerman, W. B., & Dennis, J. B. (1979) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 52
Partial polymorphic type inference is undecidable
Boehm, H. (1985) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1985.44 · Cited by 48
Matrix algebra and applicative programming
Wise, D. S. (1987) · Lecture notes in computer science · doi:10.1007/3-540-18317-5_9 · Cited by 47
Nondeterminism with Referential Transparency in Functional Programming Languages
Burton, F. W. (1988) · The Computer Journal · doi:10.1093/comjnl/31.3.243 · Cited by 29
Cited by
Concepts and paradigms of object-oriented programming
Wegner, P. (1990) · ACM SIGPLAN OOPS Messenger · doi:10.1145/382192.383004 · Cited by 439
Web Service Composition: A Survey of Techniques and Tools
Lemos, A. L., Daniel, F., & Benatallah, B. (2016) · ACM Computing Surveys · doi:10.1145/2831270 · Cited by 320
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
Self-citation
Metadata
- Authors
- Hudak, P.
- Venue
- ACM Computing Surveys
- Published
- 1989-09
- Volume
- 21
- Issue
- 3
- Pages
- 359-411
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2105232714
- Cited by
- 409
- References
- 64
- FWCI
- 17.19
- Type
- journal article
- Language
- en
- Open access
- closed
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.