2026/02/25

Newest at the top

2026-02-25 15:33:16 +0100 <dminuoso> mauke: Now that you mention it, I actually recall some obscure haskell report facts about this.
2026-02-25 15:33:00 +0100 <mauke> I'm pretty sure I've done something like this before
2026-02-25 15:32:53 +0100 <mauke> (f, g) = fix (... some nonsense ...)
2026-02-25 15:32:07 +0100 <dminuoso> I mean it feels obvious and nice, it just never occured to me...
2026-02-25 15:31:53 +0100dminuosois baffled
2026-02-25 15:31:50 +0100 <dminuoso> o.o
2026-02-25 15:31:48 +0100 <yahb2> <no output>
2026-02-25 15:31:48 +0100 <dminuoso> % x :: Int; [x] = [1]
2026-02-25 15:31:47 +0100 <mauke> well, that's a type error
2026-02-25 15:31:45 +0100 <dminuoso> Oh
2026-02-25 15:31:38 +0100 <dminuoso> I cant do that.
2026-02-25 15:31:33 +0100 <yahb2> <interactive>:7:17: error: [GHC-39999] ; • No instance for ‘Num [Int]’ arising from the literal ‘1’ ; • In the expression: 1 ; In a pattern binding: [x] = 1
2026-02-25 15:31:33 +0100 <dminuoso> % x :: Int; [x] = 1
2026-02-25 15:31:22 +0100 <dminuoso> mauke: Yeah but..
2026-02-25 15:31:21 +0100 <lambdabot> "hello"
2026-02-25 15:31:20 +0100 <__monty__> > let [x] = ["hello"] in x
2026-02-25 15:31:11 +0100 <mauke> (:) x _ = [1,2,3]
2026-02-25 15:30:49 +0100 <mauke> pattern matching/binding
2026-02-25 15:29:08 +0100 <dminuoso> Or rather, PS is a pattern and BS is a constructor..
2026-02-25 15:28:32 +0100 <dminuoso> But neither is PatternSynonyms enabled, nor are there any macros introduced in that file
2026-02-25 15:28:15 +0100 <dminuoso> I mean PS/BS are pattern synonyms..
2026-02-25 15:27:54 +0100 <__monty__> dminuoso: CPP-aided crimes?
2026-02-25 15:26:12 +0100rainbyte(~rainbyte@186.22.19.214) rainbyte
2026-02-25 15:24:37 +0100 <dminuoso> What kind of syntax is that?
2026-02-25 15:24:34 +0100 <dminuoso> BS decodeFP _ =
2026-02-25 15:24:30 +0100 <dminuoso> https://hackage.haskell.org/package/base64-bytestring-1.2.1.0/docs/src/Data.ByteString.Base64.html - at the bottom there is a definition for decodePF
2026-02-25 15:24:19 +0100lbseale(~quassel@user/ep1ctetus) ep1ctetus
2026-02-25 15:23:35 +0100lbseale(~quassel@user/ep1ctetus) (Client Quit)
2026-02-25 15:20:53 +0100lbseale(~quassel@user/ep1ctetus) ep1ctetus
2026-02-25 15:18:14 +0100 <aka_dude> Hey. I want to talk to mentor of https://summer.haskell.org/ideas.html#ui-layout-library-for-haskell proposal, Adrian Sieber (ad-si). Do you know where can I reach him?
2026-02-25 15:18:13 +0100 <dutchie> `asum [liftA2 min mx my, mx, my]`?
2026-02-25 15:17:22 +0100 <dutchie> `liftA2 min` is almost exactly the wrong thing
2026-02-25 15:16:45 +0100 <dutchie> is there a good way to write `lesserPresent :: Ord a => Maybe a -> Maybe a -> Maybe a` that returns the minimum? currently doing silly things with maybeToList and minimum
2026-02-25 15:14:35 +0100Wanderer(~wanderer@user/wanderer) Wanderer
2026-02-25 15:11:39 +0100Wanderer(~wanderer@user/wanderer) (Server closed connection)
2026-02-25 15:09:43 +0100uli-fem(~uli-fem@118.210.1.123) (Ping timeout: 268 seconds)
2026-02-25 15:06:03 +0100Pozyomka(~pyon@user/pyon) pyon
2026-02-25 15:01:41 +0100Pozyomka(~pyon@user/pyon) (Quit: brb)
2026-02-25 14:59:12 +0100uli-fem(~uli-fem@118.210.1.123)
2026-02-25 14:43:31 +0100uli-fem(~uli-fem@118.210.1.123) (Ping timeout: 264 seconds)
2026-02-25 14:38:55 +0100uli-fem(~uli-fem@118.210.1.123)
2026-02-25 14:36:20 +0100 <probie> I think other representations make it a headache if you're not willing to specify what a `Char` actually is
2026-02-25 14:27:13 +0100housemate(~housemate@202.7.248.67) housemate
2026-02-25 14:23:46 +0100bggd_(~bgg@2a01:e0a:fd5:f510:37b0:d42d:8afb:890)
2026-02-25 14:23:40 +0100uli-fem(~uli-fem@118.210.1.123) (Ping timeout: 265 seconds)
2026-02-25 14:23:14 +0100qqq(~qqq@185.54.22.240) (Ping timeout: 268 seconds)
2026-02-25 14:18:43 +0100uli-fem(~uli-fem@118.210.1.123)
2026-02-25 14:17:24 +0100 <dminuoso> I feel like String was a bad idea to begin with.
2026-02-25 14:17:18 +0100housemate(~housemate@202.7.248.67) (Quit: https://ineedsomeacidtocalmmedown.space/)
2026-02-25 14:17:14 +0100 <dminuoso> Im not entirely sure all excuses are good at the end.