A total programming language is one in which all programs are guaranteed to terminate. As such, such languages are not Turing complete. It is also impossible to implement a self-interpreter in a total programming language, because combined with quines that would allow you to create a non-terminating program in the form on an infinite loop. Nevertheless, total languages can still be quite powerful, with some actual languages being total. Programs that need to continue running can use techniques from total languages to prevent from hanging.
One way to convert a Turing complete programming language into a total programming language is to require programs to have a proof that they always halt attached to their source code.
Pages in category "Total"
The following 189 pages are in this category, out of 189 total.
- A programming language is any set of rules that converts strings, or graphical program elements in the case of visual programming languages, to various kinds of machine code output.
- ABPLWNL but with stack
- An unusable esolang made with an one-line interpreter and a long name
- Apple Pie
- Arch is the best!
- I am sure this is the shortest code for 99 bottles of beer
- If the question specifies that the number of the words should be less than 3, and the number of words in your answer is larger than 3, your answer is automatically wrong.
- Inverted Logic