Newest at the top
| 2025-11-30 00:36:07 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) humasect |
| 2025-11-30 00:29:35 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-11-30 00:23:10 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-30 00:22:54 +0100 | takuan | (~takuan@d8D86B9E9.access.telenet.be) (Remote host closed the connection) |
| 2025-11-30 00:20:59 +0100 | L29Ah | (~L29Ah@wikipedia/L29Ah) L29Ah |
| 2025-11-30 00:12:19 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-11-30 00:08:05 +0100 | <aaronm04> | --constraint ="splitmix < 0.1.3" |
| 2025-11-30 00:07:56 +0100 | <aaronm04> | ah hmm, there might be a workaround in https://github.com/haskellari/splitmix/issues/101 |
| 2025-11-30 00:07:47 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-30 00:05:59 +0100 | tromp | (~textual@2001:1c00:3487:1b00:5005:5ee4:6658:fef3) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2025-11-30 00:05:20 +0100 | <aaronm04> | the specific error location is cbits-unix/init.c:3:10 in case that helps |
| 2025-11-30 00:04:56 +0100 | <aaronm04> | on OpenBSD 7.8, I cannot build splitmix-0.1.3.1 due to not finding the sys/random.h header. Is there a fix for this? |
| 2025-11-30 00:03:24 +0100 | __monty__ | (~toonn@user/toonn) (Quit: leaving) |
| 2025-11-30 00:03:01 +0100 | ljdarj1 | ljdarj |
| 2025-11-30 00:03:01 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 264 seconds) |
| 2025-11-30 00:02:07 +0100 | ljdarj1 | (~Thunderbi@user/ljdarj) ljdarj |
| 2025-11-29 23:59:25 +0100 | aaronm04 | (~user@user/aaronm04) aaronm04 |
| 2025-11-29 23:59:04 +0100 | simplystuart | (~simplystu@c-75-75-152-164.hsd1.pa.comcast.net) |
| 2025-11-29 23:56:35 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-11-29 23:54:58 +0100 | tromp | (~textual@2001:1c00:3487:1b00:5005:5ee4:6658:fef3) |
| 2025-11-29 23:53:35 +0100 | <Guest56> | Thank you so much! |
| 2025-11-29 23:52:52 +0100 | simplystuart | (~simplystu@c-75-75-152-164.hsd1.pa.comcast.net) (Ping timeout: 244 seconds) |
| 2025-11-29 23:52:17 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-29 23:49:53 +0100 | <Rembane> | Guest56: No worries. Good luck! :) |
| 2025-11-29 23:49:33 +0100 | <Rembane> | Guest56: Another version, which uses guards on case which removes some of the nesting: https://play.haskell.org/saved/omzWcKUF |
| 2025-11-29 23:48:48 +0100 | <__monty__> | Clint: Don't see how it deals with depending on different versions in different projects then. |
| 2025-11-29 23:46:29 +0100 | <Guest56> | thanks for the case example though :) |
| 2025-11-29 23:46:22 +0100 | <Guest56> | understandable |
| 2025-11-29 23:46:00 +0100 | tromp | (~textual@2001:1c00:3487:1b00:5005:5ee4:6658:fef3) (Quit: My iMac has gone to sleep. ZZZzzz…) |
| 2025-11-29 23:45:12 +0100 | <Rembane> | Guest56: No idea, I'm way too tired for that. :) |
| 2025-11-29 23:45:05 +0100 | <Rembane> | Guest56: https://play.haskell.org/saved/2Ogh8nQy <- example for case |
| 2025-11-29 23:43:36 +0100 | <Guest56> | hmm... how else should I model this? |
| 2025-11-29 23:43:14 +0100 | <Guest56> | oh? |
| 2025-11-29 23:43:12 +0100 | <Rembane> | Guest56: But I have a feeling there's either incredible inherent complexity in the problem or that there's an easier way to model this in Haskell. |
| 2025-11-29 23:42:44 +0100 | <Rembane> | Guest56: You can replace it with a case and pattern match on Just |
| 2025-11-29 23:42:21 +0100 | <Guest56> | I'm basically trying to replace the let expression as let will not let me repeat bindings. |
| 2025-11-29 23:41:28 +0100 | tcard_ | (~tcard@2400:4051:5801:7500:cf17:befc:ff82:5303) |
| 2025-11-29 23:41:15 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-11-29 23:41:11 +0100 | tcard_ | (~tcard@2400:4051:5801:7500:cf17:befc:ff82:5303) (Remote host closed the connection) |
| 2025-11-29 23:40:08 +0100 | <Rembane> | Guest56: Yup, lets see. |
| 2025-11-29 23:39:37 +0100 | <Guest56> | Rembane you there? |
| 2025-11-29 23:39:04 +0100 | <Guest56> | else Nothing |
| 2025-11-29 23:39:04 +0100 | <Guest56> | else Nothing |
| 2025-11-29 23:39:03 +0100 | <Guest56> | then Just $ RGN tr1 ta |
| 2025-11-29 23:39:03 +0100 | <Guest56> | in if gr2 == gr2' && gr2' == gr2'' && gr2'' == gr2''' && gr2''' == gr2'''' && gr2'''' == gr2''''' |
| 2025-11-29 23:39:02 +0100 | <Guest56> | then let FForall gr2 (FArrow (FArrow (FArrow (RGN tr1 (FVar gr2)) (RGN (FVar gr2) (gr2))) (RGNHandle (FVar gr2))) (RGN (FVar gr2) ta)) = tv |
| 2025-11-29 23:39:02 +0100 | <Guest56> | in if (S.member tr1 d) && (S.member ta d) && isJust tv |
| 2025-11-29 23:39:01 +0100 | <Guest56> | let tv = (inferType d g . valToExp) v |
| 2025-11-29 23:39:01 +0100 | <Guest56> | inferType d g (ELetRGN tr1 ta v) = |
| 2025-11-29 23:38:13 +0100 | <Guest56> | ok, there we go. This will not compile because all those `gr2`s need to be different and then checked for equality. |