Talk:Haskell/Lists II/Archive 1

List comprehensions
I'm reading the book from the beginning, and the List comprehensions part seems way too complicated: particularly because of "(we'll assume that a test for evenness exists called ifEven):" is a bad assumption ;-). If I can't try out the code, I can't experiment with it, and I can't understand it. --gerymate


 * That any better now? --Gwern (contribs) 18:40, 27 October 2006 (UTC)


 * Better for me, but I think, list comprehensions are way too high level for this stage. At this point we haven't learnt control structures, neither

| this | that statements, nor the term "otherwise". "mod" is also new here, but it's all right... I think, list comprehensions shouldn't be in the 'Haskell Basics' section. --gerymate


 * Oh. I didn't even realize that guards hadn't been covered yet. As for mod... it might be rewritable in terms of regular old division (since that's what mod really is). As for 'otherwise', isn't that pretty clear? --Gwern (contribs) 02:09, 28 October 2006 (UTC)

Missing Material
Shouldn't the discussion of lists include a mention of the "head" and "tail" functions? I was completely lost trying to do what I thought was simple list processing (with my only exposure to Haskell so far being this tutorial), until another reference (http://www.cs.utah.edu/~hal/docs/daume02yaht.pdf) mentioned those two functions. I knew there had to be some car/cdr equivalent, and just as car/cdr are among the first Lisp functions you would learn, shouldn't head/tail be mentioned here?

Pattern matching should have been explained a while ago
Please see the notes for contributors. --Digichoron (discuss • contribs) 17:27, 5 April 2011 (UTC)