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)
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)
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)
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 [definition, in Trie]
Abs [inductive, in SearchTree]
Abs [inductive, in Redblack]
abstract [definition, in Trie]
abstraction_of_bogus_tree [lemma, in SearchTree]
AbsX [definition, in SearchTree]
Abs_E [constructor, in Redblack]
Abs_E [constructor, in SearchTree]
Abs_helper [lemma, in Redblack]
Abs_T [constructor, in SearchTree]
Abs_T [constructor, in Redblack]
Abs_three_ten [definition, in Trie]
add_edge [definition, in Color]
adj [definition, in Color]
adj_ext [lemma, in Color]
ADT [library]
ADT_SUMMARY [section, in ADT]
ADT_SUMMARY.default [variable, in ADT]
ADT_SUMMARY.V [variable, in ADT]


B

balance [definition, in Redblack]
balance_relate [lemma, in Redblack]
balance_SearchTree [lemma, in Redblack]
balance_SearchTree [lemma, in Redblack]
balance_SearchTree [lemma, in Redblack]
beq_reflect [lemma, in Perm]
Binom [library]
BinomQueue [module, in Binom]
BinomQueue.Abs [definition, in Binom]
BinomQueue.abs_perm [lemma, in Binom]
BinomQueue.can_relate [lemma, in Binom]
BinomQueue.carry [definition, in Binom]
BinomQueue.carry_elems [lemma, in Binom]
BinomQueue.carry_valid [lemma, in Binom]
BinomQueue.delete_max [definition, in Binom]
BinomQueue.delete_max_aux [definition, in Binom]
BinomQueue.delete_max_None_relate [lemma, in Binom]
BinomQueue.delete_max_Some_priq [lemma, in Binom]
BinomQueue.delete_max_Some_relate [lemma, in Binom]
BinomQueue.empty [definition, in Binom]
BinomQueue.empty_priq [lemma, in Binom]
BinomQueue.empty_relate [lemma, in Binom]
BinomQueue.find_max [definition, in Binom]
BinomQueue.find_max' [definition, in Binom]
BinomQueue.heap_delete_max [definition, in Binom]
BinomQueue.insert [definition, in Binom]
BinomQueue.insert_priq [lemma, in Binom]
BinomQueue.insert_relate [lemma, in Binom]
BinomQueue.join [definition, in Binom]
BinomQueue.join_elems [lemma, in Binom]
BinomQueue.join_valid [lemma, in Binom]
BinomQueue.key [definition, in Binom]
BinomQueue.Leaf [constructor, in Binom]
BinomQueue.merge [definition, in Binom]
BinomQueue.merge_priq [lemma, in Binom]
BinomQueue.merge_relate [lemma, in Binom]
BinomQueue.Node [constructor, in Binom]
BinomQueue.pow2heap [definition, in Binom]
BinomQueue.pow2heap' [definition, in Binom]
BinomQueue.priq [definition, in Binom]
BinomQueue.priqueue [definition, in Binom]
BinomQueue.priqueue_elems [inductive, in Binom]
BinomQueue.priqueue_elems_ext [lemma, in Binom]
BinomQueue.priq' [definition, in Binom]
BinomQueue.smash [definition, in Binom]
BinomQueue.smash_elems [lemma, in Binom]
BinomQueue.smash_valid [lemma, in Binom]
BinomQueue.tree [inductive, in Binom]
BinomQueue.tree_can_relate [lemma, in Binom]
BinomQueue.tree_elems [inductive, in Binom]
BinomQueue.tree_elems_ext [lemma, in Binom]
BinomQueue.tree_elems_leaf [constructor, in Binom]
BinomQueue.tree_elems_node [constructor, in Binom]
BinomQueue.tree_perm [lemma, in Binom]
BinomQueue.unzip [definition, in Binom]
Black [constructor, in Redblack]
ble_reflect [lemma, in Perm]
blt_reflect [lemma, in Perm]


C

can_relate [lemma, in SearchTree]
cardinal_map [lemma, in Color]
check_example_map [lemma, in SearchTree]
check_too_clever [lemma, in SearchTree]
color [definition, in Color]
color [inductive, in Redblack]
Color [library]
coloring [definition, in Color]
coloring_ok [definition, in Color]
colors_of [definition, in Color]
color1 [definition, in Color]
color_correct [lemma, in Color]
combine [definition, in SearchTree]
combine [definition, in Redblack]
compute_with_lt_dec [lemma, in Decide]
compute_with_StdLib_lt_dec [lemma, in Decide]
cons_relate [lemma, in ADT]
contents [definition, in Multiset]
contents_in [lemma, in Multiset]
contents_perm [lemma, in Multiset]
contents_perm_aux [lemma, in Multiset]
create_relate [lemma, in ADT]


D

Decide [library]
delete_contents [lemma, in Multiset]
domain_example_map [definition, in Color]


E

E [constructor, in Redblack]
E [constructor, in SearchTree]
E [module, in Color]
elements [definition, in SearchTree]
elements [definition, in Redblack]
elements' [definition, in SearchTree]
elements' [definition, in Redblack]
elements_property [definition, in Redblack]
elements_relate [lemma, in SearchTree]
elements_relate [lemma, in SearchTree]
elements_relate [lemma, in Redblack]
elements_relateX [lemma, in SearchTree]
elements_relate_second_attempt [lemma, in SearchTree]
elements_slow_elements [lemma, in SearchTree]
empty [definition, in Multiset]
empty [definition, in Trie]
empty_is_trie [lemma, in Trie]
empty_relate [lemma, in Trie]
empty_tree [definition, in Redblack]
empty_tree [definition, in SearchTree]
empty_tree_relate [lemma, in Redblack]
empty_tree_relate [lemma, in SearchTree]
empty_tree_SearchTree [lemma, in SearchTree]
empty_tree_SearchTree [lemma, in Redblack]
eqlistA_Eeq_eq [lemma, in Color]
equivlistA_example [definition, in Color]
example_map [definition, in Color]
example_map [definition, in SearchTree]
example_SearchTree_bad [lemma, in SearchTree]
example_SearchTree_good [lemma, in SearchTree]
example_tree [definition, in SearchTree]
expand_range_SearchTree' [lemma, in Redblack]
Experiments [module, in Extract]
Experiments.E [definition, in Extract]
Experiments.empty_tree [definition, in Extract]
Experiments.insert [definition, in Extract]
Experiments.lookup [definition, in Extract]
Experiments.T [definition, in Extract]
Exploration1 [module, in Perm]
Exploration1.bogus_subtraction [lemma, in Perm]
Exploration1.butterfly [definition, in Perm]
Exploration1.first_le_second [definition, in Perm]
Exploration1.maybe_swap [definition, in Perm]
Exploration1.maybe_swap_correct [lemma, in Perm]
Exploration1.maybe_swap_idempotent [lemma, in Perm]
Exploration1.maybe_swap_idempotent [lemma, in Perm]
Exploration1.maybe_swap_idempotent' [lemma, in Perm]
Exploration1.maybe_swap_perm [lemma, in Perm]
Exploration1.maybe_swap_123 [definition, in Perm]
Exploration1.maybe_swap_321 [definition, in Perm]
Exploration1.not_a_permutation [definition, in Perm]
Exploration1.omega_example1 [lemma, in Perm]
Exploration1.omega_example1 [lemma, in Perm]
Exploration1.omega_example2 [lemma, in Perm]
Exploration1.permut_example [definition, in Perm]
Extract [library]


