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 _ (221 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 _ (13 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 _ (55 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 _ (56 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 _ (16 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 _ (67 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 _ (6 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 _ (8 entries)

Global Index

A

a [lemma, in HW5]
add [axiom, in HW7]
add [definition, in HW7]
add [definition, in HW7]
alist [definition, in HW6]
and_associates [lemma, in HW1]
App [constructor, in HW5]
App [constructor, in HW5]
append [definition, in HW2]
append [definition, in HW0]
append_associative [lemma, in HW2]
append_associative [lemma, in HW0]
Arrow [constructor, in HW5]
Arrow [constructor, in HW5]
asgn [definition, in HW6]


B

bool_and [definition, in HW2]
bool_eq [definition, in HW2]
bool_eq_dec [definition, in HW6]
bool_not [definition, in HW2]
bool_or [definition, in HW2]
bool_xor [definition, in HW2]
boundedSat [definition, in HW6]
boundedSatSimple [definition, in HW6]


C

chooseSplit [definition, in HW6]
clause [definition, in HW6]
coalesce1 [lemma, in HW1]
coalesce2 [lemma, in HW1]
cons [constructor, in HW2]
Cons [constructor, in HW7]
cons [constructor, in HW0]
Const [constructor, in HW2]
Const [constructor, in HW5]
Const [constructor, in HW5]
constant_fold [definition, in HW2]
constant_folded [definition, in HW2]
constant_fold_simplifies [lemma, in HW2]
constant_fold_sound [lemma, in HW2]
context [definition, in HW5]
context [definition, in HW5]
contradiction_P [lemma, in HW1]
contradictory_assignment [lemma, in HW6]
contrapositive [lemma, in HW1]
cut_out_the_middle_man [lemma, in HW1]


D

dict [axiom, in HW7]
dict [definition, in HW7]
dict [definition, in HW7]
DICTIONARY [module, in HW7]
DICTIONARY_PARAM [module, in HW7]
dict' [inductive, in HW7]
domain [axiom, in HW7]
domain [definition, in HW7]
domain [definition, in HW7]
domain [axiom, in HW7]
domain [definition, in HW7]
domain [definition, in HW7]
domain_eq_dec [axiom, in HW7]


E

empty [definition, in HW7]
empty [axiom, in HW7]
empty [definition, in HW7]
eq_transitive [definition, in HW4]
eval [definition, in HW2]
example [definition, in HW4]
exp [inductive, in HW2]


F

findUnitClause [definition, in HW6]
formula [definition, in HW6]
Fst [constructor, in HW5]
FuncDictionary [module, in HW7]


G

grand_challenge_problem [lemma, in HW1]


H

hasType [inductive, in HW5]
hasType [inductive, in HW5]
hasType_wellFormed [lemma, in HW5]
hasType_wellFormed [lemma, in HW5]
Him [constructor, in HW5]
HT_App [constructor, in HW5]
HT_App [constructor, in HW5]
HT_Const [constructor, in HW5]
HT_Const [constructor, in HW5]
HT_Fst [constructor, in HW5]
HT_Lam [constructor, in HW5]
HT_Lam [constructor, in HW5]
HT_Pair [constructor, in HW5]
HT_Snd [constructor, in HW5]
HT_Var [constructor, in HW5]
HT_Var [constructor, in HW5]
HW0 [library]
HW1 [library]
HW2 [library]
HW3 [library]
HW4 [library]
HW5 [library]
HW6 [library]
HW7 [library]


I

indeed [lemma, in HW1]
insert [definition, in HW2]
insert_increases [lemma, in HW2]
insert_ordered [lemma, in HW2]
interp_alist [definition, in HW6]
isNil [definition, in HW6]


L

Lam [constructor, in HW5]
Lam [constructor, in HW5]
last [axiom, in HW3]
lasts_agree1 [lemma, in HW3]
lasts_agree2 [lemma, in HW3]
last_f [axiom, in HW3]
Leaf [constructor, in HW2]
Leaf_neq_Node [lemma, in HW2]
list [inductive, in HW0]
list [inductive, in HW2]
ListDictionary [module, in HW7]
lit [definition, in HW6]
lookup [definition, in HW7]
lookup [inductive, in HW5]
lookup [inductive, in HW5]
lookup [definition, in HW7]
lookup [axiom, in HW7]
lookup' [definition, in HW7]
Lookup_O [constructor, in HW5]
Lookup_O [constructor, in HW5]
Lookup_S [constructor, in HW5]
Lookup_S [constructor, in HW5]


M

make_up_your_mind [lemma, in HW1]
Me [constructor, in HW5]
mp3 [lemma, in HW5]
my_list_ind [axiom, in HW4]
my_nat_ind [axiom, in HW4]


N

nasty [lemma, in HW1]
Nat [constructor, in HW5]
Nat [constructor, in HW5]
negate [definition, in HW6]
nil [constructor, in HW0]
Nil [constructor, in HW7]
nil [constructor, in HW2]
nobody [lemma, in HW1]
Node [constructor, in HW2]
Node_inj [lemma, in HW2]
not_and_or_not [lemma, in HW2]
no_identities [definition, in HW2]


O

ofcourse [lemma, in HW1]
one_or_the_other [lemma, in HW1]
ordered [definition, in HW2]
ordered' [definition, in HW2]
or_associates [lemma, in HW1]
or_commutes [lemma, in HW1]


P

Pair [constructor, in HW5]
permutation [axiom, in HW3]
permutation_reflexive [lemma, in HW3]
permutation_symmetric [lemma, in HW3]
permutation_transitive [lemma, in HW3]
PLC [module, in HW5]
Plus [constructor, in HW2]
Prod [constructor, in HW5]


R

reverse [definition, in HW2]
reverse' [definition, in HW2]
reverse'_correct [lemma, in HW2]
reverse'_helper [definition, in HW2]
reverse_congruence [lemma, in HW1]


S

satClause [definition, in HW6]
satFormula [definition, in HW6]
satLit [definition, in HW6]
satLit_contra [lemma, in HW6]
satLit_dec [lemma, in HW6]
satLit_idem_clause [lemma, in HW6]
satLit_idem_formula [lemma, in HW6]
satLit_idem_lit [lemma, in HW6]
satLit_upd_eq [lemma, in HW6]
satLit_upd_neq [lemma, in HW6]
satLit_upd_neq2 [lemma, in HW6]
setClause [definition, in HW6]
setClauseSimple [definition, in HW6]
setFormula [definition, in HW6]
setFormulaSimple [definition, in HW6]
simplify_identities [definition, in HW2]
simplify_identities_simplifies [lemma, in HW2]
simplify_identities_sound [lemma, in HW2]
size [definition, in HW2]
small_world [lemma, in HW1]
Snd [constructor, in HW5]
somebody [inductive, in HW5]
something_fishy [lemma, in HW1]
STLC [module, in HW5]
swap_quantifiers [lemma, in HW1]
swap_quantifiers [definition, in HW4]
swap_quantifiers2 [definition, in HW4]


T

term [inductive, in HW5]
term [inductive, in HW5]
term1 [definition, in HW4]
term2 [definition, in HW4]
term3 [definition, in HW4]
term4 [definition, in HW4]
testIt [lemma, in HW5]
Times [constructor, in HW2]
transpose [axiom, in HW3]
tree [inductive, in HW2]
truth [lemma, in HW1]
type [inductive, in HW5]
type [inductive, in HW5]


U

uniqueness [lemma, in HW5]
uniqueness [lemma, in HW5]
unitClauseTrue [lemma, in HW6]
unitPropagate [definition, in HW6]
unitPropagateSimple [definition, in HW6]
upd [definition, in HW6]


V

Var [constructor, in HW5]
var [definition, in HW6]
Var [constructor, in HW5]
Var [constructor, in HW2]
var [definition, in HW2]


W

wellFormed [inductive, in HW5]
wellFormed [inductive, in HW5]
WF_App [constructor, in HW5]
WF_App [constructor, in HW5]
WF_Const [constructor, in HW5]
WF_Const [constructor, in HW5]
WF_Fst [constructor, in HW5]
WF_Lam [constructor, in HW5]
WF_Lam [constructor, in HW5]
WF_Pair [constructor, in HW5]
WF_Snd [constructor, in HW5]
WF_Var [constructor, in HW5]
WF_Var [constructor, in HW5]


X

xor_not_eq [lemma, in HW2]



Axiom Index

A

add [in HW7]


D

dict [in HW7]
domain [in HW7]
domain [in HW7]
domain_eq_dec [in HW7]


E

empty [in HW7]


L

last [in HW3]
last_f [in HW3]
lookup [in HW7]


M

my_list_ind [in HW4]
my_nat_ind [in HW4]


P

permutation [in HW3]


T

transpose [in HW3]



Lemma Index

A

a [in HW5]
and_associates [in HW1]
append_associative [in HW2]
append_associative [in HW0]


C

coalesce1 [in HW1]
coalesce2 [in HW1]
constant_fold_simplifies [in HW2]
constant_fold_sound [in HW2]
contradiction_P [in HW1]
contradictory_assignment [in HW6]
contrapositive [in HW1]
cut_out_the_middle_man [in HW1]


G

grand_challenge_problem [in HW1]


H

hasType_wellFormed [in HW5]
hasType_wellFormed [in HW5]


I

indeed [in HW1]
insert_increases [in HW2]
insert_ordered [in HW2]


L

lasts_agree1 [in HW3]
lasts_agree2 [in HW3]
Leaf_neq_Node [in HW2]


M

make_up_your_mind [in HW1]
mp3 [in HW5]


N

nasty [in HW1]
nobody [in HW1]
Node_inj [in HW2]
not_and_or_not [in HW2]


O

ofcourse [in HW1]
one_or_the_other [in HW1]
or_associates [in HW1]
or_commutes [in HW1]


P

permutation_reflexive [in HW3]
permutation_symmetric [in HW3]
permutation_transitive [in HW3]


R

reverse'_correct [in HW2]
reverse_congruence [in HW1]


S

satLit_contra [in HW6]
satLit_dec [in HW6]
satLit_idem_clause [in HW6]
satLit_idem_formula [in HW6]
satLit_idem_lit [in HW6]
satLit_upd_eq [in HW6]
satLit_upd_neq [in HW6]
satLit_upd_neq2 [in HW6]
simplify_identities_simplifies [in HW2]
simplify_identities_sound [in HW2]
small_world [in HW1]
something_fishy [in HW1]
swap_quantifiers [in HW1]


T

testIt [in HW5]
truth [in HW1]


U

uniqueness [in HW5]
uniqueness [in HW5]
unitClauseTrue [in HW6]


X

xor_not_eq [in HW2]



Constructor Index

A

App [in HW5]
App [in HW5]
Arrow [in HW5]
Arrow [in HW5]


C

cons [in HW2]
Cons [in HW7]
cons [in HW0]
Const [in HW2]
Const [in HW5]
Const [in HW5]


F

Fst [in HW5]


H

Him [in HW5]
HT_App [in HW5]
HT_App [in HW5]
HT_Const [in HW5]
HT_Const [in HW5]
HT_Fst [in HW5]
HT_Lam [in HW5]
HT_Lam [in HW5]
HT_Pair [in HW5]
HT_Snd [in HW5]
HT_Var [in HW5]
HT_Var [in HW5]


L

Lam [in HW5]
Lam [in HW5]
Leaf [in HW2]
Lookup_O [in HW5]
Lookup_O [in HW5]
Lookup_S [in HW5]
Lookup_S [in HW5]


M

Me [in HW5]


N

Nat [in HW5]
Nat [in HW5]
nil [in HW0]
Nil [in HW7]
nil [in HW2]
Node [in HW2]


P

Pair [in HW5]
Plus [in HW2]
Prod [in HW5]


S

Snd [in HW5]


T

Times [in HW2]


V

Var [in HW5]
Var [in HW5]
Var [in HW2]


W

WF_App [in HW5]
WF_App [in HW5]
WF_Const [in HW5]
WF_Const [in HW5]
WF_Fst [in HW5]
WF_Lam [in HW5]
WF_Lam [in HW5]
WF_Pair [in HW5]
WF_Snd [in HW5]
WF_Var [in HW5]
WF_Var [in HW5]



Inductive Index

D

dict' [in HW7]


E

exp [in HW2]


H

hasType [in HW5]
hasType [in HW5]


L

list [in HW0]
list [in HW2]
lookup [in HW5]
lookup [in HW5]


S

somebody [in HW5]


T

term [in HW5]
term [in HW5]
tree [in HW2]
type [in HW5]
type [in HW5]


W

wellFormed [in HW5]
wellFormed [in HW5]



Definition Index

A

add [in HW7]
add [in HW7]
alist [in HW6]
append [in HW2]
append [in HW0]
asgn [in HW6]


B

bool_and [in HW2]
bool_eq [in HW2]
bool_eq_dec [in HW6]
bool_not [in HW2]
bool_or [in HW2]
bool_xor [in HW2]
boundedSat [in HW6]
boundedSatSimple [in HW6]


C

chooseSplit [in HW6]
clause [in HW6]
constant_fold [in HW2]
constant_folded [in HW2]
context [in HW5]
context [in HW5]


D

dict [in HW7]
dict [in HW7]
domain [in HW7]
domain [in HW7]
domain [in HW7]
domain [in HW7]


E

empty [in HW7]
empty [in HW7]
eq_transitive [in HW4]
eval [in HW2]
example [in HW4]


F

findUnitClause [in HW6]
formula [in HW6]


I

insert [in HW2]
interp_alist [in HW6]
isNil [in HW6]


L

lit [in HW6]
lookup [in HW7]
lookup [in HW7]
lookup' [in HW7]


N

negate [in HW6]
no_identities [in HW2]


O

ordered [in HW2]
ordered' [in HW2]


R

reverse [in HW2]
reverse' [in HW2]
reverse'_helper [in HW2]


S

satClause [in HW6]
satFormula [in HW6]
satLit [in HW6]
setClause [in HW6]
setClauseSimple [in HW6]
setFormula [in HW6]
setFormulaSimple [in HW6]
simplify_identities [in HW2]
size [in HW2]
swap_quantifiers [in HW4]
swap_quantifiers2 [in HW4]


T

term1 [in HW4]
term2 [in HW4]
term3 [in HW4]
term4 [in HW4]


U

unitPropagate [in HW6]
unitPropagateSimple [in HW6]
upd [in HW6]


V

var [in HW6]
var [in HW2]



Module Index

D

DICTIONARY [in HW7]
DICTIONARY_PARAM [in HW7]


F

FuncDictionary [in HW7]


L

ListDictionary [in HW7]


P

PLC [in HW5]


S

STLC [in HW5]



Library Index

H

HW0
HW1
HW2
HW3
HW4
HW5
HW6
HW7



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 _ (221 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 _ (13 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 _ (55 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 _ (56 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 _ (16 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 _ (67 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 _ (6 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 _ (8 entries)

This page has been generated by coqdoc