mirror of
https://github.com/GaloisInc/cryptol.git
synced 2024-12-17 04:44:39 +03:00
b78062eafe
Similar to what @weaversa requested in #66, we bind `it` to `False` when we can't find a sat assignment, and `it` to `True` when we've proved a theorem. Also adds some simple tests for the sat/prove result binding, and let binding at the repl.
20 lines
250 B
Plaintext
20 lines
250 B
Plaintext
Loading module Cryptol
|
|
Q.E.D.
|
|
it : Bit
|
|
True
|
|
f 0 = False
|
|
it : [4]
|
|
0
|
|
f 3 = True
|
|
it : [4]
|
|
3
|
|
Unsatisfiable.
|
|
it : Bit
|
|
False
|
|
g {x = 0, y = 1} = False
|
|
it : {x : [32], y : [32]}
|
|
{x = 0, y = 1}
|
|
g {x = 0, y = 0} = True
|
|
it : {x : [32], y : [32]}
|
|
{x = 0, y = 0}
|