F

FastEnough [module, in Trie]
FastEnough.collisions [definition, in Trie]
FastEnough.collisions_pi [definition, in Trie]
FastEnough.loop [definition, in Trie]
fib [definition, in ADT]
fibish [definition, in ADT]
fibish_correct [lemma, in ADT]
fibonacci [definition, in ADT]
filter_sortE [lemma, in Color]
fold_right_rev_left [lemma, in Color]
forall_nodes [definition, in SearchTree]
Forall_nth [lemma, in Sort]
Forall_perm [lemma, in Perm]


G

G [definition, in Color]
graph [definition, in Color]


H

how_many_subgoals_remaining [definition, in Redblack]


I

InA_example [definition, in Color]
InA_map_fst_key [lemma, in Color]
ins [definition, in Redblack]
ins [definition, in Trie]
insert [definition, in Trie]
insert [definition, in Redblack]
insert [definition, in SearchTree]
insert [definition, in Sort]
insertion_sort_correct [lemma, in Multiset]
insertion_sort_correct [lemma, in Sort]
insert_contents [lemma, in Multiset]
insert_is_redblack [lemma, in Redblack]
insert_is_trie [lemma, in Trie]
insert_perm [lemma, in Sort]
insert_relate [lemma, in Redblack]
insert_relate [lemma, in Trie]
insert_relate [lemma, in SearchTree]
insert_relate' [lemma, in SearchTree]
insert_SearchTree [lemma, in SearchTree]
insert_SearchTree [lemma, in Redblack]
insert_sorted [lemma, in Sort]
insert_sorted' [lemma, in Sort]
ins_is_redblack [lemma, in Redblack]
ins_not_E [lemma, in Redblack]
ins_not_E [lemma, in Redblack]
ins_not_E [lemma, in Redblack]
ins_relate [lemma, in Redblack]
ins_SearchTree [lemma, in Redblack]
int [axiom, in Extract]
Integers [module, in Trie]
Integers.add [definition, in Trie]
Integers.addc [definition, in Trie]
Integers.addc_correct [lemma, in Trie]
Integers.add_correct [lemma, in Trie]
Integers.compare [definition, in Trie]
Integers.compare_correct [lemma, in Trie]
Integers.comparison [inductive, in Trie]
Integers.Eq [constructor, in Trie]
Integers.Gt [constructor, in Trie]
Integers.Lt [constructor, in Trie]
Integers.positive [inductive, in Trie]
Integers.positive2nat [definition, in Trie]
Integers.positive2nat_pos [lemma, in Trie]
Integers.print_in_binary [definition, in Trie]
Integers.succ [definition, in Trie]
Integers.succ_correct [lemma, in Trie]
Integers.ten [definition, in Trie]
Integers.xH [constructor, in Trie]
Integers.xI [constructor, in Trie]
Integers.xO [constructor, in Trie]
Integers.Z [inductive, in Trie]
Integers.Zneg [constructor, in Trie]
Integers.Zpos [constructor, in Trie]
Integers.Z0 [constructor, in Trie]
Integers.::x_'~'_'0' [notation, in Trie]
Integers.::x_'~'_'1' [notation, in Trie]
IntMaps [module, in Extract]
IntMaps.total_map [definition, in Extract]
IntMaps.t_empty [definition, in Extract]
IntMaps.t_update [definition, in Extract]
IntMaps.t_update_eq [lemma, in Extract]
IntMaps.t_update_neq [lemma, in Extract]
IntMaps.t_update_shadow [lemma, in Extract]
int2Z [axiom, in Extract]
int_blt_reflect [lemma, in Extract]
in_colors_of_1 [lemma, in Color]
In_decidable [lemma, in SearchTree]
in_perm_delete [lemma, in Multiset]
in_4_pi [definition, in Decide]
IsRB_b [constructor, in Redblack]
IsRB_leaf [constructor, in Redblack]
IsRB_r [constructor, in Redblack]
is_a_sorting_algorithm [definition, in Selection]
is_a_sorting_algorithm [definition, in Sort]
is_a_sorting_algorithm' [definition, in Multiset]
is_redblack [inductive, in Redblack]
is_redblack_toblack [lemma, in Redblack]
is_trie [definition, in Trie]


K

key [definition, in SearchTree]
key [definition, in Redblack]


L

