2026/05/02

Newest at the top

2026-05-02 06:37:07 +0000tusko(~uwu@user/tusko) tusko
2026-05-02 06:35:12 +0000 <[exa]> mesaoptimizer: depends on the amount of advanced stuff you need to push in
2026-05-02 06:35:10 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds)
2026-05-02 06:30:21 +0000tusko(~uwu@user/tusko) (Ping timeout: 265 seconds)
2026-05-02 06:30:16 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-05-02 06:25:08 +0000LdyIQ(~SaintGena@user/SaintGenavieve) (Quit: Leaving)
2026-05-02 06:23:13 +0000connrs(~connrs@user/connrs) connrs
2026-05-02 06:23:06 +0000connrs(~connrs@user/connrs) (Remote host closed the connection)
2026-05-02 06:19:46 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 256 seconds)
2026-05-02 06:15:19 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-05-02 06:12:55 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds)
2026-05-02 06:06:19 +0000tusko(~uwu@user/tusko) tusko
2026-05-02 06:06:02 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-05-02 05:52:48 +0000 <mesaoptimizer> oh, waaaaaaaaaai and servant exist
2026-05-02 05:52:21 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 255 seconds)
2026-05-02 05:47:58 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-05-02 05:47:35 +0000alter2000(~alter2000@user/alter2000) alter2000
2026-05-02 05:47:17 +0000 <mesaoptimizer> is scotty the current recommended web server for serving a backend?
2026-05-02 05:46:57 +0000puke(~puke@user/puke) puke
2026-05-02 05:40:00 +0000craunts795335385(~craunts@152.32.100.66)
2026-05-02 05:38:55 +0000craunts795335385(~craunts@152.32.100.66) (Client Quit)
2026-05-02 05:38:35 +0000puke(~puke@user/puke) (Quit: puke)
2026-05-02 05:37:54 +0000craunts795335385(~craunts@152.32.100.66)
2026-05-02 05:35:42 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds)
2026-05-02 05:31:14 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-05-02 05:26:32 +0000 <gentauro> janus: if I already defined a Monoid, I can use this instead of `fold` if I just want to perform the binary op the types placed in a list
2026-05-02 05:25:54 +0000bkani(~bkani@user/bkani) (Ping timeout: 246 seconds)
2026-05-02 05:25:39 +0000 <yahb2> type Monoid :: * -> Constraint ; class Semigroup a => Monoid a where ; ... ; mconcat :: [a] -> a ; -- Defined in ‘GHC.Internal.Base’
2026-05-02 05:25:39 +0000 <gentauro> % :i mconcat
2026-05-02 05:25:30 +0000 <yahb2> Oops, something went wrong
2026-05-02 05:25:30 +0000 <gentauro> % :t mconcat
2026-05-02 05:23:29 +0000machinedgod(~machinedg@d172-219-48-230.abhsia.telus.net) (Ping timeout: 265 seconds)
2026-05-02 05:21:48 +0000bkani(~bkani@user/bkani) bkani
2026-05-02 05:19:32 +0000alhazrod(uid662262@user/alhazrod) (Quit: Connection closed for inactivity)
2026-05-02 05:13:11 +0000Eoco(~ian@128.101.131.218) Eoco
2026-05-02 05:10:38 +0000Eoco(~ian@128.101.131.218) (Ping timeout: 252 seconds)
2026-05-02 05:01:50 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds)
2026-05-02 05:00:52 +0000 <LdyIQ> also permutations are super basic that's just a permutation group
2026-05-02 04:58:06 +0000 <EvanR> monads for nothing and theorems for free
2026-05-02 04:56:55 +0000 <LdyIQ> that's like the basis for a lot of algebraic geometry
2026-05-02 04:56:45 +0000 <LdyIQ> monochrom, huh? free structures model combinatorics all the time
2026-05-02 04:56:38 +0000merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-05-02 04:56:23 +0000s00pcan(~s00pcan@24.73.63.94) (Remote host closed the connection)
2026-05-02 04:51:36 +0000jmcantrell_(~weechat@user/jmcantrell) (Ping timeout: 246 seconds)
2026-05-02 04:48:55 +0000emaczen(~user@user/emaczen) (Ping timeout: 264 seconds)
2026-05-02 04:39:24 +0000takuan(~takuan@d8D86B9E9.access.telenet.be)
2026-05-02 04:38:32 +0000monochrom(~trebla@216.138.220.146) monochrom
2026-05-02 04:34:46 +0000monochrom(~trebla@216.138.220.146) (Quit: ZNC 1.9.1+deb2build5 - https://znc.in)
2026-05-02 04:33:21 +0000 <monochrom> If you have heard of "free" and know what it means, then algebraic data types model free structures in combinatorics, e.g., sequences and trees. However, "clearly", they don't model non-free, quotiented-out structures such as combinations and permutations.
2026-05-02 04:26:44 +0000acidjnk(~acidjnk@p200300d6e700e502cdc9d306f6c67f69.dip0.t-ipconnect.de) acidjnk