Newest at the top
| 2025-11-18 15:02:25 +0100 | srazkvt | (~sarah@user/srazkvt) (Ping timeout: 264 seconds) |
| 2025-11-18 15:01:38 +0100 | trickard_ | (~trickard@cpe-62-98-47-163.wireline.com.au) |
| 2025-11-18 15:01:15 +0100 | trickard_ | (~trickard@cpe-62-98-47-163.wireline.com.au) (Ping timeout: 244 seconds) |
| 2025-11-18 15:00:25 +0100 | <haskellbridge> | <Morj> It's off by one but that's fine |
| 2025-11-18 14:59:55 +0100 | <haskellbridge> | <Morj> That's fine, I already wrote "lb a = flip Data.Function.fix (abs a, 0) $ \go (x, r) -> if x == 0 then r else go (Data.Bits.shiftR x 1, r + 1)" |
| 2025-11-18 14:59:52 +0100 | bitdex_ | (~bitdex@gateway/tor-sasl/bitdex) (Quit: = "") |
| 2025-11-18 14:59:27 +0100 | <haskellbridge> | <Morj> There's logBase, but that's for Floating. I don't see a log2 function |
| 2025-11-18 14:55:23 +0100 | <lucabtz> | maybe not efficient though |
| 2025-11-18 14:54:56 +0100 | <lucabtz> | with some flooring or ceiling |
| 2025-11-18 14:54:47 +0100 | <lucabtz> | isnt it just log2 |
| 2025-11-18 14:54:30 +0100 | <haskellbridge> | <Morj> I would google myself but stackoverflow is down with cloudflare |
| 2025-11-18 14:54:15 +0100 | <haskellbridge> | <Morj> Is there no function in base to get the bit length of a positive Integer? |
| 2025-11-18 14:51:02 +0100 | spew | (~spew@user/spew) spew |
| 2025-11-18 14:44:47 +0100 | Lycurgus | (~juan@user/Lycurgus) Lycurgus |
| 2025-11-18 14:35:56 +0100 | fp | (~Thunderbi@2001:708:150:10::7e06) fp |
| 2025-11-18 14:30:15 +0100 | fp | (~Thunderbi@2001:708:20:1406::10c5) (Ping timeout: 252 seconds) |
| 2025-11-18 14:26:54 +0100 | Square2 | (~Square4@user/square) Square |
| 2025-11-18 14:26:40 +0100 | Googulator | (~Googulato@2a01-036d-0106-0231-4475-80b4-5cdc-43d6.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-11-18 14:25:56 +0100 | Nachtgespenst | (~user@user/siracusa) (Quit: Bye!) |
| 2025-11-18 14:16:50 +0100 | trickard_ | (~trickard@cpe-62-98-47-163.wireline.com.au) |
| 2025-11-18 14:09:39 +0100 | trickard_ | (~trickard@cpe-62-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-11-18 14:05:57 +0100 | trickard_ | (~trickard@cpe-62-98-47-163.wireline.com.au) |
| 2025-11-18 14:05:43 +0100 | trickard | (~trickard@cpe-62-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-11-18 13:54:15 +0100 | <kaol> | If this is about a linux distribution going with the package provided by them is one option. |
| 2025-11-18 13:54:01 +0100 | <tomsmeding> | omidmash: solves only half of your problem, but the ghcup install script responds to the BOOTSTRAP_HASKELL_NONINTERACTIVE environment variable |
| 2025-11-18 13:53:49 +0100 | <omidmash> | Ah I have just noticed the haskell-ops channel |
| 2025-11-18 13:48:32 +0100 | <omidmash> | instance with ansible? |
| 2025-11-18 13:48:32 +0100 | <omidmash> | Good day. I need to install Haskell on lots of PCs that I manage using ansible playbooks. These computers are in computer labors, so I need GHC/I to work reliably. The official instruction installs in home folder (which I have set to reset on reboot), and needs user prompts. Is there a way to install Haskell systemwide that is automatable, for |
| 2025-11-18 13:47:15 +0100 | omidmash | (~omidmash@user/omidmash) omidmash |
| 2025-11-18 13:45:29 +0100 | SlackCoder | (~SlackCode@64-94-63-8.ip.weststar.net.ky) SlackCoder |
| 2025-11-18 13:42:25 +0100 | <tomsmeding> | Leary: heh. Thanks for asking though, I appreciate it :) |
| 2025-11-18 13:40:40 +0100 | <Leary> | There is a certain irony in asking that of the guy who hosts public logs of the whole channel, but it just felt a bit rude to quote a casual conversation somewhere less transient without asking. |
| 2025-11-18 13:39:05 +0100 | Zemy | (~Zemy@2600:100c:b0ae:c0b:6c30:fdff:fe2e:3217) (Ping timeout: 245 seconds) |
| 2025-11-18 13:38:14 +0100 | <tomsmeding> | sure, they are public anyway :) |
| 2025-11-18 13:37:59 +0100 | <Leary> | tomsmeding: I want to include (lightly edited) logs of this conversation in the gist as a warning to posterity; do you mind? |
| 2025-11-18 13:35:16 +0100 | Zemy_ | (~Zemy@72.178.108.235) |
| 2025-11-18 13:34:43 +0100 | Zemy | (~Zemy@2600:100c:b0ae:c0b:6c30:fdff:fe2e:3217) |
| 2025-11-18 13:34:42 +0100 | Zemy_ | (~Zemy@72.178.108.235) (Read error: Connection reset by peer) |
| 2025-11-18 13:34:41 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) L29Ah |
| 2025-11-18 13:33:24 +0100 | wootehfoot | (~wootehfoo@user/wootehfoot) wootehfoot |
| 2025-11-18 13:19:53 +0100 | <tomsmeding> | especially in the context of it being explicitly disallowed to write manual instances for Coercible |
| 2025-11-18 13:19:40 +0100 | <tomsmeding> | we'd need some kind of guarantee from GHC that conjuring up custom Coercible evidence is okay and respected by GHC, and there is no such guarantee currently, I think |
| 2025-11-18 13:18:57 +0100 | <tomsmeding> | yes |
| 2025-11-18 13:17:15 +0100 | <Leary> | tomsmeding: Looking at the core under optimisation, it does compile just fine on my GHC 9.10. But I don't see why a future GHC could not choose to treat it as: `archWS = case wordSize of { 32 -> case unsafeWord32 of {}; 64 -> case unsafeWord64 of {}; _ -> UNK }`, producing core `archWS = case patError "ArchWS.hs:20:66-88|case"# of {}`. |
| 2025-11-18 13:09:59 +0100 | srazkvt | (~sarah@user/srazkvt) srazkvt |
| 2025-11-18 13:09:44 +0100 | srazkvt | (~sarah@user/srazkvt) (Client Quit) |
| 2025-11-18 13:08:23 +0100 | srazkvt | (~sarah@user/srazkvt) srazkvt |
| 2025-11-18 13:02:46 +0100 | Googulator79 | Googulator |
| 2025-11-18 13:00:39 +0100 | <tomsmeding> | If it compiles, it works. |
| 2025-11-18 13:00:22 +0100 | <tomsmeding> | beautiful! |