Haskell - Simple English Wikipedia, the free encyclopedia

Haskell
Paradigmfunctional, lazy/non-strict, modular
Designed bySimon Peyton Jones, Lennart Augustsson, Dave Barton, Brian Boutel, Warren Burton, Joseph Fasel, Kevin Hammond, Ralf Hinze, Paul Hudak, John Hughes, Thomas Johnsson, Mark Jones, John Launchbury, Erik Meijer, John Peterson, Alastair Reid, Colin Runciman, Philip Wadler
First appeared1990; 35 years ago (1990)
Stable releaseHaskell 2010[1] / July 2010; 14 years ago (2010-07)
Preview releaseAnnounced as Haskell 2014[2]
Typing disciplinestatic, strong, inferred
OSCross-platform
Filename extensions.hs, .lhs
Websitehaskell.org
Major implementations
GHC, Hugs, NHC, JHC, Yhc, UHC
Dialects
Helium, Gofer

Haskell /ˈhæskəl/[3] is a purely functional programming language. It is named after Haskell Brooks Curry, a U.S. mathematician who contributed a lot to logic. Haskell is based on lambda calculus and uses the Greek letter lambda as its logo. The main implementations are the Glasgow Haskell Compiler (GHC), and Hugs, a Haskell interpreter.

Examples

[change | change source]

The following is an example Hello World program in Haskell: 

module Main where  main :: IO () main = putStrLn "Hello, World!"

One way to create an infinite list of Fibonacci numbers is this:[4] 

fib n = fibs !! n         where fibs = 0 : 1 : zipWith (+) fibs (tail fibs)

Concept

[change | change source]

The language is similar to traditional mathematics, in which all variables are pure, meaning they cannot change during the program's runtime. All equations must remain true in principle. For any impure actions, there is the IO monad, which itself is pure, but creates side effects when ran.[5]

Functions are treated like normal values, meaning they can be applied to other functions. 2+ argument functions are fundamentally a one argument function, a function that takes in some input and returns a function in the process of currying. Traditional variables are treated like zero argument functions.

The order of variable declarations within the file does not matter, allowing for mutual recursion, where variables are defined in terms of each other.

Features

[change | change source]

Data Types

[change | change source]
Data Types
Data Type Purpose
Integer A signed integer using arbitrary precision arithmetic, meaning the number can be as large as possible
Char Short for "character". Any character stored in Unicode.
String A list of characters.
Boolean See boolean.
[a] List data type, stored as a linked list.
a -> b Function between data types a and b.
Double and Float Floating point numbers, commonly used for decimals due to its efficiency.

Type Classes

[change | change source]

A type class is a descriptor of a data type. These are used to make functions more general. For example, the addition operator has a type signature of

(+) :: Num a => a -> a -> a

This statement translates to "given some data type that is a number, you can add two variables of that type to create a new one".[6]

Type Classes
Type Class Description Example Functions Example Data Types
Eq a Ensures a data type (in this case, a) can be equated (==): Checks equality between two variables of the same data type Integer, String
Ord a Places order between variables of a data type (>) & (<): Compares two variables of the same data type Integer, Char
Num a Allows for basic mathematical operators between variables of this data type (+), (-), (*) Integer, Float, Double

Lazy Evaluation

[change | change source]

Lazy evaluation is where expressions aren't evaluated immediately, sometimes never evaluated. This allows for infinitely long lists, and avoids unnecessary calculations.[7]

Influence

[change | change source]

Haskell was influenced by many earlier programming languages. These were Clean, FP, Gofer, Hope and Hope+, Id, ISWIM, KRC, Lisp, Miranda, ML and Standard ML, Orwell, SASL, SISAL, and Scheme.[8]

