Hope (programming language): Difference between revisions

Revision as of 11:43, 24 September 2007

Revision as of 18:12, 8 February 2008

Line 9:

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 being inferred by a type-inference algorithm.

The first implementation of Hope was [[strict evaluation|strict]], but since that one there have been [[lazy evaluation|lazy]] versions and strict versions with lazy constructors.