Suppose I want to implement a 1-D cellular automaton in Prolog (come to think of it, has anyone ever studied cellular automata not driven in synchronous fashion by a central clock? don’t answer this).
For this I need a “randomly accessible” 1-D array of character. A list, being singly linked, sounds less than ideal. In fact, any linked data structures sound like a bad deal. Do I need to go for a C-based opaque data structure?