L [module, in ADT]
Leaf [constructor, in Trie]
LISTISH [module, in ADT]
LISTISH.cons [axiom, in ADT]
LISTISH.create [axiom, in ADT]
LISTISH.list [axiom, in ADT]
LISTISH.nth [axiom, in ADT]
list2map [definition, in SearchTree]
list2map_app_left [lemma, in SearchTree]
list2map_app_right [lemma, in SearchTree]
list2map_not_in_default [lemma, in SearchTree]
list_delete [definition, in Multiset]
list_nat_eq_dec [definition, in Decide]
list_nat_in [definition, in Decide]
List_Priqueue [module, in Priqueue]
List_Priqueue.Abs [definition, in Priqueue]
List_Priqueue.Abs' [inductive, in Priqueue]
List_Priqueue.Abs_intro [constructor, in Priqueue]
List_Priqueue.abs_perm [lemma, in Priqueue]
List_Priqueue.can_relate [lemma, in Priqueue]
List_Priqueue.delete_max [definition, in Priqueue]
List_Priqueue.delete_max_None_relate [lemma, in Priqueue]
List_Priqueue.delete_max_Some_priq [lemma, in Priqueue]
List_Priqueue.delete_max_Some_relate [lemma, in Priqueue]
List_Priqueue.empty [definition, in Priqueue]
List_Priqueue.empty_priq [lemma, in Priqueue]
List_Priqueue.empty_relate [lemma, in Priqueue]
List_Priqueue.insert [definition, in Priqueue]
List_Priqueue.insert_priq [lemma, in Priqueue]
List_Priqueue.insert_relate [lemma, in Priqueue]
List_Priqueue.key [definition, in Priqueue]
List_Priqueue.merge [definition, in Priqueue]
List_Priqueue.merge_priq [lemma, in Priqueue]
List_Priqueue.merge_relate [lemma, in Priqueue]
List_Priqueue.priq [definition, in Priqueue]
List_Priqueue.priqueue [definition, in Priqueue]
List_Priqueue.select [definition, in Priqueue]
List_Priqueue.select_biggest [lemma, in Priqueue]
List_Priqueue.select_biggest_aux [lemma, in Priqueue]
List_Priqueue.select_perm [lemma, in Priqueue]
look [definition, in Trie]
lookup [definition, in Trie]
lookup [definition, in Redblack]
lookup [definition, in SearchTree]
lookup_relate [lemma, in Trie]
lookup_relate [lemma, in SearchTree]
lookup_relate [lemma, in Redblack]
lookup_relateX [lemma, in SearchTree]
lookup_relate' [lemma, in SearchTree]
look_ins_other [lemma, in Trie]
look_ins_same [lemma, in Trie]
look_leaf [lemma, in Trie]
low_deg [definition, in Color]
ltb [axiom, in Extract]
ltb_lt [axiom, in Extract]
lt_proper [lemma, in Color]
lt_strict [lemma, in Color]
L.cons [definition, in ADT]
L.create [definition, in ADT]
L.list [definition, in ADT]
L.nth [definition, in ADT]
L_Abs [inductive, in ADT]


M

M [module, in Color]
makeBlack [definition, in Redblack]
makeBlack_relate [lemma, in Redblack]
MapsTable [module, in ADT]
MapsTable.default [definition, in ADT]
MapsTable.empty [definition, in ADT]
MapsTable.gempty [lemma, in ADT]
MapsTable.get [definition, in ADT]
MapsTable.gso [lemma, in ADT]
MapsTable.gss [lemma, in ADT]
MapsTable.key [definition, in ADT]
MapsTable.set [definition, in ADT]
MapsTable.table [definition, in ADT]
MapsTable.V [definition, in ADT]
Mdomain [definition, in Color]
mk_graph [definition, in Color]
Mremove_cardinal_less [lemma, in Color]
Mremove_elements [lemma, in Color]
multiset [definition, in Multiset]
Multiset [library]
multiset_delete [definition, in Multiset]


N

naive_lookup_relateX [lemma, in SearchTree]
nat2pos [definition, in Trie]
nat2pos2nat [lemma, in Trie]
nat2pos_injective [lemma, in Trie]
nearly_redblack [inductive, in Redblack]
node [definition, in Color]
Node [constructor, in Trie]
nodemap [definition, in Color]
nodes [definition, in Color]
nodeset [definition, in Color]
not_elements_relate [lemma, in SearchTree]
not_naive_lookup_relateX [lemma, in SearchTree]
no_selfloop [definition, in Color]
nrRB_b [constructor, in Redblack]
nrRB_r [constructor, in Redblack]
nth_firstn [lemma, in ADT]
nth_relate [lemma, in ADT]


O

omega_on_keys [lemma, in SearchTree]
out_of_gas [definition, in Selection]
O_Abs [definition, in ADT]


P

palette [definition, in Color]
Perm [library]
perm_contents [lemma, in Multiset]
pos2nat [definition, in Trie]
pos2nat2pos [lemma, in Trie]
pos2nat_injective [lemma, in Trie]
Preface [library]
PRIQUEUE [module, in Priqueue]
Priqueue [library]
PRIQUEUE.Abs [axiom, in Priqueue]
PRIQUEUE.abs_perm [axiom, in Priqueue]
PRIQUEUE.can_relate [axiom, in Priqueue]
PRIQUEUE.delete_max [axiom, in Priqueue]
PRIQUEUE.delete_max_None_relate [axiom, in Priqueue]
PRIQUEUE.delete_max_Some_priq [axiom, in Priqueue]
PRIQUEUE.delete_max_Some_relate [axiom, in Priqueue]
PRIQUEUE.empty [axiom, in Priqueue]
PRIQUEUE.empty_priq [axiom, in Priqueue]
PRIQUEUE.empty_relate [axiom, in Priqueue]
PRIQUEUE.insert [axiom, in Priqueue]
PRIQUEUE.insert_priq [axiom, in Priqueue]
PRIQUEUE.insert_relate [axiom, in Priqueue]
PRIQUEUE.key [definition, in Priqueue]
PRIQUEUE.merge [axiom, in Priqueue]
PRIQUEUE.merge_priq [axiom, in Priqueue]
PRIQUEUE.merge_relate [axiom, in Priqueue]
PRIQUEUE.priq [axiom, in Priqueue]
PRIQUEUE.priqueue [axiom, in Priqueue]
Proper_eq_eq [lemma, in Color]
Proper_eq_key_elt [lemma, in Color]


R

RatherSlow [module, in Trie]
RatherSlow.collisions [definition, in Trie]
RatherSlow.collisions_pi [definition, in Trie]
RatherSlow.empty [definition, in Trie]
RatherSlow.loop [definition, in Trie]
RatherSlow.total_mapz [definition, in Trie]
RatherSlow.update [definition, in Trie]
Red [constructor, in Redblack]
Redblack [library]
reflect_example1 [definition, in Perm]
reflect_example2 [definition, in Perm]
remove_node [definition, in Color]
repeat [definition, in ADT]
repeat_step_relate [lemma, in ADT]


S

