Newest at the top
| 2026-02-24 23:15:12 +0100 | <mauke> | nvm, I'm blind |
| 2026-02-24 23:13:01 +0100 | <mauke> | 1 + 2 = 3 |
| 2026-02-24 23:12:45 +0100 | <mauke> | ah, I see it |
| 2026-02-24 23:11:53 +0100 | petrichor | (~jez@user/petrichor) (Ping timeout: 248 seconds) |
| 2026-02-24 23:10:01 +0100 | abiss27 | (~abiss27@user/abiss) abiss |
| 2026-02-24 23:08:07 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2026-02-24 23:04:47 +0100 | <haskellbridge> | <ijouw> Working on it |
| 2026-02-24 23:04:44 +0100 | <tomsmeding> | (there is, but figuring out what the splitting is, requires a little trick) |
| 2026-02-24 23:04:35 +0100 | target_i | (~target_i@user/target-i/x-6023099) (Quit: leaving) |
| 2026-02-24 23:04:32 +0100 | peterbecich | (~Thunderbi@71.84.33.135) peterbecich |
| 2026-02-24 23:04:25 +0100 | <tomsmeding> | ijouw: do you have a proof that if sum [1..n] is even, there is such a splitting? |
| 2026-02-24 23:04:21 +0100 | takuan | (~takuan@d8D86B9E9.access.telenet.be) (Ping timeout: 255 seconds) |
| 2026-02-24 23:03:59 +0100 | <haskellbridge> | <ijouw> Isn't the two sets algorithm discussed above easy to compute? The question is whether the sum [1..n] is even (solvable in constant time) (or am I missing something?). Printing could indeed be slowest part. |
| 2026-02-24 23:03:14 +0100 | philderbeast | (~philderbe@57-134-39-54.resi.cgocable.ca) (Client Quit) |
| 2026-02-24 23:02:15 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) (Quit: Leaving...) |
| 2026-02-24 23:01:40 +0100 | Milan_Vanca | (~milan@user/Milan-Vanca:32634) (Quit: WeeChat 4.7.2) |
| 2026-02-24 23:01:02 +0100 | merijn | (~merijn@host-cl.cgnat-g.v4.dfn.nl) merijn |
| 2026-02-24 23:00:27 +0100 | ChaiTRex | (~ChaiTRex@user/chaitrex) ChaiTRex |
| 2026-02-24 22:59:44 +0100 | Guest81 | (~Guest81@52.144.37.132) () |
| 2026-02-24 22:59:39 +0100 | philderbeast | (~philderbe@57-134-39-54.resi.cgocable.ca) |
| 2026-02-24 22:58:31 +0100 | ChaiTRex | (~ChaiTRex@user/chaitrex) (Client Quit) |
| 2026-02-24 22:57:44 +0100 | <EvanR> | repl is overrated, you want to load a file anyway. Then reload |
| 2026-02-24 22:57:07 +0100 | <tomsmeding> | that's probably easiest, yes (use ghcup) |
| 2026-02-24 22:56:55 +0100 | <Guest81> | So i need ghci. Thanks all. |
| 2026-02-24 22:55:48 +0100 | <tomsmeding> | ghci does quite a bit more than just an interpreter for basic expressions, and "learn you a haskell" assumes ghci |
| 2026-02-24 22:55:46 +0100 | <mauke> | a = [1,2,3] is not an expression |
| 2026-02-24 22:55:35 +0100 | <tomsmeding> | it is an interpreter, but not ghci |
| 2026-02-24 22:55:12 +0100 | ChaiTRex | (~ChaiTRex@user/chaitrex) ChaiTRex |
| 2026-02-24 22:55:10 +0100 | <Guest81> | OK so basically "Try it!" is not a true interpreter. |
| 2026-02-24 22:55:02 +0100 | <geekosaur> | probably just hint |
| 2026-02-24 22:55:00 +0100 | <monochrom> | Who writes 1000 lines of code on a REPL anyway? Be realistic. |
| 2026-02-24 22:54:51 +0100 | ChaiTRex | (~ChaiTRex@user/chaitrex) (Remote host closed the connection) |
| 2026-02-24 22:54:33 +0100 | astra | (sid289983@id-289983.hampstead.irccloud.com) |
| 2026-02-24 22:54:32 +0100 | prdak | (~Thunderbi@user/prdak) (Ping timeout: 268 seconds) |
| 2026-02-24 22:54:31 +0100 | <tomsmeding> | play.haskell.org is not a repl, though :) |
| 2026-02-24 22:54:20 +0100 | <tomsmeding> | apparently it accepts only full expressions |
| 2026-02-24 22:54:19 +0100 | astra | (sid289983@user/amish) (Server closed connection) |
| 2026-02-24 22:54:18 +0100 | <monochrom> | But play.haskell.org is better. |
| 2026-02-24 22:54:07 +0100 | <tomsmeding> | ah yes, that does work Guest81 ^ |
| 2026-02-24 22:53:51 +0100 | <monochrom> | "let a = [1,2,3] in length a" |
| 2026-02-24 22:53:35 +0100 | <monochrom> | Oh that. Sorry! |
| 2026-02-24 22:53:23 +0100 | <tomsmeding> | monochrom: we're talking about the "Try it!" thing on haskell.org, which is stupid and broken |
| 2026-02-24 22:53:12 +0100 | <monochrom> | "let a = [1,2,3]" also works for me. |
| 2026-02-24 22:53:06 +0100 | <tomsmeding> | there's https://play.haskell.org if you want to upgrade to writing a full program (which doesn't have to be complicated!); otherwise, either install ghci, or there may be some other online repl |
| 2026-02-24 22:52:47 +0100 | <monochrom> | "a = [1,2,3]" works for me. |
| 2026-02-24 22:52:32 +0100 | <EvanR> | "interesting" |
| 2026-02-24 22:52:21 +0100 | <Guest81> | <no location info>: not an expression: ‘let a = [1,2,3]’ |
| 2026-02-24 22:52:20 +0100 | <Guest81> | no go: let a = [1,2,3] |
| 2026-02-24 22:52:08 +0100 | <tomsmeding> | it doesn't there |
| 2026-02-24 22:52:02 +0100 | <EvanR> | a = [1,2,3] ought to work in ghci and at top level? |