Newest at the top
| 2025-11-11 16:15:52 +0100 | lucabtz | (~lucabtz@user/lucabtz) lucabtz |
| 2025-11-11 16:15:38 +0100 | ljdarj | (~Thunderbi@user/ljdarj) ljdarj |
| 2025-11-11 16:15:22 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Quit: ljdarj) |
| 2025-11-11 16:14:26 +0100 | lucabtz | (~lucabtz@user/lucabtz) (Remote host closed the connection) |
| 2025-11-11 16:14:13 +0100 | j1n37 | (~j1n37@user/j1n37) j1n37 |
| 2025-11-11 16:08:25 +0100 | Square2 | (~Square4@user/square) (Ping timeout: 240 seconds) |
| 2025-11-11 16:07:25 +0100 | Zemyla | (~Zemyla@72.178.108.235) (Ping timeout: 250 seconds) |
| 2025-11-11 16:05:50 +0100 | spew | (~spew@user/spew) spew |
| 2025-11-11 16:05:25 +0100 | fp | (~Thunderbi@wireless-86-50-140-45.open.aalto.fi) (Ping timeout: 240 seconds) |
| 2025-11-11 16:03:39 +0100 | <Sidney> | Just found it! Thank you so much |
| 2025-11-11 16:02:56 +0100 | gorignak | (~gorignak@user/gorignak) gorignak |
| 2025-11-11 16:02:54 +0100 | <merijn> | And one earlier at 1:00: https://ircbrowse.tomsmeding.com/browse/lchaskell?id=1693741#trid1693741 |
| 2025-11-11 16:02:39 +0100 | gorignak | (~gorignak@user/gorignak) (Client Quit) |
| 2025-11-11 16:02:19 +0100 | <merijn> | Not sure if that's the one you meant |
| 2025-11-11 16:02:13 +0100 | <merijn> | Incidentally, I do see a question from you at 02:42 |
| 2025-11-11 16:02:00 +0100 | <merijn> | Everything in this channel is |
| 2025-11-11 16:01:38 +0100 | <Sidney> | Okay I will go back and check. Are you saying everything in the IRC is recorded so it should be there? |
| 2025-11-11 16:00:49 +0100 | <merijn> | Note that the log timestamps are UTC+1, which might differ from wherever you are |
| 2025-11-11 16:00:23 +0100 | <merijn> | Are you sure you checked the right time? |
| 2025-11-11 15:59:52 +0100 | <merijn> | ah, you did >.> |
| 2025-11-11 15:59:31 +0100 | <merijn> | Sidney: See the logs in the topic |
| 2025-11-11 15:59:12 +0100 | emmanuelux | (~emmanuelu@user/emmanuelux) emmanuelux |
| 2025-11-11 15:58:24 +0100 | <Sidney> | Hi, I asked a few questions here last night but my computer crashed and now I don't have access to the answers I received. They were really high quality, so is there a way I can get access to them? I checked the logs for last night but I did not see any of the conversation. Thanks! |
| 2025-11-11 15:57:55 +0100 | gorignak | (~gorignak@user/gorignak) gorignak |
| 2025-11-11 15:57:38 +0100 | gorignak | (~gorignak@user/gorignak) (Quit: quit) |
| 2025-11-11 15:57:29 +0100 | ouilemur | (~jgmerritt@user/ouilemur) (Quit: WeeChat 4.7.0) |
| 2025-11-11 15:54:07 +0100 | Zemy_ | (~Zemy@72.178.108.235) |
| 2025-11-11 15:54:04 +0100 | Zemy | (~Zemy@72.178.108.235) (Read error: Connection reset by peer) |
| 2025-11-11 15:46:47 +0100 | <Zemyla> | I don't know if this is useful at all, but I'm thinking class Isofunctor f where { isomap :: AnIso' a b -> f a -> f b; (<$>#) :: Coercible a b -> p a b -> f a -> f b; (<$>#) = isomap coerce } |
| 2025-11-11 15:45:09 +0100 | <Zemyla> | You'd need a way to witness the isomorphisms ((), a) ~ a ~ (a, ()) and Either Void a ~ a ~ Either a Void, which is difficult to do with both covariant and contravariant functors. |
| 2025-11-11 15:44:20 +0100 | <haskellbridge> | <Morj> merijn: 99 problems are cool, I'll use them too. But they're lacking lazyness and other haskell-specific things |
| 2025-11-11 15:43:29 +0100 | <Zemyla> | class Times f where { one :: f (); times :: f a -> f b -> f (a, b) }; class Plus f where { zero :: f Void; plus :: f a -> f b -> f (Either a b) } |
| 2025-11-11 15:41:43 +0100 | <Zemyla> | So both covariant and contravariant Functors have notions of two different monoids. |
| 2025-11-11 15:41:06 +0100 | Zemyla | (~Zemyla@72.178.108.235) Zemyla |
| 2025-11-11 15:40:08 +0100 | <haskellbridge> | <Morj> sm: Those are the style I'm looking for, but the quality is not great |
| 2025-11-11 15:39:16 +0100 | <lambdabot> | http://www.haskell.org/haskellwiki/H-99:_Ninety-Nine_Haskell_Problems https://github.com/bitemyapp/learnhaskell http://www.reddit.com/r/dailyprogrammer/ http://www.reddit.com/r/programmingchallenges/ |
| 2025-11-11 15:39:16 +0100 | <merijn> | @where exercises |
| 2025-11-11 15:38:08 +0100 | <haskellbridge> | <Morj> Leary: Thanks, this is the challenges I was thinking about |
| 2025-11-11 15:37:42 +0100 | Putonlalla | (~Putonlall@it-cyan.it.jyu.fi) Tuplanolla |
| 2025-11-11 15:37:28 +0100 | <Leary> | Morj: Perhaps https://github.com/effectfully-ou/haskell-challenges |
| 2025-11-11 15:37:05 +0100 | fp | (~Thunderbi@wireless-86-50-140-45.open.aalto.fi) fp |
| 2025-11-11 15:36:40 +0100 | orizuru | (~orizuru@user/orizuru) (Ping timeout: 256 seconds) |
| 2025-11-11 15:34:48 +0100 | <haskellbridge> | <sm> https://joyful.com/Haskell+map#courses or https://joyful.com/Haskell+map#books might jog the memory |
| 2025-11-11 15:33:31 +0100 | <haskellbridge> | <sm> is another |
| 2025-11-11 15:33:11 +0100 | <haskellbridge> | <sm> https://github.com/l-Shane-l/haskell-katas |
| 2025-11-11 15:32:32 +0100 | <haskellbridge> | <Morj> There was also a whole book for learning haskell, with similar tasks, but more for beginners, and I also forgot its name, would appreciate the guesses |
| 2025-11-11 15:31:57 +0100 | <haskellbridge> | <Morj> There was a popular github repo with several very hard excercises, like «write function that when used with traverse will only go N steps deep into a tree», does anyone remember it? |
| 2025-11-11 15:31:47 +0100 | Sidney | (~Sidney@2600:4040:2678:9600:b1c4:ced3:242d:1252) |
| 2025-11-11 15:31:32 +0100 | fp | (~Thunderbi@2001:708:20:1406::1370) (Remote host closed the connection) |
| 2025-11-11 15:31:31 +0100 | <haskellbridge> | <sm> exercism is good |