skip to content
magda lipka


A simple tautology checker written in Haskell.


And by “simple” I mean a brute force algorithm. First, the program generates all possible sentences from given characters and given length. Then it validates them and converts into some form of abstract syntax tree - which allows it to check if the sentence is a tautology - by evaluating all combinations of parameter values.