Munching squares: Difference between revisions

Line 108:
(* Test that the index is not out of bounds high. This could
be proven without a runtime check, but doing that is left
as an exercise for the very, veryan advanced reader. For one thing, you
one thing, you will need a more complicated version of lxor. Then you
lxor.will Youneed willto likelyprove, wantor toprovide useas an externalaxiom, that the constraintXOR
solver,of astwo well,numbers orof atthe leastsame anumber reasonableof setsignificant ofbits is
axiomsitself restricted to that number of bits. *)
val () = assertloc (i < numcolors)
 
1,448

edits