Uiua: Difference between revisions
(→Function with unique glyph: Cut Cross, since it's been removed) |
(Adding 0.12 primitive(Incomplete!)) |
||
Line 5: | Line 5: | ||
| function styles = stack-based [[tacit]] | | function styles = stack-based [[tacit]] | ||
| numeric types = 64-bit float | | numeric types = 64-bit float | ||
| | | Unicode support = full | ||
| released = 2023 | | released = 2023 | ||
| developer = Kai Schmidt | | developer = Kai Schmidt | ||
Line 27: | Line 27: | ||
Like the [[SHARP APL]] family, Uiua supports only [[Array_model#Flat_array_theory|flat arrays]] with a homogeneous [[type]], and has a dedicated [[box]] type for [[Nested array|array nesting]]. However, arithmetic is [[pervasion|pervasive]] as in the nested array model. Arithmetic also follows [[leading axis agreement]], extended so that a length-1 axis is matched with an axis of any length by replicating along it (like the broadcasting system of [[wikipedia:Julia (programming language)|Julia]] and [[wikipedia:NumPy|NumPy]]). It supports [[character arithmetic]] as in [[BQN]], as well as other primitives characteristic of BQN such as [[structural Under]], [[Classify]], and a [[Transpose]] that rotates the axes of its argument by one. | Like the [[SHARP APL]] family, Uiua supports only [[Array_model#Flat_array_theory|flat arrays]] with a homogeneous [[type]], and has a dedicated [[box]] type for [[Nested array|array nesting]]. However, arithmetic is [[pervasion|pervasive]] as in the nested array model. Arithmetic also follows [[leading axis agreement]], extended so that a length-1 axis is matched with an axis of any length by replicating along it (like the broadcasting system of [[wikipedia:Julia (programming language)|Julia]] and [[wikipedia:NumPy|NumPy]]). It supports [[character arithmetic]] as in [[BQN]], as well as other primitives characteristic of BQN such as [[structural Under]], [[Classify]], and a [[Transpose]] that rotates the axes of its argument by one. | ||
== Primitives == | == Primitives == <!-- It unfinish, you can contribute to this. Just don't make any sh*t in here. --> | ||
<!-- You can add Primitives with keywords, system primitives, tables for un, fill, and under, examples, things like string, char, sizzles, constants, labels, and more! Just, don't make this page some sh*t. I am not Kai Schmidt, nor a full-time programmer. I, Anh Duc is just a 4th-grade pupil in Vietnam and I am expanding this page just for hobby purposes and because I am a fan of Uiua. Again, do not mess this page to much. --> | |||
=== Function with unique glyph === | === Function with unique glyph === | ||
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. | 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 the use of non-ASCII keyboards. | ||
The tables below are based on Uiua version 0.12.0, with since-removed primitives taken out. | |||
==== Stack ==== | ==== Stack ==== | ||
Line 166: | Line 167: | ||
| <code>◴</code> || [[Deduplicate]] || Remove duplicate elements from an array | | <code>◴</code> || [[Deduplicate]] || Remove duplicate elements from an array | ||
|- | |- | ||
| <code>◰</code> || [[Nub Sieve|Unique]] || Get a mask of first occurrences of items in an array | | <code>◰</code> || [[Nub Sieve|Unique]] || Get a mask of the first occurrences of items in an array | ||
|- | |- | ||
| <code>□</code> || [[Box]] || Turn an array into a box | | <code>□</code> || [[Box]] || Turn an array into a box | ||
Line 201: | Line 202: | ||
|- | |- | ||
| <code>↻</code> || [[Rotate]] || Rotate the elements of an array by n | | <code>↻</code> || [[Rotate]] || Rotate the elements of an array by n | ||
|- | |||
| <code>⮌</code> || [[Orient]] || Change the order of the axes of an array. | |||
|- | |- | ||
| <code>◫</code> || [[Windows]] || The n-wise windows of an array | | <code>◫</code> || [[Windows]] || The n-wise windows of an array | ||
Line 221: | Line 224: | ||
This is the element-wise version of <code>≡ rows.</code> | This is the element-wise version of <code>≡ rows.</code> | ||
|- | |- | ||
| <code>≡</code> || Rows || Monadic modifier ||Apply a function to each row of an array or arrays. | | <code>≡</code> || Rows || Monadic modifier || Apply a function to each row of an array or arrays. | ||
This is the row-wise version of <code>∵ each.</code> | This is the row-wise version of <code>∵ each.</code> | ||
|- | |- | ||
| <code>⊞</code> || Table || Monadic 2-argument modifier || Apply a function to each combination of rows of two arrays. | | <code>⊞</code> || Table || Monadic 2-argument modifier || Apply a function to each combination of rows of two arrays. | ||
This is often what you want instead of <code>∵ each.</code> | This is often what you want instead of <code>∵ each.</code> | ||
|- | |||
| <code>⍚</code> || Inventory || Monadic modifier || Apply a function to each unboxed row of an array and re-box the results. | |||
For box arrays, this is equivalent to <code>≡⍜°□</code>. | |||
|- | |- | ||
| <code>⍥</code> || [[Repeat]] || Monadic modifier || Repeat a function a number of times | | <code>⍥</code> || [[Repeat]] || Monadic modifier || Repeat a function a number of times | ||
Line 254: | Line 260: | ||
Expects as many arguments as its function takes. | Expects as many arguments as its function takes. | ||
The function must take at least 1 more argument than it returns outputs. | The function must take at least 1 more argument than it returns outputs. | ||
Arguments that are lower on the stack | Arguments that are lower on the stack will be used as accumulators. | ||
Arguments that are higher on the stack will be iterated over. | Arguments that are higher on the stack will be iterated over. | ||
The function will be | The function will be repeatedly called with the rows of the iterated arrays followed by the accumulators. | ||
The returned values will be used as the new accumulators on each iteration. | |||
|- | |- | ||
| <code>⊜</code> || [[Partition]] || Group sequential sections of an array | | <code>⊜</code> || [[Partition]] || Group sequential sections of an array | ||
Line 265: | Line 271: | ||
The arrays must be the same <code>⧻ length.</code> | The arrays must be the same <code>⧻ length.</code> | ||
The first array must be rank <code>1</code> and contain integers. | The first array must be rank <code>1</code> and contain integers. | ||
Consecutive rows in the second array that line up with groups of the same key in the first array will be grouped | Consecutive rows in the second array that line up with groups of the same key in the first array will be grouped. | ||
Keys <code>≤0</code> will be omitted. | Keys <code>≤0</code> will be omitted. | ||
The function then processes each group in order. The result depends on what the function is. | The function then processes each group in order. The result depends on what the function is. | ||
Line 311: | Line 317: | ||
|- | |- | ||
| <code>⊓</code> || Bracket || Dyadic modifier || Call two functions on two distinct sets of values | | <code>⊓</code> || Bracket || Dyadic modifier || Call two functions on two distinct sets of values | ||
|} | |||
==== Other Modifier ==== | |||
{| class="wikitable" | |||
|+ Table of Other Modifiers in Uiua | |||
! Glyph !! Name !! Type !! Definition | |||
|- | |||
| <code>◇</code> || Content || Monadic Modifier || Unbox the arguments to a function before calling it | |||
|- | |||
| <code>⬚</code> || Fill || Dyadic Modifier || Set the fill value for a function | |||
By default, some operations require that arrays' <code>△ shape</code> are in some way compatible. | |||
<code>⬚ fill</code> allows you to specify a value that will be used to extend the shape of one or both of the operands to make an operation succeed. | |||
The function is modified to take a fill value which will be used to fill in shapes. | |||
|} | |} | ||
== External links == | == External links == | ||
* [https://concatenative.org/wiki/view/Uiua Uiua] on the concatenative language wiki | * [https://concatenative.org/wiki/view/Uiua Uiua] on the concatenative language wiki | ||
* [https://www.arraycast.com/episodes/episode63-uiua Uiua, a Stack based Array language] on the [[Array Cast]] | * [https://www.arraycast.com/episodes/episode63-uiua Uiua, a Stack-based Array language] on the [[Array Cast]] | ||
* [https://www.uiua.org/docs Doc] for the Documentation | * [https://www.uiua.org/docs Doc] for the Documentation | ||
* [https://www.uiua.org Interpreter] for the interpreter | * [https://www.uiua.org Interpreter] for the interpreter |
Revision as of 13:25, 21 June 2024
Uiua is a stack-based array language emphasizing tacit programming, designed by Kai Schmidt. Initially influenced strongly by BQN, Uiua has added original stack-based features and glyphs and moved to the boxed array model of SHARP APL and J. It also makes functions second-class rather than first-class to facilitate features that depend on the number of arguments functions take.
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 typing glyphs necessitating 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, Uiua supports only flat arrays with a homogeneous type, and has a dedicated box type for array nesting. However, arithmetic is pervasive as in the nested array model. Arithmetic also follows leading axis agreement, extended so that a length-1 axis is matched with an axis of any length by replicating along it (like the broadcasting system of Julia and NumPy). It supports character arithmetic as in BQN, as well as other primitives characteristic of BQN such as structural Under, Classify, and a Transpose that rotates the axes of its argument by one.
Primitives
Function with unique glyph
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 the use of non-ASCII keyboards.
The tables below are based on Uiua version 0.12.0, with since-removed primitives taken out.
Stack
Work with the stack
Glyph | Name | Type | Definition |
---|---|---|---|
. |
Duplicate | Monadic 2-output function | Duplicate the top value on the stack |
, |
Over | Dyadic 3-output function | Duplicate the second-to-top value to the top of the stack |
: |
Flip | Dyadic 2-output function | Swap the top two values on the stack |
◌(;) |
Pop | Monadic 0-output function | Discard the top stack value |
? |
Stack | Noadic 0-output function | Debug print all stack values without popping them |
⸮ |
Trace | Monadic function | Debug print the top value on the stack without popping it |
Constants
Push a constant value onto the stack
Glyph | Name | Definition |
---|---|---|
η |
Eta | The number of radians in a quarter circle |
π |
Pi | The ratio of a circle's circumference to its diameter |
τ |
Tau | The ratio of a circle's circumference to its radius |
∞ |
Infinity | The biggest number |
Monadic Pervasive
Operate on every element in an array
Glyph | Name | Definition |
---|---|---|
¬ |
Not | Logical not |
± |
Sign | Numerical sign (1, ¯1, or 0) |
¯ |
Negate | Negate a number |
⌵ |
Absolute value | Get the absolute value of a number |
√ |
Sqrt | Take the square root of a number |
○ |
Sine | Get the sine of a number |
⌊ |
Floor | Round to the nearest integer towards ¯∞
|
⌈ |
Ceiling | Round to the nearest integer towards ∞
|
⁅ |
Round | Round to the nearest integer |
Dyadic Pervasive
Operate on every pair of elements in two arrays (Note that True is 1 and False is 0)
Glyph | Name | Definition | Formats from: |
---|---|---|---|
= |
Equals | Compare for equality | = |
≠ |
Not equals | Compare for inequality | != |
< |
Less than | Compare for less than | < |
> |
Greater than | Compare for greater than | > |
≤ |
Less or equal | Compare for less than or equal | <= |
≥ |
Greater or equal | Compare for greater than or equal | >= |
+ |
Add | Add values | + |
- |
Subtract | Subtract values | - |
× |
Multiply | Multiply values | * |
÷ |
Divide | Divide values | % |
◿ |
Modulus | Modulo values | mod |
ⁿ |
Power | Raise a value to a power | pow |
ₙ |
Logarithm | Get the based logarithm of a number | log |
↧ |
Minimum/Logical And | Take the minimum of two arrays (Can use for logical AND.) | min |
↥ |
Maximum/Logical Or | Take the maximum of two arrays (Can use for logical OR.) | max |
∠ |
Atangent | Take the arctangent of two numbers | atan |
ℂ |
Complex | Make a complex number from imaginary and real parts | com |
Monadic Array
Operate on a single array
Glyph | Name | Definition |
---|---|---|
⧻ |
Length | Get the number of rows in an array |
△ |
Shape | Get the dimensions of an array |
⇡ |
Range | Make an array of all natural numbers less than a number |
⊢ |
First | Get the first row of an array |
⇌ |
Reverse | Reverse the rows of an array |
♭ |
Deshape | Make an array 1-dimensional |
¤ |
Fix | Add a length-1 axis to an array |
⋯ |
Bits | Encode an array as bits (LSB-first) |
⍉ |
Transpose | Rotate the shape of an array |
⍏ |
Rise | Get the indices into an array if it were sorted ascending |
⍖ |
Fall | Get the indices into an array if it were sorted descending |
⊚ |
Where | Get indices where array values are not equal to zero |
⊛ |
Classify | Assign a unique index to each unique element in an array |
◴ |
Deduplicate | Remove duplicate elements from an array |
◰ |
Unique | Get a mask of the first occurrences of items in an array |
□ |
Box | Turn an array into a box
This is Uiua's primary way to create nested or mixed-type arrays.
Normally, arrays can only be created if their rows have the same shape and type.
⬚ fill can help you with the shape part, but it is not always wanted, and it can't help with the type part.
You can go to (To See more information about the |
Dyadic Array
Operate on two arrays
Glyph | Name | Definition |
---|---|---|
≍ |
Match | Check if two arrays are exactly the same |
⊟ |
Couple | Combine two arrays as rows of a new array |
⊂ |
Join | Append two arrays end-to-end |
⊏ |
Select | Select multiple rows from an array |
⊡ |
Pick | Index a row or elements from an array |
↯ |
Reshape | Change the shape of an array |
☇ |
Rerank | Change the rank of an array's rows |
↙ |
Take | Take the first n elements of an array |
↘ |
Drop | Drop the first n elements of an array |
↻ |
Rotate | Rotate the elements of an array by n |
⮌ |
Orient | Change the order of the axes of an array. |
◫ |
Windows | The n-wise windows of an array |
▽ |
Keep | Discard or copy some rows of an array |
⌕ |
Find | Find the occurrence's of one array in another |
∊ |
Member | Check if each row of one array exists in another |
⊗ |
Indexof | Find the first index of each row of one array in another |
Iterating Modifiers
Iterate and apply a function to an array or arrays
Glyph | Name | Type | Definition |
---|---|---|---|
∵ |
Each | Monadic modifier | Apply a function to each element of an array or arrays.
This is the element-wise version of |
≡ |
Rows | Monadic modifier | Apply a function to each row of an array or arrays.
This is the row-wise version of |
⊞ |
Table | Monadic 2-argument modifier | Apply a function to each combination of rows of two arrays.
This is often what you want instead of |
⍚ |
Inventory | Monadic modifier | Apply a function to each unboxed row of an array and re-box the results.
For box arrays, this is equivalent to |
⍥ |
Repeat | Monadic modifier | Repeat a function a number of times |
⍢ |
Do | Dyadic modifier | Repeat a function while a condition holds |
Aggregating Modifiers
Apply a function to aggregate an array
Glyph | Name | Definition |
---|---|---|
/ |
Reduce | Apply a reducing function to an array.
For reducing with an initial value, see |
∧ |
Fold | Apply a function to aggregate arrays. |
\ |
Scan | Reduce, but keep intermediate values |
⊕ |
Group | Group elements of an array into buckets by index
Takes a function and two arrays.
The arrays must be the same |
⊜ |
Partition | Group sequential sections of an array
The most common use of Takes a function and two arrays.
The arrays must be the same |
Inversion Modifiers
Work with the inverses of functions
Glyph | Name | Type | Definition |
---|---|---|---|
° |
Un | Monadic modifier | Invert the behavior of a function
Most functions are not invertible. |
⍜ |
Under | Dyadic modifier | Apply a function under another
This is a more powerful version of
Any function that can be |
🌎 Planet 🪐
Advanced stack manipulation
Glyph | Name | Type | Definition |
---|---|---|---|
∘ |
Identity | Monadic function | Do nothing with one value |
⋅ |
Gap | Monadic modifier | Discard the top stack value then call a function |
⊙ |
Dip | Monadic modifier | Temporarily pop the top value off the stack and call a function |
∩ |
Both | Monadic 2-argument modifier | Call a function on two sets of values
For monadic functions, |
⊃ |
Fork | Dyadic modifier | Call two functions on the same values
|
⊓ |
Bracket | Dyadic modifier | Call two functions on two distinct sets of values |
Other Modifier
Glyph | Name | Type | Definition |
---|---|---|---|
◇ |
Content | Monadic Modifier | Unbox the arguments to a function before calling it |
⬚ |
Fill | Dyadic Modifier | Set the fill value for a function
By default, some operations require that arrays' |
External links
- Uiua on the concatenative language wiki
- Uiua, a Stack-based Array language on the Array Cast
- Doc for the Documentation
- Interpreter for the interpreter
- Basic to start learning Uiua
APL dialects [edit] | |
---|---|
Maintained | APL+Win ∙ APL2 ∙ APL64 ∙ APL\iv ∙ Aplette ∙ April ∙ Co-dfns ∙ Dyalog APL ∙ Dyalog APL Vision ∙ dzaima/APL ∙ GNU APL ∙ Kap ∙ NARS2000 ∙ Pometo ∙ TinyAPL |
Historical | A Programming Language ∙ A+ (A) ∙ APL# ∙ APL2C ∙ APL\360 ∙ APL/700 ∙ APL\1130 ∙ APL\3000 ∙ APL.68000 ∙ APL*PLUS ∙ APL.jl ∙ APL.SV ∙ APLX ∙ Extended Dyalog APL ∙ Iverson notation ∙ IVSYS/7090 ∙ NARS ∙ ngn/apl ∙ openAPL ∙ Operators and Functions ∙ PAT ∙ Rowan ∙ SAX ∙ SHARP APL ∙ Rationalized APL ∙ VisualAPL (APLNext) ∙ VS APL ∙ York APL |
Derivatives | AHPL ∙ BQN ∙ CoSy ∙ ELI ∙ Glee ∙ I ∙ Ivy ∙ J ∙ Jelly ∙ K (Goal, Klong, Q) ∙ KamilaLisp ∙ Lang5 ∙ Lil ∙ Nial ∙ RAD ∙ Uiua |
Overviews | Comparison of APL dialects ∙ Timeline of array languages ∙ Timeline of influential array languages ∙ Family tree of array languages |