Of course the topic of this entire discussion could be simplified significantly if this idea were implemented.
We would simply wire a cluster diagram constant to the type and the rest would fall into place. I guess we could even mix datatypes of the cluster and coercion would progress normally for each element. If the array is too short, we would get get values for the missing elements according to the values wired on top.
In the end it would look awfully similar to the typecast solution, but would be safer to use.