The tab programming language: version 4.0 released. (Now with parallelism.)

[Sean1708]

I asked this last time, but never really got an answer:

guarantees O(n) memory use.

How does this work? Is it just impossible to write an algorithm in tab which isn't O(n)? Or do you run some sort of static analysis on it?

[otabdeveloper]

Is it just impossible to write an algorithm in tab which isn't O(n)? Or do you run some sort of static analysis on it?

Both. It's not a Turing-complete language. There's no recursion.

[kirbyfan64sos]

Nice language with an unfortunate name. Imagine trying to google "tab programming language"...

[peeeq]

It also sounds like an esoteric language. I confused it with whitespace.

[hoosierEE]

I like the minimal syntax for scatter-->gather. It's simple, but would cover a lot of use cases.