Zed already had terms of use that forbid "reverse engineering" (ie looking at the GPL source code).
Gram is a hard fork that removes the TOS, telemetry and AI, and turns Zed into just a text editor.
Readit Newsdoug-moen commented on Zed will require age identification for its services zed.dev/terms#21-eligibil... · Posted by u/delduca
doug-moen commented on Bootc and OSTree: Modernizing Linux System Deployment a-cup-of.coffee/blog/ostr... · Posted by u/mrtedbear
bootc and OSTree are both very neat, but the leading edge of immutable Linux distros (GNOME OS, KDE Linux) is currently converging on a different proposal by systemd developers that's standardized by the UAPI Group (https://uapi-group.org/specifications/). It fixes quite a few of the complexities with OSTree (updates are handled by `systemd-sysupdate`/`updatectl` and are just files served via HTTP) and is quite a bit easier to extend with things like an immutable version of the Nvidia drivers or codecs thanks to system extensions handled by `systemd-sysext` (which in turn are just simple squashfs files overlayed over `/usr`) and configuration via `systemd-confext`. `mkosi`, also by systemd, is quickly becoming _the_ way to build custom images too, and is somewhat tied to these new standards.
GNOME OS and KDE Linux are both specialized distros that primarily exist to test GNOME and KDE. They aren't for general users, and both web sites warn you not to rely on them. And they impose limitations on your ability to install arbitrary 3rd party software, whereas Fedora Atomic Desktop lets you customize the system without such limitations. Fedora Atomic lets me install arbitrary RPMs into the base system.
"quite a bit easier to extend" sounds good to me, but the "easier" here refers to the internal system implementation details? I am an end user, not a Linux distro system architect, and I care more about the user experience. I will be interested in test driving a general purpose OS based on this technology, whenever that happens in the future. Since Red Hat is involved in the UAPI project, perhaps Fedora Atomic Desktop will migrate to this technology in the future?
Hmm this is a bit like peeling a banana only to throw the banana and eat the peel. Pass by value reduces the true benefit of copy-on-write.
Use immutable pass by reference. Make a copy only if mutability is requested in the thread. This makes concurrent reads lock-free but also cuts down on memory allocations.
I think that what you are calling "immutable pass by reference" is what the OP is calling "pass by value". See, when used abstractly, "pass by value" means that the argument is passed as a value, hence it is immutable and the callee can't mutate it. One way to implement this is by copying the data that represents the value. In the OP's language, and in many other languages that work this way, instead of copying the data, we implement "pass by value" by incrementing the reference count and passing a pointer to the original data. These differing implementations provide the same abstract semantics, but differ in performance.
At the risk of telling you what you already know and/or did not mean to say: not everything can be a value. If everything is a value then no computation (reduction) is possible. Why? Because computation stops at values. This is traditional programming language/lambda calculus nomenclature and dogma. See Plotkin's classic work on PCF (~ 1975) for instance; Winskel's semantics text (~ 1990) is more approachable.
Things of course become a lot more fun with concurrency.
Now if you want a language where all the data thingies are immutable values and effects are somewhat tamed but types aren't too fancy etc. try looking at Milner's classic Standard ML (late 1970s, effectively frozen in 1997). It has all you dream of and more.
In any case keep having fun and don't get too bogged in syntax.
I am unable to extract any meaning from your post. You appear to be making a general claim: it is impossible to design a programming language where everything is a value. You at least admit that "data thingies" can be values. Are you claiming that it is not possible for functions to be values? (If we assume that the argument and the result of a function call is a value, then this would mean higher order functions are impossible, for example.) If not that, then what? Please give a specific example of something that can never be a value in any programming language that I care to design.
This is Trump's MAGA diet, a replacement for the lame liberal DEI diet of the Biden administration. Not hyperbole, the web site states all this explicitly if you click through to this link: <https://cdn.realfood.gov/Scientific%20Report.pdf>
The Scientific Report mentions Trump 4 times, so I looked up Trump's diet. Seems he eats a lot of McDonalds takeout and drinks a lot of diet coke. It seems to me that Trump's diet is an exemplary and healthy diet that follows these new recommendations, which prioritizes foods such as beef, oils and animal fat (including full fat dairy) and potatoes. Cheeseburger and fries, and the diet coke avoids added sugar, while promoting hydration. Trump might be prickly about past criticism of his diet; now he can point to these recommendations.
doug-moen commented on Some Junk Theorems in Lean github.com/James-Hanson/j... · Posted by u/saithound
the last paragraphs cite why junk theorems are objectionable but then fully misinterprets it to draw the opposite conclusion. the intersection is the S-feature and problematic. 1 + 2 = 4 is a “theorem beyond T” expressed in T theory.
don’t be mislead about what a junk theorem is!
Yah, I read that and thought "this seems like gibberish: maybe I am reading LLM slop".
doug-moen commented on Dogalog: A realtime Prolog-based livecoding music environment github.com/danja/dogalog... · Posted by u/triska
Was it vibe-coded or is it just the README? Not a critique, just a question.
Yes, it was vibe-coded, and the author says they still haven't learned Prolog yet. <https://www.reddit.com/r/livecoding/comments/1pmabwv/dogalog...>
doug-moen commented on The original ABC language, Python's predecessor (1991) github.com/gvanrossum/abc... · Posted by u/tony
Wow 2 * 1000 without rounding errors, 40 years ago this must have been super impressive, since I find that quite a feat of today's python.
Lisp has had arbitrary precision arithmetic since the early 1970s. So did dc on Unix, also in the early 1970s. ABC didn't arrive until 1987.
doug-moen commented on New OS aims to provide (some) compatibility with macOS github.com/ravynsoft/ravy... · Posted by u/kasajian
> The world has moved on
we're talking about laptops, right?
no, they are talking about high performance desktops, mostly. They link to the Framework desktop, which has 256 GB/s memory bandwith. For comparison, the Apple Mac Pro has 800 GB/s memory bandwidth. Neither manufacturer is able to achieve these speeds using socketed memory.
- ability to sandbox Google Play and Google Apps so that they live in their nice little Google bubble and have no control over my phone overall
- ability to run all applications sandboxed with fake permissions that I can whitelist for each application and without letting the app know it doesn't have the permissions it wants. Want location? Give the app a location point I've fixed for that app. (Or pass through real GPS location if I've chosen so.) Want contacts? Give the app empty contacts list. Or if I've allowed, give the app the contacts I've whitelisted.
The Android/Google ecosystem is all right in itself, I just want to limit all of it inside a cage that I control. I want the exact same for my browser: I want webpages to run in a highly controlled sandbox with my choice of spoofed environment and permissions instead of assuming any power over my system. Or my Linux desktop where I firejail or sandbox certain proprietary apps outside of my distro's repositories.
https://discuss.grapheneos.org/d/27926-per-profile-location-...
Currently there is a Mock Location feature, but it is globally scoped and not what you asked for.