3 ms·
The theoretical difference in power between a non-Turing complete declarative language and a turing complete one is irrelevant in practice. Datalog is a decidab
by AlotOfReading 3mo ago
The theoretical difference in power between a non-Turing complete declarative language and a turing complete one is irrelevant in practice. Datalog is a decidable, declarative subset of Turing-complete Prolog. It's also EXPTIME complete. I don't think we exclude any real use cases by prohibiting super-exponential algorithms.
The problem is shitty config languages. I wouldn't group xaml in the same category as dhall for example.
- mickeyp 3mo agoThat's lovely. I look forward to seeing your autoconf and GNU Make replacement in MAUDE SYSTEM.
- psd1 3mo agoOT, but seeing "alot" always sends me here: https://hyperboleandahalf.blogspot.com/2010/04/alot-is-better-than-you-at-everything.html https://hyperboleandahalf.blogspot.com/2010/04/alot-is-bette... Language is what people use, and "alot" is close to critical mass, so you'll outlive this species of pedantry. I just like the cartoon.
- AlotOfReading 3mo agoThat was half the meaning of the username back when I started using it. And I also like reading.
- psd1 3mo agoThen: well played, you got me