These paradigms are explained in the following subsections. It is worth noting that a language can be
multi-paradigm, thus being capable of expressing a program in two or more of the four paradigms.
Furthermore, if languages and
are said to be Turing complete, one might assume that any program expressed in
, can be translated to a program in
which responds to inputs in the same way.