2026/01/17

Newest at the top

2026-01-17 19:32:03 +0100wootehfoot(~wootehfoo@user/wootehfoot) (Quit: Leaving)
2026-01-17 19:29:07 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-17 19:26:33 +0100annamalai(~annamalai@117.231.194.195) annamalai
2026-01-17 19:26:15 +0100annamalai(~annamalai@157.49.250.55) (Ping timeout: 240 seconds)
2026-01-17 19:22:52 +0100jmcantrell_(~weechat@user/jmcantrell) jmcantrell
2026-01-17 19:18:24 +0100 <monochrom> Hrm I should find mine and post it. I used to teach this in my course.
2026-01-17 19:17:55 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds)
2026-01-17 19:16:33 +0100 <monochrom> thirdofmay18081814goya: If your interpreter is in a monad for exceptions (eg ExceptT like geekosaur says) then you can write it as a straightforward recursive descent.
2026-01-17 19:15:30 +0100 <geekosaur> I was thinking that (well, ExceptT, but that's just a fancy Maybe)
2026-01-17 19:14:38 +0100target_i(~target_i@user/target-i/x-6023099) target_i
2026-01-17 19:13:44 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-17 19:12:30 +0100ChaiTRex(~ChaiTRex@user/chaitrex) ChaiTRex
2026-01-17 19:12:29 +0100trickard_trickard
2026-01-17 19:12:05 +0100ChaiTRex(~ChaiTRex@user/chaitrex) (Remote host closed the connection)
2026-01-17 19:02:35 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds)
2026-01-17 19:00:24 +0100img(~img@user/img) img
2026-01-17 18:59:09 +0100img(~img@user/img) (Quit: ZNC 1.10.1 - https://znc.in)
2026-01-17 18:58:41 +0100gmg(~user@user/gehmehgeh) gehmehgeh
2026-01-17 18:58:00 +0100gmg(~user@user/gehmehgeh) (Quit: Leaving)
2026-01-17 18:57:57 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-17 18:57:41 +0100 <haskellbridge> <thirdofmay18081814goya> makes sense, ty!
2026-01-17 18:52:23 +0100 <EvanR> an optional "upward propagation" is just returning a Maybe
2026-01-17 18:51:52 +0100 <EvanR> thirdofmayNUMBERSgoya: any other way sounds like overengineering and/or OOP imperative shenanigans xD
2026-01-17 18:51:37 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds)
2026-01-17 18:51:14 +0100gmg(~user@user/gehmehgeh) gehmehgeh
2026-01-17 18:46:24 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-17 18:42:05 +0100 <haskellbridge> <thirdofmay18081814goya> i feel like there should be a single statement declaring this, not two (one changing the node for one indicating that a propagation wants to go up, another to handle it)
2026-01-17 18:41:27 +0100Lycurgus(~juan@user/Lycurgus) (Quit: alsoknownas.renjuan.org ( juan@acm.org ))
2026-01-17 18:41:02 +0100 <haskellbridge> <thirdofmay18081814goya> but it might just be the proper way to do it, don't know why it feels off to me lol
2026-01-17 18:38:56 +0100 <haskellbridge> <thirdofmay18081814goya> i.e. add a conditional branch that tests whether a subcontext has provided a propagation
2026-01-17 18:38:19 +0100 <haskellbridge> <thirdofmay18081814goya> EvanR: I thought that yeah this might be the proper way, felt that it is gimmicky/not conceptually simple
2026-01-17 18:37:19 +0100 <[exa]> </issue>
2026-01-17 18:37:15 +0100 <[exa]> yeah... firefox mobile works okay too, this one was some kindof default miui thing
2026-01-17 18:36:43 +0100ttybitnik(~ttybitnik@user/wolper) (Quit: Fading out...)
2026-01-17 18:36:32 +0100 <geekosaur> maybe misparsed the ghci prompts too
2026-01-17 18:36:17 +0100Zemy(~Zemy@mobile-107-80-206-95.mycingular.net) (Ping timeout: 244 seconds)
2026-01-17 18:35:58 +0100 <geekosaur> I suspect it interpreted it as HTML instead of text, and the display name prefixes from the bridge and the prefix of the ghci error message as unknown tags
2026-01-17 18:35:57 +0100 <EvanR> or in the explicit recursive descent, returning something from each recursion
2026-01-17 18:35:31 +0100 <EvanR> thirdofmayNUMBERSgoya: on its face that just sounds like folding a tree
2026-01-17 18:35:15 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds)
2026-01-17 18:34:33 +0100Zemy_(~Zemy@2600:100c:b0a9:6e2b:701a:11ff:fe19:237)
2026-01-17 18:34:05 +0100 <[exa]> geekosaur: re the pastebin, I blame the browser in the end, it was on a cellphone and computer browser works fine. No idea what happened there.
2026-01-17 18:33:57 +0100karenw(~karenw@user/karenw) karenw
2026-01-17 18:32:22 +0100jmcantrell_(~weechat@user/jmcantrell) (Ping timeout: 265 seconds)
2026-01-17 18:32:09 +0100 <haskellbridge> <thirdofmay18081814goya> how would you implement recursive descent where you can propagate something upwards? e.g., say you're writing an interpreter and while recursing downwards you enter two try/catch scopes. the second, deeper one fails to catch an error, so it much propagate upwards to be caught by the first try/catch scope. is there any recursion scheme that specifies what this means, to "propagate upwards"?
2026-01-17 18:31:19 +0100Core5695(~Zemy@2600:100c:b0a9:6e2b:dc8f:5aff:fe84:9af8) (Ping timeout: 260 seconds)
2026-01-17 18:30:47 +0100merijn(~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn
2026-01-17 18:30:26 +0100 <geekosaur> (I suspected that was it, but I also had some site insist I install a payment processor plugin. I NOPEd out but wondered if it had maybe slipped it in anyway)
2026-01-17 18:30:20 +0100 <[exa]> Mikolaj: okay that paid off.
2026-01-17 18:28:09 +0100Zemy(~Zemy@mobile-107-80-206-95.mycingular.net)