I believe that racket uses strict-array for what this SRFI calls fixed-array.

As a mathematician I’m always making up terms, usually just locally in a paper, and like many others I get lazy and say that some object is “admissible” if some condition holds, or use a similarly generic term.  This type of terminology will never be picked up by other people.

So I think that terminology should be more particular than strict-<whatever>.

So how about “eager-array”?  Eager’s the opposite of lazy (there are no lazy arrays in this proposal), and it could indicate that the values that the getter returns are pre-computed and accessed with a simple memory reference.

Comments?

Brad