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.

▲

psd1 a day ago | parent | next [-]

OT, but seeing "alot" always sends me here: 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 12 hours ago | parent [-]

That was half the meaning of the username back when I started using it. And I also like reading.

	▲	psd1 2 minutes ago \| parent [-]
		Then: well played, you got me

▲

mickeyp a day ago | parent | prev [-]

That's lovely. I look forward to seeing your autoconf and GNU Make replacement in MAUDE SYSTEM.