Abstraction of a path that represents a lock, special-casing equality and comparisons to work over type, base variable modulo this and access list

`include InferStdlib.PrettyPrintable.PrintableOrderedType with type PrintableOrderedType.t = InferIR.AccessPath.t`
`type t``= InferIR.AccessPath.t```
`val compare : t ‑> t ‑> int`
`val pp : InferStdlib.PrettyPrintable.F.formatter ‑> t ‑> unit`
`val owner_class : t ‑> InferIR.Typ.name option`

Class of the root variable of the path representing the lock

`val equal : t ‑> t ‑> bool`