Lock-free vs wait-free concurrency
https://rethinkdb.com/blog/lock-free-vs-wait-free-concurrency/
https://rethinkdb.com/blog/lock-free-vs-wait-free-concurrency/
๐3๐คฏ1
stg-machine-naturally.pdf
1.2 MB
The spineless tagless G-machine, naturally
https://dl.acm.org/doi/pdf/10.1145/289423.289439
https://dl.acm.org/doi/pdf/10.1145/289423.289439
๐ฅ3
Allocators from C, Rust, Odin C3, Hare, Zig
https://antonz.org/allocators/
https://antonz.org/allocators/
antonz.org
Allocators from C to Zig
Exploring allocator design in C, C3, Hare, Odin, Rust, and Zig.
โค10๐ฅ6
Hard Mode Rust
https://matklad.github.io/2022/10/06/hard-mode-rust.html
https://matklad.github.io/2022/10/06/hard-mode-rust.html
matklad.github.io
Hard Mode Rust
This post is a case study of writing a Rust application using only minimal, artificially constrained API (eg, no dynamic memory allocation). It assumes a fair bit of familiarity with the language.
๐ฅ2๐1
Speculative Staging for Interpreter Optimization
https://arxiv.org/abs/1310.2300
https://arxiv.org/abs/1310.2300
arXiv.org
Speculative Staging for Interpreter Optimization
Interpreters have a bad reputation for having lower performance than just-in-time compilers. We present a new way of building high performance interpreters that is particularly effective for...
๐ฅ2๐1
Copy-and-Patch Compilation: A fast compilation algorithm for high-level languages and bytecodehttps://arxiv.org/abs/2011.13127
arXiv.org
Copy-and-Patch Compilation: A fast compilation algorithm for...
Fast compilation is important when compilation occurs at runtime, such as query compilers in modern database systems and WebAssembly virtual machines in modern browsers. We present copy-and-patch,...
๐ฅ6๐ฟ2
paramorphism-synthesis.pdf
370.6 KB
Recursive Program Synthesis using Paramorphisms
https://dl.acm.org/doi/pdf/10.1145/3656381
https://dl.acm.org/doi/pdf/10.1145/3656381
๐ฅ2
unification-and-anti-CoC.pdf
168.7 KB
Unification and Anti-Unification in the Calculus of Constructions
https://www.cs.cmu.edu/~fp/papers/lics91.pdf
https://www.cs.cmu.edu/~fp/papers/lics91.pdf
๐2๐1๐ฅ1
MeTTa Optimal Reduction Kernel: A blazing fast hypergraph processing kernel for Hyperonhttps://github.com/trueagi-io/MORK
GitHub
GitHub - trueagi-io/MORK: MeTTa Optimal Reduction Kernel
MeTTa Optimal Reduction Kernel. Contribute to trueagi-io/MORK development by creating an account on GitHub.
๐ฅ2๐1๐ค1
2309.06180v1.pdf
1.4 MB
Efficient Memory Management for Large Language Model Serving with PagedAttention
https://arxiv.org/abs/2309.06180
https://arxiv.org/abs/2309.06180
๐คจ4๐ฏ3๐ฟ1
How to Choose Between Hindley-Milner and Bidirectional Typing
https://thunderseethe.dev/posts/how-to-choose-between-hm-and-bidir/
https://thunderseethe.dev/posts/how-to-choose-between-hm-and-bidir/
Thunderseethe's Devlog
How to Choose Between Hindley-Milner and Bidirectional Typing
A false dichotomy that hides the real request
โค1๐ฅ1๐ซก1๐ฆ1
An assembler that compiles to printf
https://git.sr.ht/~sebsite/printfasm
https://git.sr.ht/~sebsite/printfasm
๐ฅ3๐คจ1๐ก1
p2816r0.pdf
1.3 MB
Safety Profiles: Type-and-resource Safe programming in ISO Standard C++https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2023/p2816r0.pdf
๐ฟ4๐คฃ1
Game_Theory_Analysis_of_Strategic_Choicesin_Programming_Education.pdf
74.9 KB
Game Theory Analysis of Strategic Choices in Programming Education and AI-Assisted Development
๐ฅด3๐คฏ2
Distributed systems for fun and profit
https://book.mixu.net/distsys/single-page.html
https://book.mixu.net/distsys/single-page.html
๐ฅ2
babble.pdf
1.3 MB
babble: Learning Better Abstractions with E-Graphs and Anti-unification
https://dl.acm.org/doi/epdf/10.1145/3571207
https://dl.acm.org/doi/epdf/10.1145/3571207
๐ฅ2
Tcl Combinator Engine
https://wiki.tcl-lang.org/page/Combinator%20Engine
https://wiki.tcl-lang.org/page/Combinator%20Engine
wiki.tcl-lang.org
Combinator Engine
Tclers wiki
๐ฆ2๐พ2
FORCE.pdf
67 KB
FORCE: A Fast and Easy-To-Implement Variable-Ordering Heuristic
https://dl.acm.org/doi/pdf/10.1145/764808.764839
https://dl.acm.org/doi/pdf/10.1145/764808.764839
๐ฟ2