Updating readme, cleaning up code a bit
Moved sorting and partition out of the constraint solver, started playing with some uninterpreted functions.
Fixed the factorial example
Added a couple of forms of fibonacci
Added the mod operator into the constraint solver. Added Euclid's algorithm to the uninterpreted functions tests
Finished the simpler version of insord1
Finished the more succinct version of insertion sort.
Added to the uninterp and bitvec examples.
Added an example using foldr (not very interesting)
Found a few examples where Z3 comes up short, moved a pointer offset function into ATS.
Small formatting change
Added permutation to the Insertion sort example. Modified the
constraint solver to accept uninterpreted sorts.
Simplified the quicksort example so that the permutation predicate
isn't proven with props. Instead, I want to move it to the SMT solver
like I did with insertion sort.
Some notes on a non-linear inequality and a sketch for a component of a filesystem using bitvectors.
Added in the start of array insertion sort.
Alias intbv32 and uintbv32 with int32_t  and uint32_t.
Merge branch 'master' of github.com:wdblair/ATS-Postiats-contrib
Small style adjustments.
Added a rough sketch for insertion sort.
Getting closer to finished insertion sort for paper