Short description: Functional programming language
Paradigm Purely functional Lennart Augustsson, Dave Barton, Brian Boutel, Warren Burton, Joseph Fasel, Kevin Hammond, Ralf Hinze, Paul Hudak, John Hughes, Thomas Johnsson, Mark Jones, Simon Peyton Jones, John Launchbury, Erik Meijer, John Peterson, Alastair Reid, Colin Runciman, Philip Wadler 1990; 31 years ago[1] Haskell 2010[2] / July 2010; 11 years ago Haskell 2020 announced[3] Inferred, static, strong Cross-platform .hs, .lhs www.haskell.org GHC, Hugs, NHC, JHC, Yhc, UHC Helium, Gofer Clean,[4] FP,[4] Gofer,[4] Hope and Hope+,[4] Id,[4] ISWIM,[4] KRC,[4] Lisp,[4] Miranda,[4] ML and Standard ML,[4] Orwell, SASL,[4] Scheme,[4] SISAL[4]

Haskell /ˈhæskəl/[5] is a general-purpose, statically typed, purely functional programming language with type inference and lazy evaluation.[6][7] Designed for teaching, research and industrial application, Haskell has pioneered a number of advanced programming language features such as type classes, which enable type-safe operator overloading. Haskell's main implementation is the Glasgow Haskell Compiler (GHC). It is named after logician Haskell Curry.[1]

Haskell's semantics are historically based on those of the Miranda programming language, which served to focus the efforts of the initial Haskell working group.[8] The last formal specification of the language was made in July 2010, while the development of GHC has expanded Haskell via language extensions. The next formal specification was planned for 2020.[3]

Haskell is used in academia and industry.[9][10] As of May 2021, Haskell was the 28th most popular programming language in terms of Google searches[11] for tutorials and made up less than 1% of active users on the GitHub source code repository.[12]

## History