S [module, in Color]
same_contents_iff_perm [lemma, in Multiset]
same_mod_10 [definition, in Color]
ScratchPad [module, in Decide]
ScratchPad.greater23 [lemma, in Decide]
ScratchPad.is_3_less_7 [definition, in Decide]
ScratchPad.left [constructor, in Decide]
ScratchPad.less37 [lemma, in Decide]
ScratchPad.lt_dec [definition, in Decide]
ScratchPad.lt_dec' [definition, in Decide]
ScratchPad.lt_dec_equivalent [lemma, in Decide]
ScratchPad.right [constructor, in Decide]
ScratchPad.sumbool [inductive, in Decide]
ScratchPad.t1 [definition, in Decide]
ScratchPad.t2 [definition, in Decide]
ScratchPad.t4 [definition, in Decide]
ScratchPad.v1a [definition, in Decide]
ScratchPad.v1b [definition, in Decide]
ScratchPad.v2a [definition, in Decide]
ScratchPad.v3 [definition, in Decide]
ScratchPad.:type_scope:'{'_x_'}'_'+'_'{'_x_'}' [notation, in Decide]
ScratchPad2 [module, in Decide]
ScratchPad2.insert [definition, in Decide]
ScratchPad2.insert_sorted [lemma, in Decide]
ScratchPad2.le_dec [definition, in Decide]
ScratchPad2.lt_dec [definition, in Decide]
ScratchPad2.lt_dec_axiom_1 [axiom, in Decide]
ScratchPad2.lt_dec_axiom_2 [axiom, in Decide]
ScratchPad2.max_with_axiom [definition, in Decide]
ScratchPad2.prove_with_max_axiom [lemma, in Decide]
ScratchPad2.sort [definition, in Decide]
ScratchPad2.sorted [inductive, in Decide]
ScratchPad2.sorted_cons [constructor, in Decide]
ScratchPad2.sorted_nil [constructor, in Decide]
ScratchPad2.sorted_1 [constructor, in Decide]
SearchTree [inductive, in SearchTree]
SearchTree [inductive, in Redblack]
SearchTree [library]
SearchTreeX [definition, in SearchTree]
SearchTree' [inductive, in SearchTree]
SearchTree' [inductive, in Redblack]
SearchTree'_le [lemma, in Redblack]
SearchTree'_le [lemma, in SearchTree]
SearchTree2 [module, in Extract]
SearchTree2.Abs [inductive, in Extract]
SearchTree2.Abs_E [constructor, in Extract]
SearchTree2.Abs_T [constructor, in Extract]
SearchTree2.combine [definition, in Extract]
SearchTree2.E [constructor, in Extract]
SearchTree2.elements [definition, in Extract]
SearchTree2.elements' [definition, in Extract]
SearchTree2.empty_tree [definition, in Extract]
SearchTree2.empty_tree_relate [lemma, in Extract]
SearchTree2.insert [definition, in Extract]
SearchTree2.insert_relate [lemma, in Extract]
SearchTree2.key [definition, in Extract]
SearchTree2.lookup [definition, in Extract]
SearchTree2.lookup_relate [lemma, in Extract]
SearchTree2.T [constructor, in Extract]
SearchTree2.tree [inductive, in Extract]
SearchTree2.TREES [section, in Extract]
SearchTree2.TREES.default [variable, in Extract]
SearchTree2.TREES.V [variable, in Extract]
SearchTree2.unrealistically_strong_can_relate [lemma, in Extract]
SectionExample1 [module, in SearchTree]
SectionExample1.empty [definition, in SearchTree]
SectionExample1.lookup [definition, in SearchTree]
SectionExample1.lookup_empty [lemma, in SearchTree]
SectionExample1.mymap [definition, in SearchTree]
SectionExample2 [module, in SearchTree]
SectionExample2.empty [definition, in SearchTree]
SectionExample2.lookup [definition, in SearchTree]
SectionExample2.lookup_empty [lemma, in SearchTree]
SectionExample2.MAPS [section, in SearchTree]
SectionExample2.MAPS.default [variable, in SearchTree]
SectionExample2.MAPS.V [variable, in SearchTree]
SectionExample2.mymap [definition, in SearchTree]
select [definition, in Selection]
Selection [library]
selection_sort [definition, in Selection]
selection_sort_correct [definition, in Selection]
selection_sort_is_correct [lemma, in Selection]
selection_sort_perm [lemma, in Selection]
selection_sort_sorted [lemma, in Selection]
selection_sort_sorted_aux [lemma, in Selection]
select_perm [lemma, in Selection]
select_smallest [lemma, in Selection]
select_smallest_aux [lemma, in Selection]
select_terminates [lemma, in Color]
selsort [definition, in Selection]
selsort'_perm [lemma, in Selection]
selsort_perm [lemma, in Selection]
singleton [definition, in Multiset]
Sin_domain [lemma, in Color]
sixlist [definition, in ADT]
slow_elements [definition, in SearchTree]
slow_elements_range [lemma, in SearchTree]
Snot_in_empty [lemma, in Color]
sort [definition, in Sort]
Sort [library]
sorted [inductive, in Selection]
sorted [inductive, in Sort]
sorted' [definition, in Sort]
sorted'_sorted [lemma, in Sort]
sorted_cons [constructor, in Sort]
sorted_cons [constructor, in Selection]
Sorted_lt_key [lemma, in Color]
sorted_nil [constructor, in Sort]
sorted_nil [constructor, in Selection]
sorted_sorted' [lemma, in Sort]
sorted_1 [constructor, in Selection]
sorted_1 [constructor, in Sort]
SortE_equivlistE_eqlistE [lemma, in Color]
Sort1 [module, in Extract]
Sort1.insert [definition, in Extract]
Sort1.sort [definition, in Extract]
sort_contents [lemma, in Multiset]
sort_perm [lemma, in Sort]
sort_pi [definition, in Sort]
sort_pi [definition, in Multiset]
sort_pi [definition, in Selection]
sort_pi_same_contents [definition, in Multiset]
sort_sorted [lemma, in Sort]
sort_sorted' [lemma, in Sort]
sort_specifications_equivalent [lemma, in Multiset]
specialize_SortA_equivlistA_eqlistA [lemma, in Color]
Sremove_cardinal_less [lemma, in Color]
Sremove_elements [lemma, in Color]
Sremove_elements [lemma, in Color]
step [definition, in ADT]
stepish [definition, in ADT]
step_relate [lemma, in ADT]
ST_E [constructor, in SearchTree]
ST_E [constructor, in Redblack]
ST_intro [constructor, in SearchTree]
ST_intro [constructor, in Redblack]
ST_T [constructor, in Redblack]
ST_T [constructor, in SearchTree]
subset_nodes [definition, in Color]
subset_nodes_sub [lemma, in Color]


T

