The override operation is a natural one in computer science, and has connections with other areas of mathematics such as hyperplane arrangements. For arbitrary functions f and g, f g is the function with domain dom(f) ∪ dom(g) that agrees with f on dom(f) and with g on dom(g)\ dom(f). Jackson and the author have shown that there is no finite axiomatisation of algebras of functions of signature (). But adding operations (such as update) to this minimal signature can lead to finite axiomatisations. For the functional signature (, \) where \ is set-theoretic difference, Cirulis has given a finite equational axiomatisation as subtraction o-semilattices. Define f g = (f g)∩(g f) for all functions f and g; this is the largest domain restriction of the binary relation f ∪ g that gives a partial function. Now f ∩g = f\(f\g) and f g = f (f g) for all functions f,g, so the signatures () and (, ∩) are both intermediate between () and (, \) in expressive power. We show that each is finitely axiomatised, with the former giving a proper quasivariety and the latter the variety of associative distributive o-semilattices in the sense of Cirulis.