HN Explorer

verdagon

↗ HN profile [ 82.4 ms ] full profile
Karma
0
Created
()
Submissions
0
  1. The Impossible Optimization, and the Metaprogramming to Achieve It (verdagon.dev)
    9 points 1
  2. Group Borrowing: Zero-cost memory safety with fewer restrictions (verdagon.dev)
    85 points 10
  3. Understanding SIMD: Infinite complexity of trivial problems (modular.com)
    257 points 126
  4. Layer-wise inferencing and batching: Small VRAM doesn't limit LLM throughput (verdagon.dev)
    2 points 0
  5. The Type of Sprintf (ryanbrewer.dev)
    13 points 23
  6. Rhovas: A programming language for API design and enforcement (rhovas.dev)
    2 points 0
  7. You Need More Constraints (borretti.me)
    3 points 0
  8. Five Years of Rhovas (blog.willbanders.dev)
    1 points 0
  9. Experimenting with Memory Management for Basil (degaz.io)
    2 points 0
  10. Single Ownership and Memory Safety Without Borrow Checking, RC, or GC (verdagon.dev)
    3 points 1
  11. What’s the Smallest Variety of Cheri? (msrc-blog.microsoft.com)
    1 points 0
  12. Sources of Complexity: Constraints (hillelwayne.com)
    2 points 0
  13. Implementing a New Memory Safety Approach, Part 1 (verdagon.dev)
    5 points 0
  14. Hash Codes, Non-Determinism, and Other Eldritch Horrors (verdagon.dev)
    3 points 0
  15. What is Systems Programming, Really? (2018) (willcrichton.net)
    1 points 0
  16. Which Programming Languages Use the Least Electricity? (thenewstack.io)
    1 points 1
  17. Next-Gen Language Features: User Code on the GPU (verdagon.dev)
    2 points 0
  18. Vale 0.2 Released: Higher RAII, Concept Functions, Const Generics, FFI, Modules (verdagon.dev)
    1 points 0
  19. Added to Vale 0.2 Beta: Concept Functions (verdagon.dev)
    2 points 1
  20. On removing let and let mut (verdagon.dev)
    33 points 20
  21. Surprising Weak-Ref Implementations: Swift, Obj-C, C++, Rust, and Vale (verdagon.dev)
    8 points 2
  22. Data races in Python, despite the Global Interpreter Lock (verdagon.dev)
    85 points 77
  23. Seamless, Fearless, and Structured Concurrency (verdagon.dev)
    1 points 0
  24. Generational references: 2.3x faster than reference counting (unoptimized) (vale.dev)
    11 points 0
  25. Vale's Generational References (vale.dev)
    14 points 0