Newest at the top
| 2025-11-07 16:04:52 +0100 | fp | (~Thunderbi@130.233.70.136) (Ping timeout: 260 seconds) |
| 2025-11-07 16:03:14 +0100 | <tomsmeding> | but the latter is constant over the entire ContT computation, so fmap'ing that must be type-preserving |
| 2025-11-07 16:02:56 +0100 | <tomsmeding> | you're trying to put one of them in the normal in-monad return value of that ContT expression, and the other in the 'r' top-level return value of the ContT computation |
| 2025-11-07 16:02:53 +0100 | Sgeo | (~Sgeo@user/sgeo) Sgeo |
| 2025-11-07 16:00:50 +0100 | <tomsmeding> | where do they go? |
| 2025-11-07 16:00:45 +0100 | <tomsmeding> | consider: run1 "returns" two things: x and the thing that you later swap |
| 2025-11-07 16:00:19 +0100 | <tomsmeding> | [exa]: I don't think that's going to work |
| 2025-11-07 16:00:07 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-11-07 15:57:46 +0100 | <haskellbridge> | <Morj> Ahh you're right |
| 2025-11-07 15:57:39 +0100 | <tomsmeding> | Set is not a fucntor |
| 2025-11-07 15:57:34 +0100 | <tomsmeding> | it's a functor in the values |
| 2025-11-07 15:57:31 +0100 | Anarchos | (~Anarchos@91-161-254-16.subs.proxad.net) Anarchos |
| 2025-11-07 15:57:26 +0100 | <haskellbridge> | <Morj> Wait, since when is Map a Functor? I thought the instance was unlawful |
| 2025-11-07 15:57:11 +0100 | trickard_ | trickard |
| 2025-11-07 15:56:52 +0100 | <haskellbridge> | <Morj> I like mono-traversable more because it doesn't require functor, so can work on bytestrings. On the other hand they both don't allow Set for different reasons |
| 2025-11-07 15:56:42 +0100 | <lortabac> | which takes a different approach from mono-traversable |
| 2025-11-07 15:55:37 +0100 | <lambdabot> | https://hackage.haskell.org/package/witherable |
| 2025-11-07 15:55:37 +0100 | <lortabac> | @hackage witherable |
| 2025-11-07 15:55:33 +0100 | <lortabac> | there is a generalized version in witherable |
| 2025-11-07 15:55:32 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-07 15:54:40 +0100 | Googulator94 | (~Googulato@team.broadbit.hu) |
| 2025-11-07 15:54:25 +0100 | Googulator94 | (~Googulato@team.broadbit.hu) (Client Quit) |
| 2025-11-07 15:54:07 +0100 | Googulator18 | (~Googulato@team.broadbit.hu) (Ping timeout: 250 seconds) |
| 2025-11-07 15:50:41 +0100 | <Square2> | nvm |
| 2025-11-07 15:50:40 +0100 | Googulator94 | (~Googulato@team.broadbit.hu) |
| 2025-11-07 15:48:55 +0100 | Googulator57 | (~Googulato@team.broadbit.hu) (Ping timeout: 250 seconds) |
| 2025-11-07 15:47:53 +0100 | <Square2> | oh there's filterM I guess |
| 2025-11-07 15:46:02 +0100 | Googulator18 | (~Googulato@team.broadbit.hu) |
| 2025-11-07 15:45:02 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
| 2025-11-07 15:43:18 +0100 | <haskellbridge> | <Morj> In base it's data-specific. In mono-traversable there is a class for it: https://hackage.haskell.org/package/mono-traversable-1.0.21.0/docs/Data-Sequences.html#v:filter |
| 2025-11-07 15:43:12 +0100 | trickard_ | (~trickard@cpe-57-98-47-163.wireline.com.au) |
| 2025-11-07 15:42:42 +0100 | <Square2> | it seems to be data structure specific |
| 2025-11-07 15:42:17 +0100 | <Square2> | is filter defined in some base class or is made specifically for different data structures? |
| 2025-11-07 15:40:41 +0100 | Googulator30 | (~Googulato@team.broadbit.hu) (Ping timeout: 250 seconds) |
| 2025-11-07 15:39:44 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-07 15:37:42 +0100 | trickard_ | (~trickard@cpe-57-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-11-07 15:37:27 +0100 | Googulator57 | (~Googulato@team.broadbit.hu) |
| 2025-11-07 15:32:17 +0100 | trickard_ | (~trickard@cpe-57-98-47-163.wireline.com.au) |
| 2025-11-07 15:32:04 +0100 | trickard_ | (~trickard@cpe-57-98-47-163.wireline.com.au) (Read error: Connection reset by peer) |
| 2025-11-07 15:31:46 +0100 | Lycurgus | (~juan@user/Lycurgus) (Quit: alsoknownas.renjuan.org ( juan@acm.org )) |
| 2025-11-07 15:31:15 +0100 | fp | (~Thunderbi@130.233.70.136) fp |
| 2025-11-07 15:30:54 +0100 | fp | (~Thunderbi@130.233.70.136) (Quit: fp) |
| 2025-11-07 15:30:32 +0100 | Googulator30 | (~Googulato@team.broadbit.hu) |
| 2025-11-07 15:28:34 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds) |
| 2025-11-07 15:25:44 +0100 | Zemy_ | (~Zemy@2600:100c:b0ab:d403:cbc:dbff:fe6f:c62e) (Ping timeout: 256 seconds) |
| 2025-11-07 15:25:40 +0100 | <[exa]> | ) |
| 2025-11-07 15:25:37 +0100 | <[exa]> | (this is torn out from a mildly over-complicated code, I'll try to materialize a simple example. The `run1` and `run2` is something like `withFileOpen` or so. |
| 2025-11-07 15:25:00 +0100 | <[exa]> | example: https://paste.tomsmeding.com/WfUKO31Y |
| 2025-11-07 15:24:13 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-07 15:22:53 +0100 | <[exa]> | how does one rewrite a continuation-ish computation with a "fmap" in it, like `fmap something . blah $ \x -> ...`, into ContT? (All combinations failed for me so I'm asking) |