Newest at the top
| 2025-02-03 00:36:20 +0100 | Tikosh | (~quassel@user/Tikosh) (Remote host closed the connection) |
| 2025-02-03 00:35:45 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-02-03 00:35:02 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 265 seconds) |
| 2025-02-03 00:30:32 +0100 | remedan | (~remedan@62.245.108.153) remedan |
| 2025-02-03 00:30:16 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-02-03 00:29:44 +0100 | remedan | (~remedan@62.245.108.153) (Quit: Bye!) |
| 2025-02-03 00:29:29 +0100 | ljdarj1 | ljdarj |
| 2025-02-03 00:29:29 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 260 seconds) |
| 2025-02-03 00:26:22 +0100 | ljdarj1 | (~Thunderbi@user/ljdarj) ljdarj |
| 2025-02-03 00:24:18 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-02-03 00:19:08 +0100 | mange | (~user@user/mange) mange |
| 2025-02-03 00:17:42 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-02-03 00:12:16 +0100 | remedan | (~remedan@62.245.108.153) remedan |
| 2025-02-03 00:07:13 +0100 | remedan | (~remedan@62.245.108.153) (Quit: Bye!) |
| 2025-02-03 00:06:42 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds) |
| 2025-02-03 00:02:19 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-02-02 23:59:53 +0100 | gmg | (~user@user/gehmehgeh) (Quit: Leaving) |
| 2025-02-02 23:56:09 +0100 | Tikosh | (~quassel@user/Tikosh) Tikosh |
| 2025-02-02 23:54:55 +0100 | euleritian | (~euleritia@77.23.250.232) |
| 2025-02-02 23:54:33 +0100 | euleritian | (~euleritia@77.23.250.232) (Read error: Connection reset by peer) |
| 2025-02-02 23:54:29 +0100 | euleritian | (~euleritia@77.23.250.232) |
| 2025-02-02 23:54:17 +0100 | euleritian | (~euleritia@ip4d17fae8.dynamic.kabel-deutschland.de) (Remote host closed the connection) |
| 2025-02-02 23:51:17 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-02-02 23:46:57 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-02-02 23:45:44 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 244 seconds) |
| 2025-02-02 23:44:55 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) (Quit: Connection closed for inactivity) |
| 2025-02-02 23:43:59 +0100 | <ski> | in case you'd like to mix in any other `m' (maybe `IO' or `ST s'), as well |
| 2025-02-02 23:43:33 +0100 | <lambdabot> | MyState -> m (Maybe (Item, MyState)) |
| 2025-02-02 23:43:33 +0100 | <ski> | @unmtl StateT MyState (MaybeT m) Item |
| 2025-02-02 23:43:26 +0100 | <lambdabot> | MyState -> m (Either MyFailure (Item, MyState)) |
| 2025-02-02 23:43:26 +0100 | <ski> | @unmtl StateT MyState (ExceptT MyFailure m) Item |
| 2025-02-02 23:42:59 +0100 | <ski> | if you want to have more than one way to fail |
| 2025-02-02 23:42:50 +0100 | <lambdabot> | MyState -> Either MyFailure (Item, MyState) |
| 2025-02-02 23:42:50 +0100 | <ski> | @unmtl StateT MyState (Either MyFailure) Item |
| 2025-02-02 23:42:33 +0100 | <ski> | or |
| 2025-02-02 23:42:23 +0100 | <lambdabot> | MyState -> Maybe (Item, MyState) |
| 2025-02-02 23:42:23 +0100 | <ski> | @unmtl StateT MyState Maybe Item |
| 2025-02-02 23:42:03 +0100 | <ski> | haskellstudent : `MyState -> Maybe (MyState,Item)' |
| 2025-02-02 23:41:31 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-02-02 23:31:03 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 246 seconds) |
| 2025-02-02 23:26:45 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-02-02 23:20:30 +0100 | <Rembane> | haskellstudent: No worries. Good luck! |
| 2025-02-02 23:20:07 +0100 | <haskellstudent> | Alright, thank you for your suggestion, I'll check them out |
| 2025-02-02 23:18:49 +0100 | <Rembane> | haskellstudent: Sweet! Then you can combine ExceptT with a StateT to make up the functionality. OTOH, it might be more straightforward to do it in a custom way. |
| 2025-02-02 23:17:18 +0100 | <haskellstudent> | I'm not familiar with monad transformers but I'm willing to learn |
| 2025-02-02 23:16:40 +0100 | <haskellstudent> | The solution is only limited by my mental capacity and my ability to understand new concepts :) |
| 2025-02-02 23:15:43 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-02-02 23:15:20 +0100 | <Rembane> | haskellstudent: Is a monad transformer stack an allowed solution? |
| 2025-02-02 23:14:28 +0100 | <haskellstudent> | about the State monad but I don't see how it synergizes with the short-circuit idea. Any ideas on how I should implement my idea? |
| 2025-02-02 23:14:28 +0100 | <haskellstudent> | Hello, everyone! I'm trying to create a set of functions whose signature is as : State->(State, Item). There are some cases where a call to such function might return a "StateFail". In such case, the whole procedure should short-circuit and return that StateFail, otherwise the procedure should continue until a terminal state is reached. I know |