Computer science2019 · shared on Hacker News
Counting Immutable Beans: Reference Counting for Purely Functional Programming
Explore Counting Immutable Beans: Reference Counting for Purely Functional Programming, its original source and Hacker News discussions. Discover community perspectives and save it to your reading list.
GO BEYOND THE ABSTRACT
The conversation around the idea.
Original Hacker News threads. Different perspectives, questions, and things worth thinking about.
Showing up to 100 related threads. A paper may appear in a comment rather than the original submission.
Links found in the discussion
Up to 50 recent source links, in HN item order.
Ykcl ·
Reference count, don't garbage collect
189 points406 comments
Yazhenley ·
Neut Programming Language
147 points39 comments
Ythisiswrongggg ·
Ask HN: Is Clojure Dead?
86 points140 comments
Yoli5679 ·
A Review of the Lean Theorem Prover
67 points11 comments
Ynilradical ·
A simple ray tracer in Lean 4
53 points28 comments
Ymatt_d ·
Counting Immutable Beans: Reference Counting for Purely Functional Programming
2 points0 comments
Ychriscbr ·
Microsoft Research: Fully In-Place Functional Programming [pdf]
2 points0 comments
Ygridentio ·
Lean4 helped Terence Tao discover a small bug in his recent paper
1 points0 comments