Hacker GitHub

← All repos

thomasmueller/bau-lang

View on GitHub ↗ ★ 80 Java

Bau is a simple, concise, safe, powerful and fast programming language.

20 mentions on Hacker News by 1 person: 0 stories, 20 comments · first 2025-04-21 · latest 2026-09-17

Mentions per year 20 mentions · busiest year 2025 (10)
20082026
  1. …compare it against yours. One improvement I did is some kind of preallocation for small blocks. https://github.com/thomasmueller/bau-lang/blob/main/src/main...
    comment by thomasmg · 2026-09-17 · in Comparison of Malloc() Algorithms
  2. …are big differences. But I really like the moto "easy to use memory safety without tracing GC". [1] https://github.com/thomasmueller/bau-lang/tree/main
    comment by thomasmg · 2026-08-07
  3. …a bit more complex. Actually multiple such methods. But well, that's just my own use case. [1] https://github.com/thomasmueller/bau-lang/blob/main/src/test...
  4. …If needed, one could use a static function that returns 0 or panics or whatever is best. [1] https://github.com/thomasmueller/bau-lang/blob/main/README.m...
    comment by thomasmg · 2026-03-09 · in My “grand vision” for Rust
  5. …are no typed unions currently (maybe I'll add them, not sure yet), but there are "Traits" [2]. [1] https://github.com/thomasmueller/bau-lang#types [2] https://github.com/thomasmueller/bau-lang#traits
  6. …learn as Python. Right now I'm trying to integrate Perceus, the ref-count optimization of Keka. [1] https://github.com/thomasmueller/bau-lang
  7. …still in Java only), a PDF generator (200 lines), and now also a tiny programming language [5]. [1] https://github.com/thomasmueller/bau-lang/blob/main/src/test... [2] https://github.com/thomasmueller/bau-lang/blob/main/src/test... [3]…
  8. …The castling moves are specially tricky to implement I think. I enjoyed the challenge as well. [1] https://github.com/thomasmueller/bau-lang/blob/main/src/test...
  9. …but is not shortest-width, it is around 290 lines for both parsing and toString [1] [1] https://github.com/thomasmueller/bau-lang/blob/main/src/test...
  10. …management. It has reference counting with lightweight borrowing for performance sensitive parts: https://github.com/thomasmueller/bau-lang
  11. …(about 80 lines, and that includes the ~15 lines of binarySearch, which you might need anyway). [1] https://github.com/thomasmueller/bau-lang/blob/main/src/test...
  12. …it runs in O(n*log(n)^2). It is about 3 times more complex than shell sort. I implemented it here https://github.com/thomasmueller/bau-lang/blob/main/src/test... (most sort algos you mentioned above are in the same direcory btw) You didn't…
  13. …and Zig in this regard. Sure, we can argue the use case of Rust is different than eg. Python. [1] https://github.com/thomasmueller/bau-lang [2] https://github.com/thomasmueller/lz4_simple [3] https://github.com/thomasmueller/bau-lang/tree/m…
    comment by thomasmg · 2025-11-07 · in A Note on Fil-C
  14. …(B) Swift is too Apple-centric currently. Sure, this might be become a non-issue over time. [1] https://github.com/thomasmueller/bau-lang/blob/main/doc/perf...
    comment by thomasmg · 2025-11-07 · in A Note on Fil-C
  15. …So the language itself must be very good in my view, otherwise fewer people would use it. [1] https://github.com/thomasmueller/bau-lang/blob/main/doc/perf...
    comment by thomasmg · 2025-11-06 · in How often does Python allocate?
  16. …are many languages like mine, most of them incomplete and not really popular, discussed in [3]. [1] https://github.com/thomasmueller/bau-lang [2] https://github.com/thomasmueller/bau-lang/blob/main/src/test... [3]…
  17. …language uses reference counting by default, but does support single ownership + borrowing.) [1] https://github.com/thomasmueller/bau-lang
  18. …which can be inaccurate. [1]: https://stackoverflow.com/questions/2667015/is-regex-too-slo... [2]: https://github.com/thomasmueller/bau-lang/blob/main/src/test...
  19. …that is supposted to be (almost) as fast as C, Rust etc, but as simple and concise as Python: https://github.com/thomasmueller/bau-lang There is a playground which is using a C compiler and WASM, and so is quite fast, while running fully…
  20. …but it would still be concise (and sometimes, more concise). I tried to formulate a proposal here: https://github.com/thomasmueller/bau-lang/blob/main/RegexV2....
    comment by thomasmg · 2025-04-21 · in Regex Isn't Hard (2023)