Show instance for functions - Revision history

Boris: Statement that 2x is faster than x+x is doubtful because generally () is slower than (+), but (*) by power of 2 may be optimized by shifts... New example is more clear I think.

Boris — Fri, 05 Feb 2010 11:21:29 GMT

Statement that 2*x is faster than x+x is doubtful because generally (*) is slower than (+), but (*) by power of 2 may be optimized by shifts... New example is more clear I think.

Lemming: give the lambda expression the fixed type Int -> Int in order to avoid effects of strange Num instance

Lemming — Tue, 18 Dec 2007 21:30:01 GMT

give the lambda expression the fixed type Int -> Int in order to avoid effects of strange Num instance

DonStewart: /* Question */

DonStewart — Tue, 18 Dec 2007 16:59:10 GMT

Question

Lemming: explanation

Lemming — Tue, 18 Dec 2007 14:45:22 GMT

explanation

Show instance for functions - Revision history

Boris: Statement that 2*x is faster than x+x is doubtful because generally (*) is slower than (+), but (*) by power of 2 may be optimized by shifts... New example is more clear I think.

Lemming: give the lambda expression the fixed type Int -> Int in order to avoid effects of strange Num instance

DonStewart: /* Question */

Lemming: explanation

Boris: Statement that 2x is faster than x+x is doubtful because generally () is slower than (+), but (*) by power of 2 may be optimized by shifts... New example is more clear I think.