Not particularly inspired by the array languages in general. I do like the idea of a specifics DSL or library that is built from the ground up for ‘vector’ operations (Futhark would certainly be an inspiration here). I do think an (syntax divergences aside) implementation of what is essentially CUDA-like language/library is very possible.

I don’t really have any lofty goals, the language exists to let me have my personal ideal programming language. One of the things I would like to see adopted, by any language, is that the language is able to encode and present provable guarantees about code. So, memory safety, freedom from UB, lack of overflow (integer or stack) is provable in some subset of the language and the proof is done in a logically consistent, verifiable manner.

Of course most of those proofs are not anywhere near feasible for general case code, but the language can restrict allowable constructs in a computation, function, process, or module to a set that makes the desired properties provable by construction.

The language should be capable of unifying and abstracting over SIMD (or other hardware implementations), GPUs, and OS or Userspace multithreading at levels of abstraction from assembly to Haskell or other high level languages.