Lix Development | 436 Members | |
| (Technical) development of Lix, the package manager, a Nix implementation. Please be mindful of ongoing technical conversations in this channel. | 145 Servers |
| Sender | Message | Time |
|---|---|---|
| 11 Nov 2025 | ||
| 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 | |