  We apply Kolesnikov's algorithm to obtain a variety of nonassociative
algebras defined by right anticommutativity and a `noncommutative' version of
the Malcev identity. We use computational linear algebra to verify that these
identities are equivalent to the identities of degree <= 4 satisfied by the
dicommutator in every alternative dialgebra. We extend these computations to
show that any special identity for Malcev dialgebras must have degree at least
7. Finally, we introduce a trilinear operation which makes any Malcev dialgebra
into a Leibniz triple system.
