Simplicity is a typed, combinator-based, functional language without loops or recursion. It is formally verified, and can be statically analyzed with upper bounds on computation resources prior to execution.
Simplicity has the desirable property of being Turing incomplete, but can express any finitary function. Simplicity is the next generation in smart contract scripting.
There are now three Liquid functionary operators signaling for Simplicity. Activation requires unanimous support from all functionaries over a window of 10,080 blocks.