Like, all of it. People who decry it think of Wirth's original implementation but never the decades of (admittedly slow, Delphi was hardly blazing trails here...) improvements so they think it sucks. Pascal is great.
With AI, I think it's a future worth exploring. Great low-level and efficient string handling, unlike C.
Stupendously fast compiler and linker, and it generates code that's near C++/C/Rust performance with relative ease. Cram more useful features into it; keep the memory and pointer system as it is; add more useful language concepts from other places. Hell, strap an optional GC into it for things where you don't care.
I am still in awe of Niklaus Wirth's Project Oberon: The Design of an Operating System and Compiler which includes source for everything from the hardware up and that too in a reasonable sized book - https://news.ycombinator.com/item?id=38869366 (this is the revised 2013 edition, get also the older 1992 edition which contains everything).
When browsers made their appearance as a "platform", i thought this is how they would be implemented, small, tight, fast, fully functional and everything running on a abstract machine. Instead we got the garbage that we have today.
“Space/time tradeoffs” I guess would be the name of it. Memory latency and bandwidth trails op/s of the CPU - operations beat fetches by ~2 orders of magnitude; memory complicates both SIMD and parallelism across cores which is another ~1 order of magnitude each. The back of the envelope suggests we left a 25,000x speedup factor on the table because our systems and tools and intuitions have converged on load-op-store-load-op-store, instead of load-op-op-op-[…]-op-op-store.
It is well past due time to revisit memory allocation from first principles. I recently finished my PhD on the topic, and realized that we have yet to agree on a consistent definition of fragmentation (see Wilson et al's seminal survey on "Dynamic Storage Allocation"), much less how to deal with it.
When I was in the trenches, I had constant cognitive dissonance against the fact that (i) "it's a solved problem" and (ii) low-to-no-malloc was often presented as a feature of low-level code.
My take is, train a SOTA deep learning system on solved static memory allocation instances (which is NP-complete already) and build a dynamic malloc on top.
Disclaimer: I've moved on past academia and I may have missed one or two breakthroughs. But the older the problem, the higher the probability of it staying open.
I'm not sure anybody has ever felt memory allocation was a solved problem. But more that it's a difficult one to do well for everybody.
You can build fancy balancing trees, heaps and all sorts to try and counteract fragmentation, but then you risk messing up cache coherency and you may spend a lot of time doing tedious busywork that can hold up real work.
What we have now is subobtimal for sure. Particularly if you come along and allocate huge swathes of memory in userland and then release it, only to re-alloc it. Huge page tables help a lot here, from the user/kernel side of things. But of course that is also not a perfect solution. Most apps don't want huge page tables as they don't map well onto normal things like browsing and listening to music. And so it goes; round and round.
I completely agree. In August I discovered the key to faster data transmission is better memory management. This allowed me to write a common protocol library in TypeScript that is about 35x faster than the current fastest implementation.
Due to a defect in my perf tool I eventually discovered that about 99.2% of processing time was spent on memory management, not instruction processing or network buffer. I was working in a high level garbage collected language, so I could not fine tune adjustments to pointers. Instead I got creative with call stack management and low level data frame header authoring. Now I am trying to replicate that success back to a low level http 1.1 implementation and it’s much more challenging.
Operating system design, and distributed operating system design (k8s falls well short of a distributed OS; it’s more like a toolkit that does the compute part)
Right. Before the web took off i believed distributed OSes (eg. Amaoeba, Plan 9, Inferno etc.) along with all sorts of OO middleware (eg. CORBA, DCOM etc.) would become the "standard" way to do distributed network computing.
Had that happened we wouldn't be wasting so much hardware today (old smartphones/tablets/laptops/etc.) but could have leveraged it all in a unified private network. Every single computer in my home would be now part of a distributed computing platform managed by a distributed OS.
The irony is that today the entire Cloud architecture viz. Docker, Kubernetes, REST etc. frameworks are actually recreating the above design!
Evolutionary programming. Very suited to goals and agentic stuff. I'd be surprised if it's not yet in production somewhere.
Procedurally generated content is also a lot more interesting. Without structure, you get slop.
You can set the beginning of a story and an ending, as well as a story contour. Then procedurally generate content that ends at these points, even if they seem to veer away.
Metaprogramming for similar reasons, things like writing scripts/languages for very specific problems.
There's good techniques for all these, but the ROI was too low compared to the returns. It was difficult to write tests for the output space, but now it's a lot simpler.
All types of unconventional/exotic computing. I think this has been criminally neglected ever since the ascendancy of the von neumann architecture digital computer.
I wonder if there are any modern languages that would be particularly interesting to make specific hardware for.
The only example I know of is the one that runs Java bytecode.
Pascal.
Like, all of it. People who decry it think of Wirth's original implementation but never the decades of (admittedly slow, Delphi was hardly blazing trails here...) improvements so they think it sucks. Pascal is great.
With AI, I think it's a future worth exploring. Great low-level and efficient string handling, unlike C.
Stupendously fast compiler and linker, and it generates code that's near C++/C/Rust performance with relative ease. Cram more useful features into it; keep the memory and pointer system as it is; add more useful language concepts from other places. Hell, strap an optional GC into it for things where you don't care.
Nice.
Brinch Hansen on Pascal Compilers - https://news.ycombinator.com/item?id=24913959
I am still in awe of Niklaus Wirth's Project Oberon: The Design of an Operating System and Compiler which includes source for everything from the hardware up and that too in a reasonable sized book - https://news.ycombinator.com/item?id=38869366 (this is the revised 2013 edition, get also the older 1992 edition which contains everything).
When browsers made their appearance as a "platform", i thought this is how they would be implemented, small, tight, fast, fully functional and everything running on a abstract machine. Instead we got the garbage that we have today.
“Space/time tradeoffs” I guess would be the name of it. Memory latency and bandwidth trails op/s of the CPU - operations beat fetches by ~2 orders of magnitude; memory complicates both SIMD and parallelism across cores which is another ~1 order of magnitude each. The back of the envelope suggests we left a 25,000x speedup factor on the table because our systems and tools and intuitions have converged on load-op-store-load-op-store, instead of load-op-op-op-[…]-op-op-store.
It is well past due time to revisit memory allocation from first principles. I recently finished my PhD on the topic, and realized that we have yet to agree on a consistent definition of fragmentation (see Wilson et al's seminal survey on "Dynamic Storage Allocation"), much less how to deal with it.
When I was in the trenches, I had constant cognitive dissonance against the fact that (i) "it's a solved problem" and (ii) low-to-no-malloc was often presented as a feature of low-level code.
My take is, train a SOTA deep learning system on solved static memory allocation instances (which is NP-complete already) and build a dynamic malloc on top.
To see where the static SOTA was a couple years ago, see this: https://arxiv.org/abs/2504.04874
And also my general audience-friendly presentation of it: https://cappadokes.github.io/jekyll/update/2025/07/16/welcom...
Disclaimer: I've moved on past academia and I may have missed one or two breakthroughs. But the older the problem, the higher the probability of it staying open.
I'm not sure anybody has ever felt memory allocation was a solved problem. But more that it's a difficult one to do well for everybody.
You can build fancy balancing trees, heaps and all sorts to try and counteract fragmentation, but then you risk messing up cache coherency and you may spend a lot of time doing tedious busywork that can hold up real work.
What we have now is subobtimal for sure. Particularly if you come along and allocate huge swathes of memory in userland and then release it, only to re-alloc it. Huge page tables help a lot here, from the user/kernel side of things. But of course that is also not a perfect solution. Most apps don't want huge page tables as they don't map well onto normal things like browsing and listening to music. And so it goes; round and round.
I completely agree. In August I discovered the key to faster data transmission is better memory management. This allowed me to write a common protocol library in TypeScript that is about 35x faster than the current fastest implementation.
Due to a defect in my perf tool I eventually discovered that about 99.2% of processing time was spent on memory management, not instruction processing or network buffer. I was working in a high level garbage collected language, so I could not fine tune adjustments to pointers. Instead I got creative with call stack management and low level data frame header authoring. Now I am trying to replicate that success back to a low level http 1.1 implementation and it’s much more challenging.
I think I have a very simple fix that solves fragmentation. Force the size of every buffer and every array to be a power of two. What do you think?
I think your fix suffers from severe internal fragmentation.
Operating system design, and distributed operating system design (k8s falls well short of a distributed OS; it’s more like a toolkit that does the compute part)
Right. Before the web took off i believed distributed OSes (eg. Amaoeba, Plan 9, Inferno etc.) along with all sorts of OO middleware (eg. CORBA, DCOM etc.) would become the "standard" way to do distributed network computing.
Had that happened we wouldn't be wasting so much hardware today (old smartphones/tablets/laptops/etc.) but could have leveraged it all in a unified private network. Every single computer in my home would be now part of a distributed computing platform managed by a distributed OS.
The irony is that today the entire Cloud architecture viz. Docker, Kubernetes, REST etc. frameworks are actually recreating the above design!
- https://en.wikipedia.org/wiki/Ternary_computer
- https://en.wikipedia.org/wiki/Sloot_Digital_Coding_System
Evolutionary programming. Very suited to goals and agentic stuff. I'd be surprised if it's not yet in production somewhere.
Procedurally generated content is also a lot more interesting. Without structure, you get slop.
You can set the beginning of a story and an ending, as well as a story contour. Then procedurally generate content that ends at these points, even if they seem to veer away.
Metaprogramming for similar reasons, things like writing scripts/languages for very specific problems.
There's good techniques for all these, but the ROI was too low compared to the returns. It was difficult to write tests for the output space, but now it's a lot simpler.
Plan 9 was cool.
The plan involving the raising of the dead?
Computer Lib / Dream Machines
Xanadu
GUIs, quality, digital garbage: every version of a program is incompatible with the one before and require a new toochain to build and run, bloat
Asynchronous digital design!
All types of unconventional/exotic computing. I think this has been criminally neglected ever since the ascendancy of the von neumann architecture digital computer.
1) The Zen of Exotic Computing by Peter Kogge - https://epubs.siam.org/doi/10.1137/1.9781611977295
2) Handbook Of Unconventional Computing in 2-vols (Vol1-Theory, Vol2- Implementations) by Andrew Adamatzky et al. - https://www.worldscientific.com/worldscibooks/10.1142/12232#...
Lisp Machines. And if you're a real freak, Forth Machines
I wonder if there are any modern languages that would be particularly interesting to make specific hardware for. The only example I know of is the one that runs Java bytecode.
The Architecture of Symbolic Computers by Peter Kogge - Detailed Notes at: https://github.com/hlopko/architecture_of_symbolic_computers...
Languages not made for people that are optimized for tuned LLMs
What year does this forgotten concept come from, the 80s?
Analog computing
How about giving a shit about efficiency?
what fast and performant really means.
Love
Coding without LLM AI.
tech debt