Newest at the top
| 2025-12-03 23:23:00 +0100 | <haskellbridge> | <lucabtz> Maybe in + I would require commutative too though |
| 2025-12-03 23:22:27 +0100 | ZLima12_ | ZLima12 |
| 2025-12-03 23:21:28 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-03 23:17:34 +0100 | <monochrom> | :) |
| 2025-12-03 23:10:33 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
| 2025-12-03 23:09:16 +0100 | <haskellbridge> | <lucabtz> Leary yeah looks great |
| 2025-12-03 23:05:44 +0100 | Googulator | (~Googulato@2a01-036d-0106-479c-d9ec-010d-f188-ffcb.pool6.digikabel.hu) |
| 2025-12-03 23:05:39 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-03 23:05:34 +0100 | Googulator | (~Googulato@2a01-036d-0106-479c-d9ec-010d-f188-ffcb.pool6.digikabel.hu) (Quit: Client closed) |
| 2025-12-03 23:05:19 +0100 | X-Scale | (~ARM@50.65.114.89.rev.vodafone.pt) (Ping timeout: 240 seconds) |
| 2025-12-03 23:04:01 +0100 | lambda_gibbon | (~lambda_gi@208.83.175.39) |
| 2025-12-03 23:02:24 +0100 | lambda_gibbon | (~lambda_gi@208.83.175.39) (Ping timeout: 260 seconds) |
| 2025-12-03 23:01:25 +0100 | weary-traveler | (~user@user/user363627) (Remote host closed the connection) |
| 2025-12-03 22:59:49 +0100 | <Leary> | lucabtz: You might be interested in these, which I wrote forever ago: https://paste.tomsmeding.com/eQbuVoyR |
| 2025-12-03 22:57:54 +0100 | <EvanR> | seems to work for them |
| 2025-12-03 22:57:46 +0100 | <EvanR> | but this class basically mirrors the idris version of Num |
| 2025-12-03 22:57:43 +0100 | <haskellbridge> | <lucabtz> I'm typing from the phone :p |
| 2025-12-03 22:57:41 +0100 | lambda_gibbon | (~lambda_gi@208.83.175.39) |
| 2025-12-03 22:57:23 +0100 | <EvanR> | one :: 0 |
| 2025-12-03 22:56:57 +0100 | <haskellbridge> | <lucabtz> Doesn't use phantom types, but still connects Monoid to Additive and Multiplicative |
| 2025-12-03 22:56:26 +0100 | <haskellbridge> | <lucabtz> would this work |
| 2025-12-03 22:56:21 +0100 | <haskellbridge> | <lucabtz> https://paste.tomsmeding.com/2X4DbihK |
| 2025-12-03 22:56:07 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-12-03 22:51:27 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-12-03 22:49:12 +0100 | <EvanR> | also answers what fromInteger does |
| 2025-12-03 22:48:54 +0100 | <EvanR> | by producing nonsense when you mess up |
| 2025-12-03 22:48:39 +0100 | <EvanR> | now it's not partial and fails on you just like untyped languages |
| 2025-12-03 22:47:57 +0100 | <EvanR> | compute the answers lazily, fits any finite use case |
| 2025-12-03 22:47:38 +0100 | <EvanR> | to simplify the "untyped matrix" thing, make it an infinite grid with cell 0 0 at the center |
| 2025-12-03 22:44:51 +0100 | <EvanR> | xD |
| 2025-12-03 22:44:45 +0100 | <EvanR> | it's the first choice in the list |
| 2025-12-03 22:43:57 +0100 | <tomsmeding> | that makes only slightly less sense than a 1x1 matrix |
| 2025-12-03 22:43:44 +0100 | <EvanR> | tomsmeding, a zero by zero matrix |
| 2025-12-03 22:43:25 +0100 | <tomsmeding> | (which is ameliorated by binary operations auto-broadcasting their operands when one of their dimensions has size 1) |
| 2025-12-03 22:42:36 +0100 | <tomsmeding> | this instance returns a 1x1 matrix in fromInteger, which is about the best you can do |
| 2025-12-03 22:42:25 +0100 | <tomsmeding> | https://hackage.haskell.org/package/hmatrix-0.20.2/docs/src/Numeric.Matrix.html#line-48 |
| 2025-12-03 22:42:09 +0100 | takuan | (~takuan@d8D86B9E9.access.telenet.be) (Remote host closed the connection) |
| 2025-12-03 22:40:47 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 265 seconds) |
| 2025-12-03 22:40:32 +0100 | dhil | (~dhil@5.151.29.137) (Ping timeout: 240 seconds) |
| 2025-12-03 22:40:27 +0100 | ljdarj1 | ljdarj |
| 2025-12-03 22:40:27 +0100 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 252 seconds) |
| 2025-12-03 22:40:11 +0100 | ljdarj1 | (~Thunderbi@user/ljdarj) ljdarj |
| 2025-12-03 22:39:58 +0100 | <tomsmeding> | (yes, if the dimensions are in the type all is fine) |
| 2025-12-03 22:39:28 +0100 | <tomsmeding> | I'd say an untyped matrix type with (+) and (*) makes some amount of sense, even if the operations are necessarily partial. I have not even a partial definition to give for fromInteger |
| 2025-12-03 22:38:58 +0100 | <tomsmeding> | less! |
| 2025-12-03 22:38:51 +0100 | <Leary> | tomsmeding: Yep, hence "makes as much sense as your `Num`." |
| 2025-12-03 22:38:50 +0100 | <haskellbridge> | <lucabtz> What if you want a Monoid neither of those? |
| 2025-12-03 22:38:40 +0100 | <tomsmeding> | I can't even suffice with a partial fromInteger -- well, one that is defined as `error` is possible, yes |
| 2025-12-03 22:38:27 +0100 | <monochrom> | Yeah, a phantom type that specifies the binary operator. |
| 2025-12-03 22:38:25 +0100 | <tomsmeding> | Leary: well, the other operations are partial. |