Total functional programming Lassi Kortela 06 Jun 2020 19:37 UTC
>> total functional programming [...] The language is not Turing-complete, but an amazing number of algorithms are available nonetheless.
The Dhall language is total.
Of particular interest to Schemers:
"For example, Dhall does not provide language support for recursion. If
you try to define a recursive expression or function you will get a type
error. Lists are the only recursive data structure and the only way to
build or consume lists is through safe primitives guaranteed to
terminate, like List/fold."