T [constructor, in SearchTree]
T [constructor, in Redblack]
TABLE [module, in ADT]
TABLE.default [axiom, in ADT]
TABLE.empty [axiom, in ADT]
TABLE.gempty [axiom, in ADT]
TABLE.get [axiom, in ADT]
TABLE.gso [axiom, in ADT]
TABLE.gss [axiom, in ADT]
TABLE.key [definition, in ADT]
TABLE.set [axiom, in ADT]
TABLE.table [axiom, in ADT]
TABLE.V [axiom, in ADT]
three_less_seven_1 [lemma, in Decide]
three_less_seven_2 [lemma, in Decide]
three_ten [definition, in Trie]
too_much_gas [definition, in Selection]
tree [inductive, in SearchTree]
tree [inductive, in Redblack]
TREES [section, in SearchTree]
TREES [section, in Redblack]
TREES.default [variable, in SearchTree]
TREES.default [variable, in Redblack]
TREES.EXAMPLES [section, in SearchTree]
TREES.EXAMPLES.v2 [variable, in SearchTree]
TREES.EXAMPLES.v4 [variable, in SearchTree]
TREES.EXAMPLES.v5 [variable, in SearchTree]
TREES.V [variable, in Redblack]
TREES.V [variable, in SearchTree]
TreeTable [module, in ADT]
TreeTable.default [definition, in ADT]
TreeTable.empty [definition, in ADT]
TreeTable.gempty [lemma, in ADT]
TreeTable.get [definition, in ADT]
TreeTable.gso [lemma, in ADT]
TreeTable.gss [lemma, in ADT]
TreeTable.key [definition, in ADT]
TreeTable.set [definition, in ADT]
TreeTable.table [definition, in ADT]
TreeTable.V [definition, in ADT]
TreeTable2 [module, in ADT]
TreeTable2.default [definition, in ADT]
TreeTable2.empty [definition, in ADT]
TreeTable2.gempty [lemma, in ADT]
TreeTable2.get [definition, in ADT]
TreeTable2.gso [lemma, in ADT]
TreeTable2.gss [lemma, in ADT]
TreeTable2.key [definition, in ADT]
TreeTable2.set [definition, in ADT]
TreeTable2.table [definition, in ADT]
TreeTable2.V [definition, in ADT]
trie [inductive, in Trie]
Trie [library]
trie_table [definition, in Trie]
T_neq_E [lemma, in Redblack]


U

undirected [definition, in Color]
union [definition, in Multiset]
union_assoc [lemma, in Multiset]
union_comm [lemma, in Multiset]
unrealistically_strong_can_relate [lemma, in SearchTree]


V

value [definition, in Multiset]
VerySlow [module, in Trie]
VerySlow.collisions [definition, in Trie]
VerySlow.collisions_pi [definition, in Trie]
VerySlow.loop [definition, in Trie]


W

WF [module, in Color]
WP [module, in Color]


Z

Z_eqb_reflect [lemma, in Extract]
Z_ltb_reflect [lemma, in Extract]


:

:nat_scope:x_'=?'_x [notation, in Perm]
:nat_scope:x_'>=?'_x [notation, in Perm]
:nat_scope:x_'>?'_x [notation, in Perm]



Notation Index

I

Integers.::x_'~'_'0' [in Trie]
Integers.::x_'~'_'1' [in Trie]


S

ScratchPad.:type_scope:'{'_x_'}'_'+'_'{'_x_'}' [in Decide]


:

:nat_scope:x_'=?'_x [in Perm]
:nat_scope:x_'>=?'_x [in Perm]
:nat_scope:x_'>?'_x [in Perm]



Module Index

B

BinomQueue [in Binom]


E

E [in Color]
Experiments [in Extract]
Exploration1 [in Perm]


F

FastEnough [in Trie]


I

Integers [in Trie]
IntMaps [in Extract]


L

L [in ADT]
LISTISH [in ADT]
List_Priqueue [in Priqueue]


M

M [in Color]
MapsTable [in ADT]


P

PRIQUEUE [in Priqueue]


R

RatherSlow [in Trie]


S

S [in Color]
ScratchPad [in Decide]
ScratchPad2 [in Decide]
SearchTree2 [in Extract]
SectionExample1 [in SearchTree]
SectionExample2 [in SearchTree]
Sort1 [in Extract]


T

TABLE [in ADT]
TreeTable [in ADT]
TreeTable2 [in ADT]


V

VerySlow [in Trie]


W

WF [in Color]
WP [in Color]



Variable Index

A

ADT_SUMMARY.default [in ADT]
ADT_SUMMARY.V [in ADT]


S

SearchTree2.TREES.default [in Extract]
SearchTree2.TREES.V [in Extract]
SectionExample2.MAPS.default [in SearchTree]
SectionExample2.MAPS.V [in SearchTree]


T

TREES.default [in SearchTree]
TREES.default [in Redblack]
TREES.EXAMPLES.v2 [in SearchTree]
TREES.EXAMPLES.v4 [in SearchTree]
TREES.EXAMPLES.v5 [in SearchTree]
TREES.V [in Redblack]
TREES.V [in SearchTree]



Library Index

A

ADT


B

Binom


C

Color


D

Decide


E

Extract


M

Multiset


P

Perm
Preface
Priqueue


R

Redblack


S

SearchTree
Selection
Sort


T

Trie



Lemma Index

A

abstraction_of_bogus_tree [in SearchTree]
Abs_helper [in Redblack]
adj_ext [in Color]


B

balance_relate [in Redblack]
balance_SearchTree [in Redblack]
balance_SearchTree [in Redblack]
balance_SearchTree [in Redblack]
beq_reflect [in Perm]
BinomQueue.abs_perm [in Binom]
BinomQueue.can_relate [in Binom]
BinomQueue.carry_elems [in Binom]
BinomQueue.carry_valid [in Binom]
BinomQueue.delete_max_None_relate [in Binom]
BinomQueue.delete_max_Some_priq [in Binom]
BinomQueue.delete_max_Some_relate [in Binom]
BinomQueue.empty_priq [in Binom]
BinomQueue.empty_relate [in Binom]
BinomQueue.insert_priq [in Binom]
BinomQueue.insert_relate [in Binom]
BinomQueue.join_elems [in Binom]
BinomQueue.join_valid [in Binom]
BinomQueue.merge_priq [in Binom]
BinomQueue.merge_relate [in Binom]
BinomQueue.priqueue_elems_ext [in Binom]
BinomQueue.smash_elems [in Binom]
BinomQueue.smash_valid [in Binom]
BinomQueue.tree_can_relate [in Binom]
BinomQueue.tree_elems_ext [in Binom]
BinomQueue.tree_perm [in Binom]
ble_reflect [in Perm]
blt_reflect [in Perm]


C

can_relate [in SearchTree]
cardinal_map [in Color]
check_example_map [in SearchTree]
check_too_clever [in SearchTree]
color_correct [in Color]
compute_with_lt_dec [in Decide]
compute_with_StdLib_lt_dec [in Decide]
cons_relate [in ADT]
contents_in [in Multiset]
contents_perm [in Multiset]
contents_perm_aux [in Multiset]
create_relate [in ADT]


D

delete_contents [in Multiset]


E

