We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Verity
Verity is an esolang by User:ChuckEsoteric08 inspired mainly by Equipage and Underload.
Description
Verity uses a single queue which can store signed integers of any size. Queue can also store functions that could be executed using apply operator `.
Each instruction other than ` and . simply enqueues a function.
` dequeue an element and apply it ^ dequeue an element and enqueue it ! enqueue "apply" > enqueue "move" ; enqueue "compose" + enqueue "add" - enqueue "sub" : enqueue "dup" = enqueue "eq" ~ enqueue "swap" * enqueue "deq" 1 enqueue "one" . enqueue "out" , enqueue "in"
Apply would dequeue an element and apply it:
"apply": dequeue an element and apply it "move": dequeue an element and enqueue it "compose": dequeue functions g and h, enqueue g∘h "add": dequeue two elements, add them, and enqueue the result "sub": dequeue two elements, subtract them, and enqueue the result "dup": dequeue an element and enqueue it twice "eq": dequeue two elements and if they are equal enqueue 1, else enqueue 0 "swap": enqueue two elements, a and b, enqueue b followed by a "deq": dequeue an element and discard it "one": enqueue value 1 "out": dequeue an element and output it as an ASCII character "in": input a byte and enqueue it's ASCII value
When add, sub, eq and out have function or multiple as dequeued elements it results in an error. Same happens when compose is done on integers.
Computational class
Verity is clearly Turing-complete as it can simulate many Turing-complete languages and systems, including Tag system and Minsky machine.