Safalra Allowed No Swearing In Sansism's Moniker. (Or if you don't like recursive acronyms, it means "without doctrine".) A fungeoid with separate two-dimensional (or more generally, n-dimensional) code and memory spaces and an instruction set similar to that of Brainf***.
A tiny language that has no built-in instructions, but relies on inline assembly to achieve Turing completeness. Along with something called GUPI, but I'm not sure quite what that does. One of the smallest languages (along with Brainf***) to ever be bootstrapped, i.e. a Shelta compiler has been written in Shelta.
Self-Modifying Extremely Tiny AutomatoN Application. An automaton with a program counter and two instructions: swapping two steps and jumping to another step. It is probably not Turing complete.
Self-Modifying Indecent Turing Hack. A language in which there are no jumps or conditionals. The program counter can only advance one instruction at a time, and so a conditional or loop must be simulated by copying code between parts of the program.
A language for which an implementation was created as an IOCCC entry. Combines features from FORTH, C and Ada.
A language in which every program consists of 14 statements, each having the form of an English (or German, at the programmer's choice) sentence. Rather than the statements being executed in any kind of order, each statement defines a different kind of construct used in the program. The language is faithful to the Roman Catholic church, by using each cardinal only once.