SQL is not Turing complete (if you ignore the WITH RECURSIVE construct), [...] Morel, on the other hand, crosses that line. This is necessary, because all

SQL is not Turing complete (if you ignore the WITH RECURSIVE construct), [...] Morel, on the other hand, crosses that line. This is necessary, because all functional languages are Turing complete, [...] According to Wikipedia, there is a paradign of total functional programming (https://en.wikipedia.org/wiki/Total_functional_programming https://en.wikipedia.org/wiki/Total_functional_programming), as described by D.A. Turner (https://www.cs.kent.ac.uk/people/staff/dat/esfp/fple.pdf https://www.cs.kent.ac.uk/people/staff/dat/esfp/fple.pdf) which restricts programs to be non-Turing complete. Wikipedia gives two examples of languages following it: Epigram and Charity. TL;DR it's possible if you limit the recursive functions to only act on _reduced_ form of input (e.g. strict subset of a set) and if every function is total (produce output for every input). Cool project BTW.