SAT-canonical-0.1.0.0

Safe HaskellSafe
LanguageHaskell2010

Simplification

Synopsis

Documentation

withTF :: FProp -> Bool Source #

(withTF f) is verified if the formula f contains any occurrence of the constants T or F:

simplification :: FProp -> FProp Source #

simplification' :: FProp -> FProp Source #

prop_simp :: FProp -> Bool Source #

>>> quickCheck prop_simp
+++ OK, passed 100 tests.