|
m clarify Linspire usage
|
m →See also: wikibook naming convention update
|
||
| Line 125: | Line 125: | ||
==See also== |
==See also== |
||
{{ |
{{Wikibooks|Haskell}} |
||
*[[O'Haskell]] is an extension of Haskell adding [[object-oriented programming|object-orientation]] and [[concurrent programming]] support. |
*[[O'Haskell]] is an extension of Haskell adding [[object-oriented programming|object-orientation]] and [[concurrent programming]] support. |
||
 | |
| Paradigm | functional, non-strict, modular |
|---|---|
| First appeared | 1998 |
| Typing discipline | strong, static |
| Website | www |
| Major implementations | |
| GHC, Hugs, NHC, JHC, Yhc | |
| Dialects | |
| -- | |
| Influenced by | |
| Miranda, ML, Gofer | |
| Influenced | |
| Python | |
Haskell is a standardized pure functional programming language with non-strict semantics, named after the logician Haskell Curry. It was created by a committee formed in 1987 for the express purpose of defining such a language. The direct predecessor of Haskell was Miranda, devised in 1985. The latest official language standard outside the standardization organizations is Haskell 98, intended to specify a minimal, portable version of the language for teaching and as a base for future extensions.
The language continues to evolve rapidly, with Hugs and GHC (see below) representing the current de facto standard.
Characterizing syntax features in Haskell include pattern matching, currying, list comprehensions, guards, and definable operators. The language also supports recursive functions and algebraic data types, as well as lazy evaluation. Unique concepts include monads, and type classes. The combination of such features can make functions which would be difficult to write in a procedural programming language almost trivial to implement in Haskell.
The language is, as of 2002, the lazy functional language on which the most research is being performed. Several variants have been developed: parallelizable versions from MIT and Glasgow, both called Parallel Haskell; more parallel and distributed versions called Distributed Haskell (formerly Goffin) and Eden; a speculatively evaluating version called Eager Haskell and several object oriented versions: Haskell++, O'Haskell and Mondrian.
There is also a Haskell-like language that offers a new method of support for GUI development called Concurrent Clean. Its biggest deviation from Haskell is in the use of uniqueness types for input instead of monads.
Although Haskell has a comparatively small user community, its strengths have been well applied to a few projects. Audrey Tang's Pugs is an implementation for the forthcoming Perl 6 language with an interpreter and compilers that proved useful already after just a few months of its writing. Darcs is a revision control system, with several innovative features. Linspire GNU/Linux chose Haskell for system tools development [1].
A simple example that is often used to demonstrate the syntax of functional languages is the factorial function, shown in Haskell:
fac :: Integer -> Integer fac 0 = 1 fac n | n > 0 = n * fac (n-1)
Or in a single line:
let { fac 0 = 1; fac n | n > 0 = n * fac (n-1) }
This describes the factorial as a recursive function, with a single terminating base case. It is similar to the descriptions of factorials found in mathematics textbooks. Much of Haskell code is similar to standard mathematical notation in facility and syntax.
The first line of the factorial function shown is optional, and describes the types of this function. It can be read as the function fac (fac) has type (::) from integer to integer (Integer -> Integer). That is, it takes an integer as an argument, and returns another integer. The type of a definition is inferred automatically if the programmer didn't supply a type annotation.
The second line relies on pattern matching, an important feature of Haskell. Note that parameters of a function are not in parentheses but separated by spaces. When the function's argument is 0 (zero) it will return the integer 1 (one). For all other cases the third line is tried. This is the recursion, and executes the function again until the base case is reached.
Aguard protects the third line from negative numbers for which a factorial is undefined. Without the guard this function would recurse through all negative numbers without ever reaching the base case of 0. As it is, the pattern matching is not complete: if a negative integer is passed to the fac function as an argument, the program will fail with a runtime error. A final case could check for this error condition and print an appropriate error message instead.
The "Prelude" is a number of small functions analogous to C's standard library. Using the Prelude and writing in the point-free style of unspecified arguments, it becomes:
fac = product . enumFromTo 1
A simple way to test such examples in the Hugs interpreter, as opposed to writing and compiling a full Haskell program, is to use a "where" clause. Enter the function name and parameters followed by where and then the function definition.
fac 5 where fac = product . enumFromTo 1
The above is close to mathematical definitions such as f = g oh (see function composition), and indeed, it is not an assignment of a value to a variable.
A simple RPN calculator expressed with a higher-order function whose argument f is defined in a where clause using pattern matching and the type class Read:
calc :: String -> [Float]
calc = foldl f [] . words
where
f (x:y:zs) "+" = y+x:zs
f (x:y:zs) "-" = y-x:zs
f (x:y:zs) "*" = y*x:zs
f (x:y:zs) "/" = y/x:zs
f xs y = read y : xs
The empty list is the initial state, and f interprets one word at a time, either matching two numbers from the head of the list and pushing the result back in, or parsing the word as a floating-point number and prepending it to the list.
The following definition produces the list of Fibonacci numbers in linear time:
fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
The infinite list is produced by corecursion — the latter values of the list are computed on demand starting from the initial two items 0 and 1. This kind of a definition is an instance of lazy evaluation and an important part of Haskell programming. For an example of how the evaluation resolves, the following illustrates the values of fibs and tail fibs after the computation of six items and shows how zipWith (+) has produced four items and proceeds to produce the next item:
fibs = 0 : 1 : 1 : 2 : 3 : 5 : ...
+ + + + + +
tail fibs = 1 : 1 : 2 : 3 : 5 : ...
= = = = = =
zipWith ... = 1 : 2 : 3 : 5 : 8 : ...
fibs = 0 : 1 : 1 : 2 : 3 : 5 : 8 : ...
The same function, written using GHC's parallel list comprehension syntax (GHC extensions must be enabled using a special command-line flag; see GHC's manual for more):
fibs = 0 : 1 : [ a+b | a <- fibs | b <- tail fibs ]
The factorial we saw previously can be written as a sequence of functions:
fac n = (foldl (.) id [\x -> x*k | k <- [1..n]]) 1
A remarkably concise function that returns the list of Hamming numbers in order:
hamming = 1 : map (*2) hamming # map (*3) hamming # map (*5) hamming
where xxs@(x:xs) # yys@(y:ys)
| x==y = x : xs#ys
| x<y = x : xs#yys
| x>y = y : xxs#ys
Like the various fibs solutions displayed above, this uses corecursion to produce a list of numbers on demand, starting from the base case of 1 and building new items based on the preceding part of the list.
In this case the producer is defined in a where clause as an infix operator represented by the symbol #. Apart from the different application syntax, operators are like functions whose name consists of symbols instead of letters.
Each vertical bar | starts a guard clause with a guard before the equals sign and the corresponding definition after the equals sign. Together, the branches define how # merges two ascending lists into one ascending list without duplicate items.
Haskell has many advanced features not found in many other programming languages, but some of these features have been criticized as making the language too complex or difficult to understand. In particular, critiques levelled against functional programming languages and non-mainstream programming languages are applicable to Haskell. In addition, there are complaints stemming from the purity of Haskell and its theoretical roots.
Jan-Willem Maessen in 2002 and Simon Peyton Jones in 2003 discuss problems associated with lazy evaluation whilst also acknowledging the theoretical motivation for it. They note that, in addition to adding some performance overhead, laziness makes it more difficult for programmers to reason about the performance of their code.
Bastiaan Heeren, Daan Leijen, and Arjan van IJzendoorn in 2003 also observed some stumbling blocks for Haskell learners. To address these, they 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.
The following all comply fully, or very nearly, with the Haskell 98 standard, and are distributed under open source licenses. There are currently no commercial Haskell implementations.
