Content deleted Content added
added comment about explicit declarations |
m Robot-assisted disambiguation (you can help!): Haskell programming language |
||
Line 1:
'''Hope''' is a small [[functional (programming)|functional]] [[programming language]] developed in the early 1980s prior to [[Miranda programming language|Miranda]] and [[Haskell (programming language)|Haskell]]. It is notable for being the first language with call-by-pattern evaluation and [[algebraic data type]]s. Although Hope is no longer used, it is an important language in the development of functional programming.
A Hope tutorial by Roger Bailey was featured in the August [[1985]] issue of [[Byte magazine|Byte]] on [[declarative programming]].
Line 7:
--- fact 0 <= 1;
--- fact n <= n*fact(n-1);
Unlike in [[Haskell (programming language)|Haskell]], changing the order of the clauses would not change the meaning of the program, because Hope's pattern matching always favors more specific patterns over less specific ones.
Another way in which Hope differs from Haskell and ML, is that types in Hope are explicitly declared, rather than inferred by a type-inference algorithm.
| |||