New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Real-closed field solver #4

Open

copumpkin opened this issue Apr 11, 2013 · 1 comment

copumpkin commented Apr 11, 2013

These are remarkably hard to find and it would be nice to have a clean one in Haskell.

Owner

msakai commented Apr 15, 2013

Thank you for your comment.

Here's my implementation of cylindrical algebraic decomposition.
https://github.com/msakai/toysolver/blob/71c5d068d9c2f80e1cb9735a4c3f799ee0422da4/src/Algorithm/CAD.hs
It only provides quantifier elimination (or projection) procedure for conjunction of polynomial constraints. But it is easy to extend it to full RCF decision procedure.

I'd like to split the functionality into a separate package with clean API, if I could clean up it' API and dependencies.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment