>+++++++++[<++++++++>-]<.>++++++[<+++++>-]<-.+++++++..+++.>>
+++++++[<++++++>-]<++.------------.<++++++++.--------.+++.------.--------.
>+.>++++++++++.
"Hello World!"
Brainf*ck has only eight instruction. The instructions are as follows:
The variable "p" represents a pointer where p = 0 at the start of every program, and a[p] represents the byte at the pointer. Only ASCII characters represented by the byte the pointer points to are recognized. You are given an array of 30000 bytes and a pointer that can be moved within the array. You can increment or decrement, by one, the byte at the pointer, as well as input or output any byte at the pointer. When the pointer equals zero, the program ends.
Obviously, this is an imperative language. The information stored at various memory locations are changed with a step-by-step execution of the statements. In fact, Brainf*ck closely resembles an assembly language with its direct manipulation of memory contents.
https://www2.gvsu.edu/miljours/bf.html