Difference between revisions of "Lenny222/About Haskell"
Jump to navigation
Jump to search
Line 15: | Line 15: | ||
| ? |
| ? |
||
|- |
|- |
||
⚫ | |||
⚫ | |||
| ? |
| ? |
||
| ? |
| ? |
||
Line 24: | Line 24: | ||
|- |
|- |
||
| pattern matching |
| pattern matching |
||
+ | | Example: |
||
⚫ | |||
⚫ | |||
⚫ | |||
− | |||
− | |||
− | === functional === |
||
− | |||
− | === pure === |
||
− | |||
− | === Pattern matching === |
||
− | |||
fib 0 = 0 |
fib 0 = 0 |
||
fib 1 = 1 |
fib 1 = 1 |
||
fib n = fib (n - 2) + fib (n - 1) |
fib n = fib (n - 2) + fib (n - 1) |
||
+ | | |
||
− | |||
+ | |- |
||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
⚫ | |||
== Users == |
== Users == |
Revision as of 11:56, 9 July 2009
Haskell
is a programming language with the following properties:
Feature | What does it mean? | What is it good for? |
---|---|---|
functional | ? | ? |
lambda functions | ? | ? |
lazy | ? | ? |
pattern matching | Example:
fib 0 = 0 fib 1 = 1 fib n = fib (n - 2) + fib (n - 1) |
|
pure | ? | ? |