https://dl.acm.org/doi/10.1145/2776825
Cache efficient functional algorithms, by Guy E. Blelloch and Robert Harper
This is a short description of a cost-model and its language to analyse the cache efficiency of functional algorithms. It assumes that new values are allocated in sequential order and defines for them a nursery in the cache, while another part of the cache is designated as a read cache. The key idea seems to be compact data structures, which means that they can be read in linear cost (i.e., O(n/B), where B is the cache block size). I will probably read the longer article too as I am curious what are the practical takeaways.