Tacit programming is of theoretical interest, because the strict use of composition results in programs that are well adapted for equational reasoning.
In universal algebra and equational theory, the methods of term rewriting, congruence closure and unification are used to attempt to decide satisfiability.
