Show instance for functions: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

curprev 00:3000:30, 1 February 2016‎ Hairy Dude talk contribs‎ 2,884 bytes +27‎ →‎Theoretical answer: this "mathematical" means "set-theoretic"; other notions of function (e.g. Martin-Löf type theory) aren't defined by their graph type theory
curprev 00:2700:27, 1 February 2016‎ Hairy Dude talk contribs‎ 2,857 bytes +76‎ →‎Practical answer: optimized to nothing

curprev 18:5218:52, 25 February 2015‎ Dmwit talk contribs‎ 2,781 bytes +165‎ →‎Theoretical answer

curprev 11:2111:21, 5 February 2010‎ Boris talk contribs‎ m 2,616 bytes −11‎ 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.

curprev 21:3021:30, 18 December 2007‎ Lemming talk contribs‎ 2,627 bytes +28‎ give the lambda expression the fixed type Int -> Int in order to avoid effects of strange Num instance
curprev 16:5916:59, 18 December 2007‎ DonStewart talk contribs‎ 2,599 bytes +257‎ →‎Question
curprev 14:4514:45, 18 December 2007‎ Lemming talk contribs‎ 2,342 bytes +2,342‎ explanation

1 February 2016

25 February 2015

5 February 2010

18 December 2007