And CSS https://accodeing.com/blog/2015/css3-proven-to-be-turing-com...

This research is cool, but I always feel it needs an asterisk. Requiring a click or event or some external clock feels like a cop out. I've seen a similar thing with PowerPoint.

It would be a bit like saying a language with iterations but neither first-class functions nor recursion is Turing complete as long as an external stack is provided. Or maybe it allows a stack (or recursion) but requires external intervention for function application.

Cool hacking nevertheless.

Prolog has well-defined execution order with side-effects. It's an imperative language masquerading as a declarative one.

MiniKanren, then?

So would LISP, Haskell, and Erlang.

Declarative in this context means no recursion or infinite loops. So none of these are declarative.