Explore >> Select a destination
|
You are here 
|
blog.scottnonnenberg.com | ||
| | | | |
argumatronic.com
|
|
| | | | | Occasional writings about Haskell. | |
| | | | |
rachelcarmena.github.io
|
|
| | | | | Some characteristics of functional programming | |
| | | | |
learnyouahaskell.com
|
|
| | | | | ||
| | | | |
donsbot.com
|
|
| | | SMT solvers are automated tools to solve the "Satisfiability Modulo Theories" problem -- that is, determining whether a given logical formula can be satisfied. However, unlike SAT solvers, SMT solvers generalize to solving such NP-complete problems that contain not just boolean variables, but more useful types, such as lists, tuples, arrays, integers and reals. And... | ||
