David Van Horn <firstname.lastname@example.org>
Random-access lists are a purely functional data structure for representing lists of values. A random-access list may act as a drop in replacement for the usual sequential list data structure (cons?, cons, car, cdr), which additionally supports fast index-based addressing and updating (list-ref, list-set).
This document outlines the API for the random-access list library. This implementation is based on Okasaki, FPCA ’95.