I was working on an abstract algebra library for Python when I realized that most of the dirty work just designed loops to match logical expressions with quantifiers. Then I realized, although it might be difficult to implement a function for logical quantification in Python, it would be easier in Haskell or in another language.
Right now I have quantifiers that work as long as the property includes only one variable, which is quantified, and only if the relation you quantize has three variables, overcoming these barriers seems to be the difficult part.
For example, the operator ∀x ∃y (x < y)causes problems, but ∀x (x = 2) ∃y (y < 3)in order.
Are there any existing Haskell libraries that implement value level logical quantifiers like this? It’s hard to search, because whenever I look for something in the Haskell “logical quantifier” strings, I get a lot of things about type quantifiers that I don’t want.
The only thing I could find is forAllin Test.QuickCheck , and it is not related to "exists."
source
share