Newest at the top
| 2025-11-22 20:57:04 +0100 | falafel | (~falafel@2603:8000:ca00:83fb:1db5:6d25:28c0:7c1c) falafel |
| 2025-11-22 20:56:25 +0100 | peterbecich | (~Thunderbi@172.222.148.214) (Ping timeout: 264 seconds) |
| 2025-11-22 20:55:08 +0100 | <haskellbridge> | <Morj> Was it in qt for signals |
| 2025-11-22 20:54:53 +0100 | <haskellbridge> | <Morj> I have flashbacks to a system which had those factorial-flips, but I erased it from my memory |
| 2025-11-22 20:54:46 +0100 | <EvanR> | g a b c d e = f c d e a b |
| 2025-11-22 20:54:36 +0100 | deptype | (~deptype@2406:b400:3a:9d2f:1c0f:7b0:178a:6f00) |
| 2025-11-22 20:54:34 +0100 | <EvanR> | at this point use nonpointless form |
| 2025-11-22 20:54:26 +0100 | <chromoblob> | yes |
| 2025-11-22 20:54:01 +0100 | <chromoblob> | or one could call them like: abcToAcb, abcToBac, ... |
| 2025-11-22 20:53:59 +0100 | <EvanR> | do you mean n factorial flips for each N |
| 2025-11-22 20:53:59 +0100 | deptype | (~deptype@2406:b400:3a:9d2f:bfa9:f0b2:ea22:761e) (Remote host closed the connection) |
| 2025-11-22 20:53:28 +0100 | <chromoblob> | why isn't there more flips - flip3_1, flip3_2, ..., flip3_6 |
| 2025-11-22 20:52:47 +0100 | <EvanR> | this is a great usecase for flip |
| 2025-11-22 20:52:47 +0100 | Nachtgespenst | (~user@user/siracusa) siracusa |
| 2025-11-22 20:52:26 +0100 | <chromoblob> | ohh |
| 2025-11-22 20:52:26 +0100 | <lambdabot> | forM = flip mapM |
| 2025-11-22 20:52:26 +0100 | <EvanR> | @src forM |
| 2025-11-22 20:52:11 +0100 | <EvanR> | \o/ |
| 2025-11-22 20:52:07 +0100 | <EvanR> | g = flip f |
| 2025-11-22 20:52:05 +0100 | <EvanR> | and you can define it like this |
| 2025-11-22 20:52:01 +0100 | <EvanR> | yeah |
| 2025-11-22 20:51:53 +0100 | <chromoblob> | or use points: (\a b -> (...) b a) ... |
| 2025-11-22 20:51:46 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds) |
| 2025-11-22 20:51:17 +0100 | <haskellbridge> | <Morj> I agree with you, that's why I was asking if this pattern is known and has a better named combinator :-) |
| 2025-11-22 20:51:16 +0100 | <chromoblob> | then have two names for two orders |
| 2025-11-22 20:51:13 +0100 | <EvanR> | so you can't blame the person who defined it |
| 2025-11-22 20:51:02 +0100 | <EvanR> | sometimes the order of arguments doesn't have 1 best choice |
| 2025-11-22 20:50:33 +0100 | <chromoblob> | i guess i don't accept "flip" as a standard function. who and when would want to reorder arguments |
| 2025-11-22 20:50:32 +0100 | <EvanR> | a single flip is good for party tricks |
| 2025-11-22 20:49:32 +0100 | <chromoblob> | i'm more frightened by flip f b a, it feels like a redirected thread in my head, like __s--- |
| 2025-11-22 20:49:25 +0100 | <EvanR> | and the general public I was thinking of was haskell programmers not the mailman |
| 2025-11-22 20:48:50 +0100 | <EvanR> | frighten wasn't the emotion I was thinking of |
| 2025-11-22 20:47:02 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-22 20:46:57 +0100 | mreh | (~matthew@host86-146-25-125.range86-146.btcentralplus.com) (Quit: Lost terminal) |
| 2025-11-22 20:46:15 +0100 | <haskellbridge> | <Morj> As if the general public wasn't frightened enough.. |
| 2025-11-22 20:45:00 +0100 | <chromoblob> | (`fix` initial) $ \next i -> ... |
| 2025-11-22 20:41:17 +0100 | <tomsmeding> | I was gonna say, we need a data-aviary version of recursion-schemes |
| 2025-11-22 20:41:06 +0100 | <EvanR> | if pithy not available a bird will do |
| 2025-11-22 20:41:01 +0100 | Frostillicus | (~Frostilli@pool-71-174-119-69.bstnma.fios.verizon.net) (Ping timeout: 244 seconds) |
| 2025-11-22 20:40:52 +0100 | <EvanR> | with a pithy name |
| 2025-11-22 20:40:41 +0100 | <EvanR> | which does the exact pattern I need at this moment |
| 2025-11-22 20:40:34 +0100 | <haskellbridge> | <Morj> Because it is just a while loop expressed with functions |
| 2025-11-22 20:40:23 +0100 | <tomsmeding> | ω ω |
| 2025-11-22 20:40:15 +0100 | <haskellbridge> | <Morj> When I do this I imagine myself an imperative grug |
| 2025-11-22 20:40:11 +0100 | <EvanR> | please give me a recursion combinator |
| 2025-11-22 20:40:03 +0100 | <haskellbridge> | <Morj> Haha |
| 2025-11-22 20:39:54 +0100 | <tomsmeding> | maybe my brain is not big enough yet |
| 2025-11-22 20:39:38 +0100 | <haskellbridge> | <Morj> Mm not really, it's just "let var1 = goList1 list1" for every |
| 2025-11-22 20:39:37 +0100 | <tomsmeding> | or at least, I like seeing the point where you recurse into a different structure |
| 2025-11-22 20:39:12 +0100 | <tomsmeding> | at that point the names actually start becoming useful, IMO |