Original Post

Two years ago, after analyzing the object-oriented-inspired cellular automata I made, I reinvented the wheel called "Binary decision diagram". Turns out, it's also a much simpler implementation comparing to MIG, AIG, DNF, CNF... Just a network of multiplexers, or "if-then-else" trees. The use in EDA is interesting though, allowing to rethink the way we define the conditionals in PL.