Newest at the top
| 2025-02-03 20:44:04 +0100 | Square | (~Square@user/square) Square |
| 2025-02-03 20:40:24 +0100 | <albet70> | rec = \ls -> \k -> mapK (\x -> \c -> if x == 0 then k ? else c (1/x)) ls k |
| 2025-02-03 20:40:10 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 252 seconds) |
| 2025-02-03 20:39:43 +0100 | gorignak | (~gorignak@user/gorignak) gorignak |
| 2025-02-03 20:39:12 +0100 | gorignak | (~gorignak@user/gorignak) (Quit: quit) |
| 2025-02-03 20:37:49 +0100 | <albet70> | try to keep the previous result befor meet the break item in the list, like rec [1,2,3,0,4] return [1,2,3,0] not just [0], but that p in mapK can not keep previous result |
| 2025-02-03 20:36:02 +0100 | alfiee | (~alfiee@user/alfiee) alfiee |
| 2025-02-03 20:32:34 +0100 | <davean> | mauke: yah that first sentance seems pretty critical though. |
| 2025-02-03 20:32:23 +0100 | euleritian | (~euleritia@ip5f5ad1be.dynamic.kabel-deutschland.de) |
| 2025-02-03 20:32:15 +0100 | <mauke> | I can't connect the first sentence, but the rest makes sense |
| 2025-02-03 20:32:05 +0100 | euleritian | (~euleritia@dynamic-176-006-140-194.176.6.pool.telefonica.de) (Read error: Connection reset by peer) |
| 2025-02-03 20:30:39 +0100 | <hellwolf> | *can parse |
| 2025-02-03 20:30:34 +0100 | <hellwolf> | right. hmm, only LLM can try, at that point. |
| 2025-02-03 20:30:09 +0100 | <davean> | Maybem I'm not sure what they asked was even coherent english though. |
| 2025-02-03 20:29:57 +0100 | <hellwolf> | albet70: we might need to suggest you to think differently. what are the starting materials you have? |
| 2025-02-03 20:29:32 +0100 | gorignak | (~gorignak@user/gorignak) gorignak |
| 2025-02-03 20:29:16 +0100 | <hellwolf> | it certainly misses the Haskell context. |
| 2025-02-03 20:29:04 +0100 | <hellwolf> | I think by statement, it means like those "statements" in other languages where effectful expression are usually sequentially laid out. |
| 2025-02-03 20:29:01 +0100 | gorignak | (~gorignak@user/gorignak) (Quit: quit) |
| 2025-02-03 20:27:36 +0100 | <davean> | albet70: I can not parse what you said |
| 2025-02-03 20:27:17 +0100 | <albet70> | or can it? |
| 2025-02-03 20:27:05 +0100 | hellwolf | (~user@262a-8508-ab6e-9670-0f00-4d40-07d0-2001.sta.estpak.ee) hellwolf |
| 2025-02-03 20:26:57 +0100 | sord937 | (~sord937@gateway/tor-sasl/sord937) (Quit: sord937) |
| 2025-02-03 20:26:47 +0100 | hellwolf | (~user@274b-85a5-2831-cb8b-0f00-4d40-07d0-2001.sta.estpak.ee) (Quit: rcirc on GNU Emacs 29.4) |
| 2025-02-03 20:26:09 +0100 | <albet70> | since that p in mapK can't keep value |
| 2025-02-03 20:25:24 +0100 | <albet70> | how to do statement in function without in do notation? like the rec [1,2,3,0,4] id will return [0.0], how let it be [1,2,3,0]? |
| 2025-02-03 20:24:02 +0100 | <smiesner> | hi, again i'd like to ask if someone knows tools for model-to-model transformations in haskell. is hydra such a tool? i want to translate from/to different UDP standards |
| 2025-02-03 20:19:31 +0100 | supercode | (~supercode@user/supercode) (Quit: Client closed) |
| 2025-02-03 20:19:21 +0100 | gorignak | (~gorignak@user/gorignak) gorignak |
| 2025-02-03 20:18:50 +0100 | gorignak | (~gorignak@user/gorignak) (Quit: quit) |
| 2025-02-03 20:18:36 +0100 | remedan | (~remedan@62.245.108.153) remedan |
| 2025-02-03 20:14:40 +0100 | Googulator56 | (~Googulato@2a01-036d-0106-418c-6daf-e703-6cee-d20f.pool6.digikabel.hu) (Ping timeout: 240 seconds) |
| 2025-02-03 20:13:48 +0100 | jespada | (~jespada@2800:a4:2315:e400:dc3a:2af1:31c:f0bc) (Quit: My Mac has gone to sleep. ZZZzzz…) |
| 2025-02-03 20:11:46 +0100 | <albet70> | yes |
| 2025-02-03 20:10:42 +0100 | Googulator61 | (~Googulato@2a01-036d-0106-418c-6daf-e703-6cee-d20f.pool6.digikabel.hu) |
| 2025-02-03 20:05:27 +0100 | gorignak | (~gorignak@user/gorignak) gorignak |
| 2025-02-03 20:04:56 +0100 | gorignak | (~gorignak@user/gorignak) (Quit: quit) |
| 2025-02-03 20:04:03 +0100 | Katarushisu | (~Katarushi@finc-20-b2-v4wan-169598-cust1799.vm7.cable.virginm.net) Katarushisu |
| 2025-02-03 19:58:05 +0100 | Smiles | (uid551636@id-551636.lymington.irccloud.com) Smiles |
| 2025-02-03 19:56:17 +0100 | <mauke> | albet70: that looks like it can do early return, but not lazy evaluation |
| 2025-02-03 19:55:17 +0100 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 248 seconds) |
| 2025-02-03 19:55:16 +0100 | gorignak | (~gorignak@user/gorignak) gorignak |
| 2025-02-03 19:55:12 +0100 | ss4 | (~wootehfoo@user/wootehfoot) (Read error: Connection reset by peer) |
| 2025-02-03 19:54:45 +0100 | gorignak | (~gorignak@user/gorignak) (Quit: quit) |
| 2025-02-03 19:53:23 +0100 | <albet70> | like most languages have lambda expression, is that means I can turn lambda expression in Haskell to lambda expression in other languages |
| 2025-02-03 19:52:05 +0100 | alfiee | (~alfiee@user/alfiee) (Ping timeout: 248 seconds) |
| 2025-02-03 19:52:03 +0100 | Googulator56 | (~Googulato@2a01-036d-0106-418c-6daf-e703-6cee-d20f.pool6.digikabel.hu) |
| 2025-02-03 19:51:49 +0100 | Googulator56 | (~Googulato@2a01-036d-0106-418c-6daf-e703-6cee-d20f.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-02-03 19:51:42 +0100 | <albet70> | use ContT in Haskell is elegant, but sometimes I like to know how to implement the function in other languages by function |
| 2025-02-03 19:50:31 +0100 | Tuplanolla | (~Tuplanoll@91-159-69-59.elisa-laajakaista.fi) Tuplanolla |