Newest at the top
2025-05-03 20:54:37 +0200 | <monochrom> | Or maybe I still don't heh. |
2025-05-03 20:54:36 +0200 | wootehfoot | (~wootehfoo@user/wootehfoot) (Read error: Connection reset by peer) |
2025-05-03 20:54:28 +0200 | <monochrom> | Or should it be "{name :: String, age :: Int, id :: f ()}"? Then I can see what to do with f. |
2025-05-03 20:53:20 +0200 | <monochrom> | [exa]: How does HKT help? Do I have like "data T f = {name :: f String, age :: f Int}"? For now I can't think of what to use for f for references. |
2025-05-03 20:49:25 +0200 | ljdarj1 | ljdarj |
2025-05-03 20:49:25 +0200 | ljdarj | (~Thunderbi@user/ljdarj) (Ping timeout: 265 seconds) |
2025-05-03 20:48:41 +0200 | <[exa]> | I'd say follow unix, prototype it first to the working state, then you can trash it constructively, with much less ambiguity |
2025-05-03 20:48:02 +0200 | <haskellbridge> | <Liamzee> *in progress |
2025-05-03 20:47:53 +0200 | <haskellbridge> | <Liamzee> mine |
2025-05-03 20:47:47 +0200 | <[exa]> | "your" as on one's own or other people's ? |
2025-05-03 20:47:41 +0200 | <haskellbridge> | <Liamzee> I have a library in process, but I feel like, the more I explore the space the more I think my fundamental library architecture is broken (for instance, I think splitting it into a core and callers for API is a good idea now) |
2025-05-03 20:46:55 +0200 | <haskellbridge> | <Liamzee> What's the Haskell community's guidance on rewriting your libraries? |
2025-05-03 20:45:10 +0200 | ljdarj1 | (~Thunderbi@user/ljdarj) ljdarj |
2025-05-03 20:36:07 +0200 | <[exa]> | ah I meant the usual HKD |
2025-05-03 20:34:31 +0200 | <EvanR> | ? |
2025-05-03 20:34:16 +0200 | <EvanR> | higher order types |
2025-05-03 20:34:13 +0200 | <EvanR> | what's the politically correct name for higher kinded types |
2025-05-03 20:32:53 +0200 | j1n37- | (~j1n37@user/j1n37) (Ping timeout: 248 seconds) |
2025-05-03 20:31:49 +0200 | j1n37 | (~j1n37@user/j1n37) j1n37 |
2025-05-03 20:31:20 +0200 | <[exa]> | hm, beam hides the references by higher-kinded types, not bad |
2025-05-03 20:30:31 +0200 | peterbecich | (~Thunderbi@syn-047-229-123-186.res.spectrum.com) peterbecich |
2025-05-03 20:29:01 +0200 | acidjnk_new3 | (~acidjnk@p200300d6e71c4f7604057216e123cf7a.dip0.t-ipconnect.de) acidjnk |
2025-05-03 20:27:13 +0200 | <[exa]> | ok well I guess I'm hitting the same wall as ORMs |
2025-05-03 20:19:16 +0200 | <[exa]> | :] |
2025-05-03 20:19:05 +0200 | <[exa]> | monochrom: nah the bottled one is called beer |
2025-05-03 20:18:06 +0200 | tzh | (~tzh@c-76-115-131-146.hsd1.or.comcast.net) tzh |
2025-05-03 20:17:48 +0200 | <monochrom> | Um, is that code for LSD? >:) |
2025-05-03 20:16:27 +0200 | acidjnk_new3 | (~acidjnk@p200300d6e71c4f76bcfd7e139b6b957f.dip0.t-ipconnect.de) (Ping timeout: 252 seconds) |
2025-05-03 20:13:59 +0200 | Sgeo | (~Sgeo@user/sgeo) Sgeo |
2025-05-03 20:10:56 +0200 | [exa] | pops a brainstorming booster bottle |
2025-05-03 20:10:40 +0200 | <[exa]> | which looks convenient enough |
2025-05-03 20:10:28 +0200 | <[exa]> | maybe I'll just need to invent some way to throw this at the library user |
2025-05-03 20:09:47 +0200 | <monochrom> | Well, I would just say "use a Unique monad". |
2025-05-03 20:09:20 +0200 | <monochrom> | OK the question of UIDs. |
2025-05-03 20:08:36 +0200 | <monochrom> | (the "network" there just means graph, object graph, so again your vanilla record in which some fields are pointers to other records) |
2025-05-03 20:08:34 +0200 | <[exa]> | not really, this issue is common to both |
2025-05-03 20:07:54 +0200 | <monochrom> | Oh! Are we just looking at "network databases" such as in the dark ages vs "relational databases" such as in the modern enlightened time? |
2025-05-03 20:07:49 +0200 | <[exa]> | but this time with blackjack and types |
2025-05-03 20:07:32 +0200 | <[exa]> | yeah starting to look much more like another prolog reimplementation. |
2025-05-03 20:01:59 +0200 | tromp | (~textual@2001:1c00:3487:1b00:31c9:5f27:18bf:4d4e) |
2025-05-03 19:57:04 +0200 | <monochrom> | May I also tempt you into taking a look at the Curry language so you don't even have to use Prolog syntax! (It uses Haskell syntax.) >:) |
2025-05-03 19:55:30 +0200 | <[exa]> | ok I should certainly go more in the prolog path (query & assert) instead of plain decode&encode |
2025-05-03 19:54:34 +0200 | <[exa]> | yeah it looks like it's gonna be a view |
2025-05-03 19:54:18 +0200 | <EvanR> | an arbitrary report |
2025-05-03 19:54:04 +0200 | <EvanR> | is a haskell value just a report or view of the database |
2025-05-03 19:53:32 +0200 | <[exa]> | EvanR: as a haskell value. |
2025-05-03 19:53:30 +0200 | <monochrom> | "The first soap opera written in datalog." >:) |
2025-05-03 19:52:37 +0200 | <monochrom> | May I use this example? name(mary,"Mary"). name(alice,"Alice"). name(alice2,"Alice"). crush(mary,alice). crush(alice,alice2). crush(alice2,mary). |
2025-05-03 19:50:14 +0200 | <EvanR> | I'm not sure what use as objects means |
2025-05-03 19:49:27 +0200 | <[exa]> | EvanR: probably an entity then. I'm not trying to dodge IDs, more like trying to find what name and type the functions that "do it" should be so that I'm preferably separating the objectness and entityness of the things as well as possible. I want to use these things as objects when they get deserialized. |