2026/01/22

Newest at the top

2026-01-22 04:05:36 +0100 <haskellbridge> <iqubic (she/her)> How can I fix my code here?
2026-01-22 04:05:33 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds)
2026-01-22 04:05:06 +0100 <geekosaur> yeh, I have no clue about LML
2026-01-22 04:04:55 +0100Raito_Bezarius(~Raito@libera/contributor/wireguard.tunneler.raito-bezarius) (Ping timeout: 245 seconds)
2026-01-22 04:04:15 +0100 <geekosaur> xs :: [a]
2026-01-22 04:04:10 +0100 <geekosaur> map (x:) (drop1 xs) :: [[a]] -> [[a]]
2026-01-22 04:04:09 +0100 <EvanR> (unlikely to still be available and functioning)
2026-01-22 04:03:50 +0100 <EvanR> rather the compiler for it
2026-01-22 04:03:49 +0100 <geekosaur> drop1 :: [a] -> [[a]]
2026-01-22 04:03:43 +0100 <EvanR> and lazy ML was written in
2026-01-22 04:03:19 +0100 <haskellbridge> <iqubic (she/her)> drop1 (x:xs) = xs ++ map (x:) (drop1 xs)
2026-01-22 04:03:14 +0100 <haskellbridge> <iqubic (she/her)> geekosaur: Am I missing something obvious here?
2026-01-22 04:02:54 +0100 <geekosaur> I think there's an ancient i386 binary for HBC somewhere, but no source and no guarantee the binary would run on modern systems
2026-01-22 04:02:29 +0100Inline(~User@2001-4dd6-dd24-0-288a-d894-752e-65cf.ipv6dyn.netcologne.de) Inline
2026-01-22 04:01:25 +0100 <geekosaur> ghc was originally written in HBC, a now lost compiler which was itself written in Lazy ML
2026-01-22 04:01:10 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-22 03:59:25 +0100 <haskellbridge> <iqubic (she/her)> I'm so lost here... What am I missing?
2026-01-22 03:58:59 +0100 <haskellbridge> <iqubic (she/her)> I'm trying to use the head of the iinput.
2026-01-22 03:58:56 +0100 <haskellbridge> <Nguyễn Trọng Cường> I have a really stupid question: Is the very first GHC executable written in C? I analysed some modern GHC programs by Detect It Easy and all of them are flagged as "C" and "MinGW"
2026-01-22 03:58:32 +0100 <geekosaur> rename the one in map, maybe it'll be a bit clearer (its "[a]" unifies with the "[[a]]" from drop1)
2026-01-22 03:58:20 +0100 <haskellbridge> <iqubic (she/her)> xxs?
2026-01-22 03:57:56 +0100 <geekosaur> xxs is only [a], not [[a]]
2026-01-22 03:57:35 +0100 <haskellbridge> <iqubic (she/her)> I fail to see the issue here.
2026-01-22 03:57:30 +0100 <haskellbridge> <iqubic (she/her)> (drop1 xs) :: [[a]]
2026-01-22 03:56:57 +0100 <haskellbridge> <iqubic (she/her)> (x:) :: [a] -> [a]
2026-01-22 03:56:36 +0100vidak(~vidak@2407:e400:7800:2c01:d0be:76f8:cc84:bd4a) (Remote host closed the connection)
2026-01-22 03:56:20 +0100 <haskellbridge> <iqubic (she/her)> I have "map (x:) (drop1 xs)"
2026-01-22 03:53:46 +0100 <geekosaur> xs is [a], drop1 xs is [[a]], map's result type will be the same as its input type as (x:) simply prepends to the inner lists
2026-01-22 03:53:04 +0100 <haskellbridge> <iqubic (she/her)> drop1 [1,2,3] -> [[2,3], [1,3], [1,2]]
2026-01-22 03:52:47 +0100 <haskellbridge> <iqubic (she/her)> I want a function that computes all the ways to drop a single element from a list.
2026-01-22 03:49:55 +0100 <haskellbridge> <iqubic (she/her)> Why isn't this compiling? https://paste.tomsmeding.com/7dBnZHnU
2026-01-22 03:49:51 +0100typedfern_(~Typedfern@192.red-83-37-37.dynamicip.rima-tde.net) (Ping timeout: 244 seconds)
2026-01-22 03:49:51 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds)
2026-01-22 03:49:20 +0100Inline(~User@2001-4dd6-dd24-0-41c1-f819-9bd9-d884.ipv6dyn.netcologne.de) (Ping timeout: 244 seconds)
2026-01-22 03:48:56 +0100tremon(~tremon@83.80.159.219) (Quit: getting boxed in)
2026-01-22 03:48:44 +0100 <haskellbridge> <iqubic (she/her)> What's the list comprehension version?
2026-01-22 03:47:40 +0100humasect(~humasect@dyn-192-249-132-90.nexicom.net) (Remote host closed the connection)
2026-01-22 03:45:49 +0100 <geekosaur> list monad with no actions is Cartesian product. maybe you'd find the list comprehension version easier to interpret?
2026-01-22 03:43:08 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-22 03:32:13 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds)
2026-01-22 03:31:58 +0100vidak(~vidak@2407:e400:7800:2c01:d0be:76f8:cc84:bd4a) vidak
2026-01-22 03:30:44 +0100 <haskellbridge> <iqubic (she/her)> But sequenceA "foldr (liftA2 (:)) (pure [])" is a Cartesian product, and I'm not sure why.
2026-01-22 03:29:58 +0100 <haskellbridge> <iqubic (she/her)> Erm... not that. It's late and I'm tired.
2026-01-22 03:29:06 +0100 <haskellbridge> <iqubic (she/her)> "cart [[11,12], [21,22]]" is "[[11,21,22],[12,21,22]]"
2026-01-22 03:28:17 +0100 <haskellbridge> <iqubic (she/her)> How does that compute a Cartesian product though?
2026-01-22 03:27:21 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-22 03:27:20 +0100 <haskellbridge> <iqubic (she/her)> I see... that's very similar to "foldr (:) []", but with applicative actions.
2026-01-22 03:26:47 +0100vidak(~vidak@2407:e400:7800:2c01:d0be:76f8:cc84:bd4a) (Remote host closed the connection)
2026-01-22 03:25:17 +0100 <monochrom> I might rewrite "[[]]" as "pure []".
2026-01-22 03:23:49 +0100 <haskellbridge> <iqubic (she/her)> And "foldr (liftA2 (:)) [[]]" does the same thing.