Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming · HackerPapers discussions

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by agentultra

Tue, 25 Feb 2025 02:26:21 GMT

There might even be some possibility for cross-pollination with ideas such as Counting Immutable Beans [0]. I’ve long wondered if there could be a functional programming language that made static memory management less verbose and easier to manage without monads and other explicit structures. [0] https://arxiv.org/abs/1908.05647

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by yashrk

Tue, 21 Nov 2023 10:49:27 GMT

Two main papers about this topic AFAIK are: «Counting Immutable Beans» by Sebastian Ullrich and Leonardo de Moura (https://arxiv.org/pdf/1908.05647.pdf) and «Perceus: Garbage Free Reference Counting with Reuse» by Alex Reinking, Ningning Xie,Leonardo de Moura, Daan Leijen (https://dl.acm.org/doi/pdf/10.1145/3453483.3454032). See also Anton Felix Lorenzen's master thesis: https://antonlorenzen.de/master_thesis_perceus_borrowing.pdf Mr. Feldman also mentioned some «alias analysis» library «Morphic Solver» from Berkley University, but I cannot find anything about it. BTW compile time reference…

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by dunham

Fri, 27 Oct 2023 17:08:03 GMT

Yeah, I believe they said they intend for it to be used as a general purpose programming language. I used it to complete Advent of Code last year. There are some really interesting features for general purpose programming in there. For example: you can code updates to arrays in a functional style (change a value, get a new array back), but if the refcount is 1, it updates in place. This works for inductive types and structures, too. So I was able to efficiently use C-style arrays (O(1) update/lookup) while writing functional code. (paper: https://arxiv.org/abs/1908.05647 ) Another interesting…

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by francasso

Mon, 26 Jun 2023 09:42:46 GMT

I'm sure the details are different, but the general idea, to me, seems the same as the one descibed by Leo and Sebastian in https://arxiv.org/abs/1908.05647. Both Koka and Lean 4 use reference counting to know if it's safe to reuse a structure. This paper (Daan is a collegue of Leo at MS Research) gives a different formalization and proofs. The file is still named "fbip.pdf" though :)

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by nequo

Thu, 29 Sep 2022 13:45:23 GMT

> When I think of how the java streams API is used, it generates lots of garbage (i.e. lots of intermediary allocs) Not extremely relevant because it’s Lean 4 and not Java, but destructive updates can help with that: https://arxiv.org/pdf/1908.05647.pdf Edit: Now linking to the right paper.

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by agentultra

Fri, 29 Jul 2022 13:47:46 GMT

A paper I quite enjoyed on automatic reference counting for pure, immutable functional programming: https://arxiv.org/abs/1908.05647 It can be quite "fast."

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by tomhoule

Mon, 01 Feb 2021 13:57:34 GMT

I am really enjoying lean 3 as a theorem prover; lean 4 as a programming language is a really intriguing/enticing prospect. The "functional but in place" paradigm is something quite new, as far as I can tell. For reference, see the "Counting Immutable Beans" paper[1] by the designers of the language, that details how the runtime makes use of reference counts to do destructive updates in pure code whenever possible. [1]: https://arxiv.org/pdf/1908.05647.pdf

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — mentioned by lakecresva

Tue, 29 Dec 2020 02:19:54 GMT

The Lean developers put out a paper about v4's reference counting last year which shows that in basic benchmarks, Lean 4 is in the same ballpark as Haskell, Swift, and ML. https://arxiv.org/abs/1908.05647

Paper and discussion history. A mention is not an endorsement.

Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming — HN submission

Thu, 22 Aug 2019 12:29:16 GMT

Counting Immutable Beans: Reference Counting for Purely Functional Programming

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.