3 ms·
Anything that needs pattern matching or search. As a for instance, grammars (in Prolog, a grammar can be expressed as a first order logic theory, to be proved
by YeGoblynQueenne 10y ago
Anything that needs pattern matching or search.
As a for instance, grammars (in Prolog, a grammar can be expressed as a first order logic theory, to be proved by the compiler; therefore, a program).