Very cool! Congrats on the launch, even if it is very early.<p>Unsolicited feedback: I read the name an Enzo (n-zo) until I read the readme and realized it was Ezno (es-no).<p>Since in a previous post [0] you say you're unsure on the name, Enzo could be a good one if this is a common mistake.<p>[0] <a href="https://kaleidawave.github.io/posts/introducing-ezno/" rel="nofollow">https://kaleidawave.github.io/posts/introducing-ezno/</a>
This is extremely early per the disclaimer at the top, like too early to even run most toy programs.<p>In general I'm kind of skeptical of the approach these rewrite in rust/go projects are going. Maybe as wasm plugins for hot paths in existing tools, but it's not clear to me that the full rewrites are where we want to be long term as a community.
Very cool! I'm curious, is this intended for dev tooling?<p>For example, I could see this (or something similar) being useful as the engine for a typescript language server that would be faster than the standard one<p>But if it's not aimed at 1:1 with tsc, would it be intended more for something like swc[1]?<p>Or what would you expect people to use this for, besides just being a cool project to learn from?<p>[1] <a href="https://github.com/swc-project/swc">https://github.com/swc-project/swc</a>
Discussion from when it was first announced: <a href="https://news.ycombinator.com/item?id=32941613" rel="nofollow">https://news.ycombinator.com/item?id=32941613</a> (2022-09-22, 175 points, 98 comments).
The issue has always been that people start these projects, see just how big/hard checking the whole of TypeScript is and don't finish it.<p>It would be awesome if you finished it :]
I haven't looked at the source, but the way to write one of these that's fast is to use incremental computation. [0]<p>It tends to take a lot of RAM, but the speedups possible are 3-5 orders of magnitude in the projects I've studied.<p>Here's a parallel C++ library to do so that requires relatively minor changes to the original algorithm. [1] [2]<p>I also believe it would be possible to develop a compiler framework to do the transformation mostly automatically, using an MLIR dialect.<p>[0] <a href="https://en.wikipedia.org/wiki/Incremental_computing" rel="nofollow">https://en.wikipedia.org/wiki/Incremental_computing</a><p>[1] <a href="https://dl.acm.org/doi/pdf/10.1145/3409964.3461799" rel="nofollow">https://dl.acm.org/doi/pdf/10.1145/3409964.3461799</a><p>[2] Source code: <a href="https://github.com/cmuparlay/psac">https://github.com/cmuparlay/psac</a>