The S language is a theoretical programming language proposed by Martin Davids in his book Computability, Complexity and Languages. It is composed by labels, variables, and 4 basic instructions, and its used between many things, to prove that there are natural functions (F: N^n -> N) which can not be computed. Awesome!<p>If you want to see the repo, you can find it in <a href="https://github.com/ramadis/slang" rel="nofollow">https://github.com/ramadis/slang</a>