status: final (2013-02-24)
keywords: Data Structure, R7RS Large, R7RS Large: Red Edition
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 linear-access pair and list
data structures (
cdr), which additionally supports fast index-based
addressing and updating (
The impact is a whole class of purely-functional algorithms expressed in
terms of index-based list addressing become feasible compared with their
linear-access list counterparts.
This document proposes a library API for purely functional random-access lists consistent with the R6RS  base library and list utility standard library .