# Total functional programming

Total functional programming (also known as strong functional programming,[1] to be contrasted with ordinary, or weak functional programming) is a programming paradigm that restricts the range of programs to those that are provably terminating.[2]

Termination is guaranteed by the following restrictions:

1. A restricted form of recursion, which operates only upon ‘reduced’ forms of its arguments, such as Walther recursion, substructural recursion, or "strongly normalizing" as proven by abstract interpretation of code.[3]
2. Every function must be a total (as opposed to partial) function. That is, it must have a definition for everything inside its domain.
• There are several possible ways to extend commonly used partial functions such as division to be total: choosing an arbitrary result for inputs on which the function is normally undefined (such as $\forall x \in \mathbb{N}. x \div 0 = 0$ for division); adding another argument to specify the result for those inputs; or excluding them by use of type system features such as refinement types.[2]

These restrictions mean that total functional programming is not Turing-complete. However, the set of algorithms that can be used is still huge. For example, any algorithm for which an asymptotic upper bound can be calculated (by a program that itself only uses Walther recursion) can be trivially transformed into a provably-terminating function by using the upper bound as an extra argument decremented on each iteration or recursion.

For example, quicksort is not trivially shown to be substructural recursive, but it only recurs to a maximum depth of the length of the vector (worst-case time complexity O(n2)). A quicksort implementation on lists (which would be rejected by a substructural recursive checker) is, using Haskell:

qsort []       = []
qsort [a]      = [a]
qsort (a:as)   = let (lesser, greater) = partition a as
in qsort lesser ++ [a] ++ qsort greater


To make it substructural recursive using the length of the vector as a limit, we could do:

qsort x = qsortSub x x
-- minimum case
qsortSub []     as     = as -- shows termination
-- standard qsort cases
qsortSub (l:ls) []     = [] -- nonrecursive, so accepted
qsortSub (l:ls) [a]    = [a] -- nonrecursive, so accepted
qsortSub (l:ls) (a:as) = let (lesser, greater) = partition a as
-- recursive, but recurs on ls, which is a substructure of
-- its first input.
in qsortSub ls lesser ++ [a] ++ qsortSub ls greater


Some classes of algorithms that have no theoretical upper bound but have a practical upper bound (for example, some heuristic-based algorithms) can be programmed to "give up" after so many recursions, also ensuring termination.

Another outcome of total functional programming is that both strict evaluation and lazy evaluation result in the same behaviour, in principle; however, one or the other may still be preferable (or even required) for performance reasons.[4]

In total functional programming, a distinction is made between data and codata—the former is finitary, while the latter is potentially infinite. Such potentially infinite data structures are used for applications such as I/O. Using codata entails the usage of such operations as corecursion. However, it is possible to do I/O in a total functional programming language (with dependent types) also without codata.[5]

Both Epigram and Charity could be considered total functional programming languages, even though they don't work in the way Turner specifies in his paper. So could programming directly in plain System F, in Martin-Löf type theory or the Calculus of Constructions.

## References

1. ^ This term is due to: Turner, D.A. (December 1995), "First International Symposium on Functional Programming Languages in Education", Springer LNCS 1022: 1–13 |chapter= ignored (help).
2. ^ a b Turner, D.A. (2004-07-28), "Total Functional Programming", Journal of Universal Computer Science 10 (7): 751–768, doi:10.3217/jucs-010-07-0751
3. ^ Turner, D.A. (2000-04-28), "Ensuring Termination in ESFP", Journal of Universal Computer Science 6 (4): 474–488, doi:10.3217/jucs-006-04-0474
4. ^ The differences between lazy and eager evaluation are discussed in: Granström, J. G. (2011). Treatise on Intuitionistic Type Theory. Logic, Epistemology, and the Unity of Science 7. ISBN 978-94-007-1735-0. See in particular pp. 86-91.
5. ^ Granström, J. G. (May 2012), "A New Paradigm for Component-based Development", Journal of Software 7 (5): 1136–1148, doi:10.4304/jsw.7.5.1136-1148