The future of Haskell discussion

[Marcin 'Qrczak' Kowalczyk]

12 Sep 2001 12:37:25 -0000, kahl@heraklit.informatik.unibw-muenchen.de <kahl@heraklit.informatik.unibw-muenchen.de> pisze:

> * Currently HOPS implements only one evaluation strategy,
>   namely leftmost outermost graph rewriting with sharing preservation
>   (without automatic sharing maximisation).
>   With the standard rules in place, this corresponds
>   to the original definition of lazy evaluation
>   (also known as the ``D-rule''), which is different
>   from the lazy pattern matching evaluation
>   of sequential Haskell implementations.

What is the difference?

-- 
 __("<  Marcin Kowalczyk * qrczak@knm.org.pl http://qrczak.ids.net.pl/
 \__/
  ^^                      SYGNATURA ZASTĘPCZA
QRCZAK