Lazy groupoids

A binary operationf(x, y) is said to be lazy if every operation that can be obtained fromfby composition is equivalent tof(x, y),f(x, x) orx. We describe lazy operations by identities (i.e., we determine all varieties of lazy groupoids), and we also characterize lazy groupoids up to isomorphism