booleanSimplified

For the blog post.

Build

$ stack build

Run

$ stack exec bsimplified -- "A*~B+~A*~B+A*~B+A*B"
Minterms (Truth patterns):
        m_0 = { A = True, B = True }
        m_1 = { A = True, B = False }
        m_3 = { A = False, B = False }
The state of compression #1: ["m_0 m_1","m_1 m_3"]
Found prime implicants: ["m_0 m_1","m_1 m_3"]
Simplified terms: (m_0 m_1), (m_1 m_3)