Why does the type signature of linear array change compared to normal array?

Question

I'm going through an example in A Taste of Linear Logic.

It first introduces the standard array with the usual operations defined (page 24):

Then suggests that a linear equivalent (using a linear logic for type signatures to restrict array copying) would have a slightly different type signature:

This is designed with the idea that array contains values that are cheap to copy but that the array itself is expensive to copy and thus should be passed along from use to use as a handle.

Question: The signatures for lookup and update correspond well to the standard signatures, but how do I interpret the signature for new?

In particular:

• The function new does not seem to return an array. How can I get an array to use if one is not provided?
• I think I do understand that Arr –o Arr x X is not derivable using linear logic and therefore a function to extract individual values without consuming the array is needed, but I don't understand why new doesn't provide that function directly