Contract koans: Verifying contract for uncountable sets

Hey all,

I am working on koans for contracts and want my user to write a flat
contract, a chaperone contract, and an impersonator contract. A series of
rackunit assertions will follow with attempts to pass or fail the contract,
such that the user will need to read the assertions and work backwards to
write contracts that pass all tests.

I can see using rackunit's check-not-exn to verify specific cases, but how
would I verify that the user's contract was correct for an uncountable set
of values *without* giving away the answer in an assertion? I see a couple
of possible solutions in the docs, but I'm not grokking a clear path
yet. Statically
analyze a projection? Throw fuel at one of the random generators until I
happily assume they are right? RTFM again for something easy that I just
missed?

Sage

-- 
You received this message because you are subscribed to the Google Groups "Racket Users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscribe-/JYPxA39Uh5TLH3MbocFF+G/[email protected]
For more options, visit https://groups.google.com/d/optout.