The cut operator is not part of the Mercury language. In addition, the conditional operator ‘-> ;’ does not do a hard cut across the condition — only a soft cut which prunes away either the ‘then’ goal or the ‘else’ goal. If there are multiple solutions to the condition, they will all be found on backtracking.
Prolog programs that use cuts and a ‘catch-all’ clause should be transformed to use if-then-else.
p(this, ...) :- !, ... p(that, ...) :- !, ... p(Thing, ...) :- ...
should be rewritten as
p(Thing, ...) :- ( Thing = this -> ... ; Thing = that -> ... ; ... ).
The Mercury compiler does much better indexing than most Prolog compilers. Actually, the compiler indexes on all input variables to a disjunction (separate clauses of a predicate are merged into a single clause with a disjunction inside the compiler). As a consequence, the Mercury compiler indexes on all arguments. It also does deep indexing. That is, a predicate such as the following will be indexed.
p([f(g(h)) | Rest]) :- ... p([f(g(i)) | Rest]) :- ...
Since indexing is done on disjunctions rather than clauses, it is often unnecessary to introduce auxiliary predicates in Mercury, whereas in Prolog it is often important to do so for efficiency.
If you have a predicate that needs to test all the functors of a type, it is better to use a disjunction instead of a chain of conditionals, for two reasons. First, if you add a new functor to a type, the compiler will still accept the now incomplete conditionals, whereas if you use a disjunction you will get a determinism error that pinpoints which part of the code needs changing. Second, in some situations the code generator can implement an indexed disjunction (which we call a switch) using binary search, a jump table or a hash table, which can be faster than a chain of if-then-elses.