4 ms·
> No declarative language can ever handle every use case. Prolog would beg to differ.
by baryphonic 2y ago
> No declarative language can ever handle every use case.
Prolog would beg to differ.
- jampekka 2y agoAnd CSS https://accodeing.com/blog/2015/css3-proven-to-be-turing-complete https://accodeing.com/blog/2015/css3-proven-to-be-turing-com...
- baryphonic 2y agoThis 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.
- wizzwizz4 2y agoProlog has well-defined execution order with side-effects. It's an imperative language masquerading as a declarative one.
- baryphonic 2y agoMiniKanren, then?
- seanclayton 2y agoSo would LISP, Haskell, and Erlang.
- zarzavat 2y agoDeclarative in this context means no recursion or infinite loops. So none of these are declarative.