Uiua

Uiua is a stack-based array language designed by Kai Schmidt using glyphs inspired mainly by BQN.

Overview
Uiua uses concatenative evaluation (a context-free grammar) with a right-to-left ordering as in Polish notation. The language supports tacit programming using stack manipulation primitives, and all complex functions must be defined this way as there is no explicit function form that allows local variables. Functions have a fixed number of input and output values, meaning the overloading of ambivalent functions is removed. Because of this, Uiua often splits APL primitives into two functions. Its primitives use Unicode glyphs including many not found in other languages. To avoid the need for a keyboard layout containing these, each primitive can also be spelled using a name that consists of lowercase letters (user-defined names must have at least one uppercase letter). By default, the language formats source files when run to convert these names into the corresponding glyphs.

Like the SHARP APL family, arrays are flat with a homogeneous type; however, functions in Uiua are first-class values, and instead of boxes, niladic constant-valued functions are used to provide array nesting.

Uiua was featured on Array Cast in 2023.

Function
In the web version of Uiua, we can type in the name of the function or a part of it and when run, the interpreter will format the name to Unicode Symbol, so that we don't need use of non-ASCII keyboards. All table below are base on the Uiua 0.8.0 Version.

Stack
Work with the stack

Constants
Push a constant value onto the stack

Monadic Pervasive
Operate on every element in an array

Dyadic Pervasive
Operate on every pair of elements in two arrays (Note that True is 1 and False is 0)

Monadic Array
Operate on a single array

Dyadic Array
Operate on two arrays