Haskell itself has influenced many later programming languages, such as Agda,[9] Bluespec,[10] C++11/Concepts,[11] C#/LINQ,[12][13][14][15] Cayenne,[12] Clean,[12] Clojure,[16] CoffeeScript,[17] Curry,[12] F#,[18] Isabelle,[12] Java/Generics,[12] Mercury,[12] Perl 6,[19] Python,[12][20] Scala,[12][21] Visual Basic 9.0.[12][13]

References

[change | change source]
  1. ↑ Marlow, Simon (24 November 2009). "Announcing Haskell 2010". Haskell mailing list. Retrieved 12 March 2011.
  2. ↑ Lynagh, Ian (1 May 2013). "Haskell 2014". Haskell-prime mailing list. Retrieved 9 October 2013.
  3. ↑ Chevalier, Tim (28 January 2008). "anybody can tell me the pronuncation of "haskell"?". Haskell-cafe mailing list. Retrieved 12 March 2011.
  4. ↑ "The Fibonacci sequence". HaskellWiki. 2 August 2012. Retrieved 27 March 2013.
  5. ↑ "08-IO". www.cis.upenn.edu. Retrieved 2025-05-28.
  6. ↑ "05-type-classes". www.cis.upenn.edu. Retrieved 2025-05-28.
  7. ↑ "06-laziness". www.cis.upenn.edu. Retrieved 2025-05-28.
  8. ↑ Peyton Jones, Simon, ed. (2003). Haskell 98 Language and Libraries: The Revised Report. Cambridge University Press. p. xi. ISBN 0521826144.
  9. ↑ Norell, Ulf (2008). "Dependently Typed Programming in Agda" (PDF). Gothenburg: Chalmers University. Retrieved 9 February 2012.
  10. ↑ Hudak et al. 2007, p. 12-38,43.
  11. ↑ Stroustrup, Bjarne; Sutton, Andrew (2011). "Design of Concept Libraries for C++" (PDF). Archived from the original (PDF) on 2012-02-10. Retrieved 2013-11-01.
  12. ↑ 12.00 12.01 12.02 12.03 12.04 12.05 12.06 12.07 12.08 12.09 Hudak et al. 2007, pp. 12-45–46.
  13. ↑ 13.0 13.1 Meijer, Erik. "Confessions of a Used Programming Language Salesman: Getting the Masses Hooked on Haskell" (PDF). Oopsla 2007.
  14. ↑ Meijer, Erik (1 October 2009). "C9 Lectures: Dr. Erik Meijer – Functional Programming Fundamentals, Chapter 1 of 13". Channel 9. Microsoft. Archived from the original on 16 June 2012. Retrieved 9 February 2012.
  15. ↑ Drobi, Sadek (4 March 2009). "Erik Meijer on LINQ". InfoQ. San Francisco: C4Media Inc. Retrieved 9 February 2012.
  16. ↑ Hickey, Rich. "Clojure Bookshelf". Listmania!. Amazon.com. Retrieved 9 February 2012.
  17. ↑ Heller, Martin (18 October 2011). "Turn up your nose at Dart and smell the CoffeeScript". JavaWorld. InfoWorld. Archived from the original on 10 February 2012. Retrieved 9 February 2012.
  18. ↑ Syme, Don; Granicz, Adam; Cisternino, Antonio (2007). Expert F#. Apress. p. 2. F# also draws from Haskell particularly with regard to two advanced language features called sequence expressions and workflows.
  19. ↑ "Glossary of Terms and Jargon". Perl Foundation Perl 6 Wiki. The Perl Foundation. Archived from the original on 21 January 2012. Retrieved 9 February 2012.
  20. ↑ Kuchling, A. M. "Functional Programming HOWTO". Python v2.7.2 documentation. Python Software Foundation. Retrieved 9 February 2012.
  21. ↑ Fogus, Michael (6 August 2010). "MartinOdersky take(5) toList". Send More Paramedics. Retrieved 9 February 2012.


Retrieved from "https://simple.wikipedia.org/w/index.php?title=Haskell&oldid=10292188"