  We present axiomatisations for a number of partial function signatures that
include domain restriction, modelled as a right normal band operation. Other
operations considered are override and update, difference, minus, intersection,
composition and domain, all of which find motivation in computer science. All
axiomatisations found are finite, many of them equational.
