schrodingerzhu

7 ms·

1.
by schrodingerzhu 1y ago
Alex Chi was in the project. He is now writing TinyLLM.
2.
by schrodingerzhu 2y ago
"if the IDE autocompletes the type declaration for me somehow". Then you will need type inference to some extend. :D
3.
Typst Symbol Classifier(detypify.quarticcat.com)
5 points by schrodingerzhu 2y ago|1 comments
4.
by schrodingerzhu 2y ago
Typst symbol classifier Static website: works offline. Tiny model: 1.1 MiB (ONNX), fast to load and run. Decent symbol set: recognizes 300+ symbols.
5.
by schrodingerzhu 2y ago
The fact is that in many languages, type checking and type inference are coupled together (for languages with DT, bidirectional type checking is needed). When writing proofs, it is almost impossible to let user specify every type. Ok, let’s
6.
by schrodingerzhu 3y ago
Parser generators have long been a savior for programmers, liberating them from the daunting task of crafting correct and maintainable parsers. Yet, this much-needed simplicity often comes at the expense of efficiency. We present, Paguroide
7.
Paguroidea: Fused Parser Generator with Transparent Semantic Actions(dl.acm.org)
2 points by schrodingerzhu 3y ago|1 comments
8.
Dynamic Tree Connectivity in Rust(github.com)
1 points by schrodingerzhu 3y ago|1 comments
9.
by schrodingerzhu 3y ago
This crate provides a data structure to handle dynamic tree connectivity. Both incremental and decremental operations are supported with amortized O(log n) time complexity. As the underlying data structure is a Splay tree, this crate works
10.
by schrodingerzhu 3y ago
As a side note, LLVM is developing its own libc. It is not usable for now. But it will finally grow into a fully functional one in a year or two.