I'm in a similar path, but with a relational language. However I have find have a lot in common with arrays, in fact, I think make sense, similar to kdb+, to mo

I'm in a similar path, but with a relational language. However I have find have a lot in common with arrays, in fact, I think make sense, similar to kdb+, to model relations as columnar tables. You can read about J here: https://sblom.github.io/openj-core/ioj.htm https://sblom.github.io/openj-core/ioj.htm (From my long list of resources: https://gist.githubusercontent.com/mamcx/e1743571b9a1ea163a7f9f07aa6a8ae2/raw/cf89dd40a6d98c185cf6896600d8b1f77a9acb76/Lang.mkdown https://gist.githubusercontent.com/mamcx/e1743571b9a1ea163a7...) The main gist is understand that you can generaliza arrays and scalars in one single structure (aka a array!) A scalar is a array of 1. Others list are of N. You tag the structure with the type alike: [Type; N, N2, N3...] and then you can do things like: for i in 1: because is totally legal here! I expand the idea to say that a relation is a multiple-array (aka: Columns), and array is a relation of 1 column, a scalar is a relation of 1 column and 1 value. This mean is potentially easy to exploit SIMD and stuff like that, but I haven't explored that.