Another way could be to run that through a compiler with optimization activated, and then decompile the resulting binary back to code. But if you want to optimize hot code then usually mathematical reduction is seldomly wherein the problem lies
Tubbles
joined 2 years ago
The most low level languages, such as C, compiles down to CPU instructions, which still is way above logic gates. The CPU in turn reads the instructions and controls the computer to in a way "simulate" what could be described as a boolean expression -- at every CPU clock cycle. The next cycle the permutation of all control signals and computer compinents will be different. I highly doubt any programming language implementation has an IR that resembles what you are looking for, including mathematica. The closest you get is probably HDLs but then you need to do all the mathing yourself
Algebra in school is like a compiler with shitty type inference: you rarely have to write type annotations and you can easily end up with impossible states.
view more: next ›
Its like the C of web, it'll be a hundred years to kill it