Following the release of Miranda by Research Software Ltd. in 1985, interest in lazy functional languages grew. By 1987, more than a dozen non-strict, purely functional programming languages existed. Miranda was the most widely used, but it was proprietary software. At the conference on Functional Programming Languages and Computer Architecture (FPCA '87) in Portland, Oregon , there was a strong consensus that a committee be formed to define an open standard for such languages. The committee's purpose was to consolidate existing functional languages into a common one to serve as a basis for future research in functional-language design.[13]

Type classes, which enable type-safe operator overloading, were first proposed by Philip Wadler and Stephen Blott for Standard ML but were first implemented in Haskell between 1987 and version 1.0.[14][15]

The first version of Haskell ("Haskell 1.0") was defined in 1990.[1] The committee's efforts resulted in a series of language definitions (1.0, 1.1, 1.2, 1.3, 1.4).

In late 1997, the series culminated in Haskell 98, intended to specify a stable, minimal, portable version of the language and an accompanying standard library for teaching, and as a base for future extensions. The committee expressly welcomed creating extensions and variants of Haskell 98 via adding and incorporating experimental features.[13]

In February 1999, the Haskell 98 language standard was originally published as The Haskell 98 Report.[13] In January 2003, a revised version was published as Haskell 98 Language and Libraries: The Revised Report.[7] The language continues to evolve rapidly, with the Glasgow Haskell Compiler (GHC) implementation representing the current de facto standard.[16]

In early 2006, the process of defining a successor to the Haskell 98 standard, informally named Haskell Prime, began.[17] This was intended to be an ongoing incremental process to revise the language definition, producing a new revision up to once per year. The first revision, named Haskell 2010, was announced in November 2009[2] and published in July 2010.

Haskell 2010 is an incremental update to the language, mostly incorporating several well-used and uncontroversial features previously enabled via compiler-specific flags.

• Hierarchical module names. Module names are allowed to consist of dot-separated sequences of capitalised identifiers, rather than only one such identifier. This lets modules be named in a hierarchical manner (e.g., Data.List instead of List), although technically modules are still in a single monolithic namespace. This extension was specified in an addendum to Haskell 98 and was in practice universally used.
• The foreign function interface (FFI) allows bindings to other programming languages. Only bindings to C are specified in the Report, but the design allows for other language bindings. To support this, data type declarations were permitted to contain no constructors, enabling robust nonce types for foreign data that could not be constructed in Haskell. This extension was also previously specified in an Addendum to the Haskell 98 Report and widely used.
• So-called n+k patterns (definitions of the form fact (n+1) = (n+1) * fact n) were no longer allowed. This syntactic sugar had misleading semantics, in which the code looked like it used the (+) operator, but in fact desugared to code using (-) and (>=).
• The rules of type inference were relaxed to allow more programs to type check.
• Some syntax issues (changes in the formal grammar) were fixed: pattern guards were added, allowing pattern matching within guards; resolution of operator fixity was specified in a simpler way that reflected actual practice; an edge case in the interaction of the language's lexical syntax of operators and comments was addressed, and the interaction of do-notation and if-then-else was tweaked to eliminate unexpected syntax errors.
• The LANGUAGE pragma was specified. By 2010 dozens of extensions to the language were in wide use, and GHC (among other compilers) provided the LANGUAGE pragma to specify individual extensions with a list of identifiers. Haskell 2010 compilers are required to support the Haskell2010 extension and are encouraged to support several others, which correspond to extensions added in Haskell 2010.

## Features

Haskell features lazy evaluation, lambda expressions, pattern matching, list comprehension, type classes and type polymorphism. It is a purely functional language, which means that functions generally have no side effects. A distinct construct exists to represent side effects, orthogonal to the type of functions. A pure function can return a side effect that is subsequently executed, modeling the impure functions of other languages.

Haskell has a strong, static type system based on Hindley–Milner type inference. Its principal innovation in this area is type classes, originally conceived as a principled way to add overloading to the language,[18] but since finding many more uses.[19]

The construct that represents side-effects is an example of a monad: a general framework which can model various computations such as error handling, nondeterminism, parsing and software transactional memory. They are defined as ordinary datatypes, but Haskell provides some syntactic sugar for their use.

Haskell has an open, published specification,[7] and multiple implementations exist. Its main implementation, the Glasgow Haskell Compiler (GHC), is both an interpreter and native-code compiler that runs on most platforms. GHC is noted for its rich type system incorporating recent innovations such as generalized algebraic data types and type families. The Computer Language Benchmarks Game also highlights its high-performance implementation of concurrency and parallelism.[20]

An active, growing community exists around the language, and more than 5,400 third-party open-source libraries and tools are available in the online package repository Hackage.[21]

## Code examples

A "Hello, World!" program in Haskell (only the last line is strictly necessary):

module Main (main) where          -- not needed in interpreter, is the default in a module file

main :: IO ()                     -- the compiler can infer this type definition
main = putStrLn "Hello, World!"

The factorial function in Haskell, defined in a few different ways:

-- Type annotation (optional, same for each implementation)
factorial :: (Integral a) => a -> a

-- Using recursion (with the "ifthenelse" expression)
factorial n = if n < 2
then 1
else n * factorial (n - 1)

-- Using recursion (with pattern matching)
factorial 0 = 1
factorial n = n * factorial (n - 1)

-- Using recursion (with guards)
factorial n
| n < 2     = 1
| otherwise = n * factorial (n - 1)

-- Using a list and the "product" function
factorial n = product [1..n]

-- Using fold (implements "product")
factorial n = foldl (*) 1 [1..n]

-- Point-free style
factorial = foldr (*) 1 . enumFromTo 1

As the Integer type has arbitrary-precision, this code will compute values such as factorial 100000 (a 456,574-digit number), with no loss of precision.

An implementation of an algorithm similar to quick sort over lists, where the first element is taken as the pivot:

-- Type annotation (optional, same for each implementation)
quickSort :: Ord a => [a] -> [a]

-- Using list comprehensions
quickSort []     = []                               -- The empty list is already sorted
quickSort (x:xs) = quickSort [a | a <- xs, a < x]   -- Sort the left part of the list
++ [x] ++                        -- Insert pivot between two sorted parts
quickSort [a | a <- xs, a >= x]  -- Sort the right part of the list

-- Using filter
quickSort []     = []
quickSort (x:xs) = quickSort (filter (<x) xs)
++ [x] ++
quickSort (filter (>=x) xs)

## Implementations

Implementations that fully or nearly comply with the Haskell 98 standard, include:

• The Glasgow Haskell Compiler (GHC) compiles to native code on many different processor architectures, and to ANSI C, via one of two intermediate languages: C--, or in more recent versions, LLVM (formerly Low Level Virtual Machine) bitcode.[23][24] GHC has become the de facto standard Haskell dialect.[25] There are libraries (e.g., bindings to OpenGL) that work only with GHC. GHC is also distributed with the Haskell platform.
• Jhc, a Haskell compiler written by John Meacham, emphasizes speed and efficiency of generated programs and exploring new program transformations.
• Ajhc is a fork of Jhc.
• The Utrecht Haskell Compiler (UHC) is a Haskell implementation from Utrecht University.[26] It supports almost all Haskell 98 features plus many experimental extensions. It is implemented using attribute grammars and is currently used mostly for research on generated type systems and language extensions.

Implementations no longer actively maintained include:

• The Haskell User's Gofer System (Hugs) is a bytecode interpreter. It was once one of the implementations used most widely, alongside the GHC compiler,[27] but has now been mostly replaced by GHCi. It also comes with a graphics library.
• HBC is an early implementation supporting Haskell 1.4. It was implemented by Lennart Augustsson in, and based on, Lazy ML. It has not been actively developed for some time.
• nhc98 is a bytecode compiler focusing on minimizing memory use.
• The York Haskell Compiler (Yhc) was a fork of nhc98, with the goals of being simpler, more portable and efficient, and integrating support for Hat, the Haskell tracer. It also had a JavaScript backend, allowing users to run Haskell programs in web browsers.

Implementations not fully Haskell 98 compliant, and using a variant Haskell language, include:

• Eta and Frege are dialects of Haskell targeting the Java Virtual Machine.
• Gofer was an educational dialect of Haskell, with a feature called constructor classes, developed by Mark Jones. It was supplanted by Hugs (Haskell User's Gofer System).
• Helium, a newer dialect of Haskell. The focus is on making learning easier via clearer error messages. It currently lacks full support for type classes, rendering it incompatible with many Haskell programs.

## Notable applications

• Cabal is a tool for building and packaging Haskell libraries and programs.[28]
• Darcs is a revision control system written in Haskell, with several innovative features, such as more precise control of patches to apply.
• GHC is also often a testbed for advanced functional programming features and optimizations in other programming languages.
• Git-annex is a tool to manage (big) data files under Git version control. It also provides a distributed file synchronization system (git-annex assistant).
• Linspire GNU/Linux chose Haskell for system tools development.[29]
• Pandoc is a tool to convert one markup format into another.
• Pugs is a compiler and interpreter for the Raku programming language (formerly Perl 6).
• Xmonad is a window manager for the X Window System, written fully in Haskell.[30]

### Industry

• Bluespec SystemVerilog (BSV) is a language for semiconductor design that is an extension of Haskell. Also, Bluespec, Inc.'s tools are implemented in Haskell.
• Cryptol, a language and toolchain for developing and verifying cryptography algorithms, is implemented in Haskell.
• Facebook implements its anti-spam programs[31] in Haskell, maintaining the underlying data access library as open-source software.[32]
• GitHub implemented Semantic, an open-source library for analysis, diffing, and interpretation of untrusted source code, in Haskell.[33]
• seL4, the first formally verified microkernel,[34] used Haskell as a prototyping language for the OS developer.[34]:p.2 At the same time, the Haskell code defined an executable specification with which to reason, for automatic translation by the theorem-proving tool.[34]:p.3 The Haskell code thus served as an intermediate prototype before final C refinement.[34]:p.3

### Web

Notable web frameworks written for Haskell include:[35]

## Criticism

Jan-Willem Maessen, in 2002, and Simon Peyton Jones, in 2003, discussed problems associated with lazy evaluation while also acknowledging the theoretical motives for it.[36][37] In addition to purely practical considerations such as improved performance,[38] they note that, in addition to adding some performance overhead, lazy evaluation makes it more difficult for programmers to reason about the performance of their code (particularly its space use).

Bastiaan Heeren, Daan Leijen, and Arjan van IJzendoorn in 2003 also observed some stumbling blocks for Haskell learners: "The subtle syntax and sophisticated type system of Haskell are a double edged sword – highly appreciated by experienced programmers but also a source of frustration among beginners, since the generality of Haskell often leads to cryptic error messages."[39] To address these, researchers from Utrecht University developed an advanced interpreter called Helium, which improved the user-friendliness of error messages by limiting the generality of some Haskell features, and in particular removing support for type classes.

Ben Lippmeier designed Disciple[40] as a strict-by-default (lazy by explicit annotation) dialect of Haskell with a type-and-effect system, to address Haskell's difficulties in reasoning about lazy evaluation and in using traditional data structures such as mutable arrays.[41] He argues (p. 20) that "destructive update furnishes the programmer with two important and powerful tools ... a set of efficient array-like data structures for managing collections of objects, and ... the ability to broadcast a new value to all parts of a program with minimal burden on the programmer."

Robert Harper, one of the authors of Standard ML, has given his reasons for not using Haskell to teach introductory programming. Among these are the difficulty of reasoning about resource use with non-strict evaluation, that lazy evaluation complicates the definition of datatypes and inductive reasoning,[42] and the "inferiority" of Haskell's (old) class system compared to ML's module system.[43]

Haskell's build tool, Cabal, has historically been criticised for poorly handling multiple versions of the same library, a problem known as "Cabal hell". The Stackage server and Stack build tool were made in response to these criticisms.[44] Cabal itself now has a much more sophisticated build system, heavily inspired by Nix,[45] which became the default with version 3.0.

## Related languages

Clean is a close, slightly older relative of Haskell. Its biggest deviation from Haskell is in the use of uniqueness types instead of monads for I/O and side-effects.

A series of languages inspired by Haskell, but with different type systems, have been developed, including:

Other related languages include:

• Curry, a functional/logic programming language based on Haskell.

• Generic Haskell, a version of Haskell with type system support for generic programming.
• Hume, a strict functional language for embedded systems based on processes as stateless automata over a sort of tuples of one element mailbox channels where the state is kept by feedback into the mailboxes, and a mapping description from outputs to channels as box wiring, with a Haskell-like expression language and syntax.

## Conferences and workshops

The Haskell community meets regularly for research and development activities. The main events are:

Since 2006, a series of organized hackathons has occurred, the Hac series, aimed at improving the programming language tools and libraries.[46]

## References

1. Marlow, Simon (24 November 2009). "Announcing Haskell 2010". Haskell (Mailing list). Retrieved 12 March 2011.
2. Riedel, Herbert (28 April 2016). "ANN: Haskell Prime 2020 committee has formed". Haskell-prime (Mailing list). Retrieved 6 May 2017.
3. Peyton Jones 2003, p. xi
4. Chevalier, Tim (28 January 2008). "anybody can tell me the pronunciation of "haskell"?". Haskell-cafe (Mailing list). Retrieved 12 March 2011.
5. Type inference originally using Hindley-Milner type inference
6. Edward Kmett, Edward Kmett – Type Classes vs. the World
7. Mossberg, Erik (2020-06-08), erkmos/haskell-companies, retrieved 2020-06-22
8. O'Sullivan, Bryan; Goerzen, John; Stewart, Donald Bruce (15 November 2008) (in en). Real World Haskell: Code You Can Believe In. "O'Reilly Media, Inc.". pp. xxviii-xxxi. ISBN 978-0-596-55430-9.
9. "PYPL PopularitY of Programming Language index" (in en). May 2021.
10. Peyton Jones 2003, Preface.
11. "Type classes, first proposed during the design of the Haskell programming language, ..." —John Garrett Morris (2013), "Type Classes and Instance Chains: A Relational Approach"
14. Wadler, P.; Blott, S. (1989). "How to make ad-hoc polymorphism less ad hoc". Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (ACM): 60–76. doi:10.1145/75277.75283. ISBN 978-0-89791-294-5.
15. Hallgren, T. (January 2001). "Fun with Functional Dependencies, or Types as Values in Static Computations in Haskell". Proceedings of the Joint CS/CE Winter Meeting (Varberg, Sweden).
16. Computer Language Benchmarks Game
18. "Implementations" at the Haskell Wiki
19. Terei, David A.; Chakravarty, Manuel M. T. (2010). "An LLVM Backend for GHC". ACM Press.
20. C. Ryder and S. Thompson (2005). "Porting HaRe to the GHC API"
22. Hudak et al. 2007, pp. 12–22.
23. "Linspire/Freespire Core OS Team and Haskell". Debian Haskell mailing list. May 2006.
25. "Fighting spam with Haskell" (in en-US). 26 June 2015.
26. "Open-sourcing Haxl, a library for Haskell" (in en-US). 10 June 2014.
27. Parsing, analyzing, and comparing source code across many languages: github/semantic, GitHub, 7 June 2019, retrieved 7 June 2019
28. A formal proof of functional correctness was completed in 2009. Klein, Gerwin; Elphinstone, Kevin; Heiser, Gernot; Andronick, June; Cock, David; Derrin, Philip; Elkaduwe, Dhammika; Engelhardt, Kai et al. (October 2009). "seL4: Formal verification of an OS kernel". Big Sky, MT, USA.
29. Jan-Willem Maessen. Eager Haskell: Resource-bounded execution yields efficient iteration. Proceedings of the 2002 Association for Computing Machinery (ACM) SIGPLAN workshop on Haskell.
30. Simon Peyton Jones. Wearing the hair shirt: a retrospective on Haskell. Invited talk at POPL 2003.
31. Heeren, Bastiaan; Leijen, Daan; van IJzendoorn, Arjan (2003). "Helium, for learning Haskell". Proceedings of the 2003 ACM SIGPLAN Workshop on Haskell: 62–71. doi:10.1145/871895.871902. ISBN 1581137583.