E.g., the “add” operator only has forward and backward computation — the operand at the top is treated as a constant. Does it make sense to define such operators with only one “backwards” computation? Are there some modifications that we could make to Crosscut’s model of computation that would make it possible for us to provide a “dist” operator that is both useful and has predictable behavior?