| Global Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | : | _ | (613 entries) |
| Notation Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | : | _ | (6 entries) |
| Module Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (27 entries) | |
| Variable Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (13 entries) | |
| Library Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (14 entries) | |
| Constructor Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (52 entries) | |
| Lemma Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (211 entries) | |
| Axiom Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (37 entries) | |
| Inductive Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (26 entries) | |
| Section Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (6 entries) | |
| Definition Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (221 entries) |
Global Index
A
Abs [inductive, in Top.SearchTree]Abs [inductive, in Top.Redblack]
Abs [definition, in Top.Trie]
abstract [definition, in Top.Trie]
abstraction_of_bogus_tree [lemma, in Top.SearchTree]
AbsX [definition, in Top.SearchTree]
Abs_E [constructor, in Top.Redblack]
Abs_E [constructor, in Top.SearchTree]
Abs_helper [lemma, in Top.Redblack]
Abs_T [constructor, in Top.SearchTree]
Abs_T [constructor, in Top.Redblack]
Abs_three_ten [definition, in Top.Trie]
add_edge [definition, in Top.Color]
adj [definition, in Top.Color]
adj_ext [lemma, in Top.Color]
ADT [library]
ADT_SUMMARY [section, in Top.ADT]
ADT_SUMMARY.default [variable, in Top.ADT]
ADT_SUMMARY.V [variable, in Top.ADT]
B
balance [definition, in Top.Redblack]balance_relate [lemma, in Top.Redblack]
balance_SearchTree [lemma, in Top.Redblack]
balance_SearchTree [lemma, in Top.Redblack]
balance_SearchTree [lemma, in Top.Redblack]
beq_reflect [lemma, in Top.Perm]
Binom [library]
BinomQueue [module, in Top.Binom]
BinomQueue.Abs [definition, in Top.Binom]
BinomQueue.abs_perm [lemma, in Top.Binom]
BinomQueue.can_relate [lemma, in Top.Binom]
BinomQueue.carry [definition, in Top.Binom]
BinomQueue.carry_elems [lemma, in Top.Binom]
BinomQueue.carry_valid [lemma, in Top.Binom]
BinomQueue.delete_max [definition, in Top.Binom]
BinomQueue.delete_max_aux [definition, in Top.Binom]
BinomQueue.delete_max_None_relate [lemma, in Top.Binom]
BinomQueue.delete_max_Some_priq [lemma, in Top.Binom]
BinomQueue.delete_max_Some_relate [lemma, in Top.Binom]
BinomQueue.empty [definition, in Top.Binom]
BinomQueue.empty_priq [lemma, in Top.Binom]
BinomQueue.empty_relate [lemma, in Top.Binom]
BinomQueue.find_max [definition, in Top.Binom]
BinomQueue.find_max' [definition, in Top.Binom]
BinomQueue.heap_delete_max [definition, in Top.Binom]
BinomQueue.insert [definition, in Top.Binom]
BinomQueue.insert_priq [lemma, in Top.Binom]
BinomQueue.insert_relate [lemma, in Top.Binom]
BinomQueue.join [definition, in Top.Binom]
BinomQueue.join_elems [lemma, in Top.Binom]
BinomQueue.join_valid [lemma, in Top.Binom]
BinomQueue.key [definition, in Top.Binom]
BinomQueue.Leaf [constructor, in Top.Binom]
BinomQueue.merge [definition, in Top.Binom]
BinomQueue.merge_priq [lemma, in Top.Binom]
BinomQueue.merge_relate [lemma, in Top.Binom]
BinomQueue.Node [constructor, in Top.Binom]
BinomQueue.pow2heap [definition, in Top.Binom]
BinomQueue.pow2heap' [definition, in Top.Binom]
BinomQueue.priq [definition, in Top.Binom]
BinomQueue.priqueue [definition, in Top.Binom]
BinomQueue.priqueue_elems [inductive, in Top.Binom]
BinomQueue.priqueue_elems_ext [lemma, in Top.Binom]
BinomQueue.priq' [definition, in Top.Binom]
BinomQueue.smash [definition, in Top.Binom]
BinomQueue.smash_elems [lemma, in Top.Binom]
BinomQueue.smash_valid [lemma, in Top.Binom]
BinomQueue.tree [inductive, in Top.Binom]
BinomQueue.tree_can_relate [lemma, in Top.Binom]
BinomQueue.tree_elems [inductive, in Top.Binom]
BinomQueue.tree_elems_ext [lemma, in Top.Binom]
BinomQueue.tree_elems_leaf [constructor, in Top.Binom]
BinomQueue.tree_elems_node [constructor, in Top.Binom]
BinomQueue.tree_perm [lemma, in Top.Binom]
BinomQueue.unzip [definition, in Top.Binom]
Black [constructor, in Top.Redblack]
ble_reflect [lemma, in Top.Perm]
blt_reflect [lemma, in Top.Perm]
C
can_relate [lemma, in Top.SearchTree]cardinal_map [lemma, in Top.Color]
check_example_map [lemma, in Top.SearchTree]
check_too_clever [lemma, in Top.SearchTree]
color [inductive, in Top.Redblack]
color [definition, in Top.Color]
Color [library]
coloring [definition, in Top.Color]
coloring_ok [definition, in Top.Color]
colors_of [definition, in Top.Color]
color1 [definition, in Top.Color]
color_correct [lemma, in Top.Color]
combine [definition, in Top.SearchTree]
combine [definition, in Top.Redblack]
compute_with_lt_dec [lemma, in Top.Decide]
compute_with_StdLib_lt_dec [lemma, in Top.Decide]
cons_relate [lemma, in Top.ADT]
contents [definition, in Top.Multiset]
contents_in [lemma, in Top.Multiset]
contents_perm [lemma, in Top.Multiset]
contents_perm_aux [lemma, in Top.Multiset]
create_relate [lemma, in Top.ADT]
D
Decide [library]delete_contents [lemma, in Top.Multiset]
domain_example_map [definition, in Top.Color]
E
E [module, in Top.Color]E [constructor, in Top.Redblack]
E [constructor, in Top.SearchTree]
elements [definition, in Top.SearchTree]
elements [definition, in Top.Redblack]
elements' [definition, in Top.Redblack]
elements' [definition, in Top.SearchTree]
elements_property [definition, in Top.Redblack]
elements_relate [lemma, in Top.SearchTree]
elements_relate [lemma, in Top.Redblack]
elements_relate [lemma, in Top.SearchTree]
elements_relateX [lemma, in Top.SearchTree]
elements_relate_second_attempt [lemma, in Top.SearchTree]
elements_slow_elements [lemma, in Top.SearchTree]
empty [definition, in Top.Multiset]
empty [definition, in Top.Trie]
empty_is_trie [lemma, in Top.Trie]
empty_relate [lemma, in Top.Trie]
empty_tree [definition, in Top.SearchTree]
empty_tree [definition, in Top.Redblack]
empty_tree_relate [lemma, in Top.Redblack]
empty_tree_relate [lemma, in Top.SearchTree]
empty_tree_SearchTree [lemma, in Top.Redblack]
empty_tree_SearchTree [lemma, in Top.SearchTree]
eqlistA_Eeq_eq [lemma, in Top.Color]
equivlistA_example [definition, in Top.Color]
example_map [definition, in Top.Color]
example_map [definition, in Top.SearchTree]
example_SearchTree_bad [lemma, in Top.SearchTree]
example_SearchTree_good [lemma, in Top.SearchTree]
example_tree [definition, in Top.SearchTree]
expand_range_SearchTree' [lemma, in Top.Redblack]
Experiments [module, in Top.Extract]
Experiments.E [definition, in Top.Extract]
Experiments.empty_tree [definition, in Top.Extract]
Experiments.insert [definition, in Top.Extract]
Experiments.lookup [definition, in Top.Extract]
Experiments.T [definition, in Top.Extract]
Exploration1 [module, in Top.Perm]
Exploration1.bogus_subtraction [lemma, in Top.Perm]
Exploration1.butterfly [definition, in Top.Perm]
Exploration1.first_le_second [definition, in Top.Perm]
Exploration1.maybe_swap [definition, in Top.Perm]
Exploration1.maybe_swap_correct [lemma, in Top.Perm]
Exploration1.maybe_swap_idempotent [lemma, in Top.Perm]
Exploration1.maybe_swap_idempotent [lemma, in Top.Perm]
Exploration1.maybe_swap_idempotent' [lemma, in Top.Perm]
Exploration1.maybe_swap_perm [lemma, in Top.Perm]
Exploration1.maybe_swap_123 [definition, in Top.Perm]
Exploration1.maybe_swap_321 [definition, in Top.Perm]
Exploration1.not_a_permutation [definition, in Top.Perm]
Exploration1.omega_example1 [lemma, in Top.Perm]
Exploration1.omega_example1 [lemma, in Top.Perm]
Exploration1.omega_example2 [lemma, in Top.Perm]
Exploration1.permut_example [definition, in Top.Perm]
Extract [library]
F
FastEnough [module, in Top.Trie]FastEnough.collisions [definition, in Top.Trie]
FastEnough.collisions_pi [definition, in Top.Trie]
FastEnough.loop [definition, in Top.Trie]
fib [definition, in Top.ADT]
fibish [definition, in Top.ADT]
fibish_correct [lemma, in Top.ADT]
fibonacci [definition, in Top.ADT]
filter_sortE [lemma, in Top.Color]
fold_right_rev_left [lemma, in Top.Color]
forall_nodes [definition, in Top.SearchTree]
Forall_nth [lemma, in Top.Sort]
Forall_perm [lemma, in Top.Perm]
G
G [definition, in Top.Color]graph [definition, in Top.Color]
H
how_many_subgoals_remaining [definition, in Top.Redblack]I
InA_example [definition, in Top.Color]InA_map_fst_key [lemma, in Top.Color]
ins [definition, in Top.Redblack]
ins [definition, in Top.Trie]
insert [definition, in Top.Redblack]
insert [definition, in Top.SearchTree]
insert [definition, in Top.Sort]
insert [definition, in Top.Trie]
insertion_sort_correct [lemma, in Top.Multiset]
insertion_sort_correct [lemma, in Top.Sort]
insert_contents [lemma, in Top.Multiset]
insert_is_redblack [lemma, in Top.Redblack]
insert_is_trie [lemma, in Top.Trie]
insert_perm [lemma, in Top.Sort]
insert_relate [lemma, in Top.Redblack]
insert_relate [lemma, in Top.SearchTree]
insert_relate [lemma, in Top.Trie]
insert_relate' [lemma, in Top.SearchTree]
insert_SearchTree [lemma, in Top.Redblack]
insert_SearchTree [lemma, in Top.SearchTree]
insert_sorted [lemma, in Top.Sort]
insert_sorted' [lemma, in Top.Sort]
ins_is_redblack [lemma, in Top.Redblack]
ins_not_E [lemma, in Top.Redblack]
ins_not_E [lemma, in Top.Redblack]
ins_not_E [lemma, in Top.Redblack]
ins_relate [lemma, in Top.Redblack]
ins_SearchTree [lemma, in Top.Redblack]
int [axiom, in Top.Extract]
Integers [module, in Top.Trie]
Integers.add [definition, in Top.Trie]
Integers.addc [definition, in Top.Trie]
Integers.addc_correct [lemma, in Top.Trie]
Integers.add_correct [lemma, in Top.Trie]
Integers.compare [definition, in Top.Trie]
Integers.compare_correct [lemma, in Top.Trie]
Integers.comparison [inductive, in Top.Trie]
Integers.Eq [constructor, in Top.Trie]
Integers.Gt [constructor, in Top.Trie]
Integers.Lt [constructor, in Top.Trie]
Integers.positive [inductive, in Top.Trie]
Integers.positive2nat [definition, in Top.Trie]
Integers.positive2nat_pos [lemma, in Top.Trie]
Integers.print_in_binary [definition, in Top.Trie]
Integers.succ [definition, in Top.Trie]
Integers.succ_correct [lemma, in Top.Trie]
Integers.ten [definition, in Top.Trie]
Integers.xH [constructor, in Top.Trie]
Integers.xI [constructor, in Top.Trie]
Integers.xO [constructor, in Top.Trie]
Integers.Z [inductive, in Top.Trie]
Integers.Zneg [constructor, in Top.Trie]
Integers.Zpos [constructor, in Top.Trie]
Integers.Z0 [constructor, in Top.Trie]
Integers.::x_'~'_'0' [notation, in Top.Trie]
Integers.::x_'~'_'1' [notation, in Top.Trie]
IntMaps [module, in Top.Extract]
IntMaps.total_map [definition, in Top.Extract]
IntMaps.t_empty [definition, in Top.Extract]
IntMaps.t_update [definition, in Top.Extract]
IntMaps.t_update_eq [lemma, in Top.Extract]
IntMaps.t_update_neq [lemma, in Top.Extract]
IntMaps.t_update_shadow [lemma, in Top.Extract]
int2Z [axiom, in Top.Extract]
int_blt_reflect [lemma, in Top.Extract]
in_colors_of_1 [lemma, in Top.Color]
In_decidable [lemma, in Top.SearchTree]
in_perm_delete [lemma, in Top.Multiset]
in_4_pi [definition, in Top.Decide]
IsRB_b [constructor, in Top.Redblack]
IsRB_leaf [constructor, in Top.Redblack]
IsRB_r [constructor, in Top.Redblack]
is_a_sorting_algorithm [definition, in Top.Sort]
is_a_sorting_algorithm [definition, in Top.Selection]
is_a_sorting_algorithm' [definition, in Top.Multiset]
is_redblack [inductive, in Top.Redblack]
is_redblack_toblack [lemma, in Top.Redblack]
is_trie [definition, in Top.Trie]
K
key [definition, in Top.Redblack]key [definition, in Top.SearchTree]
L
L [module, in Top.ADT]Leaf [constructor, in Top.Trie]
LISTISH [module, in Top.ADT]
LISTISH.cons [axiom, in Top.ADT]
LISTISH.create [axiom, in Top.ADT]
LISTISH.list [axiom, in Top.ADT]
LISTISH.nth [axiom, in Top.ADT]
list2map [definition, in Top.SearchTree]
list2map_app_left [lemma, in Top.SearchTree]
list2map_app_right [lemma, in Top.SearchTree]
list2map_not_in_default [lemma, in Top.SearchTree]
list_delete [definition, in Top.Multiset]
list_nat_eq_dec [definition, in Top.Decide]
list_nat_in [definition, in Top.Decide]
List_Priqueue [module, in Top.Priqueue]
List_Priqueue.Abs [definition, in Top.Priqueue]
List_Priqueue.Abs' [inductive, in Top.Priqueue]
List_Priqueue.Abs_intro [constructor, in Top.Priqueue]
List_Priqueue.abs_perm [lemma, in Top.Priqueue]
List_Priqueue.can_relate [lemma, in Top.Priqueue]
List_Priqueue.delete_max [definition, in Top.Priqueue]
List_Priqueue.delete_max_None_relate [lemma, in Top.Priqueue]
List_Priqueue.delete_max_Some_priq [lemma, in Top.Priqueue]
List_Priqueue.delete_max_Some_relate [lemma, in Top.Priqueue]
List_Priqueue.empty [definition, in Top.Priqueue]
List_Priqueue.empty_priq [lemma, in Top.Priqueue]
List_Priqueue.empty_relate [lemma, in Top.Priqueue]
List_Priqueue.insert [definition, in Top.Priqueue]
List_Priqueue.insert_priq [lemma, in Top.Priqueue]
List_Priqueue.insert_relate [lemma, in Top.Priqueue]
List_Priqueue.key [definition, in Top.Priqueue]
List_Priqueue.merge [definition, in Top.Priqueue]
List_Priqueue.merge_priq [lemma, in Top.Priqueue]
List_Priqueue.merge_relate [lemma, in Top.Priqueue]
List_Priqueue.priq [definition, in Top.Priqueue]
List_Priqueue.priqueue [definition, in Top.Priqueue]
List_Priqueue.select [definition, in Top.Priqueue]
List_Priqueue.select_biggest [lemma, in Top.Priqueue]
List_Priqueue.select_biggest_aux [lemma, in Top.Priqueue]
List_Priqueue.select_perm [lemma, in Top.Priqueue]
look [definition, in Top.Trie]
lookup [definition, in Top.Redblack]
lookup [definition, in Top.SearchTree]
lookup [definition, in Top.Trie]
lookup_relate [lemma, in Top.Redblack]
lookup_relate [lemma, in Top.SearchTree]
lookup_relate [lemma, in Top.Trie]
lookup_relateX [lemma, in Top.SearchTree]
lookup_relate' [lemma, in Top.SearchTree]
look_ins_other [lemma, in Top.Trie]
look_ins_same [lemma, in Top.Trie]
look_leaf [lemma, in Top.Trie]
low_deg [definition, in Top.Color]
ltb [axiom, in Top.Extract]
ltb_lt [axiom, in Top.Extract]
lt_proper [lemma, in Top.Color]
lt_strict [lemma, in Top.Color]
L.cons [definition, in Top.ADT]
L.create [definition, in Top.ADT]
L.list [definition, in Top.ADT]
L.nth [definition, in Top.ADT]
L_Abs [inductive, in Top.ADT]
M
M [module, in Top.Color]makeBlack [definition, in Top.Redblack]
makeblack_fiddle [lemma, in Top.Redblack]
makeBlack_relate [lemma, in Top.Redblack]
MapsTable [module, in Top.ADT]
MapsTable.default [definition, in Top.ADT]
MapsTable.empty [definition, in Top.ADT]
MapsTable.gempty [lemma, in Top.ADT]
MapsTable.get [definition, in Top.ADT]
MapsTable.gso [lemma, in Top.ADT]
MapsTable.gss [lemma, in Top.ADT]
MapsTable.key [definition, in Top.ADT]
MapsTable.set [definition, in Top.ADT]
MapsTable.table [definition, in Top.ADT]
MapsTable.V [definition, in Top.ADT]
Mdomain [definition, in Top.Color]
mk_graph [definition, in Top.Color]
Mremove_cardinal_less [lemma, in Top.Color]
Mremove_elements [lemma, in Top.Color]
multiset [definition, in Top.Multiset]
Multiset [library]
multiset_delete [definition, in Top.Multiset]
N
naive_lookup_relateX [lemma, in Top.SearchTree]nat2pos [definition, in Top.Trie]
nat2pos2nat [lemma, in Top.Trie]
nat2pos_injective [lemma, in Top.Trie]
nearly_redblack [inductive, in Top.Redblack]
node [definition, in Top.Color]
Node [constructor, in Top.Trie]
nodemap [definition, in Top.Color]
nodes [definition, in Top.Color]
nodeset [definition, in Top.Color]
not_elements_relate [lemma, in Top.SearchTree]
not_naive_lookup_relateX [lemma, in Top.SearchTree]
no_selfloop [definition, in Top.Color]
nrRB_b [constructor, in Top.Redblack]
nrRB_r [constructor, in Top.Redblack]
nth_firstn [lemma, in Top.ADT]
nth_relate [lemma, in Top.ADT]
O
out_of_gas [definition, in Top.Selection]O_Abs [definition, in Top.ADT]
P
palette [definition, in Top.Color]Perm [library]
perm_contents [lemma, in Top.Multiset]
pos2nat [definition, in Top.Trie]
pos2nat2pos [lemma, in Top.Trie]
pos2nat_injective [lemma, in Top.Trie]
Preface [library]
PRIQUEUE [module, in Top.Priqueue]
Priqueue [library]
PRIQUEUE.Abs [axiom, in Top.Priqueue]
PRIQUEUE.abs_perm [axiom, in Top.Priqueue]
PRIQUEUE.can_relate [axiom, in Top.Priqueue]
PRIQUEUE.delete_max [axiom, in Top.Priqueue]
PRIQUEUE.delete_max_None_relate [axiom, in Top.Priqueue]
PRIQUEUE.delete_max_Some_priq [axiom, in Top.Priqueue]
PRIQUEUE.delete_max_Some_relate [axiom, in Top.Priqueue]
PRIQUEUE.empty [axiom, in Top.Priqueue]
PRIQUEUE.empty_priq [axiom, in Top.Priqueue]
PRIQUEUE.empty_relate [axiom, in Top.Priqueue]
PRIQUEUE.insert [axiom, in Top.Priqueue]
PRIQUEUE.insert_priq [axiom, in Top.Priqueue]
PRIQUEUE.insert_relate [axiom, in Top.Priqueue]
PRIQUEUE.key [definition, in Top.Priqueue]
PRIQUEUE.merge [axiom, in Top.Priqueue]
PRIQUEUE.merge_priq [axiom, in Top.Priqueue]
PRIQUEUE.merge_relate [axiom, in Top.Priqueue]
PRIQUEUE.priq [axiom, in Top.Priqueue]
PRIQUEUE.priqueue [axiom, in Top.Priqueue]
Proper_eq_eq [lemma, in Top.Color]
Proper_eq_key_elt [lemma, in Top.Color]
R
RatherSlow [module, in Top.Trie]RatherSlow.collisions [definition, in Top.Trie]
RatherSlow.collisions_pi [definition, in Top.Trie]
RatherSlow.empty [definition, in Top.Trie]
RatherSlow.loop [definition, in Top.Trie]
RatherSlow.total_mapz [definition, in Top.Trie]
RatherSlow.update [definition, in Top.Trie]
Red [constructor, in Top.Redblack]
Redblack [library]
reflect_example1 [definition, in Top.Perm]
reflect_example2 [definition, in Top.Perm]
remove_node [definition, in Top.Color]
repeat [definition, in Top.ADT]
repeat_step_relate [lemma, in Top.ADT]
S
S [module, in Top.Color]same_contents_iff_perm [lemma, in Top.Multiset]
same_mod_10 [definition, in Top.Color]
ScratchPad [module, in Top.Decide]
ScratchPad.greater23 [lemma, in Top.Decide]
ScratchPad.is_3_less_7 [definition, in Top.Decide]
ScratchPad.left [constructor, in Top.Decide]
ScratchPad.less37 [lemma, in Top.Decide]
ScratchPad.lt_dec [definition, in Top.Decide]
ScratchPad.lt_dec' [definition, in Top.Decide]
ScratchPad.lt_dec_equivalent [lemma, in Top.Decide]
ScratchPad.right [constructor, in Top.Decide]
ScratchPad.sumbool [inductive, in Top.Decide]
ScratchPad.t1 [definition, in Top.Decide]
ScratchPad.t2 [definition, in Top.Decide]
ScratchPad.t4 [definition, in Top.Decide]
ScratchPad.v1a [definition, in Top.Decide]
ScratchPad.v1b [definition, in Top.Decide]
ScratchPad.v2a [definition, in Top.Decide]
ScratchPad.v3 [definition, in Top.Decide]
ScratchPad.:type_scope:'{'_x_'}'_'+'_'{'_x_'}' [notation, in Top.Decide]
ScratchPad2 [module, in Top.Decide]
ScratchPad2.insert [definition, in Top.Decide]
ScratchPad2.insert_sorted [lemma, in Top.Decide]
ScratchPad2.le_dec [definition, in Top.Decide]
ScratchPad2.lt_dec [definition, in Top.Decide]
ScratchPad2.lt_dec_axiom_1 [axiom, in Top.Decide]
ScratchPad2.lt_dec_axiom_2 [axiom, in Top.Decide]
ScratchPad2.max_with_axiom [definition, in Top.Decide]
ScratchPad2.prove_with_max_axiom [lemma, in Top.Decide]
ScratchPad2.sort [definition, in Top.Decide]
ScratchPad2.sorted [inductive, in Top.Decide]
ScratchPad2.sorted_cons [constructor, in Top.Decide]
ScratchPad2.sorted_nil [constructor, in Top.Decide]
ScratchPad2.sorted_1 [constructor, in Top.Decide]
SearchTree [inductive, in Top.Redblack]
SearchTree [inductive, in Top.SearchTree]
SearchTree [library]
SearchTreeX [definition, in Top.SearchTree]
SearchTree' [inductive, in Top.Redblack]
SearchTree' [inductive, in Top.SearchTree]
SearchTree'_le [lemma, in Top.SearchTree]
SearchTree'_le [lemma, in Top.Redblack]
SearchTree2 [module, in Top.Extract]
SearchTree2.Abs [inductive, in Top.Extract]
SearchTree2.Abs_E [constructor, in Top.Extract]
SearchTree2.Abs_T [constructor, in Top.Extract]
SearchTree2.combine [definition, in Top.Extract]
SearchTree2.E [constructor, in Top.Extract]
SearchTree2.elements [definition, in Top.Extract]
SearchTree2.elements' [definition, in Top.Extract]
SearchTree2.empty_tree [definition, in Top.Extract]
SearchTree2.empty_tree_relate [lemma, in Top.Extract]
SearchTree2.insert [definition, in Top.Extract]
SearchTree2.insert_relate [lemma, in Top.Extract]
SearchTree2.key [definition, in Top.Extract]
SearchTree2.lookup [definition, in Top.Extract]
SearchTree2.lookup_relate [lemma, in Top.Extract]
SearchTree2.T [constructor, in Top.Extract]
SearchTree2.tree [inductive, in Top.Extract]
SearchTree2.TREES [section, in Top.Extract]
SearchTree2.TREES.default [variable, in Top.Extract]
SearchTree2.TREES.V [variable, in Top.Extract]
SearchTree2.unrealistically_strong_can_relate [lemma, in Top.Extract]
SectionExample1 [module, in Top.SearchTree]
SectionExample1.empty [definition, in Top.SearchTree]
SectionExample1.lookup [definition, in Top.SearchTree]
SectionExample1.lookup_empty [lemma, in Top.SearchTree]
SectionExample1.mymap [definition, in Top.SearchTree]
SectionExample2 [module, in Top.SearchTree]
SectionExample2.empty [definition, in Top.SearchTree]
SectionExample2.lookup [definition, in Top.SearchTree]
SectionExample2.lookup_empty [lemma, in Top.SearchTree]
SectionExample2.MAPS [section, in Top.SearchTree]
SectionExample2.MAPS.default [variable, in Top.SearchTree]
SectionExample2.MAPS.V [variable, in Top.SearchTree]
SectionExample2.mymap [definition, in Top.SearchTree]
select [definition, in Top.Selection]
Selection [library]
selection_sort [definition, in Top.Selection]
selection_sort_correct [definition, in Top.Selection]
selection_sort_is_correct [lemma, in Top.Selection]
selection_sort_perm [lemma, in Top.Selection]
selection_sort_sorted [lemma, in Top.Selection]
selection_sort_sorted_aux [lemma, in Top.Selection]
select_perm [lemma, in Top.Selection]
select_smallest [lemma, in Top.Selection]
select_smallest_aux [lemma, in Top.Selection]
select_terminates [lemma, in Top.Color]
selsort [definition, in Top.Selection]
selsort'_perm [lemma, in Top.Selection]
selsort_perm [lemma, in Top.Selection]
singleton [definition, in Top.Multiset]
Sin_domain [lemma, in Top.Color]
sixlist [definition, in Top.ADT]
slow_elements [definition, in Top.SearchTree]
slow_elements_range [lemma, in Top.SearchTree]
Snot_in_empty [lemma, in Top.Color]
sort [definition, in Top.Sort]
Sort [library]
sorted [inductive, in Top.Sort]
sorted [inductive, in Top.Selection]
sorted' [definition, in Top.Sort]
sorted'_sorted [lemma, in Top.Sort]
sorted_cons [constructor, in Top.Sort]
sorted_cons [constructor, in Top.Selection]
Sorted_lt_key [lemma, in Top.Color]
sorted_nil [constructor, in Top.Selection]
sorted_nil [constructor, in Top.Sort]
sorted_sorted' [lemma, in Top.Sort]
sorted_1 [constructor, in Top.Selection]
sorted_1 [constructor, in Top.Sort]
SortE_equivlistE_eqlistE [lemma, in Top.Color]
Sort1 [module, in Top.Extract]
Sort1.insert [definition, in Top.Extract]
Sort1.sort [definition, in Top.Extract]
sort_contents [lemma, in Top.Multiset]
sort_perm [lemma, in Top.Sort]
sort_pi [definition, in Top.Multiset]
sort_pi [definition, in Top.Sort]
sort_pi [definition, in Top.Selection]
sort_pi_same_contents [definition, in Top.Multiset]
sort_sorted [lemma, in Top.Sort]
sort_sorted' [lemma, in Top.Sort]
sort_specifications_equivalent [lemma, in Top.Multiset]
specialize_SortA_equivlistA_eqlistA [lemma, in Top.Color]
Sremove_cardinal_less [lemma, in Top.Color]
Sremove_elements [lemma, in Top.Color]
Sremove_elements [lemma, in Top.Color]
step [definition, in Top.ADT]
stepish [definition, in Top.ADT]
step_relate [lemma, in Top.ADT]
ST_E [constructor, in Top.SearchTree]
ST_E [constructor, in Top.Redblack]
ST_intro [constructor, in Top.SearchTree]
ST_intro [constructor, in Top.Redblack]
ST_T [constructor, in Top.Redblack]
ST_T [constructor, in Top.SearchTree]
subset_nodes [definition, in Top.Color]
subset_nodes_sub [lemma, in Top.Color]
T
T [constructor, in Top.SearchTree]T [constructor, in Top.Redblack]
TABLE [module, in Top.ADT]
TABLE.default [axiom, in Top.ADT]
TABLE.empty [axiom, in Top.ADT]
TABLE.gempty [axiom, in Top.ADT]
TABLE.get [axiom, in Top.ADT]
TABLE.gso [axiom, in Top.ADT]
TABLE.gss [axiom, in Top.ADT]
TABLE.key [definition, in Top.ADT]
TABLE.set [axiom, in Top.ADT]
TABLE.table [axiom, in Top.ADT]
TABLE.V [axiom, in Top.ADT]
three_less_seven_1 [lemma, in Top.Decide]
three_less_seven_2 [lemma, in Top.Decide]
three_ten [definition, in Top.Trie]
too_much_gas [definition, in Top.Selection]
tree [inductive, in Top.SearchTree]
tree [inductive, in Top.Redblack]
TREES [section, in Top.Redblack]
TREES [section, in Top.SearchTree]
TREES.default [variable, in Top.SearchTree]
TREES.default [variable, in Top.Redblack]
TREES.EXAMPLES [section, in Top.SearchTree]
TREES.EXAMPLES.v2 [variable, in Top.SearchTree]
TREES.EXAMPLES.v4 [variable, in Top.SearchTree]
TREES.EXAMPLES.v5 [variable, in Top.SearchTree]
TREES.V [variable, in Top.Redblack]
TREES.V [variable, in Top.SearchTree]
TreeTable [module, in Top.ADT]
TreeTable.default [definition, in Top.ADT]
TreeTable.empty [definition, in Top.ADT]
TreeTable.gempty [lemma, in Top.ADT]
TreeTable.get [definition, in Top.ADT]
TreeTable.gso [lemma, in Top.ADT]
TreeTable.gss [lemma, in Top.ADT]
TreeTable.key [definition, in Top.ADT]
TreeTable.set [definition, in Top.ADT]
TreeTable.table [definition, in Top.ADT]
TreeTable.V [definition, in Top.ADT]
TreeTable2 [module, in Top.ADT]
TreeTable2.default [definition, in Top.ADT]
TreeTable2.empty [definition, in Top.ADT]
TreeTable2.gempty [lemma, in Top.ADT]
TreeTable2.get [definition, in Top.ADT]
TreeTable2.gso [lemma, in Top.ADT]
TreeTable2.gss [lemma, in Top.ADT]
TreeTable2.key [definition, in Top.ADT]
TreeTable2.set [definition, in Top.ADT]
TreeTable2.table [definition, in Top.ADT]
TreeTable2.V [definition, in Top.ADT]
trie [inductive, in Top.Trie]
Trie [library]
trie_table [definition, in Top.Trie]
T_neq_E [lemma, in Top.Redblack]
U
undirected [definition, in Top.Color]union [definition, in Top.Multiset]
union_assoc [lemma, in Top.Multiset]
union_comm [lemma, in Top.Multiset]
unrealistically_strong_can_relate [lemma, in Top.SearchTree]
V
value [definition, in Top.Multiset]VerySlow [module, in Top.Trie]
VerySlow.collisions [definition, in Top.Trie]
VerySlow.collisions_pi [definition, in Top.Trie]
VerySlow.loop [definition, in Top.Trie]
W
WF [module, in Top.Color]WP [module, in Top.Color]
Z
Z_eqb_reflect [lemma, in Top.Extract]Z_ltb_reflect [lemma, in Top.Extract]
:
:nat_scope:x_'=?'_x [notation, in Top.Perm]:nat_scope:x_'>=?'_x [notation, in Top.Perm]
:nat_scope:x_'>?'_x [notation, in Top.Perm]
Notation Index
I
Integers.::x_'~'_'0' [in Top.Trie]Integers.::x_'~'_'1' [in Top.Trie]
S
ScratchPad.:type_scope:'{'_x_'}'_'+'_'{'_x_'}' [in Top.Decide]:
:nat_scope:x_'=?'_x [in Top.Perm]:nat_scope:x_'>=?'_x [in Top.Perm]
:nat_scope:x_'>?'_x [in Top.Perm]
Module Index
B
BinomQueue [in Top.Binom]E
E [in Top.Color]Experiments [in Top.Extract]
Exploration1 [in Top.Perm]
F
FastEnough [in Top.Trie]I
Integers [in Top.Trie]IntMaps [in Top.Extract]
L
L [in Top.ADT]LISTISH [in Top.ADT]
List_Priqueue [in Top.Priqueue]
M
M [in Top.Color]MapsTable [in Top.ADT]
P
PRIQUEUE [in Top.Priqueue]R
RatherSlow [in Top.Trie]S
S [in Top.Color]ScratchPad [in Top.Decide]
ScratchPad2 [in Top.Decide]
SearchTree2 [in Top.Extract]
SectionExample1 [in Top.SearchTree]
SectionExample2 [in Top.SearchTree]
Sort1 [in Top.Extract]
T
TABLE [in Top.ADT]TreeTable [in Top.ADT]
TreeTable2 [in Top.ADT]
V
VerySlow [in Top.Trie]W
WF [in Top.Color]WP [in Top.Color]
Variable Index
A
ADT_SUMMARY.default [in Top.ADT]ADT_SUMMARY.V [in Top.ADT]
S
SearchTree2.TREES.default [in Top.Extract]SearchTree2.TREES.V [in Top.Extract]
SectionExample2.MAPS.default [in Top.SearchTree]
SectionExample2.MAPS.V [in Top.SearchTree]
T
TREES.default [in Top.SearchTree]TREES.default [in Top.Redblack]
TREES.EXAMPLES.v2 [in Top.SearchTree]
TREES.EXAMPLES.v4 [in Top.SearchTree]
TREES.EXAMPLES.v5 [in Top.SearchTree]
TREES.V [in Top.Redblack]
TREES.V [in Top.SearchTree]
Library Index
A
ADTB
BinomC
ColorD
DecideE
ExtractM
MultisetP
PermPreface
Priqueue
R
RedblackS
SearchTreeSelection
Sort
T
TrieConstructor Index
A
Abs_E [in Top.Redblack]Abs_E [in Top.SearchTree]
Abs_T [in Top.SearchTree]
Abs_T [in Top.Redblack]
B
BinomQueue.Leaf [in Top.Binom]BinomQueue.Node [in Top.Binom]
BinomQueue.tree_elems_leaf [in Top.Binom]
BinomQueue.tree_elems_node [in Top.Binom]
Black [in Top.Redblack]
E
E [in Top.Redblack]E [in Top.SearchTree]
I
Integers.Eq [in Top.Trie]Integers.Gt [in Top.Trie]
Integers.Lt [in Top.Trie]
Integers.xH [in Top.Trie]
Integers.xI [in Top.Trie]
Integers.xO [in Top.Trie]
Integers.Zneg [in Top.Trie]
Integers.Zpos [in Top.Trie]
Integers.Z0 [in Top.Trie]
IsRB_b [in Top.Redblack]
IsRB_leaf [in Top.Redblack]
IsRB_r [in Top.Redblack]
L
Leaf [in Top.Trie]List_Priqueue.Abs_intro [in Top.Priqueue]
N
Node [in Top.Trie]nrRB_b [in Top.Redblack]
nrRB_r [in Top.Redblack]
R
Red [in Top.Redblack]S
ScratchPad.left [in Top.Decide]ScratchPad.right [in Top.Decide]
ScratchPad2.sorted_cons [in Top.Decide]
ScratchPad2.sorted_nil [in Top.Decide]
ScratchPad2.sorted_1 [in Top.Decide]
SearchTree2.Abs_E [in Top.Extract]
SearchTree2.Abs_T [in Top.Extract]
SearchTree2.E [in Top.Extract]
SearchTree2.T [in Top.Extract]
sorted_cons [in Top.Sort]
sorted_cons [in Top.Selection]
sorted_nil [in Top.Selection]
sorted_nil [in Top.Sort]
sorted_1 [in Top.Selection]
sorted_1 [in Top.Sort]
ST_E [in Top.SearchTree]
ST_E [in Top.Redblack]
ST_intro [in Top.SearchTree]
ST_intro [in Top.Redblack]
ST_T [in Top.Redblack]
ST_T [in Top.SearchTree]
T
T [in Top.SearchTree]T [in Top.Redblack]
Lemma Index
A
abstraction_of_bogus_tree [in Top.SearchTree]Abs_helper [in Top.Redblack]
adj_ext [in Top.Color]
B
balance_relate [in Top.Redblack]balance_SearchTree [in Top.Redblack]
balance_SearchTree [in Top.Redblack]
balance_SearchTree [in Top.Redblack]
beq_reflect [in Top.Perm]
BinomQueue.abs_perm [in Top.Binom]
BinomQueue.can_relate [in Top.Binom]
BinomQueue.carry_elems [in Top.Binom]
BinomQueue.carry_valid [in Top.Binom]
BinomQueue.delete_max_None_relate [in Top.Binom]
BinomQueue.delete_max_Some_priq [in Top.Binom]
BinomQueue.delete_max_Some_relate [in Top.Binom]
BinomQueue.empty_priq [in Top.Binom]
BinomQueue.empty_relate [in Top.Binom]
BinomQueue.insert_priq [in Top.Binom]
BinomQueue.insert_relate [in Top.Binom]
BinomQueue.join_elems [in Top.Binom]
BinomQueue.join_valid [in Top.Binom]
BinomQueue.merge_priq [in Top.Binom]
BinomQueue.merge_relate [in Top.Binom]
BinomQueue.priqueue_elems_ext [in Top.Binom]
BinomQueue.smash_elems [in Top.Binom]
BinomQueue.smash_valid [in Top.Binom]
BinomQueue.tree_can_relate [in Top.Binom]
BinomQueue.tree_elems_ext [in Top.Binom]
BinomQueue.tree_perm [in Top.Binom]
ble_reflect [in Top.Perm]
blt_reflect [in Top.Perm]
C
can_relate [in Top.SearchTree]cardinal_map [in Top.Color]
check_example_map [in Top.SearchTree]
check_too_clever [in Top.SearchTree]
color_correct [in Top.Color]
compute_with_lt_dec [in Top.Decide]
compute_with_StdLib_lt_dec [in Top.Decide]
cons_relate [in Top.ADT]
contents_in [in Top.Multiset]
contents_perm [in Top.Multiset]
contents_perm_aux [in Top.Multiset]
create_relate [in Top.ADT]
D
delete_contents [in Top.Multiset]E
elements_relate [in Top.SearchTree]elements_relate [in Top.Redblack]
elements_relate [in Top.SearchTree]
elements_relateX [in Top.SearchTree]
elements_relate_second_attempt [in Top.SearchTree]
elements_slow_elements [in Top.SearchTree]
empty_is_trie [in Top.Trie]
empty_relate [in Top.Trie]
empty_tree_relate [in Top.Redblack]
empty_tree_relate [in Top.SearchTree]
empty_tree_SearchTree [in Top.Redblack]
empty_tree_SearchTree [in Top.SearchTree]
eqlistA_Eeq_eq [in Top.Color]
example_SearchTree_bad [in Top.SearchTree]
example_SearchTree_good [in Top.SearchTree]
expand_range_SearchTree' [in Top.Redblack]
Exploration1.bogus_subtraction [in Top.Perm]
Exploration1.maybe_swap_correct [in Top.Perm]
Exploration1.maybe_swap_idempotent [in Top.Perm]
Exploration1.maybe_swap_idempotent [in Top.Perm]
Exploration1.maybe_swap_idempotent' [in Top.Perm]
Exploration1.maybe_swap_perm [in Top.Perm]
Exploration1.omega_example1 [in Top.Perm]
Exploration1.omega_example1 [in Top.Perm]
Exploration1.omega_example2 [in Top.Perm]
F
fibish_correct [in Top.ADT]filter_sortE [in Top.Color]
fold_right_rev_left [in Top.Color]
Forall_nth [in Top.Sort]
Forall_perm [in Top.Perm]
I
InA_map_fst_key [in Top.Color]insertion_sort_correct [in Top.Multiset]
insertion_sort_correct [in Top.Sort]
insert_contents [in Top.Multiset]
insert_is_redblack [in Top.Redblack]
insert_is_trie [in Top.Trie]
insert_perm [in Top.Sort]
insert_relate [in Top.Redblack]
insert_relate [in Top.SearchTree]
insert_relate [in Top.Trie]
insert_relate' [in Top.SearchTree]
insert_SearchTree [in Top.Redblack]
insert_SearchTree [in Top.SearchTree]
insert_sorted [in Top.Sort]
insert_sorted' [in Top.Sort]
ins_is_redblack [in Top.Redblack]
ins_not_E [in Top.Redblack]
ins_not_E [in Top.Redblack]
ins_not_E [in Top.Redblack]
ins_relate [in Top.Redblack]
ins_SearchTree [in Top.Redblack]
Integers.addc_correct [in Top.Trie]
Integers.add_correct [in Top.Trie]
Integers.compare_correct [in Top.Trie]
Integers.positive2nat_pos [in Top.Trie]
Integers.succ_correct [in Top.Trie]
IntMaps.t_update_eq [in Top.Extract]
IntMaps.t_update_neq [in Top.Extract]
IntMaps.t_update_shadow [in Top.Extract]
int_blt_reflect [in Top.Extract]
in_colors_of_1 [in Top.Color]
In_decidable [in Top.SearchTree]
in_perm_delete [in Top.Multiset]
is_redblack_toblack [in Top.Redblack]
L
list2map_app_left [in Top.SearchTree]list2map_app_right [in Top.SearchTree]
list2map_not_in_default [in Top.SearchTree]
List_Priqueue.abs_perm [in Top.Priqueue]
List_Priqueue.can_relate [in Top.Priqueue]
List_Priqueue.delete_max_None_relate [in Top.Priqueue]
List_Priqueue.delete_max_Some_priq [in Top.Priqueue]
List_Priqueue.delete_max_Some_relate [in Top.Priqueue]
List_Priqueue.empty_priq [in Top.Priqueue]
List_Priqueue.empty_relate [in Top.Priqueue]
List_Priqueue.insert_priq [in Top.Priqueue]
List_Priqueue.insert_relate [in Top.Priqueue]
List_Priqueue.merge_priq [in Top.Priqueue]
List_Priqueue.merge_relate [in Top.Priqueue]
List_Priqueue.select_biggest [in Top.Priqueue]
List_Priqueue.select_biggest_aux [in Top.Priqueue]
List_Priqueue.select_perm [in Top.Priqueue]
lookup_relate [in Top.Redblack]
lookup_relate [in Top.SearchTree]
lookup_relate [in Top.Trie]
lookup_relateX [in Top.SearchTree]
lookup_relate' [in Top.SearchTree]
look_ins_other [in Top.Trie]
look_ins_same [in Top.Trie]
look_leaf [in Top.Trie]
lt_proper [in Top.Color]
lt_strict [in Top.Color]
M
makeblack_fiddle [in Top.Redblack]makeBlack_relate [in Top.Redblack]
MapsTable.gempty [in Top.ADT]
MapsTable.gso [in Top.ADT]
MapsTable.gss [in Top.ADT]
Mremove_cardinal_less [in Top.Color]
Mremove_elements [in Top.Color]
N
naive_lookup_relateX [in Top.SearchTree]nat2pos2nat [in Top.Trie]
nat2pos_injective [in Top.Trie]
not_elements_relate [in Top.SearchTree]
not_naive_lookup_relateX [in Top.SearchTree]
nth_firstn [in Top.ADT]
nth_relate [in Top.ADT]
P
perm_contents [in Top.Multiset]pos2nat2pos [in Top.Trie]
pos2nat_injective [in Top.Trie]
Proper_eq_eq [in Top.Color]
Proper_eq_key_elt [in Top.Color]
R
repeat_step_relate [in Top.ADT]S
same_contents_iff_perm [in Top.Multiset]ScratchPad.greater23 [in Top.Decide]
ScratchPad.less37 [in Top.Decide]
ScratchPad.lt_dec_equivalent [in Top.Decide]
ScratchPad2.insert_sorted [in Top.Decide]
ScratchPad2.prove_with_max_axiom [in Top.Decide]
SearchTree'_le [in Top.SearchTree]
SearchTree'_le [in Top.Redblack]
SearchTree2.empty_tree_relate [in Top.Extract]
SearchTree2.insert_relate [in Top.Extract]
SearchTree2.lookup_relate [in Top.Extract]
SearchTree2.unrealistically_strong_can_relate [in Top.Extract]
SectionExample1.lookup_empty [in Top.SearchTree]
SectionExample2.lookup_empty [in Top.SearchTree]
selection_sort_is_correct [in Top.Selection]
selection_sort_perm [in Top.Selection]
selection_sort_sorted [in Top.Selection]
selection_sort_sorted_aux [in Top.Selection]
select_perm [in Top.Selection]
select_smallest [in Top.Selection]
select_smallest_aux [in Top.Selection]
select_terminates [in Top.Color]
selsort'_perm [in Top.Selection]
selsort_perm [in Top.Selection]
Sin_domain [in Top.Color]
slow_elements_range [in Top.SearchTree]
Snot_in_empty [in Top.Color]
sorted'_sorted [in Top.Sort]
Sorted_lt_key [in Top.Color]
sorted_sorted' [in Top.Sort]
SortE_equivlistE_eqlistE [in Top.Color]
sort_contents [in Top.Multiset]
sort_perm [in Top.Sort]
sort_sorted [in Top.Sort]
sort_sorted' [in Top.Sort]
sort_specifications_equivalent [in Top.Multiset]
specialize_SortA_equivlistA_eqlistA [in Top.Color]
Sremove_cardinal_less [in Top.Color]
Sremove_elements [in Top.Color]
Sremove_elements [in Top.Color]
step_relate [in Top.ADT]
subset_nodes_sub [in Top.Color]
T
three_less_seven_1 [in Top.Decide]three_less_seven_2 [in Top.Decide]
TreeTable.gempty [in Top.ADT]
TreeTable.gso [in Top.ADT]
TreeTable.gss [in Top.ADT]
TreeTable2.gempty [in Top.ADT]
TreeTable2.gso [in Top.ADT]
TreeTable2.gss [in Top.ADT]
T_neq_E [in Top.Redblack]
U
union_assoc [in Top.Multiset]union_comm [in Top.Multiset]
unrealistically_strong_can_relate [in Top.SearchTree]
Z
Z_eqb_reflect [in Top.Extract]Z_ltb_reflect [in Top.Extract]
Axiom Index
I
int [in Top.Extract]int2Z [in Top.Extract]
L
LISTISH.cons [in Top.ADT]LISTISH.create [in Top.ADT]
LISTISH.list [in Top.ADT]
LISTISH.nth [in Top.ADT]
ltb [in Top.Extract]
ltb_lt [in Top.Extract]
P
PRIQUEUE.Abs [in Top.Priqueue]PRIQUEUE.abs_perm [in Top.Priqueue]
PRIQUEUE.can_relate [in Top.Priqueue]
PRIQUEUE.delete_max [in Top.Priqueue]
PRIQUEUE.delete_max_None_relate [in Top.Priqueue]
PRIQUEUE.delete_max_Some_priq [in Top.Priqueue]
PRIQUEUE.delete_max_Some_relate [in Top.Priqueue]
PRIQUEUE.empty [in Top.Priqueue]
PRIQUEUE.empty_priq [in Top.Priqueue]
PRIQUEUE.empty_relate [in Top.Priqueue]
PRIQUEUE.insert [in Top.Priqueue]
PRIQUEUE.insert_priq [in Top.Priqueue]
PRIQUEUE.insert_relate [in Top.Priqueue]
PRIQUEUE.merge [in Top.Priqueue]
PRIQUEUE.merge_priq [in Top.Priqueue]
PRIQUEUE.merge_relate [in Top.Priqueue]
PRIQUEUE.priq [in Top.Priqueue]
PRIQUEUE.priqueue [in Top.Priqueue]
S
ScratchPad2.lt_dec_axiom_1 [in Top.Decide]ScratchPad2.lt_dec_axiom_2 [in Top.Decide]
T
TABLE.default [in Top.ADT]TABLE.empty [in Top.ADT]
TABLE.gempty [in Top.ADT]
TABLE.get [in Top.ADT]
TABLE.gso [in Top.ADT]
TABLE.gss [in Top.ADT]
TABLE.set [in Top.ADT]
TABLE.table [in Top.ADT]
TABLE.V [in Top.ADT]
Inductive Index
A
Abs [in Top.SearchTree]Abs [in Top.Redblack]
B
BinomQueue.priqueue_elems [in Top.Binom]BinomQueue.tree [in Top.Binom]
BinomQueue.tree_elems [in Top.Binom]
C
color [in Top.Redblack]I
Integers.comparison [in Top.Trie]Integers.positive [in Top.Trie]
Integers.Z [in Top.Trie]
is_redblack [in Top.Redblack]
L
List_Priqueue.Abs' [in Top.Priqueue]L_Abs [in Top.ADT]
N
nearly_redblack [in Top.Redblack]S
ScratchPad.sumbool [in Top.Decide]ScratchPad2.sorted [in Top.Decide]
SearchTree [in Top.Redblack]
SearchTree [in Top.SearchTree]
SearchTree' [in Top.Redblack]
SearchTree' [in Top.SearchTree]
SearchTree2.Abs [in Top.Extract]
SearchTree2.tree [in Top.Extract]
sorted [in Top.Sort]
sorted [in Top.Selection]
T
tree [in Top.SearchTree]tree [in Top.Redblack]
trie [in Top.Trie]
Section Index
A
ADT_SUMMARY [in Top.ADT]S
SearchTree2.TREES [in Top.Extract]SectionExample2.MAPS [in Top.SearchTree]
T
TREES [in Top.Redblack]TREES [in Top.SearchTree]
TREES.EXAMPLES [in Top.SearchTree]
Definition Index
A
Abs [in Top.Trie]abstract [in Top.Trie]
AbsX [in Top.SearchTree]
Abs_three_ten [in Top.Trie]
add_edge [in Top.Color]
adj [in Top.Color]
B
balance [in Top.Redblack]BinomQueue.Abs [in Top.Binom]
BinomQueue.carry [in Top.Binom]
BinomQueue.delete_max [in Top.Binom]
BinomQueue.delete_max_aux [in Top.Binom]
BinomQueue.empty [in Top.Binom]
BinomQueue.find_max [in Top.Binom]
BinomQueue.find_max' [in Top.Binom]
BinomQueue.heap_delete_max [in Top.Binom]
BinomQueue.insert [in Top.Binom]
BinomQueue.join [in Top.Binom]
BinomQueue.key [in Top.Binom]
BinomQueue.merge [in Top.Binom]
BinomQueue.pow2heap [in Top.Binom]
BinomQueue.pow2heap' [in Top.Binom]
BinomQueue.priq [in Top.Binom]
BinomQueue.priqueue [in Top.Binom]
BinomQueue.priq' [in Top.Binom]
BinomQueue.smash [in Top.Binom]
BinomQueue.unzip [in Top.Binom]
C
color [in Top.Color]coloring [in Top.Color]
coloring_ok [in Top.Color]
colors_of [in Top.Color]
color1 [in Top.Color]
combine [in Top.SearchTree]
combine [in Top.Redblack]
contents [in Top.Multiset]
D
domain_example_map [in Top.Color]E
elements [in Top.SearchTree]elements [in Top.Redblack]
elements' [in Top.Redblack]
elements' [in Top.SearchTree]
elements_property [in Top.Redblack]
empty [in Top.Multiset]
empty [in Top.Trie]
empty_tree [in Top.SearchTree]
empty_tree [in Top.Redblack]
equivlistA_example [in Top.Color]
example_map [in Top.Color]
example_map [in Top.SearchTree]
example_tree [in Top.SearchTree]
Experiments.E [in Top.Extract]
Experiments.empty_tree [in Top.Extract]
Experiments.insert [in Top.Extract]
Experiments.lookup [in Top.Extract]
Experiments.T [in Top.Extract]
Exploration1.butterfly [in Top.Perm]
Exploration1.first_le_second [in Top.Perm]
Exploration1.maybe_swap [in Top.Perm]
Exploration1.maybe_swap_123 [in Top.Perm]
Exploration1.maybe_swap_321 [in Top.Perm]
Exploration1.not_a_permutation [in Top.Perm]
Exploration1.permut_example [in Top.Perm]
F
FastEnough.collisions [in Top.Trie]FastEnough.collisions_pi [in Top.Trie]
FastEnough.loop [in Top.Trie]
fib [in Top.ADT]
fibish [in Top.ADT]
fibonacci [in Top.ADT]
forall_nodes [in Top.SearchTree]
G
G [in Top.Color]graph [in Top.Color]
H
how_many_subgoals_remaining [in Top.Redblack]I
InA_example [in Top.Color]ins [in Top.Redblack]
ins [in Top.Trie]
insert [in Top.Redblack]
insert [in Top.SearchTree]
insert [in Top.Sort]
insert [in Top.Trie]
Integers.add [in Top.Trie]
Integers.addc [in Top.Trie]
Integers.compare [in Top.Trie]
Integers.positive2nat [in Top.Trie]
Integers.print_in_binary [in Top.Trie]
Integers.succ [in Top.Trie]
Integers.ten [in Top.Trie]
IntMaps.total_map [in Top.Extract]
IntMaps.t_empty [in Top.Extract]
IntMaps.t_update [in Top.Extract]
in_4_pi [in Top.Decide]
is_a_sorting_algorithm [in Top.Sort]
is_a_sorting_algorithm [in Top.Selection]
is_a_sorting_algorithm' [in Top.Multiset]
is_trie [in Top.Trie]
K
key [in Top.Redblack]key [in Top.SearchTree]
L
list2map [in Top.SearchTree]list_delete [in Top.Multiset]
list_nat_eq_dec [in Top.Decide]
list_nat_in [in Top.Decide]
List_Priqueue.Abs [in Top.Priqueue]
List_Priqueue.delete_max [in Top.Priqueue]
List_Priqueue.empty [in Top.Priqueue]
List_Priqueue.insert [in Top.Priqueue]
List_Priqueue.key [in Top.Priqueue]
List_Priqueue.merge [in Top.Priqueue]
List_Priqueue.priq [in Top.Priqueue]
List_Priqueue.priqueue [in Top.Priqueue]
List_Priqueue.select [in Top.Priqueue]
look [in Top.Trie]
lookup [in Top.Redblack]
lookup [in Top.SearchTree]
lookup [in Top.Trie]
low_deg [in Top.Color]
L.cons [in Top.ADT]
L.create [in Top.ADT]
L.list [in Top.ADT]
L.nth [in Top.ADT]
M
makeBlack [in Top.Redblack]MapsTable.default [in Top.ADT]
MapsTable.empty [in Top.ADT]
MapsTable.get [in Top.ADT]
MapsTable.key [in Top.ADT]
MapsTable.set [in Top.ADT]
MapsTable.table [in Top.ADT]
MapsTable.V [in Top.ADT]
Mdomain [in Top.Color]
mk_graph [in Top.Color]
multiset [in Top.Multiset]
multiset_delete [in Top.Multiset]
N
nat2pos [in Top.Trie]node [in Top.Color]
nodemap [in Top.Color]
nodes [in Top.Color]
nodeset [in Top.Color]
no_selfloop [in Top.Color]
O
out_of_gas [in Top.Selection]O_Abs [in Top.ADT]
P
palette [in Top.Color]pos2nat [in Top.Trie]
PRIQUEUE.key [in Top.Priqueue]
R
RatherSlow.collisions [in Top.Trie]RatherSlow.collisions_pi [in Top.Trie]
RatherSlow.empty [in Top.Trie]
RatherSlow.loop [in Top.Trie]
RatherSlow.total_mapz [in Top.Trie]
RatherSlow.update [in Top.Trie]
reflect_example1 [in Top.Perm]
reflect_example2 [in Top.Perm]
remove_node [in Top.Color]
repeat [in Top.ADT]
S
same_mod_10 [in Top.Color]ScratchPad.is_3_less_7 [in Top.Decide]
ScratchPad.lt_dec [in Top.Decide]
ScratchPad.lt_dec' [in Top.Decide]
ScratchPad.t1 [in Top.Decide]
ScratchPad.t2 [in Top.Decide]
ScratchPad.t4 [in Top.Decide]
ScratchPad.v1a [in Top.Decide]
ScratchPad.v1b [in Top.Decide]
ScratchPad.v2a [in Top.Decide]
ScratchPad.v3 [in Top.Decide]
ScratchPad2.insert [in Top.Decide]
ScratchPad2.le_dec [in Top.Decide]
ScratchPad2.lt_dec [in Top.Decide]
ScratchPad2.max_with_axiom [in Top.Decide]
ScratchPad2.sort [in Top.Decide]
SearchTreeX [in Top.SearchTree]
SearchTree2.combine [in Top.Extract]
SearchTree2.elements [in Top.Extract]
SearchTree2.elements' [in Top.Extract]
SearchTree2.empty_tree [in Top.Extract]
SearchTree2.insert [in Top.Extract]
SearchTree2.key [in Top.Extract]
SearchTree2.lookup [in Top.Extract]
SectionExample1.empty [in Top.SearchTree]
SectionExample1.lookup [in Top.SearchTree]
SectionExample1.mymap [in Top.SearchTree]
SectionExample2.empty [in Top.SearchTree]
SectionExample2.lookup [in Top.SearchTree]
SectionExample2.mymap [in Top.SearchTree]
select [in Top.Selection]
selection_sort [in Top.Selection]
selection_sort_correct [in Top.Selection]
selsort [in Top.Selection]
singleton [in Top.Multiset]
sixlist [in Top.ADT]
slow_elements [in Top.SearchTree]
sort [in Top.Sort]
sorted' [in Top.Sort]
Sort1.insert [in Top.Extract]
Sort1.sort [in Top.Extract]
sort_pi [in Top.Multiset]
sort_pi [in Top.Sort]
sort_pi [in Top.Selection]
sort_pi_same_contents [in Top.Multiset]
step [in Top.ADT]
stepish [in Top.ADT]
subset_nodes [in Top.Color]
T
TABLE.key [in Top.ADT]three_ten [in Top.Trie]
too_much_gas [in Top.Selection]
TreeTable.default [in Top.ADT]
TreeTable.empty [in Top.ADT]
TreeTable.get [in Top.ADT]
TreeTable.key [in Top.ADT]
TreeTable.set [in Top.ADT]
TreeTable.table [in Top.ADT]
TreeTable.V [in Top.ADT]
TreeTable2.default [in Top.ADT]
TreeTable2.empty [in Top.ADT]
TreeTable2.get [in Top.ADT]
TreeTable2.key [in Top.ADT]
TreeTable2.set [in Top.ADT]
TreeTable2.table [in Top.ADT]
TreeTable2.V [in Top.ADT]
trie_table [in Top.Trie]
U
undirected [in Top.Color]union [in Top.Multiset]
V
value [in Top.Multiset]VerySlow.collisions [in Top.Trie]
VerySlow.collisions_pi [in Top.Trie]
VerySlow.loop [in Top.Trie]
| Global Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | : | _ | (613 entries) |
| Notation Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | : | _ | (6 entries) |
| Module Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (27 entries) | |
| Variable Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (13 entries) | |
| Library Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (14 entries) | |
| Constructor Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (52 entries) | |
| Lemma Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (211 entries) | |
| Axiom Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (37 entries) | |
| Inductive Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (26 entries) | |
| Section Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (6 entries) | |
| Definition Index | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z | _ | (221 entries) |