2025/03/28

Newest at the top

2025-03-28 07:17:23 +0100rvalue(~rvalue@user/rvalue) rvalue
2025-03-28 07:16:51 +0100rvalue(~rvalue@user/rvalue) (Read error: Connection reset by peer)
2025-03-28 07:12:49 +0100 <sim590> To me, I thought that the second version made more sense... I'm now doubting if I accidently got the right answer because of a bad upper bound and a bad algorithm... lol
2025-03-28 07:10:34 +0100 <sim590> it simpler. I rewrote it to https://paste.debian.net/1365805/. I don't understand why, but now my whole algorithme doesn't give me the right answer anymore.
2025-03-28 07:10:32 +0100 <sim590> Consider the following problem: https://projecteuler.net/problem=32. Which I have solved. My algorithm uses some math analysis to determine an upper bound for the search space. Anyway, I use the following function to recognize a pandigital triplet: https://paste.debian.net/1365804/. Using this function, my algorithms gave me the right answer. Then, I decided to rewrite the function a bit to make
2025-03-28 07:10:06 +0100LainExperiments(~LainExper@user/LainExperiments) (Ping timeout: 240 seconds)
2025-03-28 07:09:40 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds)
2025-03-28 07:05:47 +0100nvoid(~nvoid@2601:140:8700:25fe:5820:136c:b0ce:f5b1) (Quit: nvoid)
2025-03-28 07:04:46 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-03-28 06:59:40 +0100 <ski> one reason being tail calls
2025-03-28 06:59:07 +0100 <ski> basically argues for (in Haskell terms) `catchBind :: Exception e => IO a -> (e -> IO b) -> (a -> IO b) -> IO b' being more appropriate as a primitive, than `catch :: Exception e => IO a -> (e -> IO a) -> IO a'
2025-03-28 06:58:19 +0100nvoid(~nvoid@2601:140:8700:25fe:5820:136c:b0ce:f5b1)
2025-03-28 06:58:01 +0100 <ski> Leary : "Exceptional Syntax" by Nick Benton,Andrew Kennedy in 2001 at <https://www.microsoft.com/en-us/research/wp-content/uploads/2016/02/exceptionalsyntax.pdf> (<http://lambda-the-ultimate.org/node/1193)
2025-03-28 06:57:19 +0100weary-traveler(~user@user/user363627) (Remote host closed the connection)
2025-03-28 06:57:08 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 265 seconds)
2025-03-28 06:53:14 +0100Square(~Square@user/square) Square
2025-03-28 06:51:54 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-03-28 06:46:09 +0100takuan(~takuan@d8D86B601.access.telenet.be)
2025-03-28 06:46:08 +0100ChaiTRex(~ChaiTRex@user/chaitrex) ChaiTRex
2025-03-28 06:44:35 +0100ChaiTRex(~ChaiTRex@user/chaitrex) (Remote host closed the connection)
2025-03-28 06:41:03 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds)
2025-03-28 06:36:40 +0100DigitteknohippieDigit
2025-03-28 06:35:20 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-03-28 06:34:13 +0100Digit(~user@user/digit) (Ping timeout: 268 seconds)
2025-03-28 06:33:37 +0100aetepe(~aetepe@188.119.58.34) (Ping timeout: 244 seconds)
2025-03-28 06:33:06 +0100 <Leary> ski: I'm not familiar with the paper. I pulled that `data Catch` out of my arse, though it may have been inspired by 'A Framework for Higher-Order Effects & Handlers'.
2025-03-28 06:32:48 +0100Digitteknohippie(~user@user/digit) Digit
2025-03-28 06:29:09 +0100aetepe(~aetepe@188.119.58.34) aetepe
2025-03-28 06:27:19 +0100 <ski> mhm
2025-03-28 06:24:34 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 248 seconds)
2025-03-28 06:24:07 +0100 <EvanR> memory management, or lack there of
2025-03-28 06:23:10 +0100 <ski> you said "it does do the thing everyone thinks linear types are for"
2025-03-28 06:23:01 +0100 <ski> i dunno
2025-03-28 06:22:53 +0100 <EvanR> does it?
2025-03-28 06:22:06 +0100 <ski> EvanR : Ur has uniqueness ?
2025-03-28 06:21:56 +0100 <ski> Leary : `Either e x -> a' a la "Exceptional Syntax" ?
2025-03-28 06:19:33 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-03-28 06:17:39 +0100DigitteknohippieDigit
2025-03-28 06:13:33 +0100LainExperiments(~LainExper@user/LainExperiments) LainExperiments
2025-03-28 06:12:45 +0100gmg(~user@user/gehmehgeh) gehmehgeh
2025-03-28 06:12:03 +0100gmg(~user@user/gehmehgeh) (Remote host closed the connection)
2025-03-28 06:10:54 +0100xff0x(~xff0x@fsb6a9491c.tkyc517.ap.nuro.jp)
2025-03-28 06:10:44 +0100peterbecich(~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 265 seconds)
2025-03-28 06:08:49 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds)
2025-03-28 06:08:10 +0100 <haskellbridge> <thirdofmay18081814goya> thanks!
2025-03-28 06:08:08 +0100 <haskellbridge> <thirdofmay18081814goya> jackdk: ah very neat, will check this out too, have not considered any notion of laziness so far
2025-03-28 06:06:30 +0100LainExperiments4(~LainExper@user/LainExperiments) (Ping timeout: 240 seconds)
2025-03-28 06:03:49 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn
2025-03-28 06:00:02 +0100merijn(~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 244 seconds)
2025-03-28 05:55:35 +0100 <jackdk> thirdofmay18081814goya: Hughes does this for a game tree by generating the infinite tree and then pruning it to N levels, which works because laziness