elements_relate [in SearchTree]
elements_relate [in SearchTree]
elements_relate [in Redblack]
elements_relateX [in SearchTree]
elements_relate_second_attempt [in SearchTree]
elements_slow_elements [in SearchTree]
empty_is_trie [in Trie]
empty_relate [in Trie]
empty_tree_relate [in Redblack]
empty_tree_relate [in SearchTree]
empty_tree_SearchTree [in SearchTree]
empty_tree_SearchTree [in Redblack]
eqlistA_Eeq_eq [in Color]
example_SearchTree_bad [in SearchTree]
example_SearchTree_good [in SearchTree]
expand_range_SearchTree' [in Redblack]
Exploration1.bogus_subtraction [in Perm]
Exploration1.maybe_swap_correct [in Perm]
Exploration1.maybe_swap_idempotent [in Perm]
Exploration1.maybe_swap_idempotent [in Perm]
Exploration1.maybe_swap_idempotent' [in Perm]
Exploration1.maybe_swap_perm [in Perm]
Exploration1.omega_example1 [in Perm]
Exploration1.omega_example1 [in Perm]
Exploration1.omega_example2 [in Perm]


F

fibish_correct [in ADT]
filter_sortE [in Color]
fold_right_rev_left [in Color]
Forall_nth [in Sort]
Forall_perm [in Perm]


I

InA_map_fst_key [in Color]
insertion_sort_correct [in Multiset]
insertion_sort_correct [in Sort]
insert_contents [in Multiset]
insert_is_redblack [in Redblack]
insert_is_trie [in Trie]
insert_perm [in Sort]
insert_relate [in Redblack]
insert_relate [in Trie]
insert_relate [in SearchTree]
insert_relate' [in SearchTree]
insert_SearchTree [in SearchTree]
insert_SearchTree [in Redblack]
insert_sorted [in Sort]
insert_sorted' [in Sort]
ins_is_redblack [in Redblack]
ins_not_E [in Redblack]
ins_not_E [in Redblack]
ins_not_E [in Redblack]
ins_relate [in Redblack]
ins_SearchTree [in Redblack]
Integers.addc_correct [in Trie]
Integers.add_correct [in Trie]
Integers.compare_correct [in Trie]
Integers.positive2nat_pos [in Trie]
Integers.succ_correct [in Trie]
IntMaps.t_update_eq [in Extract]
IntMaps.t_update_neq [in Extract]
IntMaps.t_update_shadow [in Extract]
int_blt_reflect [in Extract]
in_colors_of_1 [in Color]
In_decidable [in SearchTree]
in_perm_delete [in Multiset]
is_redblack_toblack [in Redblack]


L

list2map_app_left [in SearchTree]
list2map_app_right [in SearchTree]
list2map_not_in_default [in SearchTree]
List_Priqueue.abs_perm [in Priqueue]
List_Priqueue.can_relate [in Priqueue]
List_Priqueue.delete_max_None_relate [in Priqueue]
List_Priqueue.delete_max_Some_priq [in Priqueue]
List_Priqueue.delete_max_Some_relate [in Priqueue]
List_Priqueue.empty_priq [in Priqueue]
List_Priqueue.empty_relate [in Priqueue]
List_Priqueue.insert_priq [in Priqueue]
List_Priqueue.insert_relate [in Priqueue]
List_Priqueue.merge_priq [in Priqueue]
List_Priqueue.merge_relate [in Priqueue]
List_Priqueue.select_biggest [in Priqueue]
List_Priqueue.select_biggest_aux [in Priqueue]
List_Priqueue.select_perm [in Priqueue]
lookup_relate [in Trie]
lookup_relate [in SearchTree]
lookup_relate [in Redblack]
lookup_relateX [in SearchTree]
lookup_relate' [in SearchTree]
look_ins_other [in Trie]
look_ins_same [in Trie]
look_leaf [in Trie]
lt_proper [in Color]
lt_strict [in Color]


M

makeBlack_relate [in Redblack]
MapsTable.gempty [in ADT]
MapsTable.gso [in ADT]
MapsTable.gss [in ADT]
Mremove_cardinal_less [in Color]
Mremove_elements [in Color]


N

naive_lookup_relateX [in SearchTree]
nat2pos2nat [in Trie]
nat2pos_injective [in Trie]
not_elements_relate [in SearchTree]
not_naive_lookup_relateX [in SearchTree]
nth_firstn [in ADT]
nth_relate [in ADT]


O

omega_on_keys [in SearchTree]


P

perm_contents [in Multiset]
pos2nat2pos [in Trie]
pos2nat_injective [in Trie]
Proper_eq_eq [in Color]
Proper_eq_key_elt [in Color]


R

repeat_step_relate [in ADT]


S

same_contents_iff_perm [in Multiset]
ScratchPad.greater23 [in Decide]
ScratchPad.less37 [in Decide]
ScratchPad.lt_dec_equivalent [in Decide]
ScratchPad2.insert_sorted [in Decide]
ScratchPad2.prove_with_max_axiom [in Decide]
SearchTree'_le [in Redblack]
SearchTree'_le [in SearchTree]
SearchTree2.empty_tree_relate [in Extract]
SearchTree2.insert_relate [in Extract]
SearchTree2.lookup_relate [in Extract]
SearchTree2.unrealistically_strong_can_relate [in Extract]
SectionExample1.lookup_empty [in SearchTree]
SectionExample2.lookup_empty [in SearchTree]
selection_sort_is_correct [in Selection]
selection_sort_perm [in Selection]
selection_sort_sorted [in Selection]
selection_sort_sorted_aux [in Selection]
select_perm [in Selection]
select_smallest [in Selection]
select_smallest_aux [in Selection]
select_terminates [in Color]
selsort'_perm [in Selection]
selsort_perm [in Selection]
Sin_domain [in Color]
slow_elements_range [in SearchTree]
Snot_in_empty [in Color]
sorted'_sorted [in Sort]
Sorted_lt_key [in Color]
sorted_sorted' [in Sort]
SortE_equivlistE_eqlistE [in Color]
sort_contents [in Multiset]
sort_perm [in Sort]
sort_sorted [in Sort]
sort_sorted' [in Sort]
sort_specifications_equivalent [in Multiset]
specialize_SortA_equivlistA_eqlistA [in Color]
Sremove_cardinal_less [in Color]
Sremove_elements [in Color]
Sremove_elements [in Color]
step_relate [in ADT]
subset_nodes_sub [in Color]


T

three_less_seven_1 [in Decide]
three_less_seven_2 [in Decide]
TreeTable.gempty [in ADT]
TreeTable.gso [in ADT]
TreeTable.gss [in ADT]
TreeTable2.gempty [in ADT]
TreeTable2.gso [in ADT]
TreeTable2.gss [in ADT]
T_neq_E [in Redblack]


