An abstraction of the Boolean Function Representation used by GL.
GL was originally designed to operate on ubdds, with support for aigs being added later. To avoid redoing a lot of proof work, a small level of indirection was added.
The particular Boolean function representation that we are using at any particular time is governed by bfr-mode, and operations like bfr-and allow us to construct new function nodes using whatever the current representation is.