A reference counting compiler with destructive memory reuse, borrow inference, and cheap thread-safe counters makes eager pure functional code competitive with tracing garbage collectors.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Counting Immutable Beans: Reference Counting Optimized for Purely Functional Programming
A reference counting compiler with destructive memory reuse, borrow inference, and cheap thread-safe counters makes eager pure functional code competitive with tracing garbage collectors.