U

union_assoc [in Multiset]
union_comm [in Multiset]
unrealistically_strong_can_relate [in SearchTree]


Z

Z_eqb_reflect [in Extract]
Z_ltb_reflect [in Extract]



Constructor Index

A

Abs_E [in Redblack]
Abs_E [in SearchTree]
Abs_T [in SearchTree]
Abs_T [in Redblack]


B

BinomQueue.Leaf [in Binom]
BinomQueue.Node [in Binom]
BinomQueue.tree_elems_leaf [in Binom]
BinomQueue.tree_elems_node [in Binom]
Black [in Redblack]


E

E [in Redblack]
E [in SearchTree]


I

Integers.Eq [in Trie]
Integers.Gt [in Trie]
Integers.Lt [in Trie]
Integers.xH [in Trie]
Integers.xI [in Trie]
Integers.xO [in Trie]
Integers.Zneg [in Trie]
Integers.Zpos [in Trie]
Integers.Z0 [in Trie]
IsRB_b [in Redblack]
IsRB_leaf [in Redblack]
IsRB_r [in Redblack]


L

Leaf [in Trie]
List_Priqueue.Abs_intro [in Priqueue]


N

Node [in Trie]
nrRB_b [in Redblack]
nrRB_r [in Redblack]


R

Red [in Redblack]


S

ScratchPad.left [in Decide]
ScratchPad.right [in Decide]
ScratchPad2.sorted_cons [in Decide]
ScratchPad2.sorted_nil [in Decide]
ScratchPad2.sorted_1 [in Decide]
SearchTree2.Abs_E [in Extract]
SearchTree2.Abs_T [in Extract]
SearchTree2.E [in Extract]
SearchTree2.T [in Extract]
sorted_cons [in Sort]
sorted_cons [in Selection]
sorted_nil [in Sort]
sorted_nil [in Selection]
sorted_1 [in Selection]
sorted_1 [in Sort]
ST_E [in SearchTree]
ST_E [in Redblack]
ST_intro [in SearchTree]
ST_intro [in Redblack]
ST_T [in Redblack]
ST_T [in SearchTree]


T

T [in SearchTree]
T [in Redblack]



Axiom Index

I

int [in Extract]
int2Z [in Extract]


L

LISTISH.cons [in ADT]
LISTISH.create [in ADT]
LISTISH.list [in ADT]
LISTISH.nth [in ADT]
ltb [in Extract]
ltb_lt [in Extract]


P

PRIQUEUE.Abs [in Priqueue]
PRIQUEUE.abs_perm [in Priqueue]
PRIQUEUE.can_relate [in Priqueue]
PRIQUEUE.delete_max [in Priqueue]
PRIQUEUE.delete_max_None_relate [in Priqueue]
PRIQUEUE.delete_max_Some_priq [in Priqueue]
PRIQUEUE.delete_max_Some_relate [in Priqueue]
PRIQUEUE.empty [in Priqueue]
PRIQUEUE.empty_priq [in Priqueue]
PRIQUEUE.empty_relate [in Priqueue]
PRIQUEUE.insert [in Priqueue]
PRIQUEUE.insert_priq [in Priqueue]
PRIQUEUE.insert_relate [in Priqueue]
PRIQUEUE.merge [in Priqueue]
PRIQUEUE.merge_priq [in Priqueue]
PRIQUEUE.merge_relate [in Priqueue]
PRIQUEUE.priq [in Priqueue]
PRIQUEUE.priqueue [in Priqueue]


S

ScratchPad2.lt_dec_axiom_1 [in Decide]
ScratchPad2.lt_dec_axiom_2 [in Decide]


T

TABLE.default [in ADT]
TABLE.empty [in ADT]
TABLE.gempty [in ADT]
TABLE.get [in ADT]
TABLE.gso [in ADT]
TABLE.gss [in ADT]
TABLE.set [in ADT]
TABLE.table [in ADT]
TABLE.V [in ADT]



Inductive Index

A

Abs [in SearchTree]
Abs [in Redblack]


B

BinomQueue.priqueue_elems [in Binom]
BinomQueue.tree [in Binom]
BinomQueue.tree_elems [in Binom]


C

color [in Redblack]


I

Integers.comparison [in Trie]
Integers.positive [in Trie]
Integers.Z [in Trie]
is_redblack [in Redblack]


L

List_Priqueue.Abs' [in Priqueue]
L_Abs [in ADT]


N

nearly_redblack [in Redblack]


S

ScratchPad.sumbool [in Decide]
ScratchPad2.sorted [in Decide]
SearchTree [in SearchTree]
SearchTree [in Redblack]
SearchTree' [in SearchTree]
SearchTree' [in Redblack]
SearchTree2.Abs [in Extract]
SearchTree2.tree [in Extract]
sorted [in Selection]
sorted [in Sort]


T

tree [in SearchTree]
tree [in Redblack]
trie [in Trie]



Section Index

A

ADT_SUMMARY [in ADT]


S

SearchTree2.TREES [in Extract]
SectionExample2.MAPS [in SearchTree]


T

TREES [in SearchTree]
TREES [in Redblack]
TREES.EXAMPLES [in SearchTree]



Definition Index

A

Abs [in Trie]
abstract [in Trie]
AbsX [in SearchTree]
Abs_three_ten [in Trie]
add_edge [in Color]
adj [in Color]


B

balance [in Redblack]
BinomQueue.Abs [in Binom]
BinomQueue.carry [in Binom]
BinomQueue.delete_max [in Binom]
BinomQueue.delete_max_aux [in Binom]
BinomQueue.empty [in Binom]
BinomQueue.find_max [in Binom]
BinomQueue.find_max' [in Binom]
BinomQueue.heap_delete_max [in Binom]
BinomQueue.insert [in Binom]
BinomQueue.join [in Binom]
BinomQueue.key [in Binom]
BinomQueue.merge [in Binom]
BinomQueue.pow2heap [in Binom]
BinomQueue.pow2heap' [in Binom]
BinomQueue.priq [in Binom]
BinomQueue.priqueue [in Binom]
BinomQueue.priq' [in Binom]
BinomQueue.smash [in Binom]
BinomQueue.unzip [in Binom]


C

color [in Color]
coloring [in Color]
coloring_ok [in Color]
colors_of [in Color]
color1 [in Color]
combine [in SearchTree]
combine [in Redblack]
contents [in Multiset]


D

domain_example_map [in Color]


E

