Datasets:
phanerozoic
/
Why3

Dataset card Data Studio Files
xet
Community
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
red(n:int) : seq color
function
examples
[ "int.Int", "import", "import", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_2.mlw
red
valid_coloring(s:seq color) = valid_coloring_f Red s \/ valid_coloring_f Black s
predicate
examples
[ "int.Int", "import", "import", "array.Array" ]
examples/verifythis_2018_le_rouge_et_le_noir_2.mlw
valid_coloring
len_contents(b:buffer) : int
function
examples
[ "int.Int", "seq.Seq", "map.Map", "array.Array" ]
examples/verifythis_2018_mind_the_gap_2.mlw
len_contents
contents(b:buffer) : int -> char
function
examples
[ "int.Int", "seq.Seq", "map.Map", "array.Array" ]
examples/verifythis_2018_mind_the_gap_2.mlw
contents
cursor_pos(b:buffer) : int
function
examples
[ "int.Int", "seq.Seq", "map.Map", "array.Array" ]
examples/verifythis_2018_mind_the_gap_2.mlw
cursor_pos
same_contents(b1 b2:buffer) = len_contents b1 = len_contents b2
predicate
examples
[ "int.Int", "seq.Seq", "map.Map", "array.Array" ]
examples/verifythis_2018_mind_the_gap_2.mlw
same_contents
sym_merge : forall v u g. sym g -> irrefl g -> Dvar.mem u g -> Dvar.mem v g ->
lemma
examples
[ "int.Int", "option.Option", "set.Fset", "fmap.Fmap", "case." ]
examples/verifythis_2018_register_allocation.mlw
sym_merge
irrefl(g : Dvar.t Svar.set) = forall u. Dvar.mem u g -> not mem u (Dvar.find u g)
predicate
examples
[ "int.Int", "option.Option", "set.Fset", "fmap.Fmap", "case." ]
examples/verifythis_2018_register_allocation.mlw
irrefl
sym(g : Dvar.t Svar.set) = forall u v. Dvar.mem u g -> Dvar.mem v g ->
predicate
examples
[ "int.Int", "option.Option", "set.Fset", "fmap.Fmap", "case." ]
examples/verifythis_2018_register_allocation.mlw
sym
destruct_peek_tail : forall l : list 'a. not is_nil l -> l = Cons (peek l) (tail l)
lemma
examples
[ "int.Int", "list.ListRich", "array.Array", "exn.Exn", "option.Option", "it" ]
examples/verifythis_2019_cartesian_trees.mlw
destruct_peek_tail
other_descendant : forall t p1 p2 s. parent t p1 p2 -> descendant t p2 s ->
lemma
examples
[ "int.Int", "list.ListRich", "array.Array", "exn.Exn", "option.Option", "it" ]
examples/verifythis_2019_cartesian_trees.mlw
other_descendant
inv_other_descendant : forall t p1 s. descendant t p1 s ->
lemma
examples
[ "int.Int", "list.ListRich", "array.Array", "exn.Exn", "option.Option", "it" ]
examples/verifythis_2019_cartesian_trees.mlw
inv_other_descendant
le = (>=)
predicate
examples
[ "int.Int", "list.ListRich", "array.Array", "exn.Exn", "option.Option", "it" ]
examples/verifythis_2019_cartesian_trees.mlw
le
le = (<)
predicate
examples
[ "int.Int", "list.ListRich", "array.Array", "exn.Exn", "option.Option", "it" ]
examples/verifythis_2019_cartesian_trees.mlw
le
reverse_sorted_incr : forall l. Decr.sorted l -> Incr.sorted (reverse l)
lemma
examples
[ "int.Int", "seq.Seq", "seq.OfList", "seq.FreeMonoid", "array.Array", "map.Occ", "list.ListRich", "bool.Bool", "exn.Exn", "list.FoldRight", "seq.Occ", "seq.OfList", "array.IntArraySorted", "array.ArrayPermut", "option.Option", "list.NthNoOpt" ]
examples/verifythis_2019_ghc_sort.mlw
reverse_sorted_incr
eqb(b1 b2 : bool) : bool
function
examples
[ "int.Int", "seq.Seq", "seq.OfList", "seq.FreeMonoid", "array.Array", "map.Occ", "list.ListRich", "bool.Bool", "exn.Exn", "list.FoldRight", "seq.Occ", "seq.OfList", "array.IntArraySorted", "array.ArrayPermut", "option.Option", "list.NthNoOpt" ]
examples/verifythis_2019_ghc_sort.mlw
eqb
le = (<)
predicate
examples
[ "int.Int", "seq.Seq", "seq.OfList", "seq.FreeMonoid", "array.Array", "map.Occ", "list.ListRich", "bool.Bool", "exn.Exn", "list.FoldRight", "seq.Occ", "seq.OfList", "array.IntArraySorted", "array.ArrayPermut", "option.Option", "list.NthNoOpt" ]
examples/verifythis_2019_ghc_sort.mlw
le
le = (<=)
predicate
examples
[ "int.Int", "seq.Seq", "seq.OfList", "seq.FreeMonoid", "array.Array", "map.Occ", "list.ListRich", "bool.Bool", "exn.Exn", "list.FoldRight", "seq.Occ", "seq.OfList", "array.IntArraySorted", "array.ArrayPermut", "option.Option", "list.NthNoOpt" ]
examples/verifythis_2019_ghc_sort.mlw
le
is_permutation_of_refl : forall p. is_permutation_of p p
lemma
examples
[ "int.Int", "import", "import", "int.NumOf", "import" ]
examples/verifythis_2021_lexicographic_permutations_1.mlw
is_permutation_of_refl
is_permutation_of_sym : forall p q. is_permutation_of p q -> is_permutation_of q p
lemma
examples
[ "int.Int", "import", "import", "int.NumOf", "import" ]
examples/verifythis_2021_lexicographic_permutations_1.mlw
is_permutation_of_sym
is_permutation_of_tran : forall p q r. is_permutation_of p q -> is_permutation_of q r ->
lemma
examples
[ "int.Int", "import", "import", "int.NumOf", "import" ]
examples/verifythis_2021_lexicographic_permutations_1.mlw
is_permutation_of_tran
to_seq(a: array elt) : (s: seq elt)
function
examples
[ "int.Int", "import", "import", "int.NumOf", "import" ]
examples/verifythis_2021_lexicographic_permutations_1.mlw
to_seq
all_permutations(s: permutation) : (all: fset permutation)
function
examples
[ "int.Int", "import", "import", "int.NumOf", "import" ]
examples/verifythis_2021_lexicographic_permutations_1.mlw
all_permutations
lt(p q: permutation) = length p = length q > 0 /\
predicate
examples
[ "int.Int", "import", "import", "int.NumOf", "import" ]
examples/verifythis_2021_lexicographic_permutations_1.mlw
lt
is_permutation_of(p a: seq elt) = length p = length a /\
predicate
examples
[ "int.Int", "import", "import", "int.NumOf", "import" ]
examples/verifythis_2021_lexicographic_permutations_1.mlw
is_permutation_of
of_to_list : forall a. array_eq (of_list (to_list a)) a
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
of_to_list
to_of_list : forall l. to_list (of_list l) = l
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
to_of_list
boxed_permut : forall a a' u.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
boxed_permut
boxed_greater : forall a.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
boxed_greater
lt_trans : forall a1 a2 a3 : array int.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
lt_trans
eq_le_compat : forall a1 a2 b1 b2 : array int.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
eq_le_compat
eq_lt_compat : forall a1 a2 b1 b2 : array int.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
eq_lt_compat
le_or_lt : forall a1 a2 : array int.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
le_or_lt
lt_not_le : forall a1 a2 : array int.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
lt_not_le
le_permut_sorted : forall a1 a2 i.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
le_permut_sorted
le_permut_decr_sorted : forall a1 a2 i.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
le_permut_decr_sorted
seq_snoc_mem : forall s : seq 'a, x y.
lemma
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
seq_snoc_mem
of_list(l : L.list int) : array int
function
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
of_list
le = (>=)
predicate
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
le
le(a1 a2 : array int) = length a1 = length a2 &&
predicate
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
le
lt(a1 a2 : array int) = le a1 a2 && not array_eq a1 a2
predicate
examples
[ "int.Int", "array.Array", "export", "list.List", "list.Nth", "list.Length", "option.Option", "int.Int", "int.Abs", "int.MinMax", "int.Power", "array.Array", "array.ArrayPermut", "int.Int", "array.Array", "array.ArrayPermut", "array.ArrayExchange", "array.ArrayEq", "array.IntArray...
examples/verifythis_2021_lexicographic_permutations_2.mlw
lt
nzo(v:int) : (int,int)
function
examples
[ "int.Sum", "int.Int", "int.NumOf", "int.Power", "int.ComputerDivision", "map.Map", "map.MapExt", "array.Array", "matrix.Matrix", "map.Occ", "map.MapPermut", "int.Int", "ref.Ref", "array.Array", "array.IntArraySorted", "array.ArraySwap", "array.ArrayPermut", "array.ArrayEq", "Quic...
examples/verifythis_2021_shearsort.mlw
nzo
newz(v:int) : int
function
examples
[ "int.Sum", "int.Int", "int.NumOf", "int.Power", "int.ComputerDivision", "map.Map", "map.MapExt", "array.Array", "matrix.Matrix", "map.Occ", "map.MapPermut", "int.Int", "ref.Ref", "array.Array", "array.IntArraySorted", "array.ArraySwap", "array.ArrayPermut", "array.ArrayEq", "Quic...
examples/verifythis_2021_shearsort.mlw
newz
newo(v:int) : int
function
examples
[ "int.Sum", "int.Int", "int.NumOf", "int.Power", "int.ComputerDivision", "map.Map", "map.MapExt", "array.Array", "matrix.Matrix", "map.Occ", "map.MapPermut", "int.Int", "ref.Ref", "array.Array", "array.IntArraySorted", "array.ArraySwap", "array.ArrayPermut", "array.ArrayEq", "Quic...
examples/verifythis_2021_shearsort.mlw
newo
inversions(m: matrix int) : int
function
examples
[ "int.Int", "int.ComputerDivision", "matrix.Matrix", "map.Occ", "int.NumOf", "int.Sum" ]
examples/verifythis_2021_shearsort_modified.mlw
inversions
lt(i j k l: int) = i < k \/
predicate
examples
[ "int.Int", "int.ComputerDivision", "matrix.Matrix", "map.Occ", "int.NumOf", "int.Sum" ]
examples/verifythis_2021_shearsort_modified.mlw
lt
snake_order(m: matrix int) = let rw = m.rows in
predicate
examples
[ "int.Int", "int.ComputerDivision", "matrix.Matrix", "map.Occ", "int.NumOf", "int.Sum" ]
examples/verifythis_2021_shearsort_modified.mlw
snake_order
to_str(r: rope) : str
function
examples
[ "int.Int", "seq.Seq", "seq.FreeMonoid" ]
examples/verifythis_2024_challenge0.mlw
to_str
valid(r: rope) = match r with
predicate
examples
[ "int.Int", "seq.Seq", "seq.FreeMonoid" ]
examples/verifythis_2024_challenge0.mlw
valid
function : when all subsegments are copied,
lemma
examples
[ "int.Int", "int.EuclideanDivision", "array.Array" ]
examples/verifythis_2024_challenge1.mlw
function
identity(l: int) : array int
function
examples
[ "int.Int", "int.EuclideanDivision", "array.Array" ]
examples/verifythis_2024_challenge1.mlw
identity
not_common_prefix_if_last_char_are_different : forall a:array int, x y:int, l:int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
not_common_prefix_if_last_char_are_different
longest_common_prefix_succ : forall a:array int, x y l:int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
longest_common_prefix_succ
lcp_same_index : forall a:array int, x:int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
lcp_same_index
le_trans : forall a:array int, x y z:int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
le_trans
permut_permutation : forall a1 a2:array int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
permut_permutation
lcp_sym : forall a:array int, x y l:int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
lcp_sym
le_le_common_prefix : forall a:array int, x y z l:int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
le_le_common_prefix
le_le_longest_common_prefix : forall a:array int, x y z l m :int.
lemma
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
le_le_longest_common_prefix
range(a:array int) = Inj.range a.elts a.length
predicate
examples
[ "other", "export", "array.Array", "export", "array.Array", "LCP", "int.Int", "ref.Refint", "array.Array", "LCP", "map.MapInjection", "array.ArrayPermut", "map.Map", "int.Int", "array.Array", "LCP", "SuffixSort", "int.Int", "array.Array", "LCP", "SuffixSort", "map.Map", "m...
examples/verifythis_fm2012_LRS.mlw
range
inorder_zip : forall z [@induction]: zipper 'a, t: tree 'a.
lemma
examples
[ "export", "export", "Memory", "bintree.Tree", "bintree.Inorder", "list.List", "list.Mem", "list.Append", "list.Distinct" ]
examples/verifythis_fm2012_treedel.mlw
inorder_zip
distinct_break_append : forall l1 [@induction] l2:list 'a.
lemma
examples
[ "export", "export", "Memory", "bintree.Tree", "bintree.Inorder", "list.List", "list.Mem", "list.Append", "list.Distinct" ]
examples/verifythis_fm2012_treedel.mlw
distinct_break_append
root(t: tree loc) : loc
function
examples
[ "export", "export", "Memory", "bintree.Tree", "bintree.Inorder", "list.List", "list.Mem", "list.Append", "list.Distinct" ]
examples/verifythis_fm2012_treedel.mlw
root
inorderz(z: zipper 'a) : list 'a
function
examples
[ "export", "export", "Memory", "bintree.Tree", "bintree.Inorder", "list.List", "list.Mem", "list.Append", "list.Distinct" ]
examples/verifythis_fm2012_treedel.mlw
inorderz
Div_mod_2 : forall x:int. x >= 0 -> x >= 2 * div x 2 >= x-1
lemma
examples
[ "int.Int", "int.ComputerDivision", "int.Power", "map.Map", "array.Array", "array.ArraySum" ]
examples/verifythis_PrefixSumRec.mlw
Div_mod_2
is_power_of_2_1 : forall x:int. is_power_of_2 x -> x > 1 -> 2 * div x 2 = x
lemma
examples
[ "int.Int", "int.ComputerDivision", "int.Power", "map.Map", "array.Array", "array.ArraySum" ]
examples/verifythis_PrefixSumRec.mlw
is_power_of_2_1
go_left(left right:int) : int
function
examples
[ "int.Int", "int.ComputerDivision", "int.Power", "map.Map", "array.Array", "array.ArraySum" ]
examples/verifythis_PrefixSumRec.mlw
go_left
go_right(left right:int) : int
function
examples
[ "int.Int", "int.ComputerDivision", "int.Power", "map.Map", "array.Array", "array.ArraySum" ]
examples/verifythis_PrefixSumRec.mlw
go_right
is_power_of_2(x:int) = exists k:int. (k >= 0 /\ x = power 2 k)
predicate
examples
[ "int.Int", "int.ComputerDivision", "int.Power", "map.Map", "array.Array", "array.ArraySum" ]
examples/verifythis_PrefixSumRec.mlw
is_power_of_2
sequence(q: queue 'a) : list 'a
function
examples
[ "int.Int", "option.Option", "list.ListRich" ]
examples/vstte10_aqueue.mlw
sequence
eq_board_set : forall b: array int, pos q i: int.
lemma
examples
[ "int.Int", "array.Array", "ref.Refint", "int.Int", "ref.Refint", "seq.Seq", "mach.array.Array63", "mach.int.Int63", "mach.peano.Peano" ]
examples/vstte10_queens.mlw
eq_board_set
eq_board_sym : forall b1 b2: array int, pos: int.
lemma
examples
[ "int.Int", "array.Array", "ref.Refint", "int.Int", "ref.Refint", "seq.Seq", "mach.array.Array63", "mach.int.Int63", "mach.peano.Peano" ]
examples/vstte10_queens.mlw
eq_board_sym
eq_board_trans : forall b1 b2 b3: array int, pos: int.
lemma
examples
[ "int.Int", "array.Array", "ref.Refint", "int.Int", "ref.Refint", "seq.Seq", "mach.array.Array63", "mach.int.Int63", "mach.peano.Peano" ]
examples/vstte10_queens.mlw
eq_board_trans
eq_board_extension : forall b1 b2: array int, pos: int.
lemma
examples
[ "int.Int", "array.Array", "ref.Refint", "int.Int", "ref.Refint", "seq.Seq", "mach.array.Array63", "mach.int.Int63", "mach.peano.Peano" ]
examples/vstte10_queens.mlw
eq_board_extension
consistent_row_eq : forall b1 b2: array int, pos: int.
lemma
examples
[ "int.Int", "array.Array", "ref.Refint", "int.Int", "ref.Refint", "seq.Seq", "mach.array.Array63", "mach.int.Int63", "mach.peano.Peano" ]
examples/vstte10_queens.mlw
consistent_row_eq
solution_eq_board : forall b1 b2: array int, pos: int. length b1 = length b2 ->
lemma
examples
[ "int.Int", "array.Array", "ref.Refint", "int.Int", "ref.Refint", "seq.Seq", "mach.array.Array63", "mach.int.Int63", "mach.peano.Peano" ]
examples/vstte10_queens.mlw
solution_eq_board
no_zero(l: list int) = forall j. 0 <= j < length l -> nth j l <> Some 0
predicate
examples
[ "int.Int", "option.Option", "list.List", "list.Length", "list.Nth", "ref.Ref", "list.HdTl" ]
examples/vstte10_search_list.mlw
no_zero
path_nonneg : forall v1 v2: vertex, n: int. path v1 v2 n -> n >= 0
lemma
examples
[ "int.Int", "export", "int.Int", "Graph", "ref.Refint" ]
examples/vstte12_bfs.mlw
path_nonneg
path_inversion : forall v1 v3: vertex, n: int. n >= 0 ->
lemma
examples
[ "int.Int", "export", "int.Int", "Graph", "ref.Refint" ]
examples/vstte12_bfs.mlw
path_inversion
path_closure : forall s: fset vertex.
lemma
examples
[ "int.Int", "export", "int.Int", "Graph", "ref.Refint" ]
examples/vstte12_bfs.mlw
path_closure
subst_c_commute : forall c [@induction] ct t.
lemma
examples
[ "int.Int", "number.Parity" ]
examples/vstte12_combinators.mlw
subst_c_commute
subst_c(c ct:context) : context
function
examples
[ "int.Int", "number.Parity" ]
examples/vstte12_combinators.mlw
subst_c
ks(n: int) : term
function
examples
[ "int.Int", "number.Parity" ]
examples/vstte12_combinators.mlw
ks
is_value(t: term) = match t with
predicate
examples
[ "int.Int", "number.Parity" ]
examples/vstte12_combinators.mlw
is_value
is_context(c: context) = match c with
predicate
examples
[ "int.Int", "number.Parity" ]
examples/vstte12_combinators.mlw
is_context
rel = (-->)
predicate
examples
[ "int.Int", "number.Parity" ]
examples/vstte12_combinators.mlw
rel
irreducible(t: term) = forall t': term. not (t-->t')
predicate
examples
[ "int.Int", "number.Parity" ]
examples/vstte12_combinators.mlw
irreducible
size(b: buffer 'a) : int
function
examples
[ "int.Int", "option.Option", "list.List", "import", "import", "RingBuffer", "list.List", "int.Int", "int.Int", "import", "import", "seq.Seq", "RingBufferSeq", "int.Int" ]
examples/vstte12_ring_buffer.mlw
size
length(b: buffer 'a) : int
function
examples
[ "int.Int", "option.Option", "list.List", "import", "import", "RingBuffer", "list.List", "int.Int", "int.Int", "import", "import", "seq.Seq", "RingBufferSeq", "int.Int" ]
examples/vstte12_ring_buffer.mlw
length
size(b: buffer 'a) : int
function
examples
[ "int.Int", "option.Option", "list.List", "import", "import", "RingBuffer", "list.List", "int.Int", "int.Int", "import", "import", "seq.Seq", "RingBufferSeq", "int.Int" ]
examples/vstte12_ring_buffer.mlw
size
length(b: buffer 'a) : int
function
examples
[ "int.Int", "option.Option", "list.List", "import", "import", "RingBuffer", "list.List", "int.Int", "int.Int", "import", "import", "seq.Seq", "RingBufferSeq", "int.Int" ]
examples/vstte12_ring_buffer.mlw
length
depths_head : forall t: tree, d: int.
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
depths_head
depths_prefix : forall t: tree, d1 d2: int, s1 s2: list int.
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
depths_prefix
depths_prefix_simple : forall t: tree, d1 d2: int.
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
depths_prefix_simple
depths_unique2 : forall t1 t2: tree, d1 d2: int.
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
depths_unique2
forest_depths_append : forall f1 f2: list (int, tree).
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
forest_depths_append
g_append : forall l1 [@induction] l2: list (int, tree). g (l1 ++ l2) -> g l1
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
g_append
depths_length : forall t d. length (depths d t) >= 1
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
depths_length
forest_depths_length : forall l. length (forest_depths l) >= 0
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
forest_depths_length
g_tail : forall l1 l2: list (int, tree). g (l1 ++ l2) -> g l2
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
g_tail