Am Di., 14. Juli 2020 um 02:38 Uhr schrieb John Cowan <[email protected]>:
> Just cherry-picking a few points... Just cherry-cherry-picking. :) > On Mon, Jul 13, 2020 at 5:40 PM Linas Vepstas <[email protected]> wrote: > >> Compare to, for example SQL -- it blows the doors off syntax-case in >> usability and power. > > > Well, no; syntax-case allows arbitrary Scheme, so it is Turing-complete. SQL > is not, unless the implementation of CTEs allows arbitrary nesting. SQL is > also extremely rigid, deficient, and un-orthogonal compared to a true > relational algebra implementation like Tutorial D. In fact, already the pattern language of syntax-rules is Turing-complete.
