Conversation

Notices

1. clacke (clacke@social.heldscal.la)'s status on Tuesday, 05-Dec-2017 04:38:22 EST clacke
   @pho4cexa Things like list comprehension syntax basically aren't a thing in curried languages like Haskell, because functions are so composable you can express it in the base syntax.
   
   And of course, in a lazy language generators aren't a thing because what would be arrays behave like generators.
   1. kat (kat@quitter.se)'s status on Tuesday, 05-Dec-2017 06:19:09 EST kat

      in reply to
      @clacke @pho4cexa defo list comprehension in Haskell 
       [ x*x | x <- [1..10]]
      
      [1,4,9,16,25,36,49,64,81,100]
      1. clacke (clacke@social.heldscal.la)'s status on Tuesday, 05-Dec-2017 06:28:02 EST clacke

         in reply to
         @kat @pho4cexa Schooled! Thank you.
         1. clacke (clacke@social.heldscal.la)'s status on Tuesday, 05-Dec-2017 06:33:05 EST clacke

            in reply to
            @kat @pho4cexa Ah! But is that using the List monad and not the LISP-like lists matched like x:xs?
            1. clacke (clacke@social.heldscal.la)'s status on Tuesday, 05-Dec-2017 06:41:02 EST clacke

               in reply to
               @kat @pho4cexa Ok, they seem to be the same thing.
               
               > Prelude> let head x:xs = x
               > Prelude> head [(+1) i | i <- [1..]]
               > 2
               1. clacke (clacke@social.heldscal.la)'s status on Tuesday, 05-Dec-2017 06:44:12 EST clacke

                  in reply to
                  @kat @pho4cexa In my trivial example though, I'm not so sure the comprehension buys any readability. This is shorter and less cluttered:
                  
                  > Prelude> head . map (+1) $ [1..]
                  > 2
            2. kat (kat@quitter.se)'s status on Tuesday, 05-Dec-2017 06:41:06 EST kat

               in reply to
               @clacke @pho4cexa http://qttr.at/20nx  http://qttr.at/20nw Lists are just nested con? It's part of Prelude.
               1. clacke (clacke@social.heldscal.la)'s status on Tuesday, 05-Dec-2017 06:46:28 EST clacke

                  in reply to
                  @kat @pho4cexa Seems that way. I just wrote my first couple of lines of this language, so. :-)
                  
                  Apparently head is actually called head, so no need to define it. :-)
                  1. kat (kat@quitter.se)'s status on Tuesday, 05-Dec-2017 06:49:49 EST kat

                     in reply to
                     @clacke @pho4cexa Oh me too, I just started with it, after playing with Python lambda calculus over the summer. http://qttr.at/20ny
               2. clacke (clacke@social.heldscal.la)'s status on Tuesday, 05-Dec-2017 06:51:27 EST clacke

                  in reply to
                  @kat @pho4cexa Seems it's both. Intriguing!
                  
                  Prelude> head $ [1..] >>= return . (+1)
                  2