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
permutation(s: mapii) = solution s 0
predicate
examples
[ "int.Int", "option.Option", "int.Int", "map.Map", "map.Map", "map.Const", "int.Int", "map.Map", "int.Int", "int.MinMax", "ref.Ref", "Bitset", "map.Map", "option.Option", "HashTable" ]
examples/max_matrix.mlw
permutation
pre(k: key) = let (i, c) = k in
predicate
examples
[ "int.Int", "option.Option", "int.Int", "map.Map", "map.Map", "map.Const", "int.Int", "map.Map", "int.Int", "int.MinMax", "ref.Ref", "Bitset", "map.Map", "option.Option", "HashTable" ]
examples/max_matrix.mlw
pre
inv(t: table) = forall k: key, v: value. H.([]) t k = Some v -> post k v
predicate
examples
[ "int.Int", "option.Option", "int.Int", "map.Map", "map.Map", "map.Const", "int.Int", "map.Map", "int.Int", "int.MinMax", "ref.Ref", "Bitset", "map.Map", "option.Option", "HashTable" ]
examples/max_matrix.mlw
inv
spec(x: int) : int
function
examples
[ "int.Int", "ref.Ref", "int.Iter", "a", "int.Int", "ref.Ref", "int.Int", "mach.int.Int63", "mach.peano.Peano", "mach.int.Refint63", "int.Iter" ]
examples/mccarthy.mlw
spec
spec(x: int) : int
function
examples
[ "int.Int", "ref.Ref", "int.Iter", "a", "int.Int", "ref.Ref", "int.Int", "mach.int.Int63", "mach.peano.Peano", "mach.int.Refint63", "int.Iter" ]
examples/mccarthy.mlw
spec
spec(x: int) : int
function
examples
[ "int.Int", "ref.Ref", "int.Iter", "a", "int.Int", "ref.Ref", "int.Int", "mach.int.Int63", "mach.peano.Peano", "mach.int.Refint63", "int.Iter" ]
examples/mccarthy.mlw
spec
spec(x: int) : int
function
examples
[ "int.Int", "ref.Ref", "int.Iter", "int.Int", "mach.int.Int63", "mach.peano.Peano", "mach.int.Refint63", "int.Iter" ]
examples/mccarthy_vc_sp.mlw
spec
spec(x: int) : int
function
examples
[ "int.Int", "ref.Ref", "int.Iter", "int.Int", "mach.int.Int63", "mach.peano.Peano", "mach.int.Refint63", "int.Iter" ]
examples/mccarthy_vc_sp.mlw
spec
rel = le, axiom .
predicate
examples
[ "export", "export", "some", "export", "export", "map.Occ", "export", "mach.int.Int", "mach.int.Int", "int.MinMax", "mach.int.Int", "int.MinMax" ]
examples/mergesort_array.mlw
rel
le = le, axiom .
predicate
examples
[ "export", "export", "some", "export", "export", "map.Occ", "export", "mach.int.Int", "mach.int.Int", "int.MinMax", "mach.int.Int", "int.MinMax" ]
examples/mergesort_array.mlw
le
sorted_reverse_cons : forall acc x1. sorted (reverse acc) ->
lemma
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
sorted_reverse_cons
sorted_reverse_cons : forall acc x1. sorted (reverse acc) ->
lemma
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
sorted_reverse_cons
sorted_rev_append : forall acc l: list elt.
lemma
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
sorted_rev_append
sorted_reverse_mem : forall x l. sorted (reverse (Cons x l)) -> forall y. mem y l -> le y x
lemma
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
sorted_reverse_mem
sorted_reverse_cons2 : forall x l. sorted (reverse (Cons x l)) -> sorted (reverse l)
lemma
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
sorted_reverse_cons2
permut_prefix : forall l: list elt. permut (prefix (length l) l) l
lemma
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
permut_prefix
rel = le, axiom .
predicate
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
rel
le = le, goal Transitive.Trans
predicate
examples
[ "export", "export", "export", "export", "export", "list.Mem", "list.Reverse", "list.RevAppend", "list.Mem", "list.Reverse", "list.RevAppend", "mach.int.Int" ]
examples/mergesort_list.mlw
le
rel = le, axiom .
predicate
examples
[ "int.Int", "seq.Seq", "seq.Mem", "seq.FreeMonoid", "seq.Occ", "seq.Permut", "queue.Queue" ]
examples/mergesort_queue.mlw
rel
le = le, goal .
predicate
examples
[ "int.Int", "seq.Seq", "seq.Mem", "seq.FreeMonoid", "seq.Occ", "seq.Permut", "queue.Queue" ]
examples/mergesort_queue.mlw
le
placed(a: array int) : int -> bool
function
examples
[ "int.Int", "map.Map", "array.Array", "ref.Refint", "pigeon.Pigeonhole", "int.Int", "int.NumOf", "array.Array", "array.ArraySwap", "ref.Refint", "int.Int", "map.Map", "array.Array", "ref.Refint", "pigeon.Pigeonhole", "int.Int", "map.Map", "array.Array", "ref.Refint", "pigeon.Pig...
examples/mex.mlw
placed
f(n: int) : int
function
examples
[ "int.Int" ]
examples/mutual_recursion.mlw
f
m(n: int) : int
function
examples
[ "int.Int" ]
examples/mutual_recursion.mlw
m
nist(n:int) : int
function
examples
[ "int.Int", "ref.Ref", "induction" ]
examples/nistonacci.mlw
nist
f(k:int) : int
function
examples
[ "int.Int", "ref.Refint", "array.Array" ]
examples/optimal_replay.mlw
f
distance(d i: int) = path d i /\ forall d': int. path d' i -> d <= d'
predicate
examples
[ "int.Int", "ref.Refint", "array.Array" ]
examples/optimal_replay.mlw
distance
le_root_trans : forall x y h. le x y -> le_root y h -> le_root x h
lemma
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
le_root_trans
le_roots_trans : forall x y l. le x y -> le_roots y l -> le_roots x l
lemma
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
le_roots_trans
size_heap(h: raw_heap) : int
function
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
size_heap
size(hh: heap) : int
function
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
size
minimum_heap(hh: heap) : elt
function
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
minimum_heap
rel = le, axiom .
predicate
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
rel
rel = le, axiom .
predicate
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
rel
heap(h: raw_heap) = match h with
predicate
examples
[ "int.Int", "list.List", "HeapType", "int.Int", "list.List", "HeapType", "int.Int", "list.List", "int.Int", "export", "export", "export", "list.List", "list.Length", "PairingHeap", "Size" ]
examples/pairing_heap.mlw
heap
size_empty : forall h.
lemma
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
size_empty
le_root_trans : forall x y h. le x y -> le_root y h -> le_root x h
lemma
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
le_root_trans
le_root_tree_trans : forall x y t. le x y -> le_root_tree y t -> le_root_tree x t
lemma
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
le_root_tree_trans
root_is_minimum : forall h.
lemma
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
root_is_minimum
size(h: heap) : int
function
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
size
minimum(h: heap) : elt
function
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
minimum
rel = le, axiom .
predicate
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
rel
rel = le, axiom .
predicate
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
rel
heap_tree(t: tree elt) = match t with
predicate
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
heap_tree
heap(h: heap) = match h with
predicate
examples
[ "int.Int", "bintree.Tree", "HeapType", "int.Int", "bintree.Tree", "bintree.Size", "HeapType", "int.Int", "bintree.Tree", "bintree.Occ", "int.Int", "bintree.Tree", "bintree.Occ", "bintree.Size", "HeapType", "Size", "Occ" ]
examples/pairing_heap_bin.mlw
heap
pigeon_hole2 : forall n m:int, f: int -> int.
lemma
examples
[ "int.Int", "int.Int", "list.List", "list.RevAppend", "int.Int", "map.Map", "map.Const", "ref.Ref", "list.List", "list.Length", "list.NthNoOpt", "PigeonHole", "int.Int", "PatienceAbstract", "list.List", "list.Length", "list.NthNoOpt", "map.Map", "list.RevAppend", "ref.Ref", "P...
examples/patience.mlw
pigeon_hole2
inv(s:state) = 0 <= s.num_stacks <= s.num_elts
predicate
examples
[ "int.Int", "int.Int", "list.List", "list.RevAppend", "int.Int", "map.Map", "map.Const", "ref.Ref", "list.List", "list.Length", "list.NthNoOpt", "PigeonHole", "int.Int", "PatienceAbstract", "list.List", "list.Length", "list.NthNoOpt", "map.Map", "list.RevAppend", "ref.Ref", "P...
examples/patience.mlw
inv
Power_even : forall x, n. n >= 0 -> mod n 2 = 0 ->
lemma
examples
[ "int.Int", "int.Power", "int.ComputerDivision", "ref.Ref" ]
examples/power.mlw
Power_even
num_exist : forall h x. numocc' h.a x > 0 ->
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
num_exist
sub_occ_1 : forall a1 a2 : V.t elt, i : int63, x : elt.
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
sub_occ_1
sub_occ_2 : forall a1 a2 i.
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
sub_occ_2
sub_occ_3 : forall a1 a2 i.
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
sub_occ_3
pop_occ_1 : forall a1 a2 x.
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
pop_occ_1
pop_occ_2 : forall a1 a2.
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
pop_occ_2
pop_order : forall a1 a2. pop a1 a2 -> heap_order a1 -> heap_order a2
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
pop_order
same_occ : forall b: bag elt, x a.
lemma
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
same_occ
cmp : t -> t -> int63
function
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
cmp
minimum(h: heap) : elt
function
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
minimum
is_pre_order(cmp: 'a -> 'a -> int63) = (forall x. cmp x x = 0) /\
predicate
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
is_pre_order
le(x y: elt) = X.cmp x y <= 0
predicate
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
le
heap_order(a : V.t elt) = forall i.
predicate
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
heap_order
pop(a1 a2: V.t elt) = length a2.view = length a1.view - 1 /\
predicate
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
pop
push(a1 a2 : V.t elt ) = length a2.view = length a1.view + 1 /\
predicate
examples
[ "import", "int.Int", "int.ComputerDivision", "int.MinMax", "seq.Seq", "mach.int.MinMax63", "mach.int.Int63", "mach.int.Refint63", "option.Option", "import", "ref.Ref", "seq.Seq", "ocaml.Sys", "ocaml.Pervasives", "int.Int", "int.ComputerDivision", "int.Div2", "int.NumOf", "bag.Bag...
examples/pqueue.mlw
push
cons(x: 'a) : (f: (list 'a, list 'a) -> (list 'a, list 'a))
function
examples
[ "list.List", "list.Mem" ]
examples/proper_cuts.mlw
cons
injective(f: 'a -> 'b) = forall x x'. x <> x' -> f x <> f x'
predicate
examples
[ "list.List", "list.Mem" ]
examples/proper_cuts.mlw
injective
partial_solution_eq_prefix : forall u t: solution, k: int.
lemma
examples
[ "int.Int", "export", "S", "ref.Refint", "int.Int", "export", "int.Int", "S", "ref.Refint", "Solution" ]
examples/queens.mlw
partial_solution_eq_prefix
no_duplicate : forall s: solutions, a b: int. sorted s a b ->
lemma
examples
[ "int.Int", "export", "S", "ref.Refint", "int.Int", "export", "int.Int", "S", "ref.Refint", "Solution" ]
examples/queens.mlw
no_duplicate
eq_sol(t u: solution) = eq_prefix t u n
predicate
examples
[ "int.Int", "export", "S", "ref.Refint", "int.Int", "export", "int.Int", "S", "ref.Refint", "Solution" ]
examples/queens.mlw
eq_sol
solution(s: solution) = partial_solution n s
predicate
examples
[ "int.Int", "export", "S", "ref.Refint", "int.Int", "export", "int.Int", "S", "ref.Refint", "Solution" ]
examples/queens.mlw
solution
lt_sol(s1 s2: solution) = exists i: int. 0 <= i < n /\ eq_prefix s1 s2 i /\ s1[i] < s2[i]
predicate
examples
[ "int.Int", "export", "S", "ref.Refint", "int.Int", "export", "int.Int", "S", "ref.Refint", "Solution" ]
examples/queens.mlw
lt_sol
partial_solution_eq_prefix : forall u t: solution, k: int.
lemma
examples
[ "int.Int", "export", "int.Int", "export", "int.Int", "S", "ref.Ref", "bv.BV32", "int.Int", "S", "bv.BV32", "BitsSpec", "ref.Ref", "Solution", "int.Int" ]
examples/queens_bv.mlw
partial_solution_eq_prefix
no_duplicate : forall s: solutions, a b: int. sorted s a b ->
lemma
examples
[ "int.Int", "export", "int.Int", "export", "int.Int", "S", "ref.Ref", "bv.BV32", "int.Int", "S", "bv.BV32", "BitsSpec", "ref.Ref", "Solution", "int.Int" ]
examples/queens_bv.mlw
no_duplicate
succ(fset int) : fset int
function
examples
[ "int.Int", "export", "int.Int", "export", "int.Int", "S", "ref.Ref", "bv.BV32", "int.Int", "S", "bv.BV32", "BitsSpec", "ref.Ref", "Solution", "int.Int" ]
examples/queens_bv.mlw
succ
pred(fset int) : fset int
function
examples
[ "int.Int", "export", "int.Int", "export", "int.Int", "S", "ref.Ref", "bv.BV32", "int.Int", "S", "bv.BV32", "BitsSpec", "ref.Ref", "Solution", "int.Int" ]
examples/queens_bv.mlw
pred
eq_sol(t u: solution) = eq_prefix t u n
predicate
examples
[ "int.Int", "export", "int.Int", "export", "int.Int", "S", "ref.Ref", "bv.BV32", "int.Int", "S", "bv.BV32", "BitsSpec", "ref.Ref", "Solution", "int.Int" ]
examples/queens_bv.mlw
eq_sol
solution(s: solution) = partial_solution n s
predicate
examples
[ "int.Int", "export", "int.Int", "export", "int.Int", "S", "ref.Ref", "bv.BV32", "int.Int", "S", "bv.BV32", "BitsSpec", "ref.Ref", "Solution", "int.Int" ]
examples/queens_bv.mlw
solution
lt_sol(s1 s2: solution) = exists i: int. 0 <= i < n /\ eq_prefix s1 s2 i /\ s1[i] < s2[i]
predicate
examples
[ "int.Int", "export", "int.Int", "export", "int.Int", "S", "ref.Ref", "bv.BV32", "int.Int", "S", "bv.BV32", "BitsSpec", "ref.Ref", "Solution", "int.Int" ]
examples/queens_bv.mlw
lt_sol
cons_flatten : forall x y :'a,s:seq ('a,'a).
lemma
examples
[ "int.Int", "int.ComputerDivision", "list.List", "list.Length", "list.Nth", "option.Option", "int.Int", "list.List", "list.Length", "option.Option", "list.Nth", "RandomAccessList", "int.Int", "int.ComputerDivision", "seq.Seq" ]
examples/random_access_list.mlw
cons_flatten
elements(l: ral 'a) : list 'a
function
examples
[ "int.Int", "int.ComputerDivision", "list.List", "list.Length", "list.Nth", "option.Option", "int.Int", "list.List", "list.Length", "option.Option", "list.Nth", "RandomAccessList", "int.Int", "int.ComputerDivision", "seq.Seq" ]
examples/random_access_list.mlw
elements
elements(l: ral 'a) : seq 'a
function
examples
[ "int.Int", "int.ComputerDivision", "list.List", "list.Length", "list.Nth", "option.Option", "int.Int", "list.List", "list.Length", "option.Option", "list.Nth", "RandomAccessList", "int.Int", "int.ComputerDivision", "seq.Seq" ]
examples/random_access_list.mlw
elements
f(y: 'a) : 'a -> 'a
function
examples
[ "int.Int", "int.ComputerDivision", "list.List", "list.Length", "list.Nth", "option.Option", "int.Int", "list.List", "list.Length", "option.Option", "list.Nth", "RandomAccessList", "int.Int", "int.ComputerDivision", "seq.Seq" ]
examples/random_access_list.mlw
f
measure_nonneg : forall e. measure e >= 0
lemma
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
measure_nonneg
to_wp(pst: post) : trans
function
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
to_wp
rcompose : ('a -> 'b) -> ('b -> 'c) -> 'a -> 'c
function
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
rcompose
exec_closure(i: instr) : state -> state
function
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
exec_closure
id : 'a -> 'a
function
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
id
n(e: expr) : int
function
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
n
measure(e: expr) : int
function
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
measure
hcode_ok(hc: hcode) = forall s. hc.post s (exec_list hc.hcode s)
predicate
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
hcode_ok
wcode_ok(wc: wcode) = forall q s.
predicate
examples
[ "int.Int", "list.List", "list.Append", "list.List", "list.Append", "Spec", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "list.List", "list.Append", "Spec", "DWP", "int.Int", "int.MinMax", "list.List", "list.Append", "Spec", "DWP" ]
examples/register_allocation.mlw
wcode_ok
labels_Leaf : forall x y : 'a. mem x (labels (Leaf y)) <-> x=y
lemma
examples
[ "list.List", "list.Mem", "list.Append", "list.Distinct", "int.Int", "ref.Ref" ]
examples/relabel.mlw
labels_Leaf
labels_Node : forall x : 'a, l r : tree 'a.
lemma
examples
[ "list.List", "list.Mem", "list.Append", "list.Distinct", "int.Int", "ref.Ref" ]
examples/relabel.mlw
labels_Node
labels(t : tree 'a) : list 'a
function
examples
[ "list.List", "list.Mem", "list.Append", "list.Distinct", "int.Int", "ref.Ref" ]
examples/relabel.mlw
labels
inversion_mem_star_gen : forall c w r w' r'.
lemma
examples
[ "seq.Seq", "int.Int", "int.Int", "mach.int.Int63", "seq.Seq" ]
examples/residual.mlw
inversion_mem_star_gen
inversion_mem_star : forall c w r. mem (cons c w) (Star r) ->
lemma
examples
[ "seq.Seq", "int.Int", "int.Int", "mach.int.Int63", "seq.Seq" ]
examples/residual.mlw
inversion_mem_star
app_assoc : forall s1 s2 s3: char_string. app s1 (app s2 s3) == app (app s1 s2) s3
lemma
examples
[ "int.Int", "int.Int", "import", "int.Int", "import", "of", "String", "import", "int.Int", "int.Fibonacci", "int.MinMax", "array.Array", "ref.Ref" ]
examples/ropes.mlw
app_assoc
rope_length_is_string_length : forall r: rope. inv r -> S.length (string r) = length r
lemma
examples
[ "int.Int", "int.Int", "import", "int.Int", "import", "of", "String", "import", "int.Int", "int.Fibonacci", "int.MinMax", "array.Array", "ref.Ref" ]
examples/ropes.mlw
rope_length_is_string_length
string_of_array_frame : forall q: array rope, l u: int. 0 <= l <= u <= Array.length q ->
lemma
examples
[ "int.Int", "int.Int", "import", "int.Int", "import", "of", "String", "import", "int.Int", "int.Fibonacci", "int.MinMax", "array.Array", "ref.Ref" ]
examples/ropes.mlw
string_of_array_frame
length(r: rope) : int
function
examples
[ "int.Int", "int.Int", "import", "int.Int", "import", "of", "String", "import", "int.Int", "int.Fibonacci", "int.MinMax", "array.Array", "ref.Ref" ]
examples/ropes.mlw
length
string(r: rope) : char_string
function
examples
[ "int.Int", "int.Int", "import", "int.Int", "import", "of", "String", "import", "int.Int", "int.Fibonacci", "int.MinMax", "array.Array", "ref.Ref" ]
examples/ropes.mlw
string
string_of_queue(q: array rope) : char_string
function
examples
[ "int.Int", "int.Int", "import", "int.Int", "import", "of", "String", "import", "int.Int", "int.Fibonacci", "int.MinMax", "array.Array", "ref.Ref" ]
examples/ropes.mlw
string_of_queue