Lix Development | 402 Members | |
| (Technical) development of Lix, the package manager, a Nix implementation. Please be mindful of ongoing technical conversations in this channel. | 135 Servers |
| Sender | Message | Time |
|---|---|---|
| 10 Nov 2025 | ||
| It's unclear that in our case we can re-emulate fully the funext behavior | 18:54:26 | |
| This week, I'm swamped with a lot of $WORK, so I'm not sure I will have time to react to anything | 18:54:47 | |
| 11 Nov 2025 | ||
| Some after the work thoughts on pointer equality, my conclusion is similar to Taeer's ones. I look at it this way: for pointer equality use be sound, you need to have a **reflexive** binary relation to apply it to. Structural comparisons are mostly like this except when it comes to incomparable pieces of opaque value like functions. But that's a historical accident and one that I fail to convince myself you can rely on in good faith to write production Nix code. As a result, I would be in favor of making that comparison true even if it was not before. I am quite against reverting the whole thing because now accidental infinite recursions have decreased in occurrence by the virtue of sharing more (graphs with cycles of the exact same object identity wise collapsed into DAGs). Obviously, we need to go and empirically prove that this change won't worsen things. The idea of offering a modified equality operator is interesting in the context because we could abuse scopedImport to create a compatibility mode and we could (no one is gonna let me do that but who knows) expose builtins to construct your own flavor of pointer equality to pass to the scoped import to make broken code run again. | 01:33:24 | |
| (extra spiciness: > desugars... and involves pointer equality albeit irreflexive?) | 01:39:12 | |
| logged in to forgejo, got a 500 (from fj). kept refreshing, getting 500s, then eventually got back to the dashboard (logged out). clicked log in again, then everything worked. | 06:04:51 | |
| jfyi | 06:04:57 | |
| scrapers are hammering git.lix.systems and causing too many postgres connections | 11:15:34 | |
| I just looked into it again and figured out that our extremely basic anti-scraping was in fact not doing anything due to a corrupted nftables internal state | 11:15:57 | |
| so uh hopefully we have fewer problems from now on and nobody got accidentally false-positived | 11:16:25 | |
| if you are having issues accessing git.lix.systems over v4 (timeouts) lmk | 11:16:51 | |
Clarification: "that" here is referring to functions comparing non-equal when they are, in fact, equal?
I think this is fine as long as it's a one-way ratchet. My concern is that we will make something compare equal (that is equal), people start depending on that behaviour, and then later change the structure again in a way that makes those compare non-equal. This is why I was proposing we mark this feature as unstable (maybe unstable isn't the right word, because there's no intention to make it stable in the future) I think we're somewhat lucky in that the state of affairs we need to be backward-compatible with at the moment (pointer equality in CppNix), is very weak (in the sense that very few things compare equal), so it's easy to maintain backward compatibility with it. If we add more things to the relation, it will become harder to change things in ways that maintain backward compatibility. (where by backward compatibility i mean things that used to compare equal continue to compare equal, but not necessarily the inverse)
Clarification: by "the whole thing" you're referring to pointer equality?
Wouldn't what we can expose be super dependent on implementation details? | 14:47:10 | |
"that" refers to any (pointer) equality that evaluated to false when it should have evaluated to true | 15:02:55 | |
yeah this sounds like a permanent xp feature | 15:03:24 | |
i'm referring to the maximal sharing work that was done in Lix | 15:04:01 | |
*
i'm referring to the maximal (well it's not exactly maximal) sharing work that was done in Lix | 15:04:09 | |
idk, we can formalize what is pointer equality | 15:04:28 | |
| we can offer recursive pointer equality, one-off pointer equality, sharing pointer equality, etc. | 15:04:45 | |
| We could also consider making functions comparable | 15:04:53 | |
| like $$\alpha$$-equivalence of lambda terms via bisimilarity or idk | 15:05:10 | |
| * like $$\alpha$$-equivalence of lambda terms via bisimulation or idk | 15:05:16 | |
| I think there are many various ways to compare functions that can be useful in different contexts (string comparison, signature comparison, evaluated comparison, pointer comparison), and it might be weird to prefer one over another. Maybe having no "default" comparison but having options to choose from would be best? | 17:42:38 | |
| I did https://wiki.lix.systems/books/lix-contributors/page/pointer-equality to expand my thoughts and current understanding | 18:07:04 | |
| I feel like there's two directions from the current local optimum (?) we are, kicking function equality out of the language, figuring how far we are willing to go to repair lack of structural equality for complicated types like functions | 18:08:20 | |
pennae are more in favor of kicking the thing out because there's no practical value to offer a real == for fns | 18:08:47 | |
i was in favor of making == for functions complete, i.e. recursive ptr equality + semantic check if ptr equality fails | 18:09:07 | |
| but i sat down and looked how to do it and noped out | 18:09:17 | |
Quip: nix eval "github:nixos/nixpkgs?rev=a999c1cc0c9eb2095729d5aa03e0d8f7ed256780#pkgsCross.gnu64.bitwarden" --no-eval-cache. This wasn’t a regression and doesn’t evaluate under any nix impl. It was the case where nixpkgs machinery thought that it was doing this in cross and thus failed to eval | 18:09:42 | |
| aaaaaaaaah thanks | 18:09:54 | |
| well the other thing was a regression no? | 18:10:00 | |
| | 18:10:06 | |