RLS

rLS (revised/reduced Lambdastack) is a stack programming language based on Lambdastack. It removes most of the ugliness and several features from the old one, but also adds support for new ones.

Variables
Variables are either one character long, in which case they can be written as is (e.g. ), or longer, in which case they need to be enclosed in parentheses (e.g.  ). Variables are visible only inside the lambda they were bound from, and this does not include other lambdas lexically inside it.

Limiting / Non-limiting Lambdas
Limiting lambdas function like lambdas in original Lambdastack, in that they prevent any stack access into the stack outside what was pushed by the lambda itself. Non-limiting lambdas on the other hand allow this. They are effectively equivalent to Lambdastack's, except when converted into inputless they don't take the whole stack with them.

Computational class
All Underload commands except for  can easily be transformed into rLS. Therefore, rLS is Turing-complete.