A subset of FORTH, named after the author's favourite Boolean value. It was designed as a tiny language for which a tiny compiler could be written, but an even smaller compiler has since been written for Brainf***. FALSE is not quite Turing complete.
A tiny language resembling Brainf*** but in which each memory cell contains a single bit. Input and output are memory mapped.
General term for the Befunge family of languages, especially Funge-98, which is generalised to one (Unefunge), two (Befunge), three (Trefunge) or more dimensions.