As a Dutch guy... I'll allow it, but only if y'all admit that the Danish language is at least as silly as Dutch is (must be something about being a flat country next to the North Sea)
Yeah, but Lars Bak isn't exactly a nobody when it comes to computer science either. Although I guess Bak is more famous for the implementation of programming languages than their design.
Aside: funny how Dart and TS both have Danish creators.
Very happy to hear that! I don't work in embedded but really like the language design of Toit. Hope it'll get a second chance, it feels like it flew under the radar a bit when it came out.
IMO that's applied Sayre's Law though. And my explanation for that is that the more niche (and therefore fragile) an academic topic gets, the more defensive people are.
I've heard stories of friends working in (say) such a niche part of fluid dynamics that there's two professors and a few dozen PhDs in the entire world who get it, and the professors refuse to work with anyone who ever cited the other in one of their papers.
On the other hand, I've worked as a programmer for molecular neurobiologists who were working on multi-million dollar research projects mapping out all cell types of the brain using single-cell RNA sequencing, and collaboration seemed much more common there.
The stakes don't get much higher than running the country you're from.
EDIT: Also, the city of Groningen elected a city council of young students and put a 24 year old in charge of the city’s traffic and urban development policy. We still brag about being one of he most bike-friendly cities in the country that was the result.
Nice example of Poe's Law. I genuinely can't tell if this is a sincere comment written by someone who spent too much time in the start-up bubble, or a satirical comment on that type of person said by someone who very much aware that start-ups are just one of many ways humans can organize themselves and who knows that parliamentary politics is nothing like that for very good reasons.
But I do find it hilarious that apparently everyone assumes it to be the former, and that is quite telling about how most of this site's visitors think the other visitors of this site look at the world.
No it comes from spending a lot of time in my home country (the UK), which despite nominally being a parliamentary democracy is very clearly run by a small number of (largely unelected) people at the top.
The same as every company I've ever worked for, large or small.
Some systems obfuscate it more than others, but at the end of the day somebody has to have the executive power to make a decision when the chips are down, or you just have chaos
Since you're working on your own thing that may or may not be like a traditional Forth at all, and also mention Uxn, you might find some ideas in Ben Bridle's Bedrock worth stealing:
> Don Knuth: As you say, I've come to believe that P = N P, namely that there does exist an integer M and an algorithm that will solve every n-bit problem belonging to the class N P in n**M elementary steps.
thanks for the quote. Reading through it is clear that my understanding of P=NP is not complete enough. I would have thought n*M is precisely not polynomial but exponential time.
…Oh, I see. The M here is a hypothesized constant, with n as the base. That's how polynomial time looks. Exponential time would have n in the exponent.
My super large SPA loads in 150ms on localhost. Yes, if it were just a static blog I might get it down to about 60ms.
The problem isn’t the size of the code. It’s the unnecessary framework complexity. Suggesting this to a corporate JavaScript developer, though, is like throwing acid on your own face as they whine about how impossible it is to do their jobs.
Sure, but that misses the point. My big SPA is faster without React and likely faster than a blog that appears to be static text generated from React. Yes, it would be much faster if it were just a few paragraphs of static text, but then it would not display any of the content that it is supposed to display, such as an a remote command shell interface or resource utilization graphs.
There was some discussion about this in the Goose discord a few days ago.
One idea that came up was this: you could define a particuda function name as the "landing pad" for handling particular error kinds. Then you "wrap" calls to the library in a function with this name. Here's a part from a larger worked example:
Wouldn't it be cooler if you could `return IoError{} from ^` and it would find the closest function in the call stack that can return an IoError?
Even better, you could give it some syntactic sugar like `throw IoError{}`? ;)
P.S. I think the `IoError { message, ok }` type is suspiciously close to `Result<(), String>`.. And if you want to return a value in the success case too it'll become even closer. Perhaps it's best to lean into that and find the calling function that can return an IoError as one of the possible values?
reply