At 10:00 PM -0600 2/8/02, Eray Ozkural (exa) wrote:
...
And as I had pointed out before, that tutorial is not at all the brightest
piece of introductory documentation when you compare it to certain printed
texts for Haskell programming language.
That comparison is not valid. In its introduction,
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sunday 10 February 2002 17:12, Hamilton Richards wrote:
So the reader is adequately warned that this is not an introduction to
functional programming. One who stumbles into a tutorial for which he is
not yet ready does himself no credit by
You are, of course, welcome to write a new tutorial that remedies the
deficiencies you find in the original. I encourage you to do so.
Eray Ozkural (exa) wrote:
Thanks for pointing out. Nevertheless, the tutorial does have room for
improvement.
--brian
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Tuesday 05 February 2002 21:08, Paul Hudak wrote:
Well, I cannot speak for the other references, since I did not write
them :-). On the other hand, stream processing *is* a stylistic way to
write certain kinds of functional programs, with the
I am new to functional programming and teaching myself Haskell. The
canonical Haskell fib function (e.g. as presented in the Gentle
tutorial) is:
fib = 1 : 1 : [ a+b | (a,b) - zip fib (tail fib) ]
This seems, to be polite, a bit overly complex. By comparison, here
is a simpler version:
The only reason the first version of fib was used in the Gentle Intro
was to demonstrate recursive stream processing, and not to show a
canonical version of Fibonacci. Indeed, the sentence preceeding it
says: For another example of the use of circularity, the Fibonacci
sequence can be computed
The only reason the first version of fib was used in the Gentle Intro was
to
demonstrate recursive stream processing...
Thank you for the explanation.
For reference, the fib example occurs in a section (3.4) titled 'Infinite'
Data Structures, of which I believe the simpler function is also an
In any case, as a newbie, I can tell you that I found the fib
function puzzling as stated.
...and not to show a canonical version of Fibonacci
Nonetheless, it seems to have become the canonical version. For
example, see the list of references to this version on Google:
On Tuesday 05 February 2002 09:40 am, Brian Berns wrote:
I am new to functional programming and teaching myself Haskell. The
canonical Haskell fib function (e.g. as presented in the Gentle
tutorial) is:
fib = 1 : 1 : [ a+b | (a,b) - zip fib (tail fib) ]
This seems, to be polite, a bit
On Tuesday, February 5, 2002, at 02:16 , Jeffrey R Lewis wrote:
On Tuesday 05 February 2002 09:40 am, Brian Berns wrote:
I am new to functional programming and teaching myself Haskell. The
canonical Haskell fib function (e.g. as presented in the Gentle
tutorial) is:
fib = 1 : 1 : [
10 matches
Mail list logo
