5 ms·
Languages of all kinds of paradigms are Turing complete. But we still use different languages for different purposes, because some programs are more convenient
by yorwba 8y ago
Languages of all kinds of paradigms are Turing complete. But we still use different languages for different purposes, because some programs are more convenient to write in a certain paradigm that maps well to their problem domain.
In Prolog for example, you can easily define concatenation of cons-lists as
concatenate(nil, Ys, Ys).
concatenate(cons(X, Xs), Ys, cons(X, Zs)) :- concatenate(Xs, Ys, Zs).
and then generate all 4 possible solutions for the query concatenate(X, Y, cons(1, cons(2, cons(3, nil)))).
Of course Prolog has built-in lists that'd allow simply writing append(X, Y, [1, 2, 3]), but the ease of defining certain simple algorithms and then running them backwards is what makes logic programming so useful in my opinion.
If SQL can express an equivalent program equally succinctly, I'd very much like to see how.