# Category:Uiua

**Uiua**

This

**programming language**may be used to instruct a computer to perform a task.

Official website |
---|

Execution method: | Compiled (bytecode) |
---|---|

Garbage collected: | Yes |

Type expression: | Implicit |

Type checking: | Dynamic |

See Also: |

Uiua (*wee-wuh*) is a general purpose, stack-based, array-oriented programming language with a focus on simplicity, beauty, and tacit code.

Uiua has a simple, context-free, LL(3) grammar. Code runs from right to left, top to bottom, with only one precedence rule. As operators are to the left of their operands, Uiua code reads a little bit like a Lisp, but with fewer parentheses.

Uiua combines the stack-based and array-oriented paradigms in a single language. Combining these already terse paradigms results in code with a very high information density and little syntactic noise.

Uiua's one and only composite data type, the array, is based on those of APL, J, and BQN. They are multidimensional and rank-polymorphic, meaning that an operation that applies to one item also applies to many items.

Unlike other array languages, Uiua does not have monadic and dyadic versions of each glyph. Every glyph does only one thing, so you don't need to parse an entire expression to know which version it is.

Find out more, and run code in your browser at https://www.uiua.org

## Todo

## Pages in category "Uiua"

The following 92 pages are in this category, out of 92 total.

### A

### C

### F

### L

### N

### P

### S

- Sailors, coconuts and a monkey problem
- Semordnilap
- Sine wave
- Smallest power of 6 whose decimal expansion contains n
- Smallest square that begins with n
- Smith numbers
- Solve hanging lantern problem
- Sort disjoint sublist
- Split a character string based on change of character
- Square-free integers
- Stack
- Stem-and-leaf plot
- String case
- String concatenation
- String interpolation (included)
- String matching
- Strip a set of characters from a string
- Sum multiples of 3 and 5
- Summarize primes