A history of Haskell: being lazy with class
The DOI matches its Crossref record; 111 of the 111 references it cites were found in a registry or an index.
Abstract
This paper describes the history of Haskell, including its genesis and principles, technical contributions, implementations and tools, and applications and impact.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Backus, J. (1978) · Communications of the ACM · doi:10.1145/359576.359579 · Cited by 2,609
van Rossum, G. (1995) · Data Archiving and Networked Services (DANS) · Cited by 2,528
Milner, R., Harper, R., MacQueen, D., & Tofte, M. (1997) · The MIT Press eBooks · doi:10.7551/mitpress/2319.001.0001 · Cited by 2,419
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (1931) · Monatshefte für Mathematik und Physik · doi:10.1007/bf01700692 · Cited by 2,395
Types and Programming Languages
Pierce, B. C. (2002) · Cited by 2,226
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
Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Gödel, K. (2006) · Monatshefte für Mathematik · doi:10.1007/s00605-006-0423-7 · Cited by 2,077
Notions of computation and monads
Moggi, E. (1991) · Information and Computation · doi:10.1016/0890-5401(91)90052-4 · Cited by 1,688
Knuth, D. E. (1984) · The Computer Journal · doi:10.1093/comjnl/27.2.97 · Cited by 1,467
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
Imperative functional programming
Peyton Jones, S. L., & Wadler, P. (1993) · Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93 · doi:10.1145/158511.158524 · Cited by 1,234
Self-citationThe 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
Shapiro, E. Y. (1983) · doi:10.7551/mitpress/1192.001.0001 · Cited by 1,085
The implementation of functional programming languages
(1987) · Microprocessors and Microsystems · doi:10.1016/0141-9331(87)90510-2 · Cited by 1,076
QuickCheck: a lightweight tool for random testing of Haskell programs
Claessen, K., & Hughes, J. (2011) · ACM SIGPLAN Notices · doi:10.1145/1988042.1988046 · Cited by 1,011
Self-citationThe Definition of Standard ML (Revised)
Milner, R., Harper, R. W., MacQueen, D. B., & Tofte, M. (1997) · Cited by 985
The Mechanical Evaluation of Expressions
Landin, P. J. (1964) · The Computer Journal · doi:10.1093/comjnl/6.4.308 · Cited by 926
Wadler, P. L. (1989) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/99370.99404 · Cited by 923
Self-citationComputational lambda-calculus and monads
Moggi, E. (2003) · [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science · doi:10.1109/lics.1989.39155 · Cited by 842
Jones, S. (1987) · Cited by 812
Cilk: An Efficient Multithreaded Runtime System
Blumofe, R. D., Joerg, C. F., Kuszmaul, B. C., Leiserson, C. E., Randall, K. H., & Zhou, Y. (1996) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1996.0107 · Cited by 784
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
Self-citation(2000) · doi:10.1145/351240.351266 · Cited by 753
Self-citationFrom Frege to Gödel: a source book in mathematical logic, 1879-1931
van Heijenoort, J. (2021) · Cited by 743
Scott, D. (2006) · Springer eBooks · doi:10.1007/bfb0079432 · Cited by 736
Why Functional Programming Matters
Hughes, J. (1989) · The Computer Journal · doi:10.1093/comjnl/32.2.98 · Cited by 734
Self-citationDeforestation: transforming programs to eliminate trees
Wadler, P. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90147-a · Cited by 699
Self-citationIntroduction to functional programming
Bird, R. S. (1988) · Cited by 693
The essence of functional programming
Wadler, P. (1992) · Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '92 · doi:10.1145/143165.143169 · Cited by 679
Self-citationThe next 700 programming languages
Landin, P. J. (1966) · Communications of the ACM · doi:10.1145/365230.365257 · Cited by 661
An Overview of the Scala Programming Language
Odersky, M., Altherr, P., Cremet, V., Emir, B., Maneth, S., Micheloud, S., Mihaylov, N., Schinz, M., Stenman, E., & Zenger, M. (2004) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 648
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
Purely Functional Data Structures
Okasaki, C. (1998) · Cambridge University Press eBooks · doi:10.1017/cbo9780511530104 · Cited by 625
A new implementation technique for applicative languages
Turner, D. A. (1979) · Software: Practice and Experience · doi:10.1002/spe.4380090105 · Cited by 610
Hughes, J. (2000) · Science of Computer Programming · doi:10.1016/s0167-6423(99)00023-4 · Cited by 610
Self-citationEdinburgh LCF: A mechanised logic of computation
Gordon, M. J. C. (1979) · Medical Entomology and Zoology · Cited by 606
Wadler, P. (1990) · Proceedings of the 1990 ACM conference on LISP and functional programming · doi:10.1145/91556.91592 · Cited by 576
Self-citationTemplate meta-programming for Haskell
Sheard, T., & Jones, S. P. (2002) · Proceedings of the 2002 ACM SIGPLAN workshop on Haskell · doi:10.1145/581690.581691 · Cited by 545
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
Tupac, J. D. (1963) · Spartan Books · Cited by 530
A unification algorithm for typed λ-calculus
Huet, G. P. (1975) · Theoretical Computer Science · doi:10.1016/0304-3975(75)90011-0 · Cited by 510 · cited 2×
“Type inference for a system involving higher kinds seems at first to require higher-order unification, which is both much harder than traditional first-order unification and lacks most general unifiers (Huet, 1975).”
BackgroundRevised 3 report on the algorithmic language scheme
Rees, J., & Clinger, W. (1986) · ACM SIGPLAN Notices · doi:10.1145/15042.15043 · Cited by 509
Monad transformers and modular interpreters
Liang, S., Hudak, P., & Jones, M. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199528 · Cited by 503
Self-citationBuilding domain-specific embedded languages
Hudak, P. (1996) · ACM Computing Surveys · doi:10.1145/242224.242477 · Cited by 477
Self-citationAbstract types have existential type
Mitchell, J. C., & Plotkin, G. D. (1988) · ACM Transactions on Programming Languages and Systems · doi:10.1145/44501.45065 · Cited by 429
Lava: hardware design in Haskell
Bjesse, P., Claessen, K., Sheeran, M., & Singh, S. (1998) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/289423.289440 · Cited by 416
Revised5 Report on the Algorithmic Language Scheme
Abelson, H., Dybvig, R. K., Haynes, C. T., Rozas, G. J., Adams, N. I., Friedman, D. P., Kohlbecker, E., Steele, G. L., Bartley, D. H., Halstead, R., et al. (1998) · Higher-Order and Symbolic Computation · doi:10.1023/a:1010051815785 · Cited by 414
Conception, evolution, and application of functional programming languages
Hudak, P. (1989) · ACM Computing Surveys · doi:10.1145/72551.72554 · Cited by 409
Self-citationThe system F of variable types, fifteen years later
Girard, J.-Y. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90044-7 · Cited by 357
Scrap your boilerplate: a practical design pattern for generic programming
Lämmel, R., & Jones, S. P. (2003) · Proceedings of the 2003 ACM SIGPLAN international workshop on Types in languages design and implementation · doi:10.1145/604174.604179 · Cited by 351
Multi-stage programming with explicit annotations
Taha, W., & Sheard, T. (1997) · Proceedings of the 1997 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation · doi:10.1145/258993.259019 · Cited by 342
Guarded recursive datatype constructors
Xi, H., Chen, C., & Chen, G. (2003) · Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/604131.604150 · Cited by 325
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
The execution algorithm of mercury, an efficient purely declarative logic programming language
Somogyi, Z., Henderson, F., & Conway, T. (1996) · The Journal of Logic Programming · doi:10.1016/s0743-1066(96)00068-4 · Cited by 324
Proving Properties of Programs by Structural Induction
Burstall, R. M. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.41 · Cited by 324
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
Self-citationRevised 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
TIL: a type-directed optimizing compiler for ML
Tarditi, D., Morrisett, G., Cheng, P., Stone, C., Harper, R., & Lee, P. (1996) · Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation · doi:10.1145/231379.231414 · Cited by 317
CONS Should Not Evaluate its Arguments.
Friedman, D. P., & Wise, D. S. (1976) · International Colloquium on Automata, Languages and Programming · Cited by 314
Cayenne—a language with dependent types
Augustsson, L. (1998) · Proceedings of the third ACM SIGPLAN international conference on Functional programming · doi:10.1145/289423.289451 · Cited by 286
Milner, R. (1984) · doi:10.1145/800055.802035 · Cited by 253
Domain specific embedded compilers
Leijen, D., & Meijer, E. (1999) · Proceedings of the 2nd conference on Domain-specific languages · doi:10.1145/331960.331977 · Cited by 249
Type Classes with Functional Dependencies
Jones, M. P. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-46425-5_15 · Cited by 246
Efficient compilation of lazy evaluation
Johnsson, T. (1984) · Proceedings of the 1984 SIGPLAN symposium on Compiler construction - SIGPLAN '84 · doi:10.1145/502874.502880 · Cited by 225
Practical type inference for arbitrary-rank types
JONES, S. P., VYTINIOTIS, D., WEIRICH, S., & SHIELDS, M. (2007) · Journal of Functional Programming · doi:10.1017/s0956796806006034 · Cited by 216
Strongly typed heterogeneous collections
Kiselyov, O., Lämmel, R., & Schupke, K. (2004) · Proceedings of the 2004 ACM SIGPLAN workshop on Haskell · doi:10.1145/1017472.1017488 · Cited by 185
Launchbury, J., & Peyton Jones, S. L. (1995) · LISP and Symbolic Computation · doi:10.1007/bf01018827 · Cited by 185
Self-citationThe Combination of Symbolic and Numerical Computation or Three-Dimensional Modeling of RNA
Major, F., Turcotte, M., Gautheret, D., Lapalme, G., Fillion, E., & Cedergren, R. (1991) · Science · doi:10.1126/science.1716375 · Cited by 182
RANTA, A. (2004) · Journal of Functional Programming · doi:10.1017/s0956796803004738 · Cited by 165
Abstract types have existential types
Mitchell, J. C., & Plotkin, G. D. (1985) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/318593.318606 · Cited by 159
Implicit parameters: dynamic scoping with static types
Lewis, J. R., Launchbury, J., Meijer, E., & Shields, M. B. (2000) · Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/325694.325708 · Cited by 154
Qualified Types : Theory and Practice
Jones, M. P. (1992) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 149
A new approach to generic functional programming
Hinze, R. T. W. (2000) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/325694.325709 · Cited by 142
de Bruijn notation as a nested datatype
Bird, R. S., & Paterson, R. (1999) · Journal of Functional Programming · doi:10.1017/s0956796899003366 · Cited by 142
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 133
Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics
Dybjer, P. (1991) · Cambridge University Press eBooks · doi:10.1017/cbo9780511569807.012 · Cited by 129
A system of constructor classes: overloading and implicit higher-order polymorphism
Jones, M. P. (1993) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/165180.165190 · Cited by 124
Type classes: an exploration of the design space
Jones, S., Jones, M. P., & Meijer, E. (1997) · Cited by 121
Uniqueness typing for functional languages with graph rewriting semantics
Barendsen, E., & Smetsers, S. (1996) · Mathematical Structures in Computer Science · doi:10.1017/s0960129500070109 · Cited by 119
Hinze, R. T. W., & Jones, S. (2001) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(05)80542-0 · Cited by 118
A polymorphic record calculus and its compilation
Ohori, A. (1995) · ACM Transactions on Programming Languages and Systems · doi:10.1145/218570.218572 · Cited by 114
A loosely-coupled applicative multi-processing system
Keller, R., Lindstrom, G. E., & Patil, S. (1979) · International Workshop on Managing Requirements Knowledge (MARK) · doi:10.1109/mark.1979.8817294 · Cited by 110
Heeren, B. J., Leijen, D., & van IJzendoorn, A. (2003) · International Symposium on Haskell · doi:10.1145/871895.871902 · Cited by 109
Jones, M. P. (1994) · Science of Computer Programming · doi:10.1016/0167-6423(94)00005-0 · Cited by 109
Baars, A. I., & Swierstra, S. D. (2002) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/581478.581494 · Cited by 107
The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies)
Church, A. (1985) · Princeton University Press eBooks · Cited by 106
Sheard, T. (2004) · Companion to the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA Companion) · doi:10.1145/1028664.1028711 · Cited by 105
Observable Sharing for Functional Circuit Description
Claessen, K., & Sands, D. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46674-6_7 · Cited by 100
Polymorphic type inference and abstract data types
Läufer, K., & Odersky, M. (1994) · ACM Transactions on Programming Languages and Systems · doi:10.1145/186025.186031 · Cited by 99
Wan, Z., Taha, W., & Hudak, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45587-6_11 · Cited by 94
Self-citationA language for declarative robotic programming
Peterson, J. R., Hager, G. D., & Hudak, P. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1999.772516 · Cited by 94
Self-citationA Polymorphic Type System for Extensible Records and Variants
Gaster, B. R., & Jones, M. P. (1996) · Cited by 86
Higher-order strictness analysis in untyped lambda calculus
Hudak, P., & Young, J. M. (1986) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/512644.512653 · Cited by 85
Self-citationHaskore music notation – An algebra of music –
Hudak, P., Makucevich, T., Gadde, S., & Whong, B. (1996) · Journal of Functional Programming · doi:10.1017/s0956796800001805 · Cited by 85
Self-citationCurry: A Truly Functional Logic Language
Hanus, M., Kuchen, H., & Moreno-Navarro, J. (1995) · Cited by 84
Scripting the type inference process
Heeren, B. J., Hage, J., & Swierstra, S. D. (2003) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/944705.944707 · Cited by 84
Achten, P., & Plasmeijer, R. (1995) · Journal of Functional Programming · doi:10.1017/s0956796800001258 · Cited by 72
Random testing of C calling conventions
Lindig, C. (2005) · International Symposium on Automated Analysis-Driven Debugging (AADEBUG) · doi:10.1145/1085130.1085132 · Cited by 71
A principled approach to operating system construction in Haskell
Hallgren, T., Jones, M. P., Leslie, R., & Tolmach, A. P. (2005) · ACM SIGPLAN International Conference on Functional Programming (ICFP) · doi:10.1145/1086365.1086380 · Cited by 71
Hinze, R. (2003) · The Fun of Programming · doi:10.1007/978-1-349-91518-7_12 · Cited by 68
Heap profiling of lazy functional programs
Runciman, C., & Wakeling, D. (1993) · Journal of Functional Programming · doi:10.1017/s0956796800000708 · Cited by 66
Implicit Parallel Programming in pH
Arvind, A., & Nikhil, R. S. (2001) · Cited by 57
High Level Specification of I/O in Functional Languages
Achten, P., van Groningen, J. H. G., & Plasmeijer, R. (1993) · Workshops in computing · doi:10.1007/978-1-4471-3215-8_1 · Cited by 38
Monadic state: axiomatization and type safety
Launchbury, J., & Sabry, A. (1997) · Proceedings of the second ACM SIGPLAN international conference on Functional programming · doi:10.1145/258948.258970 · Cited by 37
A Monadic Framework for Delimited Continuations
Dybvig, K., Jones, S., & Sabry, A. (2005) · Cited by 32
Neubauer, M., Thiemann, P. J., Gasbichler, M., et al. (2002) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/503272.503294 · Cited by 26
Realization of natural language interfaces using lazy functional programming
Frost, R. (2006) · ACM Computing Surveys · doi:10.1145/1177352.1177353 · Cited by 19
Metadata
- Authors
- Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P.
- Venue
- Proceedings of the third ACM SIGPLAN conference on History of programming languages
- Publisher
- ACM
- Published
- 2007-06-09
- OpenAlex
- W2112774031
- Cited by
- 261
- References
- 111
- FWCI
- 14.31
- Type
- conference paper
- 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.