elements [in SearchTree]
elements [in Redblack]
elements' [in SearchTree]
elements' [in Redblack]
elements_property [in Redblack]
empty [in Multiset]
empty [in Trie]
empty_tree [in Redblack]
empty_tree [in SearchTree]
equivlistA_example [in Color]
example_map [in Color]
example_map [in SearchTree]
example_tree [in SearchTree]
Experiments.E [in Extract]
Experiments.empty_tree [in Extract]
Experiments.insert [in Extract]
Experiments.lookup [in Extract]
Experiments.T [in Extract]
Exploration1.butterfly [in Perm]
Exploration1.first_le_second [in Perm]
Exploration1.maybe_swap [in Perm]
Exploration1.maybe_swap_123 [in Perm]
Exploration1.maybe_swap_321 [in Perm]
Exploration1.not_a_permutation [in Perm]
Exploration1.permut_example [in Perm]


F

FastEnough.collisions [in Trie]
FastEnough.collisions_pi [in Trie]
FastEnough.loop [in Trie]
fib [in ADT]
fibish [in ADT]
fibonacci [in ADT]
forall_nodes [in SearchTree]


G

G [in Color]
graph [in Color]


H

how_many_subgoals_remaining [in Redblack]


I

InA_example [in Color]
ins [in Redblack]
ins [in Trie]
insert [in Trie]
insert [in Redblack]
insert [in SearchTree]
insert [in Sort]
Integers.add [in Trie]
Integers.addc [in Trie]
Integers.compare [in Trie]
Integers.positive2nat [in Trie]
Integers.print_in_binary [in Trie]
Integers.succ [in Trie]
Integers.ten [in Trie]
IntMaps.total_map [in Extract]
IntMaps.t_empty [in Extract]
IntMaps.t_update [in Extract]
in_4_pi [in Decide]
is_a_sorting_algorithm [in Selection]
is_a_sorting_algorithm [in Sort]
is_a_sorting_algorithm' [in Multiset]
is_trie [in Trie]


K

key [in SearchTree]
key [in Redblack]


L

list2map [in SearchTree]
list_delete [in Multiset]
list_nat_eq_dec [in Decide]
list_nat_in [in Decide]
List_Priqueue.Abs [in Priqueue]
List_Priqueue.delete_max [in Priqueue]
List_Priqueue.empty [in Priqueue]
List_Priqueue.insert [in Priqueue]
List_Priqueue.key [in Priqueue]
List_Priqueue.merge [in Priqueue]
List_Priqueue.priq [in Priqueue]
List_Priqueue.priqueue [in Priqueue]
List_Priqueue.select [in Priqueue]
look [in Trie]
lookup [in Trie]
lookup [in Redblack]
lookup [in SearchTree]
low_deg [in Color]
L.cons [in ADT]
L.create [in ADT]
L.list [in ADT]
L.nth [in ADT]


M

makeBlack [in Redblack]
MapsTable.default [in ADT]
MapsTable.empty [in ADT]
MapsTable.get [in ADT]
MapsTable.key [in ADT]
MapsTable.set [in ADT]
MapsTable.table [in ADT]
MapsTable.V [in ADT]
Mdomain [in Color]
mk_graph [in Color]
multiset [in Multiset]
multiset_delete [in Multiset]


N

nat2pos [in Trie]
node [in Color]
nodemap [in Color]
nodes [in Color]
nodeset [in Color]
no_selfloop [in Color]


O

out_of_gas [in Selection]
O_Abs [in ADT]


P

palette [in Color]
pos2nat [in Trie]
PRIQUEUE.key [in Priqueue]


R

RatherSlow.collisions [in Trie]
RatherSlow.collisions_pi [in Trie]
RatherSlow.empty [in Trie]
RatherSlow.loop [in Trie]
RatherSlow.total_mapz [in Trie]
RatherSlow.update [in Trie]
reflect_example1 [in Perm]
reflect_example2 [in Perm]
remove_node [in Color]
repeat [in ADT]


S

same_mod_10 [in Color]
ScratchPad.is_3_less_7 [in Decide]
ScratchPad.lt_dec [in Decide]
ScratchPad.lt_dec' [in Decide]
ScratchPad.t1 [in Decide]
ScratchPad.t2 [in Decide]
ScratchPad.t4 [in Decide]
ScratchPad.v1a [in Decide]
ScratchPad.v1b [in Decide]
ScratchPad.v2a [in Decide]
ScratchPad.v3 [in Decide]
ScratchPad2.insert [in Decide]
ScratchPad2.le_dec [in Decide]
ScratchPad2.lt_dec [in Decide]
ScratchPad2.max_with_axiom [in Decide]
ScratchPad2.sort [in Decide]
SearchTreeX [in SearchTree]
SearchTree2.combine [in Extract]
SearchTree2.elements [in Extract]
SearchTree2.elements' [in Extract]
SearchTree2.empty_tree [in Extract]
SearchTree2.insert [in Extract]
SearchTree2.key [in Extract]
SearchTree2.lookup [in Extract]
SectionExample1.empty [in SearchTree]
SectionExample1.lookup [in SearchTree]
SectionExample1.mymap [in SearchTree]
SectionExample2.empty [in SearchTree]
SectionExample2.lookup [in SearchTree]
SectionExample2.mymap [in SearchTree]
select [in Selection]
selection_sort [in Selection]
selection_sort_correct [in Selection]
selsort [in Selection]
singleton [in Multiset]
sixlist [in ADT]
slow_elements [in SearchTree]
sort [in Sort]
sorted' [in Sort]
Sort1.insert [in Extract]
Sort1.sort [in Extract]
sort_pi [in Sort]
sort_pi [in Multiset]
sort_pi [in Selection]
sort_pi_same_contents [in Multiset]
step [in ADT]
stepish [in ADT]
subset_nodes [in Color]


T

TABLE.key [in ADT]
three_ten [in Trie]
too_much_gas [in Selection]
TreeTable.default [in ADT]
TreeTable.empty [in ADT]
TreeTable.get [in ADT]
TreeTable.key [in ADT]
TreeTable.set [in ADT]
TreeTable.table [in ADT]
TreeTable.V [in ADT]
TreeTable2.default [in ADT]
TreeTable2.empty [in ADT]
TreeTable2.get [in ADT]
TreeTable2.key [in ADT]
TreeTable2.set [in ADT]
TreeTable2.table [in ADT]
TreeTable2.V [in ADT]
trie_table [in Trie]


U

undirected [in Color]
union [in Multiset]


V

value [in Multiset]
VerySlow.collisions [in Trie]
VerySlow.collisions_pi [in Trie]
VerySlow.loop [in 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)
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)
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)
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)