Newest at the top
2025-05-13 22:27:29 +0200 | <xeno11> | tomsmeding: I was looking but not exactly sure what to report on... i have the --verbose output here: https://paste.debian.net/hidden/e5bcf24f/ |
2025-05-13 22:22:19 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
2025-05-13 22:13:23 +0200 | <tomsmeding> | seems like a bunch of messages got lost, too |
2025-05-13 22:11:50 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 260 seconds) |
2025-05-13 22:09:52 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) (Ping timeout: 252 seconds) |
2025-05-13 22:08:55 +0200 | <EvanR> | to quote thor: ragnarok, "who took the sword!" (that unlocks the bifrost) |
2025-05-13 22:08:53 +0200 | takuan | (~takuan@d8D86B601.access.telenet.be) (Remote host closed the connection) |
2025-05-13 22:08:05 +0200 | <EvanR> | whoa was haskell bridge off this whole time |
2025-05-13 22:07:13 +0200 | <haskellbridge> | <thirdofmay18081814goya> whoops, the "Right" case here needs to "++" with "toPathVals MkRecordV xs" too |
2025-05-13 22:07:11 +0200 | <haskellbridge> | ... long message truncated: https://kf8nh.com/_heisenbridge/media/kf8nh.com/iZbktTBScUYJbjkjdOGISIYE/YQOzohIwgLM (11 lines) |
2025-05-13 22:07:10 +0200 | <haskellbridge> | <thirdofmay18081814goya> data Record a = MkRecordV [(String, Either a (Record a))] deriving Show |
2025-05-13 22:07:08 +0200 | <haskellbridge> | <thirdofmay18081814goya> the idea is to have predicates that take a path in order to do validation at that path |
2025-05-13 22:07:07 +0200 | <haskellbridge> | <thirdofmay18081814goya> ty for the idea! |
2025-05-13 22:07:04 +0200 | <haskellbridge> | <thirdofmay18081814goya> ozkutuk: hm I need the value and the end of the path in order to do validation, but that does make me think we can use the tree of strings to access the original datatype |
2025-05-13 22:07:02 +0200 | <haskellbridge> | <ozkutuk> (I mean, not isomorphic per se, but should be a sufficient form to work with since you seem to be only interested in the strings) |
2025-05-13 22:07:01 +0200 | <haskellbridge> | <ozkutuk> for example, "Data.Tree.pathsFromRoot" could be of use then |
2025-05-13 22:06:59 +0200 | <haskellbridge> | <ozkutuk> That form might be easier to work with |
2025-05-13 22:06:56 +0200 | <haskellbridge> | <thirdofmay18081814goya> ? |
2025-05-13 22:06:55 +0200 | <haskellbridge> | <thirdofmay18081814goya> anyone know how to do the exercise Vector Head in chapter 4 |
2025-05-13 22:06:53 +0200 | <haskellbridge> | <thirdofmay18081814goya> sm: ah neat! I keep hearing about it. today is the day I try it out |
2025-05-13 22:06:52 +0200 | <haskellbridge> | <thirdofmay18081814goya> hm would be nice to have the solutions to the liquid haskell tutorial |
2025-05-13 22:06:50 +0200 | <haskellbridge> | <thirdofmay18081814goya> sm: but this definitely is part of runtime validation ty, had not encountered it before |
2025-05-13 22:06:49 +0200 | <haskellbridge> | <sm> there's Liquid Haskell, which is like contracts. But it's compile time I believe |
2025-05-13 22:06:46 +0200 | <haskellbridge> | <thirdofmay18081814goya> hm I was wondering if there was even a need to develop things like contracts libraries given haskell's sufficiently expressive type system |
2025-05-13 22:06:45 +0200 | <haskellbridge> | <sm> do you mean something else ? |
2025-05-13 22:06:45 +0200 | sabathan2 | (~sabathan@amarseille-159-1-12-107.w86-203.abo.wanadoo.fr) |
2025-05-13 22:06:43 +0200 | <haskellbridge> | <sm> there's https://hackage.haskell.org/package/base-4.21.0.0/docs/Control-Exception.html#v:assert ... |
2025-05-13 22:06:42 +0200 | <haskellbridge> | <thirdofmay18081814goya> what does the runtime validation landscape look like in haskell? |
2025-05-13 22:06:30 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
2025-05-13 22:06:26 +0200 | sabathan2 | (~sabathan@amarseille-159-1-12-107.w86-203.abo.wanadoo.fr) (Remote host closed the connection) |
2025-05-13 22:05:32 +0200 | ChanServ | +v haskellbridge |
2025-05-13 22:05:32 +0200 | haskellbridge | (~hackager@syn-096-028-227-029.res.spectrum.com) hackager |
2025-05-13 22:04:40 +0200 | catties | bunnies |
2025-05-13 21:57:59 +0200 | <EvanR> | but I guess that's a puzzle for tomorrow |
2025-05-13 21:57:48 +0200 | <EvanR> | it also doesn't help I have no idea how a letrec would get compiled to make use of these instructions |
2025-05-13 21:57:21 +0200 | <EvanR> | that makes sense but then I still have trouble with the semantics of the transition table |
2025-05-13 21:57:10 +0200 | halloy5771 | (~halloy577@205.175.106.139) (Read error: Connection reset by peer) |
2025-05-13 21:57:09 +0200 | acidjnk | (~acidjnk@p200300d6e71c4f1918462650bcfe20e4.dip0.t-ipconnect.de) (Ping timeout: 248 seconds) |
2025-05-13 21:55:24 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 245 seconds) |
2025-05-13 21:54:20 +0200 | Square2 | (~Square@user/square) (Ping timeout: 260 seconds) |
2025-05-13 21:51:23 +0200 | <monochrom> | Conversely! Robert Harper noted that memory comes from feedback loops. Mercury tubes, flip flops. |
2025-05-13 21:50:44 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
2025-05-13 21:50:36 +0200 | Square | (~Square4@user/square) Square |
2025-05-13 21:49:46 +0200 | <monochrom> | EvanR: Yeah, one way to support recursion, more generally tying knots, is a mutable cell that you write once to when you've finished the setup. |
2025-05-13 21:48:52 +0200 | wootehfoot | (~wootehfoo@user/wootehfoot) (Read error: Connection reset by peer) |
2025-05-13 21:47:41 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
2025-05-13 21:44:11 +0200 | ystael | (~ystael@user/ystael) ystael |
2025-05-13 21:43:30 +0200 | <tomsmeding> | xeno11: any interesting info in `cabal build --verbose`? |
2025-05-13 21:40:33 +0200 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 276 seconds) |
2025-05-13 21:38:35 +0200 | ystael | (~ystael@user/ystael) (Ping timeout: 260 seconds) |