12 Sep 2001 12:37:25 -0000, [EMAIL PROTECTED] <[EMAIL PROTECTED]> 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 * [EMAIL PROTECTED] http://qrczak.ids.net.pl/ \__/ ^^ SYGNATURA ZASTĘPCZA QRCZAK _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
- The future of Haskell discussion S . J . Thompson
- Re: The future of Haskell discussion Marcin 'Qrczak' Kowalczyk
- Re: The future of Haskell discussion Olaf Chitil
- Re: The future of Haskell discussion kahl
- Re: The future of Haskell discussion Mark Carroll
- Re: The future of Haskell discussion Marcin 'Qrczak' Kowalczyk
- Re: The future of Haskell discussion Manuel M. T. Chakravarty
- Re: The future of Haskell discussion C.Reinke
- Re: The future of Haskell discussion S. Alexander Jacobson
- Re: The future of Haskell discussion Mark Carroll
- Re: The future of Haskell discussion Frank Atanassow
- Re: The future of Haskell discussion Wolfgang Jeltsch
- RE: The future of Haskell discussion brk
- Re: The future of Haskell discussion Manuel M. T. Chakravarty
- Re: The future of Haskell discussion Mark Carroll