fact stringlengths 5 124 | type stringclasses 3 values | library stringclasses 5 values | imports listlengths 0 177 | filename stringclasses 414 values | symbolic_name stringlengths 1 57 | docstring stringclasses 1 value |
|---|---|---|---|---|---|---|
key_lemma : forall t l d d1 t1 s. d < d1 -> | lemma | examples | [
"export",
"export",
"export",
"export",
"list.Length",
"list.HdTlNoOpt",
"TreeReconstruction",
"Tree",
"list.Length",
"list.Reverse",
"Tree",
"list.Length",
"list.Reverse"
] | examples/vstte12_tree_reconstruction.mlw | key_lemma | |
right_nil : forall l: list (int, tree). length l >= 2 -> g l -> | lemma | examples | [
"export",
"export",
"export",
"export",
"list.Length",
"list.HdTlNoOpt",
"TreeReconstruction",
"Tree",
"list.Length",
"list.Reverse",
"Tree",
"list.Length",
"list.Reverse"
] | examples/vstte12_tree_reconstruction.mlw | right_nil | |
main_lemma : forall l: list (int, tree), d1 d2: int, t1 t2: tree. d1 <> d2 -> | lemma | examples | [
"export",
"export",
"export",
"export",
"list.Length",
"list.HdTlNoOpt",
"TreeReconstruction",
"Tree",
"list.Length",
"list.Reverse",
"Tree",
"list.Length",
"list.Reverse"
] | examples/vstte12_tree_reconstruction.mlw | main_lemma | |
map_leaf_depths : forall l: list int. forest_depths (map_leaf l) = l | lemma | examples | [
"export",
"export",
"export",
"export",
"list.Length",
"list.HdTlNoOpt",
"TreeReconstruction",
"Tree",
"list.Length",
"list.Reverse",
"Tree",
"list.Length",
"list.Reverse"
] | examples/vstte12_tree_reconstruction.mlw | map_leaf_depths | |
map_leaf_only_leaf : forall l: list int. only_leaf (map_leaf l) | lemma | examples | [
"export",
"export",
"export",
"export",
"list.Length",
"list.HdTlNoOpt",
"TreeReconstruction",
"Tree",
"list.Length",
"list.Reverse",
"Tree",
"list.Length",
"list.Reverse"
] | examples/vstte12_tree_reconstruction.mlw | map_leaf_only_leaf | |
map_leaf(l: list int) : list (int, tree) | function | examples | [
"export",
"export",
"export",
"export",
"list.Length",
"list.HdTlNoOpt",
"TreeReconstruction",
"Tree",
"list.Length",
"list.Reverse",
"Tree",
"list.Length",
"list.Reverse"
] | examples/vstte12_tree_reconstruction.mlw | map_leaf | |
le(x y: bool) = x = False \/ y = True | predicate | examples | [
"int.Int",
"bool.Bool",
"ref.Refint",
"array.Array",
"array.ArraySwap",
"array.ArrayPermut"
] | examples/vstte12_two_way_sort.mlw | le | |
sorted(a: array bool) = forall i1 i2: int. 0 <= i1 <= i2 < a.length -> le a[i1] a[i2] | predicate | examples | [
"int.Int",
"bool.Bool",
"ref.Refint",
"array.Array",
"array.ArraySwap",
"array.ArrayPermut"
] | examples/vstte12_two_way_sort.mlw | sorted | |
weakening : forall m i j k1 k2. 0 <= k1 <= k2 -> | lemma | examples | [
"int.Int",
"matrix.Matrix"
] | examples/warshall_algorithm.mlw | weakening | |
decomposition : forall m k. 0 <= k -> forall i j. path m i j (k+1) -> | lemma | examples | [
"int.Int",
"matrix.Matrix"
] | examples/warshall_algorithm.mlw | decomposition | |
minmax_bound : forall p:position, d:int. | lemma | examples_in_progress | [
"set.Fset",
"int.Int",
"int.Int",
"list.List",
"list.Elements",
"set.Fset",
"list.Mem",
"int.Int",
"int.MinMax",
"TwoPlayerGame",
"list.List",
"list.Elements",
"set.Fset"
] | examples_in_progress/alphaBeta.mlw | minmax_bound | |
minmax_nomove : forall p:position, d:int. | lemma | examples_in_progress | [
"set.Fset",
"int.Int",
"int.Int",
"list.List",
"list.Elements",
"set.Fset",
"list.Mem",
"int.Int",
"int.MinMax",
"TwoPlayerGame",
"list.List",
"list.Elements",
"set.Fset"
] | examples_in_progress/alphaBeta.mlw | minmax_nomove | |
power_monotonic : forall x y z. 0 <= x <= y -> power z x <= power z y | lemma | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | power_monotonic | |
power_non_neg : forall x y. x >= 0 /\ y >= 0 -> power x y >= 0 | lemma | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | power_non_neg | |
value_zero : forall x:array int31. | lemma | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value_zero | |
value_sub_upper_bound : forall x:map int int31, n l:int. 0 <= n <= l -> | lemma | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value_sub_upper_bound | |
value_sub_lower_bound : forall x:map int int31, n l:int. 0 <= n <= l -> | lemma | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value_sub_lower_bound | |
value_sub_lower_bound_tight : forall x:map int int31, n l:int. 0 < n <= l -> | lemma | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value_sub_lower_bound_tight | |
value_bounds_array : forall x:array int31. ok_array x -> | lemma | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value_bounds_array | |
value_array(x:array int31) : int | function | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value_array | |
value(x:t) : int | function | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value | |
value_array(x:array int31) : int | function | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value_array | |
value(x:t) : int | function | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | value | |
ok_array(a:array int31) = (to_int a.length >= 1 -> to_int a[to_int a.length - 1] <> 0) /\ | predicate | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | ok_array | |
ok(x:t) = ok_array x.digits | predicate | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | ok | |
ok_array(a:array int31) = forall i:int. 0 <= i < to_int a.length -> | predicate | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | ok_array | |
ok(x:t) = ok_array x.digits | predicate | examples_in_progress | [
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"ref.Ref",
"int.Int",
"int.Power",
"map.MapEq"
] | examples_in_progress/bigInt.mlw | ok | |
no_bound : identifier -> bool | function | examples_in_progress | [
"export",
"Lambda",
"list.List"
] | examples_in_progress/cek.mlw | no_bound | |
ground(t:term) = ground_rec t no_bound | predicate | examples_in_progress | [
"export",
"Lambda",
"list.List"
] | examples_in_progress/cek.mlw | ground | |
weak_nf(t:term) = match t with | predicate | examples_in_progress | [
"export",
"Lambda",
"list.List"
] | examples_in_progress/cek.mlw | weak_nf | |
weak_normalize(t1 t2:term) = exists n. weak_n_reduce n t1 t2 /\ weak_nf t2 | predicate | examples_in_progress | [
"export",
"Lambda",
"list.List"
] | examples_in_progress/cek.mlw | weak_normalize | |
knuth1 : forall p1 p2 p3:pt. turns_left p1 p2 p3 -> turns_left p2 p3 p1 | lemma | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | knuth1 | |
knuth2 : forall p1 p2 p3:pt. turns_left p1 p2 p3 -> not (turns_left p2 p1 p3) | lemma | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | knuth2 | |
knuth4 : forall p1 p2 p3 p4:pt. | lemma | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | knuth4 | |
knuth5 : forall p1 p2 p3 p4 p5:pt. | lemma | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | knuth5 | |
knuth3 : forall p1 p2 p3:pt. | lemma | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | knuth3 | |
crossproduct(p1 p2 p3:pt) : real | function | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | crossproduct | |
colinear(p1 p2 p3:pt) = crossproduct p1 p2 p3 = 0.0 | predicate | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | colinear | |
turns_left(p1 p2 p3:pt) = crossproduct p1 p2 p3 >. 0.0 | predicate | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | turns_left | |
is_ccw_convex(pa:path) = let l = length pa in | predicate | examples_in_progress | [
"export",
"export",
"list.List",
"list.Length",
"list.NthNoOpt",
"ConvexSet",
"ref.Ref",
"ConvexSet"
] | examples_in_progress/convex_hull.mlw | is_ccw_convex | |
MarkSumFootprint : forall n:int. forall s1: array(Student [R1]). | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref"
] | examples_in_progress/course.mlw | MarkSumFootprint | |
MarkSum_set_array_outside : forall r:region student, i j k:int, a: array pointer, p:pointer. | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref"
] | examples_in_progress/course.mlw | MarkSum_set_array_outside | |
MarkSum_set_region_outside : forall r:region student, i j:int, a: array pointer, p:pointer, s:student. | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref"
] | examples_in_progress/course.mlw | MarkSum_set_region_outside | |
create(x: 'a) : t 'a | function | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref"
] | examples_in_progress/course.mlw | create | |
invStudent(this:student) = let (_,m) = this in 0 <= m <= 100 | predicate | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref"
] | examples_in_progress/course.mlw | invStudent | |
elements_correct : forall a: t 'a. | lemma | examples_in_progress | [
"int.Int",
"int.ComputerDivision",
"bintree.Tree",
"export",
"ref.Ref",
"import",
"import",
"list.List",
"seq.Mem",
"int.Sum"
] | examples_in_progress/flexible_array.mlw | elements_correct | |
size_list_snoc : forall l: seq (tree 'a), t: tree 'a. | lemma | examples_in_progress | [
"int.Int",
"int.ComputerDivision",
"bintree.Tree",
"export",
"ref.Ref",
"import",
"import",
"list.List",
"seq.Mem",
"int.Sum"
] | examples_in_progress/flexible_array.mlw | size_list_snoc | |
interleave(x y: seq 'a) : seq 'a | function | examples_in_progress | [
"int.Int",
"int.ComputerDivision",
"bintree.Tree",
"export",
"ref.Ref",
"import",
"import",
"list.List",
"seq.Mem",
"int.Sum"
] | examples_in_progress/flexible_array.mlw | interleave | |
elements_aux(t: tree 'a) : seq 'a | function | examples_in_progress | [
"int.Int",
"int.ComputerDivision",
"bintree.Tree",
"export",
"ref.Ref",
"import",
"import",
"list.List",
"seq.Mem",
"int.Sum"
] | examples_in_progress/flexible_array.mlw | elements_aux | |
elements(a: t 'a) : seq 'a | function | examples_in_progress | [
"int.Int",
"int.ComputerDivision",
"bintree.Tree",
"export",
"ref.Ref",
"import",
"import",
"list.List",
"seq.Mem",
"int.Sum"
] | examples_in_progress/flexible_array.mlw | elements | |
inv(t: tree 'a) = match t with | predicate | examples_in_progress | [
"int.Int",
"int.ComputerDivision",
"bintree.Tree",
"export",
"ref.Ref",
"import",
"import",
"list.List",
"seq.Mem",
"int.Sum"
] | examples_in_progress/flexible_array.mlw | inv | |
sqr(z: int) : int | function | examples_in_progress | [
"int.Int",
"array.Array",
"export",
"int.Int",
"int.ComputerDivision",
"int.Power",
"ref.Ref",
"array.Array",
"GmpAuxiliaryfunctions",
"ref.Ref"
] | examples_in_progress/gmp_square_root.mlw | sqr | |
is_normalized(n h: int) = n < h <= 4 * n | predicate | examples_in_progress | [
"int.Int",
"array.Array",
"export",
"int.Int",
"int.ComputerDivision",
"int.Power",
"ref.Ref",
"array.Array",
"GmpAuxiliaryfunctions",
"ref.Ref"
] | examples_in_progress/gmp_square_root.mlw | is_normalized | |
is_hamming_times2 : forall n:int. n >= 1 -> is_hamming n -> is_hamming (2*n) | lemma | examples_in_progress | [
"int.Int",
"int.MinMax",
"number.Divisibility",
"number.Prime",
"number.Coprime",
"array.Array",
"ref.Ref"
] | examples_in_progress/hamming_sequence.mlw | is_hamming_times2 | |
is_hamming_times3 : forall n:int. n >= 1 -> is_hamming n -> is_hamming (3*n) | lemma | examples_in_progress | [
"int.Int",
"int.MinMax",
"number.Divisibility",
"number.Prime",
"number.Coprime",
"array.Array",
"ref.Ref"
] | examples_in_progress/hamming_sequence.mlw | is_hamming_times3 | |
is_hamming_times5 : forall n:int. n >= 1 -> is_hamming n -> is_hamming (5*n) | lemma | examples_in_progress | [
"int.Int",
"int.MinMax",
"number.Divisibility",
"number.Prime",
"number.Coprime",
"array.Array",
"ref.Ref"
] | examples_in_progress/hamming_sequence.mlw | is_hamming_times5 | |
is_hamming(n:int) = forall d:int. prime d /\ divides d n -> d = 2 \/ d = 3 \/ d = 5 | predicate | examples_in_progress | [
"int.Int",
"int.MinMax",
"number.Divisibility",
"number.Prime",
"number.Coprime",
"array.Array",
"ref.Ref"
] | examples_in_progress/hamming_sequence.mlw | is_hamming | |
app(s1 s2: char_string) : char_string | function | examples_in_progress | [
"int.Int"
] | examples_in_progress/immutable_string.mlw | app | |
length(s: astring) : aint | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | length | |
concat2(s1 s2: astring) : astring | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat2 | |
concat3(s1 s2 s3: astring) : astring | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat3 | |
concat4(s1 s2 s3 s4: astring) : astring | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat4 | |
concat5(s1 s2 s3 s4 s5: astring) : astring | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat5 | |
len(s: any_string) : any_int *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | len | |
concat2(s1 s2: any_chars) : any_string *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat2 | |
concat3(s1 s2 s3: any_chars) : any_string *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat3 | |
concat4(s1 s2 s3 s4: any_chars) : any_string *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat4 | |
concat5(s1 s2 s3 s4 s5: any_chars) : any_string *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat5 | |
len(s: wstring) : int *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | len | |
concat2(s1 s2: wstring) : wstring *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat2 | |
concat3(s1 s2 s3: wstring) : wstring *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat3 | |
concat4(s1 s2 s3 s4: wstring) : wstring *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat4 | |
concat5(s1 s2 s3 s4 s5: wstring) : wstring *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | concat5 | |
find(s1 s2: wstring) : int *) | function | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | find | |
satisfy_size(s: astring) = match s with | predicate | examples_in_progress | [
"string.String",
"int.Int"
] | examples_in_progress/ladderstring.mlw | satisfy_size | |
acyclic_list : forall next: t pointer, p: pointer. | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse"
] | examples_in_progress/list_rev.mlw | acyclic_list | |
reverse_append : forall l1 : list 'a, l2 : list 'a, x : 'a | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse"
] | examples_in_progress/list_rev.mlw | reverse_append | |
frame_list : forall next: t pointer, p q v: pointer | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse"
] | examples_in_progress/list_rev.mlw | frame_list | |
frame_list_ft : forall next: t pointer, p q v: pointer. | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse"
] | examples_in_progress/list_rev.mlw | frame_list_ft | |
acyclic_list : forall next: t pointer, p: pointer. | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse"
] | examples_in_progress/list_rev.mlw | acyclic_list | |
frame_model : forall next: t pointer, p q v: pointer [model next[q <- v] p]. | lemma | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse"
] | examples_in_progress/list_rev.mlw | frame_model | |
create(x: 'a) : t 'a | function | examples_in_progress | [
"map.Map",
"map.Const",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse",
"int.Int",
"ref.Ref",
"list.List",
"list.Append",
"list.Reverse"
] | examples_in_progress/list_rev.mlw | create | |
Sum_is_sum_digits_interp : forall x : int -> int, i j : int. | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Sum_is_sum_digits_interp | |
Sum_digits_a_set_eq : forall x : array int, i j k v : int. | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Sum_digits_a_set_eq | |
Interp9_step : forall x : int -> int, i j : int. | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Interp9_step | |
Gt_digit_interp : forall x1 x2 : int -> int, d : int. | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Gt_digit_interp | |
Gt_digit_update : forall x1 x2 : int -> int, d i v : int. | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Gt_digit_update | |
Smallest_shape_1 : forall y : int. y >= 0 -> mod y 9 = 0 -> | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Smallest_shape_1 | |
Smallest_shape_2 : forall y : int. y >= 0 -> mod y 9 <> 0 -> | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Smallest_shape_2 | |
Smallest_nb_digits : forall y : int. y >= 0 -> | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Smallest_nb_digits | |
Any_nb_digits_above_smallest_size : forall y : int. y > 0 -> | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Any_nb_digits_above_smallest_size | |
Completeness : m >= smallest_size y /\ (* cut *) | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | Completeness | |
is_integer(x : int -> int) = forall k : int. 0 <= k < m -> 0 <= x k <= 9 | predicate | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"int.MinMax",
"int.EuclideanDivision",
"int.Power",
"int.Sum"
] | examples_in_progress/next_digit_sum.mlw | is_integer | |
numof_occ : forall a: array elt, e: elt, l u: int. | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"bag.Bag",
"array.NumOfEq"
] | examples_in_progress/simple_priority_queue.mlw | numof_occ | |
numof_add : forall a: array elt, e: elt, l u: int. l <= u -> | lemma | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"bag.Bag",
"array.NumOfEq"
] | examples_in_progress/simple_priority_queue.mlw | numof_add | |
is_empty(q: t) = q.size = 0 | predicate | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"bag.Bag",
"array.NumOfEq"
] | examples_in_progress/simple_priority_queue.mlw | is_empty | |
is_full(q: t) = q.size = length q.elems | predicate | examples_in_progress | [
"int.Int",
"ref.Ref",
"array.Array",
"bag.Bag",
"array.NumOfEq"
] | examples_in_progress/simple_priority_queue.mlw | is_full | |
grid_eq_sub : forall g1 g2 a b. 0 <= a <= 81 /\ 0 <= b <= 81 /\ | lemma | examples_in_progress | [
"int.Int",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"Grid",
"map.Map",
"int.Int",
"mach.int.Int31",
"mach.array.Array31",
"Grid",
"array.Array",
"mach.int.Int31",
"int.Int",
"mach.array.Array31",
"ref.Ref",
"Grid",
"TheClassicalSudokuGrid",
"Solver",
"mach.array.Array31... | examples_in_progress/sudoku_reloaded.mlw | grid_eq_sub | |
subset_valid_chunk : forall g h : grid. included g h -> | lemma | examples_in_progress | [
"int.Int",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"Grid",
"map.Map",
"int.Int",
"mach.int.Int31",
"mach.array.Array31",
"Grid",
"array.Array",
"mach.int.Int31",
"int.Int",
"mach.array.Array31",
"ref.Ref",
"Grid",
"TheClassicalSudokuGrid",
"Solver",
"mach.array.Array31... | examples_in_progress/sudoku_reloaded.mlw | subset_valid_chunk | |
subset_valid : forall s g h. | lemma | examples_in_progress | [
"int.Int",
"map.Map",
"mach.int.Int31",
"mach.array.Array31",
"Grid",
"map.Map",
"int.Int",
"mach.int.Int31",
"mach.array.Array31",
"Grid",
"array.Array",
"mach.int.Int31",
"int.Int",
"mach.array.Array31",
"ref.Ref",
"Grid",
"TheClassicalSudokuGrid",
"Solver",
"mach.array.Array31... | examples_in_progress/sudoku_reloaded.mlw | subset_valid |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.