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 _ other (2696 entries)
Instance 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 _ other (14 entries)
Projection 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 _ other (146 entries)
Record 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 _ other (48 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 _ other (96 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 _ other (1006 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 _ other (304 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 _ other (117 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 _ other (584 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 _ other (33 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 _ other (52 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 _ other (267 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 _ other (29 entries)

Global Index

A

A [variable, in compcert]
accessable [projection, in prelim]
accessable_refl [projection, in prelim]
accessable_trans [projection, in prelim]
adequacy [lemma, in strong_bisim]
adequate_bisimulation [lemma, in strong_bisim]
all_closed_closed [lemma, in bourbaki]
all_closed_x0 [lemma, in bourbaki]
all_closed [definition, in bourbaki]
all_closed_chain [lemma, in bourbaki]
and_ext' [lemma, in base]
and_ext [lemma, in base]
asdf [definition, in ref_alternatives]
asdf' [definition, in ref_alternatives]
atom [projection, in prelim]


B

back_forth_bisim [library]
back_forth_ref [library]
bar [definition, in bar_induction]
bar_induction.inclUY [variable, in bar_induction]
bar_induction.U [variable, in bar_induction]
bar_induction.A [variable, in bar_induction]
bar_induction [section, in bar_induction]
bar_securable [projection, in bar_induction]
bar_induction.Bw [variable, in bar_induction]
bar_induction_brouwer [lemma, in bar_induction]
bar_induction.R [variable, in bar_induction]
bar_induction.Y [variable, in bar_induction]
bar_induction [lemma, in bar_induction]
bar_induction.monoU [variable, in bar_induction]
bar_induction_statement [definition, in bar_induction]
bar_induction.heredY [variable, in bar_induction]
bar_induction [library]
base [library]
BF_REF_LOGIC.dia [constructor, in bf_ref_logic]
BF_DIV_LOGIC.bf_div_logic.adequacy [section, in bf_div_logic]
BF_DIV_LOGIC.dia [constructor, in bf_div_logic]
BF_BISIM.curr_path [lemma, in back_forth_bisim]
BF_REF.bf_ref.bf_to_branch.HRX [variable, in back_forth_ref]
BF_REF.div_back_ref_eq [lemma, in back_forth_ref]
BF_REF.step_run_acyclic_bisimilar [lemma, in back_forth_ref]
BF_REF_LOGIC.bf_ref_logic.safeify.X [variable, in bf_ref_logic]
BF_LOGIC.bf_logic.characteristic.X [variable, in bf_logic]
BF_REF.div_back_eq [lemma, in back_forth_ref]
BF_REF.safe_run_may_extend_star [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_branch.HR [variable, in back_forth_bisim]
BF_REF_DIV_LOGIC.dia [constructor, in bf_ref_div_logic]
BF_DIV_LOGIC.box_back [constructor, in bf_div_logic]
BF_BISIM.Xclosure_back_sim' [lemma, in back_forth_bisim]
BF_REF.bf_branch_related_runs_bisim [lemma, in back_forth_ref]
BF_REF.safe_run [definition, in back_forth_ref]
BF_REF.bf_to_branch_forward [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_related_preruns.H [variable, in back_forth_bisim]
BF_REF.extended_run_push2 [lemma, in back_forth_ref]
BF_DIV_LOGIC.adequate2 [lemma, in bf_div_logic]
BF_BISIM.extended_run_push2 [lemma, in back_forth_bisim]
BF_REF_LOGIC.safety_safe_prerun [lemma, in bf_ref_logic]
BF_DIV_LOGIC.bf_div_logic [section, in bf_div_logic]
BF_REF_LOGIC.safeify_state [definition, in bf_ref_logic]
BF_REF_LOGIC.safeify_safe [lemma, in bf_ref_logic]
BF_REF_LOGIC.safety [definition, in bf_ref_logic]
BF_REF.bf_branch_related_runs [lemma, in back_forth_ref]
BF_REF.bf_ref.bf_to_div.Y [variable, in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter.X [variable, in back_forth_bisim]
BF_BISIM.bf_to_related_runs [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.R [variable, in bf_ref_div_logic]
BF_BISIM.bf_bisim.bf_to_related_preruns.R [variable, in back_forth_bisim]
BF_REF.bf_to_branch_sim [lemma, in back_forth_ref]
BF_DIV_LOGIC.bf_div_logic.mu_calc [section, in bf_div_logic]
BF_REF_LOGIC.bf_ref_logic [section, in bf_ref_logic]
BF_BISIM.Xclosure [definition, in back_forth_bisim]
BF_REF.bf_branch_related_runs_div [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_branch.Y [variable, in back_forth_bisim]
BF_REF.bf_ref.X_stutter.HR [variable, in back_forth_ref]
BF_REF.bf_run_bisim_div_trans [lemma, in back_forth_ref]
BF_BISIM.Xclosure_bf_sim' [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.Hfin1 [variable, in bf_ref_div_logic]
BF_REF.branch_to_forth' [lemma, in back_forth_ref]
BF_REF.Xclosure_bf_sim [lemma, in back_forth_ref]
BF_BISIM.bf_sim_div [definition, in back_forth_bisim]
BF_REF_DIV_LOGIC.adequacy [lemma, in bf_ref_div_logic]
BF_REF_LOGIC.models_denotable [lemma, in bf_ref_logic]
BF_REF_DIV_LOGIC.CF [definition, in bf_ref_div_logic]
BF_BISIM.bf_bisim [section, in back_forth_bisim]
BF_REF_LOGIC.safe_world [definition, in bf_ref_logic]
BF_REF.Xclosure_incl [lemma, in back_forth_ref]
BF_DIV_LOGIC.CF_is_characteristic [lemma, in bf_div_logic]
BF_REF.branch_ind_div_bisim [lemma, in back_forth_ref]
BF_REF.bf_to_branch_curr [lemma, in back_forth_ref]
BF_REF.remove_tau_cycle_must [lemma, in back_forth_ref]
BF_BISIM.bf_bisimilar_div [definition, in back_forth_bisim]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.X [variable, in bf_ref_div_logic]
BF_REF_LOGIC.bf_ref_div_logic_input [instance, in bf_ref_logic]
BF_REF_LOGIC.completeness [lemma, in bf_ref_logic]
BF_BISIM.bf_bisim.bf_to_branch.HRX [variable, in back_forth_bisim]
BF_REF.div_back' [definition, in back_forth_ref]
BF_BISIM.bf_bisim_div_eq [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.box [constructor, in bf_ref_div_logic]
BF_BISIM.forth' [definition, in back_forth_bisim]
BF_REF.safe_run_weak_may_extend [lemma, in back_forth_ref]
BF_REF_DIV_LOGIC.proof_dual2 [lemma, in bf_ref_div_logic]
BF_REF_LOGIC.safeify_prerun [definition, in bf_ref_logic]
BF_REF_LOGIC.safeify_run_safe [lemma, in bf_ref_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic.E0 [variable, in bf_ref_div_logic]
BF_REF_DIV_LOGIC.CF_body [definition, in bf_ref_div_logic]
BF_LOGIC.characteristic_other [lemma, in bf_logic]
BF_BISIM.bf_bisim.branch_to_bf.X [variable, in back_forth_bisim]
BF_REF.bf_ref.bf_to_branch [section, in back_forth_ref]
BF_REF.run_refines_safe [lemma, in back_forth_ref]
BF_REF.div_forth'_comp [lemma, in back_forth_ref]
BF_REF.branch_to_bf [lemma, in back_forth_ref]
BF_BISIM.bf_related_runs [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.characteristic_self [lemma, in bf_ref_div_logic]
BF_BISIM.bf_bisimilar_div_refl [lemma, in back_forth_bisim]
BF_BISIM.bf_bisim.X_stutter.R [variable, in back_forth_bisim]
BF_LOGIC.CF_main [definition, in bf_logic]
BF_REF.bf_branch_related_runs2 [lemma, in back_forth_ref]
BF_REF.safe_run_weak_may_extend' [lemma, in back_forth_ref]
BF_BISIM.bf_bisim_div_comp [lemma, in back_forth_bisim]
BF_BISIM.bf_bisim_comp [lemma, in back_forth_bisim]
BF_BISIM.bf_sim_div_comp [lemma, in back_forth_bisim]
BF_REF.curr_path [lemma, in back_forth_ref]
BF_REF_LOGIC.CF_body [definition, in bf_ref_logic]
BF_REF_LOGIC.safety_safe_curr [lemma, in bf_ref_logic]
BF_REF.back' [definition, in back_forth_ref]
BF_REF.bf_ref.bf_to_branch.R [variable, in back_forth_ref]
BF_REF.back'_back [lemma, in back_forth_ref]
BF_REF.safe_prerun [definition, in back_forth_ref]
BF_REF.bf_to_condD1 [lemma, in back_forth_ref]
BF_REF_LOGIC.safeify_refines [lemma, in bf_ref_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic.E1 [variable, in bf_ref_div_logic]
BF_REF.bf_ref.X_stutter.R [variable, in back_forth_ref]
BF_BISIM.bf_bisim.branch_to_bf.R [variable, in back_forth_bisim]
BF_REF.bf_ref.branch_to_bf [section, in back_forth_ref]
BF_BISIM.Xclosure_property [lemma, in back_forth_bisim]
BF_BISIM.bf_to_branch_bisimilar [lemma, in back_forth_bisim]
BF_REF.Xproperty_stutter' [lemma, in back_forth_ref]
BF_DIV_LOGIC.CF_body [definition, in bf_div_logic]
BF_REF_DIV_LOGIC.characteristic_other [lemma, in bf_ref_div_logic]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.R [variable, in bf_div_logic]
BF_BISIM.Xclosure_bf_bisim [lemma, in back_forth_bisim]
BF_REF.bf_ref.bf_to_branch.X [variable, in back_forth_ref]
BF_BISIM.bf_bisim.branch_to_bf.HR [variable, in back_forth_bisim]
BF_LOGIC.dia_back [constructor, in bf_logic]
BF_BISIM.bf_bisim.bf_to_related_preruns.Y [variable, in back_forth_bisim]
BF_BISIM.back_sim'_sim [lemma, in back_forth_bisim]
BF_LOGIC.models_denotable [lemma, in bf_logic]
BF_BISIM.branch_to_bf_bisim [lemma, in back_forth_bisim]
BF_REF.bf_div_related_runs [lemma, in back_forth_ref]
BF_BISIM.bf_bisimilar_bisimulation [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.div [constructor, in bf_ref_div_logic]
BF_REF.back [definition, in back_forth_ref]
BF_BISIM.bf_bisim_div_div' [lemma, in back_forth_bisim]
BF_REF.bf_ref.branch_to_bf.R [variable, in back_forth_ref]
BF_REF.bf_bisimilar_div_refl [lemma, in back_forth_ref]
BF_REF.bf_to_branch_backward [lemma, in back_forth_ref]
BF_REF.bf_ref.bf_to_branch.R' [variable, in back_forth_ref]
BF_BISIM.bf_bisim_div' [definition, in back_forth_bisim]
BF_DIV_LOGIC.adequacy_div1 [lemma, in bf_div_logic]
BF_REF.extended_star_length_le [lemma, in back_forth_ref]
BF_REF.back_forth [definition, in back_forth_ref]
BF_BISIM.bf_branch_related_runs_div1 [lemma, in back_forth_bisim]
BF_REF.bf_to_related_preruns [lemma, in back_forth_ref]
BF_REF.back_back' [lemma, in back_forth_ref]
BF_DIV_LOGIC.adequacy_div2 [lemma, in bf_div_logic]
BF_REF.bf_ref.branch_to_bf.HR [variable, in back_forth_ref]
BF_REF.back_forth_div' [definition, in back_forth_ref]
BF_REF.forth2 [definition, in back_forth_ref]
BF_LOGIC.CF_body [definition, in bf_logic]
BF_BISIM.bf_bisimilar_simulation [lemma, in back_forth_bisim]
BF_REF_LOGIC.weak_may_extend_initial [lemma, in bf_ref_logic]
BF_REF_LOGIC.bf_ref_logic.E0 [variable, in bf_ref_logic]
BF_REF.back_forth'_div_comp [lemma, in back_forth_ref]
BF_BISIM.forth [definition, in back_forth_bisim]
BF_REF_LOGIC.characteristic_self [lemma, in bf_ref_logic]
BF_LOGIC.CF [definition, in bf_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic.X [variable, in bf_ref_div_logic]
BF_REF.extended_run_star_decompose_must [lemma, in back_forth_ref]
BF_LOGIC.bf_logic.characteristic.E0 [variable, in bf_logic]
BF_REF_LOGIC.safeify_run_acc [lemma, in bf_ref_logic]
BF_BISIM.bf_bisimilar_div_trans [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.models_denotable [lemma, in bf_ref_div_logic]
BF_REF.bf_ref.X_stutter.X [variable, in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter.HRX [variable, in back_forth_bisim]
BF_LOGIC.completeness [lemma, in bf_logic]
BF_BISIM.bf_bisim.X_stutter [section, in back_forth_bisim]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.Hfin1 [variable, in bf_div_logic]
BF_DIV_LOGIC.CF [definition, in bf_div_logic]
BF_REF.bisimilar_mono_fixpoint [lemma, in back_forth_ref]
BF_REF.bf_ref.bf_to_branch.Y [variable, in back_forth_ref]
BF_BISIM.back [definition, in back_forth_bisim]
BF_REF.forth1 [definition, in back_forth_ref]
BF_BISIM.Xclosure_bf_sim [lemma, in back_forth_bisim]
BF_REF.back_forth_inv [lemma, in back_forth_ref]
BF_REF.bf_branch_related_runs_div2 [lemma, in back_forth_ref]
BF_LOGIC.dia [constructor, in bf_logic]
BF_REF.td_and_mono [lemma, in back_forth_ref]
BF_LOGIC.CF_is_characteristic [lemma, in bf_logic]
BF_REF_LOGIC.proof_dual1 [lemma, in bf_ref_logic]
BF_REF_DIV_LOGIC.completeness [lemma, in bf_ref_div_logic]
BF_BISIM.bf_bisim.X_stutter.HR [variable, in back_forth_bisim]
BF_REF.bf_ref.bf_to_branch.HR1 [variable, in back_forth_ref]
BF_REF.back_forth' [definition, in back_forth_ref]
BF_REF.bf_ref.branch_to_bf.X [variable, in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter.Y [variable, in back_forth_bisim]
BF_REF_DIV_LOGIC.adequate2 [lemma, in bf_ref_div_logic]
BF_REF.bf_ref.X_stutter.Y [variable, in back_forth_ref]
BF_REF.step_run_remove_cycle [lemma, in back_forth_ref]
BF_BISIM.forth_sim_sim' [lemma, in back_forth_bisim]
BF_BISIM.related_runs_push [lemma, in back_forth_bisim]
BF_DIV_LOGIC.CF_main [definition, in bf_div_logic]
BF_REF_LOGIC.box_back [constructor, in bf_ref_logic]
BF_BISIM.remove_tau_cycle [lemma, in back_forth_bisim]
BF_LOGIC [module, in bf_logic]
BF_REF.div_back [definition, in back_forth_ref]
BF_REF.bf_ref.X_stutter.HRX [variable, in back_forth_ref]
BF_BISIM.remove_tau_prerun_cycle [lemma, in back_forth_bisim]
BF_REF_LOGIC.safety_safe_run [lemma, in bf_ref_logic]
BF_BISIM.bf_to_branch_sim [lemma, in back_forth_bisim]
BF_REF.bf_ref.bf_to_div [section, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_branch [section, in back_forth_bisim]
BF_REF_LOGIC.proof_dual2 [lemma, in bf_ref_logic]
BF_REF.bf_ref.bf_to_branch.HR2 [variable, in back_forth_ref]
BF_REF.weak_must_extend_finite [lemma, in back_forth_ref]
BF_REF_LOGIC.CF_main [definition, in bf_ref_logic]
BF_LOGIC.proof_dual2 [lemma, in bf_logic]
BF_REF.td_mono [definition, in back_forth_ref]
BF_REF.bf_ref.branch_to_bf.Y [variable, in back_forth_ref]
BF_REF.related_runs_append [lemma, in back_forth_ref]
BF_REF.bf_div_ref_eq [lemma, in back_forth_ref]
BF_REF.back_forth_div [definition, in back_forth_ref]
BF_REF.Xclosure_forth_sim [lemma, in back_forth_ref]
BF_REF_LOGIC.safeify_safe' [lemma, in bf_ref_logic]
BF_REF.remove_tau_prerun_cycle [lemma, in back_forth_ref]
BF_REF.weak_may_extend_finite [lemma, in back_forth_ref]
BF_REF.safe_run_may_extend [lemma, in back_forth_ref]
BF_REF.extended_run_push2' [lemma, in back_forth_ref]
BF_REF.branch_to_back' [lemma, in back_forth_ref]
BF_REF.bf_bf' [lemma, in back_forth_ref]
BF_REF.Xclosure_back_sim [lemma, in back_forth_ref]
BF_REF.bisimilar_div_bisimulation [lemma, in back_forth_ref]
BF_BISIM.branch_to_bf_bisimilar [lemma, in back_forth_bisim]
BF_REF.bf_ref.bf_to_related_preruns [section, in back_forth_ref]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.Y [variable, in bf_ref_div_logic]
BF_BISIM.Xclosure_incl [lemma, in back_forth_bisim]
BF_BISIM.back_forth_div' [definition, in back_forth_bisim]
BF_REF.div_forth [definition, in back_forth_ref]
BF_REF.bf'_bf [lemma, in back_forth_ref]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner [section, in bf_div_logic]
BF_REF.div_forth_ref_eq [lemma, in back_forth_ref]
BF_REF.step_run_acyclic_bisimilar_must [lemma, in back_forth_ref]
BF_LOGIC.proof_dual1 [lemma, in bf_logic]
BF_BISIM.back_related_runs [lemma, in back_forth_bisim]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic [section, in bf_div_logic]
BF_REF.bf_ref.bf_to_related_preruns.H [variable, in back_forth_ref]
BF_REF_LOGIC.safe_run_initial [lemma, in bf_ref_logic]
BF_BISIM.bf_sim_comp [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.adequate1 [lemma, in bf_ref_div_logic]
BF_BISIM.extended_run_step_run [lemma, in back_forth_bisim]
BF_BISIM.step_run_remove_cycle [lemma, in back_forth_bisim]
BF_BISIM.bf_sim_div_eq [lemma, in back_forth_bisim]
BF_REF_LOGIC.safeify [definition, in bf_ref_logic]
BF_REF.run_bisim_ref [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.branch_to_bf.Y [variable, in back_forth_bisim]
BF_LOGIC.BackForth_LogicInput [instance, in bf_logic]
BF_REF.forth [definition, in back_forth_ref]
BF_REF_DIV_LOGIC.bf_interp_mode [definition, in bf_ref_div_logic]
BF_BISIM.step_run_acyclic_bisimilar [lemma, in back_forth_bisim]
BF_REF.bf_ref.bf_to_div.H [variable, in back_forth_ref]
BF_REF.run_ref_bisim [lemma, in back_forth_ref]
BF_REF_DIV_LOGIC.bf_ref_div_logic [section, in bf_ref_div_logic]
BF_REF.safe_run_may_extend_star' [lemma, in back_forth_ref]
BF_DIV_LOGIC.models_denotable [lemma, in bf_div_logic]
BF_LOGIC.interp_bf_mode [definition, in bf_logic]
BF_REF_LOGIC.classical_world [definition, in bf_ref_logic]
BF_BISIM.back_forth_div [definition, in back_forth_bisim]
BF_REF_LOGIC.bf_ref_logic.characteristic [section, in bf_ref_logic]
BF_BISIM.back_sim_sim' [lemma, in back_forth_bisim]
BF_REF.bf_ref.bf_to_related_preruns.R [variable, in back_forth_ref]
BF_REF.bf_to_condD1' [lemma, in back_forth_ref]
BF_DIV_LOGIC.adequate3 [lemma, in bf_div_logic]
BF_BISIM.back_forth [definition, in back_forth_bisim]
BF_REF.branch_to_bf_start [lemma, in back_forth_ref]
BF_REF.bf_div_forth_related_runs [lemma, in back_forth_ref]
BF_REF_LOGIC.safe_classical [lemma, in bf_ref_logic]
BF_BISIM.bf_sim_eq [lemma, in back_forth_bisim]
BF_REF.bf_ref.bf_to_related_preruns.R' [variable, in back_forth_ref]
BF_REF.step_run_decompose_must [lemma, in back_forth_ref]
BF_REF_DIV_LOGIC.dia_back [constructor, in bf_ref_div_logic]
BF_DIV_LOGIC.completeness [lemma, in bf_div_logic]
BF_REF.bf_div_back_related_runs [lemma, in back_forth_ref]
BF_REF_LOGIC.box [constructor, in bf_ref_logic]
BF_REF.safe_run_may_extend' [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_related_preruns [section, in back_forth_bisim]
BF_LOGIC.bf_logic [section, in bf_logic]
BF_REF.remove_tau_prerun_cycle_must [lemma, in back_forth_ref]
BF_BISIM.bf_branch_related_runs_div2 [lemma, in back_forth_bisim]
BF_BISIM.bf_bisim_eq [lemma, in back_forth_bisim]
BF_REF.Xproperty [definition, in back_forth_ref]
BF_REF.bf_ref.bf_to_related_preruns.X [variable, in back_forth_ref]
BF_REF.Xclosure_property [lemma, in back_forth_ref]
BF_REF.bf_ref_trans [lemma, in back_forth_ref]
BF_REF.Xclosure [definition, in back_forth_ref]
BF_REF.bf_branch_related_runs_div_bisim [lemma, in back_forth_ref]
BF_LOGIC.bf_logic.characteristic.E1 [variable, in bf_logic]
BF_DIV_LOGIC.adequate1 [lemma, in bf_div_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.Hfin2 [variable, in bf_ref_div_logic]
BF_REF_DIV_LOGIC [module, in bf_ref_div_logic]
BF_LOGIC.characteristic_self [lemma, in bf_logic]
BF_REF.extended_run_push1' [lemma, in back_forth_ref]
BF_REF_LOGIC.CF_is_characteristic [lemma, in bf_ref_logic]
BF_REF.bf_sim_comp [lemma, in back_forth_ref]
BF_DIV_LOGIC.bf_mode [inductive, in bf_div_logic]
BF_REF.step_run_remove_cycle_must [lemma, in back_forth_ref]
BF_REF.div_forth' [definition, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_branch.X [variable, in back_forth_bisim]
BF_REF_LOGIC.safe_classification [lemma, in bf_ref_logic]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic.E0 [variable, in bf_div_logic]
BF_REF_LOGIC.bf_ref_logic.characteristic.E1 [variable, in bf_ref_logic]
BF_DIV_LOGIC.DivBackForth_LogicInput [instance, in bf_div_logic]
BF_REF.extended_run_push1 [lemma, in back_forth_ref]
BF_REF.bf_ref.bf_to_div.H0 [variable, in back_forth_ref]
BF_REF.bf_div_refl [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_related_preruns.R' [variable, in back_forth_bisim]
BF_REF.related_runs_push [lemma, in back_forth_ref]
BF_BISIM.bf_to_related_preruns [lemma, in back_forth_bisim]
BF_REF_LOGIC.initial_state_prerun [definition, in bf_ref_logic]
BF_REF.forth'_forth [lemma, in back_forth_ref]
BF_DIV_LOGIC.characteristic_self [lemma, in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.Hfin2 [variable, in bf_div_logic]
BF_REF_LOGIC.CF [definition, in bf_ref_logic]
BF_REF_LOGIC.may_extend_initial [lemma, in bf_ref_logic]
BF_BISIM.Xproperty_stutter [lemma, in back_forth_bisim]
BF_REF_LOGIC.safeify_run [definition, in bf_ref_logic]
BF_BISIM.bf_bisim_trans [lemma, in back_forth_bisim]
BF_REF.weak_image_finite_acyclic_runs_must [lemma, in back_forth_ref]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic.E1 [variable, in bf_div_logic]
BF_REF.bf_sim_eq [lemma, in back_forth_ref]
BF_LOGIC.bf_logic.characteristic [section, in bf_logic]
BF_REF.weak_image_finite_acyclic_extensions_must [lemma, in back_forth_ref]
BF_REF.bf_ref.bf_to_related_preruns.Y [variable, in back_forth_ref]
BF_REF_DIV_LOGIC.box_back [constructor, in bf_ref_div_logic]
BF_REF_LOGIC.bf_interp_mode [definition, in bf_ref_logic]
BF_BISIM.bf_bisim.bf_to_branch.R [variable, in back_forth_bisim]
BF_DIV_LOGIC.characteristic_other [lemma, in bf_div_logic]
BF_REF_LOGIC.dia_back [constructor, in bf_ref_logic]
BF_REF_LOGIC.safeify_steps [definition, in bf_ref_logic]
BF_BISIM.bf_bisimilar_div' [definition, in back_forth_bisim]
BF_BISIM.back' [definition, in back_forth_bisim]
BF_REF.bf_ref [section, in back_forth_ref]
BF_BISIM.bf_sim_sim' [lemma, in back_forth_bisim]
BF_REF.bf_branch_related_runs_div1 [lemma, in back_forth_ref]
BF_BISIM.bf_sim_div' [definition, in back_forth_bisim]
BF_BISIM.bf_branch_related_runs_div [lemma, in back_forth_bisim]
BF_REF.forth' [definition, in back_forth_ref]
BF_REF.bf_ref.bf_to_div.H1 [variable, in back_forth_ref]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic.X [variable, in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.X [variable, in bf_div_logic]
BF_REF_LOGIC.characteristic_other [lemma, in bf_ref_logic]
BF_REF_LOGIC.bf_ref_logic.characteristic.X [variable, in bf_ref_logic]
BF_REF.div_forth_eq [lemma, in back_forth_ref]
BF_BISIM [module, in back_forth_bisim]
BF_REF.bf_ref.bf_to_div.R [variable, in back_forth_ref]
BF_REF.Xproperty_stutter [lemma, in back_forth_ref]
BF_REF.bf_ref.X_stutter [section, in back_forth_ref]
BF_REF.curr_path' [lemma, in back_forth_ref]
BF_DIV_LOGIC.interp_bf_mode [definition, in bf_div_logic]
BF_BISIM.extended_run_push1 [lemma, in back_forth_bisim]
BF_LOGIC.box_back [constructor, in bf_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner [section, in bf_ref_div_logic]
BF_REF.bf_bisimilar_simulation [lemma, in back_forth_ref]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy [section, in bf_ref_div_logic]
BF_BISIM.forth_sim'_sim [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.conv [constructor, in bf_ref_div_logic]
BF_DIV_LOGIC.adequacy [lemma, in bf_div_logic]
BF_DIV_LOGIC.dual1 [lemma, in bf_div_logic]
BF_BISIM.extended_star_length_le [lemma, in back_forth_bisim]
BF_BISIM.bf_bisim_bisim' [lemma, in back_forth_bisim]
BF_REF.div_back'_comp [lemma, in back_forth_ref]
BF_BISIM.step_run_finite [lemma, in back_forth_bisim]
BF_REF_DIV_LOGIC.adequacy_div1 [lemma, in bf_ref_div_logic]
BF_REF [module, in back_forth_ref]
BF_BISIM.bf_sim_div_div' [lemma, in back_forth_bisim]
BF_BISIM.bf_bisim_div [definition, in back_forth_bisim]
BF_BISIM.bf_branch_related_runs [lemma, in back_forth_bisim]
BF_BISIM.back_forth_div_Xclosure [lemma, in back_forth_bisim]
BF_REF_LOGIC.safety_defined [lemma, in bf_ref_logic]
BF_REF_LOGIC.classical_safety [lemma, in bf_ref_logic]
BF_REF_LOGIC.safe_run_model [definition, in bf_ref_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic [section, in bf_ref_div_logic]
BF_REF.bf_to_branch [lemma, in back_forth_ref]
BF_REF_LOGIC.unsafeify [definition, in bf_ref_logic]
BF_DIV_LOGIC [module, in bf_div_logic]
BF_REF_LOGIC.mk_safeify [definition, in bf_ref_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic_input [instance, in bf_ref_div_logic]
BF_BISIM.back_forth' [definition, in back_forth_bisim]
BF_REF.bf_to_related_runs [lemma, in back_forth_ref]
BF_REF.extended_run_decompose_must [lemma, in back_forth_ref]
BF_REF_DIV_LOGIC.CF_main [definition, in bf_ref_div_logic]
BF_REF_DIV_LOGIC.CF_is_characteristic [lemma, in bf_ref_div_logic]
BF_REF.weak_must_extend_start_append [lemma, in back_forth_ref]
BF_BISIM.Xproperty [definition, in back_forth_bisim]
BF_REF.bf_ref.bf_to_div.R' [variable, in back_forth_ref]
BF_REF.forth_forth' [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_related_preruns.X [variable, in back_forth_bisim]
BF_BISIM.branch_to_bf_sim [lemma, in back_forth_bisim]
BF_BISIM.bf_bisim_refl [lemma, in back_forth_bisim]
BF_BISIM.Xclosure_forth_sim' [lemma, in back_forth_bisim]
BF_REF_LOGIC.neg_safety_unsat [lemma, in bf_ref_logic]
BF_REF.bf_div_trans [lemma, in back_forth_ref]
BF_BISIM.bf_bisim.branch_to_bf [section, in back_forth_bisim]
BF_REF_DIV_LOGIC.bf_mode [inductive, in bf_ref_div_logic]
BF_REF_LOGIC.bf_mode [inductive, in bf_ref_logic]
BF_REF_DIV_LOGIC.proof_dual1 [lemma, in bf_ref_div_logic]
BF_REF.bf_ref.bf_to_div.X [variable, in back_forth_ref]
BF_BISIM.inv_Xclosure [lemma, in back_forth_bisim]
BF_REF.bf_ref_refl [lemma, in back_forth_ref]
BF_REF_LOGIC.bf_ref_logic.safeify [section, in bf_ref_logic]
BF_BISIM.bf_to_branch_bisim [lemma, in back_forth_bisim]
BF_DIV_LOGIC.conv [constructor, in bf_div_logic]
BF_REF_LOGIC [module, in bf_ref_logic]
BF_DIV_LOGIC.dia_back [constructor, in bf_div_logic]
BF_LOGIC.box [constructor, in bf_logic]
BF_LOGIC.bf_mode [inductive, in bf_logic]
BF_BISIM.bf_branch_related_runs2 [lemma, in back_forth_bisim]
BF_DIV_LOGIC.dual2 [lemma, in bf_div_logic]
BF_DIV_LOGIC.div [constructor, in bf_div_logic]
BF_REF.remove_tau_cycle [lemma, in back_forth_ref]
BF_DIV_LOGIC.box [constructor, in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.Y [variable, in bf_div_logic]
BF_BISIM.bf_sim'_sim [lemma, in back_forth_bisim]
BF_DIV_LOGIC.adequate4 [lemma, in bf_div_logic]
BF_REF_LOGIC.initial_state [definition, in bf_ref_logic]
BF_REF.bf_ref.bf_to_branch.HR [variable, in back_forth_ref]
bf_div_logic [library]
bf_logic [library]
bf_ref_div_logic [library]
bf_ref_logic [library]
bisimilar [definition, in strong_bisim]
bisimilar_refl [lemma, in strong_bisim]
bisimilar_sym [lemma, in strong_bisim]
bisimilar_trans [lemma, in strong_bisim]
bisimilar_bisimulation [lemma, in strong_bisim]
bisimulation [definition, in strong_bisim]
both [definition, in ref_alternatives]
bourbaki [lemma, in bourbaki]
bourbaki [section, in bourbaki]
bourbaki [library]
bourbaki.A [variable, in bourbaki]
bourbaki.chain_complete [variable, in bourbaki]
bourbaki.choose [variable, in bourbaki]
bourbaki.classic [variable, in bourbaki]
bourbaki.fixpoint [section, in bourbaki]
bourbaki.fixpoint.f [variable, in bourbaki]
bourbaki.fixpoint.f_inflate [variable, in bourbaki]
bourbaki.fixpoint.f_iso [variable, in bourbaki]
bourbaki.fixpoint.normal1 [section, in bourbaki]
bourbaki.fixpoint.normal1.Hx [variable, in bourbaki]
bourbaki.fixpoint.normal1.Hy [variable, in bourbaki]
bourbaki.fixpoint.normal1.outer [variable, in bourbaki]
bourbaki.fixpoint.normal1.x [variable, in bourbaki]
bourbaki.fixpoint.normal1.y [variable, in bourbaki]
bourbaki.fixpoint.x0 [variable, in bourbaki]
bourbaki.fun_ext [variable, in bourbaki]
bourbaki.prop_ext [variable, in bourbaki]
bourbaki.R [variable, in bourbaki]
bourbaki.Rrefl [variable, in bourbaki]
bourbaki.Rtrans [variable, in bourbaki]
box [constructor, in strong_bisim]
BRANCH_REF.refines_div_refinement [lemma, in branch_ref]
BRANCH_BISIM.DX_interpolates [lemma, in branch_bisim]
BRANCH_REF.goes_wrong_step_star [lemma, in branch_ref]
BRANCH_BISIM.loop_bisimulation [lemma, in branch_bisim]
BRANCH_REF.safe_state [definition, in branch_ref]
BRANCH_REF.branch_forward_ind_ind [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim_compose [lemma, in branch_bisim]
BRANCH_BISIM.D0_ind_equiv_iff_brouwer_on_games [lemma, in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.Y [variable, in branch_bisim]
BRANCH_BISIM.bisimilar_change_cond_sim [lemma, in branch_bisim]
BRANCH_REF.safe_refines_defined [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.trans.R1 [variable, in branch_bisim]
BRANCH_BISIM.cond_D1 [definition, in branch_bisim]
BRANCH_REF.branch_no_stutter [definition, in branch_ref]
BRANCH_REF.wrong_rel' [inductive, in branch_ref]
BRANCH_REF.branch_ref.trans_forward.R2 [variable, in branch_ref]
BRANCH_BISIM.branch_bisim.D0_branch_ind [section, in branch_bisim]
BRANCH_BISIM.cond_D_D0 [lemma, in branch_bisim]
BRANCH_BISIM.sim_branch_stutter [lemma, in branch_bisim]
BRANCH_REF.refines_ind_mho [lemma, in branch_ref]
BRANCH_BISIM.ruleLTS [definition, in branch_bisim]
BRANCH_BISIM.rule_state_match [inductive, in branch_bisim]
BRANCH_REF.cond_D1' [definition, in branch_ref]
BRANCH_REF.Q2step2 [constructor, in branch_ref]
BRANCH_BISIM.equiv_trans [lemma, in branch_bisim]
BRANCH_BISIM.bisimilar_D1_cond_D0 [lemma, in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.y [variable, in branch_bisim]
BRANCH_REF.q1y [projection, in branch_ref]
BRANCH_BISIM.path_push_comp [lemma, in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.Y [variable, in branch_ref]
BRANCH_REF.wrong_rel_into' [constructor, in branch_ref]
BRANCH_REF.branch_forward_back_ind_wrong [lemma, in branch_ref]
BRANCH_BISIM.rsm_init [constructor, in branch_bisim]
BRANCH_BISIM.bisimilar_D1_refl [lemma, in branch_bisim]
BRANCH_BISIM.branch_sim_ind_bisimilar [lemma, in branch_bisim]
BRANCH_BISIM.bisim_D1_branch_ind [lemma, in branch_bisim]
BRANCH_REF.wrong_expands [definition, in branch_ref]
BRANCH_BISIM.branch_ind_compose_inner [lemma, in branch_bisim]
BRANCH_REF.Q2step [inductive, in branch_ref]
BRANCH_REF.cond_D2 [definition, in branch_ref]
BRANCH_REF.stuttering_push_left [lemma, in branch_ref]
BRANCH_REF.mkQ1 [constructor, in branch_ref]
BRANCH_REF.branch_ind_to_no_stutter [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_bisimulation_D [lemma, in branch_bisim]
BRANCH_BISIM.weak_converges [definition, in branch_bisim]
BRANCH_REF.wrong_rel_into [constructor, in branch_ref]
BRANCH_REF.cond_D1_stutter [lemma, in branch_ref]
BRANCH_REF.branch_forward_ind_intro [constructor, in branch_ref]
BRANCH_BISIM.branch_bisim.trans.Z [variable, in branch_bisim]
BRANCH_BISIM.quotient.in_quot [definition, in branch_bisim]
BRANCH_BISIM.bisimilar_branch_sim [lemma, in branch_bisim]
BRANCH_REF.Q2step6 [constructor, in branch_ref]
BRANCH_REF.branch_stutter_eq [lemma, in branch_ref]
BRANCH_REF.branch_backward_no_stutter [definition, in branch_ref]
BRANCH_BISIM.branch_ind [inductive, in branch_bisim]
BRANCH_BISIM.bisimilar_D1_eq [lemma, in branch_bisim]
BRANCH_BISIM.inv_stuttering [lemma, in branch_bisim]
BRANCH_REF.wrong_bisim [definition, in branch_ref]
BRANCH_REF.refines_refl [lemma, in branch_ref]
BRANCH_BISIM.stuttering_property [definition, in branch_bisim]
BRANCH_BISIM.is_branch_branch' [lemma, in branch_bisim]
BRANCH_REF.bisim_ind_trans [lemma, in branch_ref]
BRANCH_REF [module, in branch_ref]
BRANCH_BISIM.rule_step [constructor, in branch_bisim]
BRANCH_REF.branch_forward_ind [inductive, in branch_ref]
BRANCH_BISIM.quotient.quot_step [inductive, in branch_bisim]
BRANCH_REF.branch_wrong [definition, in branch_ref]
BRANCH_BISIM.branch_ind_securable [lemma, in branch_bisim]
BRANCH_BISIM.bisimilar_ind_trans [lemma, in branch_bisim]
BRANCH_BISIM.quotient.quotient [section, in branch_bisim]
BRANCH_REF.branch_D1_forward_ind [lemma, in branch_ref]
BRANCH_REF.branch_ref.trans_backward.R1 [variable, in branch_ref]
BRANCH_BISIM.D0_to_brouwer.D0_sim_implies_ind_sim [variable, in branch_bisim]
BRANCH_BISIM.bisimulation_bisimilar_D1 [lemma, in branch_bisim]
BRANCH_BISIM.bisimilar_D0_D1 [lemma, in branch_bisim]
BRANCH_REF.branch_div_ind [lemma, in branch_ref]
BRANCH_BISIM.rule_identify [constructor, in branch_bisim]
BRANCH_BISIM.bisimilar_equal_D_D0 [lemma, in branch_bisim]
BRANCH_REF.stuttering_inv [lemma, in branch_ref]
BRANCH_REF.Q1step2 [constructor, in branch_ref]
BRANCH_BISIM.stuttering_closure [definition, in branch_bisim]
BRANCH_BISIM.is_taupath [definition, in branch_bisim]
BRANCH_REF.branch_forward_ind_no_stutter_ind [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_trans [lemma, in branch_bisim]
BRANCH_BISIM.bisimilar_ind_stuttering [lemma, in branch_bisim]
BRANCH_BISIM.branch_ind_intro [constructor, in branch_bisim]
BRANCH_REF.wrong_rel [inductive, in branch_ref]
BRANCH_BISIM.rule_init_identify [constructor, in branch_bisim]
BRANCH_REF.branch_forward_to_no_stutter [lemma, in branch_ref]
BRANCH_BISIM.rule_transition [inductive, in branch_bisim]
BRANCH_BISIM.branch_bisim.trans [section, in branch_bisim]
BRANCH_REF.expand_prf3 [projection, in branch_ref]
BRANCH_REF.branch_back_ind_compose [lemma, in branch_ref]
BRANCH_REF.Q2step1 [constructor, in branch_ref]
BRANCH_REF.go_wrong_later [constructor, in branch_ref]
BRANCH_REF.branch_ref_eq [lemma, in branch_ref]
BRANCH_REF.branch_ref_compose [lemma, in branch_ref]
BRANCH_BISIM.D1_D2 [lemma, in branch_bisim]
BRANCH_REF.XQ1_bisim [lemma, in branch_ref]
BRANCH_REF.Q2step3 [constructor, in branch_ref]
BRANCH_REF.bisim_branch_ind_stutter_eq [lemma, in branch_ref]
BRANCH_REF.safe_refines_ind_defined [lemma, in branch_ref]
BRANCH_REF.Q1step [inductive, in branch_ref]
BRANCH_BISIM.sim_seq_prefix [lemma, in branch_bisim]
BRANCH_REF.cond_D2'_compose [lemma, in branch_ref]
BRANCH_REF.branch_forward_step_right' [lemma, in branch_ref]
BRANCH_BISIM.rsm_seq [constructor, in branch_bisim]
BRANCH_REF.branch_backward_ind_intro [constructor, in branch_ref]
BRANCH_BISIM.rs_init [constructor, in branch_bisim]
BRANCH_BISIM.D0_to_brouwer.rule [variable, in branch_bisim]
BRANCH_BISIM.D0_to_brouwer.Bbar [variable, in branch_bisim]
BRANCH_BISIM.cond_D0 [definition, in branch_bisim]
BRANCH_REF.bisim_ref [lemma, in branch_ref]
BRANCH_REF.wrong_expands' [definition, in branch_ref]
BRANCH_REF.branch_ref.expands_refine.Y [variable, in branch_ref]
BRANCH_REF.stuttering_path' [lemma, in branch_ref]
BRANCH_REF.wrong_rel_mho [constructor, in branch_ref]
BRANCH_BISIM.stuttering_closure_incl [lemma, in branch_bisim]
BRANCH_REF.q2y [definition, in branch_ref]
BRANCH_BISIM.quotient [module, in branch_bisim]
BRANCH_REF.refines_ind_mho_star [lemma, in branch_ref]
BRANCH_REF.branch_ref.trans_forward.Y [variable, in branch_ref]
BRANCH_BISIM.D0bar_mono [lemma, in branch_bisim]
BRANCH_REF.branch_forward [definition, in branch_ref]
BRANCH_REF.state_def [definition, in branch_ref]
BRANCH_REF.branch_forward_no_stutter [definition, in branch_ref]
BRANCH_BISIM.bisimilar_D_D0 [lemma, in branch_bisim]
BRANCH_BISIM.D0_branch_ind [lemma, in branch_bisim]
BRANCH_REF.path_push_comp [lemma, in branch_ref]
BRANCH_REF.refines_ind_mho_goes_wrong [lemma, in branch_ref]
BRANCH_REF.branch_ind_compose_inner_back [lemma, in branch_ref]
BRANCH_REF.branch_ind_div [lemma, in branch_ref]
BRANCH_BISIM.cond_D [definition, in branch_bisim]
BRANCH_REF.branch_ref.trans_forward.HR2 [variable, in branch_ref]
BRANCH_BISIM.branch_ind'_ind_stuttering [lemma, in branch_bisim]
BRANCH_BISIM.branch_bisim.trans.R2 [variable, in branch_bisim]
BRANCH_BISIM.stuttering_closure_property [lemma, in branch_bisim]
BRANCH_REF.branch_ind_eq [lemma, in branch_ref]
BRANCH_BISIM.equiv_refl [lemma, in branch_bisim]
BRANCH_BISIM.rule_init_step [constructor, in branch_bisim]
BRANCH_BISIM.taupath_rule [definition, in branch_bisim]
BRANCH_BISIM.stuttering_is_branch [lemma, in branch_bisim]
BRANCH_REF.branch_backward_ind_ind [lemma, in branch_ref]
BRANCH_BISIM.simulation_bisimilar_D1 [lemma, in branch_bisim]
BRANCH_REF.refinement_equiv [lemma, in branch_ref]
BRANCH_REF.branch_def_branch_safe [lemma, in branch_ref]
BRANCH_REF.mkQ2 [constructor, in branch_ref]
BRANCH_BISIM.branch_ind_ind' [lemma, in branch_bisim]
BRANCH_BISIM.bisimilar_D1_stuttering_closed [lemma, in branch_bisim]
BRANCH_REF.branch_ind_compose [lemma, in branch_ref]
BRANCH_REF.goes_wrong_ind [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_ind_refl [lemma, in branch_bisim]
BRANCH_BISIM.D0_to_brouwer [lemma, in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.X [variable, in branch_ref]
BRANCH_REF.branch_branch_ind_no_stutter [lemma, in branch_ref]
BRANCH_REF.branch_back_branch_ind [lemma, in branch_ref]
BRANCH_BISIM [module, in branch_bisim]
BRANCH_REF.q1H [projection, in branch_ref]
BRANCH_REF.cond_D2'_eq [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_refl [lemma, in branch_bisim]
BRANCH_REF.safe_refines_safe [lemma, in branch_ref]
BRANCH_REF.refines_ind_trans [lemma, in branch_ref]
BRANCH_REF.cond_D1'_stutter [lemma, in branch_ref]
BRANCH_REF.Q1step1 [constructor, in branch_ref]
BRANCH_REF.branch_ref.trans_forward.R1 [variable, in branch_ref]
BRANCH_BISIM.quotient.quot_bisim [lemma, in branch_bisim]
BRANCH_BISIM.droploop [definition, in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.Hxy [variable, in branch_bisim]
BRANCH_BISIM.branch_ind'_intro [constructor, in branch_bisim]
BRANCH_REF.cond_D1_D2' [lemma, in branch_ref]
BRANCH_REF.Q1step3 [constructor, in branch_ref]
BRANCH_REF.branch_ind_stutter_eq [lemma, in branch_ref]
BRANCH_REF.branch_ref.trans_backward.HR1 [variable, in branch_ref]
BRANCH_BISIM.quotient.quot [definition, in branch_bisim]
BRANCH_REF.branch_forward_ind_mono [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_equal_D_DX [lemma, in branch_bisim]
BRANCH_REF.cond_D1'_mono [lemma, in branch_ref]
BRANCH_BISIM.rule_state_branch_sim [lemma, in branch_bisim]
BRANCH_REF.cond_D2' [definition, in branch_ref]
BRANCH_REF.refines_div_refl [lemma, in branch_ref]
BRANCH_BISIM.bisimulation_ind_bisimilar [lemma, in branch_bisim]
BRANCH_REF.refines_div_stutter [lemma, in branch_ref]
BRANCH_BISIM.branch_sim_eq [lemma, in branch_bisim]
BRANCH_BISIM.finite_divergences_step_star [lemma, in branch_bisim]
BRANCH_REF.branch_def_safe [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_D1_D [lemma, in branch_bisim]
BRANCH_REF.Q2step4 [constructor, in branch_ref]
BRANCH_REF.branch_back_to_no_stutter [lemma, in branch_ref]
BRANCH_REF.Q1st [record, in branch_ref]
BRANCH_BISIM.branch_ind_stutter [lemma, in branch_bisim]
BRANCH_BISIM.D0_to_brouwer [section, in branch_bisim]
BRANCH_REF.refines_ind_no_stutter_refinement [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams.X [variable, in branch_bisim]
BRANCH_REF.branch_backward_ind_no_stutter_intro [constructor, in branch_ref]
BRANCH_BISIM.interpolates_D_D0_equal [lemma, in branch_bisim]
BRANCH_BISIM.cond_DX [definition, in branch_bisim]
BRANCH_REF.branch_backward_ind [inductive, in branch_ref]
BRANCH_REF.wrong_bisimilar [definition, in branch_ref]
BRANCH_REF.branch_ref.expands_refine.HR [variable, in branch_ref]
BRANCH_BISIM.is_branch'_branch [lemma, in branch_bisim]
BRANCH_BISIM.D0bar_in_D0bar_Q [lemma, in branch_bisim]
BRANCH_REF.refines_refinement [lemma, in branch_ref]
BRANCH_BISIM.D0bar_Q [definition, in branch_bisim]
BRANCH_REF.branch_backward_ref_compose [lemma, in branch_ref]
BRANCH_REF.bisim_ind_refl [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_D1_trans [lemma, in branch_bisim]
BRANCH_REF.refines_div_trans [lemma, in branch_ref]
BRANCH_REF.refines_ind_refinement [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams.R [variable, in branch_bisim]
BRANCH_BISIM.D1_branch_ind_classic [lemma, in branch_bisim]
BRANCH_BISIM.branch_sim_compose [lemma, in branch_bisim]
BRANCH_REF.branch_forward_branch_ind [lemma, in branch_ref]
BRANCH_BISIM.bisimulation_ind_compose [lemma, in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.H [variable, in branch_bisim]
BRANCH_REF.branch_forward_ind_no_stutter [inductive, in branch_ref]
BRANCH_REF.branch_forward_ind_no_sutter_intro [constructor, in branch_ref]
BRANCH_REF.Q1 [definition, in branch_ref]
BRANCH_BISIM.quotient.qst_main [constructor, in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.x [variable, in branch_bisim]
BRANCH_REF.bisim_div_trans [lemma, in branch_ref]
BRANCH_BISIM.D1_branch_ind_bisimilar [lemma, in branch_bisim]
BRANCH_REF.Q2 [definition, in branch_ref]
BRANCH_BISIM.branch' [definition, in branch_bisim]
BRANCH_BISIM.branch_bisim [section, in branch_bisim]
BRANCH_BISIM.path_run_ex_uniq [lemma, in branch_bisim]
BRANCH_REF.branch_forward_ind_D1 [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.trans.HR1 [variable, in branch_bisim]
BRANCH_REF.accessible_refl [lemma, in branch_ref]
BRANCH_REF.stuttering_is_branch_backward_ind [lemma, in branch_ref]
BRANCH_REF.loop_bisimulation [lemma, in branch_ref]
BRANCH_REF.go_wrong_now [constructor, in branch_ref]
BRANCH_REF.branch_forward_ind_compose [lemma, in branch_ref]
BRANCH_REF.reachable [definition, in branch_ref]
BRANCH_BISIM.sim_D0_stuttering_ind [lemma, in branch_bisim]
BRANCH_BISIM.loop_simulation [lemma, in branch_bisim]
BRANCH_REF.wrong_expansion [record, in branch_ref]
BRANCH_REF.branch_ref.expands_refine.X [variable, in branch_ref]
BRANCH_BISIM.branch_bisim.D0_branch_ind.Bw [variable, in branch_bisim]
BRANCH_REF.refines_mho_forward_no_stutter [lemma, in branch_ref]
BRANCH_REF.bisim_branch_div_refl [lemma, in branch_ref]
BRANCH_BISIM.branch_ind_compose [lemma, in branch_bisim]
BRANCH_BISIM.branch_sim_ind_eq [lemma, in branch_bisim]
BRANCH_REF.wrong_expands_refine [lemma, in branch_ref]
BRANCH_REF.branch_ref.trans_forward.X [variable, in branch_ref]
BRANCH_REF.stuttering_is_branch_forward [lemma, in branch_ref]
BRANCH_BISIM.branch_sim_D1_compose [lemma, in branch_bisim]
BRANCH_REF.refines_ind_mho_path_where_mho [lemma, in branch_ref]
BRANCH_REF.Q2Y_bisim [lemma, in branch_ref]
BRANCH_REF.stuttering_push_right [lemma, in branch_ref]
BRANCH_REF.stuttering_is_branch_forward_ind [lemma, in branch_ref]
BRANCH_BISIM.D0_to_brouwer.B [variable, in branch_bisim]
BRANCH_BISIM.bisimilar_change_cond [lemma, in branch_bisim]
BRANCH_REF.cond_D2_eq [lemma, in branch_ref]
BRANCH_REF.branch_ref [section, in branch_ref]
BRANCH_REF.branch_D1'_backward_ind [lemma, in branch_ref]
BRANCH_REF.branch_forward_mono [lemma, in branch_ref]
BRANCH_REF.branch_forward_branch_ind_no_stutter [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams.Y [variable, in branch_bisim]
BRANCH_REF.mkQ2Y [constructor, in branch_ref]
BRANCH_BISIM.branch_ind_branch [lemma, in branch_bisim]
BRANCH_REF.branch_ref.trans_backward [section, in branch_ref]
BRANCH_BISIM.quotient.quotLTS [definition, in branch_bisim]
BRANCH_BISIM.branch_ind_ind [lemma, in branch_bisim]
BRANCH_BISIM.D1_D0_sim [lemma, in branch_bisim]
BRANCH_REF.Q1toQ2 [definition, in branch_ref]
BRANCH_BISIM.branch_bisim.ind_equiv.X [variable, in branch_bisim]
BRANCH_REF.branch_backward_ind_no_stutter [inductive, in branch_ref]
BRANCH_REF.branch_ref.trans_forward.HR1 [variable, in branch_ref]
BRANCH_REF.branch_forward_ind_to_no_stutter [lemma, in branch_ref]
BRANCH_REF.stuttering_closure [definition, in branch_ref]
BRANCH_REF.branch_ref.trans_backward.Z [variable, in branch_ref]
BRANCH_BISIM.branch_bisim.trans.X [variable, in branch_bisim]
BRANCH_REF.branch_forward_step_right [lemma, in branch_ref]
BRANCH_BISIM.D0_ind_equiv_LPO [lemma, in branch_bisim]
BRANCH_REF.branch_back_branch_ind_no_stutter [lemma, in branch_ref]
BRANCH_BISIM.D0bar [definition, in branch_bisim]
BRANCH_REF.refines_ind_refl [lemma, in branch_ref]
BRANCH_REF.path_push_comp_back [lemma, in branch_ref]
BRANCH_BISIM.sim_D0_stuttering_D1 [lemma, in branch_bisim]
BRANCH_REF.branch_backward [definition, in branch_ref]
BRANCH_BISIM.bisimilar_D1_cond_D [lemma, in branch_bisim]
BRANCH_BISIM.is_taupath_aux [definition, in branch_bisim]
BRANCH_REF.branch_ind [definition, in branch_ref]
BRANCH_BISIM.path_run [definition, in branch_bisim]
BRANCH_REF.Q2step5 [constructor, in branch_ref]
BRANCH_REF.Q1step4 [constructor, in branch_ref]
BRANCH_BISIM.path_st [definition, in branch_bisim]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams [section, in branch_bisim]
BRANCH_REF.branch_expands_branch_ref [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.ind_equiv.R [variable, in branch_bisim]
BRANCH_REF.branch_ref.trans_forward [section, in branch_ref]
BRANCH_REF.branch_def_inv [lemma, in branch_ref]
BRANCH_REF.branch_backward_ind_D1' [lemma, in branch_ref]
BRANCH_REF.prove_branch_ind_bisim [lemma, in branch_ref]
BRANCH_BISIM.branch_ind' [inductive, in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.X [variable, in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.R2 [variable, in branch_ref]
BRANCH_BISIM.branch_ind'_ind [lemma, in branch_bisim]
BRANCH_REF.branch_div [definition, in branch_ref]
BRANCH_REF.branch [definition, in branch_ref]
BRANCH_BISIM.rs_seq [constructor, in branch_bisim]
BRANCH_REF.branch_ref.expands_refine.R [variable, in branch_ref]
BRANCH_BISIM.rule_state_D0_sim [lemma, in branch_bisim]
BRANCH_REF.refines_ind_mho_step_star [lemma, in branch_ref]
BRANCH_BISIM.simulation_D1_stuttering [lemma, in branch_bisim]
BRANCH_REF.safe_refines_ind_safe [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_equal_D_D1 [lemma, in branch_bisim]
BRANCH_BISIM.equiv_sym [lemma, in branch_bisim]
BRANCH_BISIM.stuttering_closure_idem [lemma, in branch_bisim]
BRANCH_REF.reachable' [definition, in branch_ref]
BRANCH_REF.expand_inj [projection, in branch_ref]
BRANCH_BISIM.D0_to_brouwer.A [variable, in branch_bisim]
BRANCH_BISIM.D0bar_Q_hered [lemma, in branch_bisim]
BRANCH_BISIM.branch_bisim.ind_equiv [section, in branch_bisim]
BRANCH_BISIM.sim_stuttering_push [lemma, in branch_bisim]
BRANCH_BISIM.stuttering_closure_property_inv [lemma, in branch_bisim]
BRANCH_REF.cond_D1_D2 [lemma, in branch_ref]
BRANCH_REF.stuttering_is_branch [lemma, in branch_ref]
BRANCH_REF.branch_div12 [lemma, in branch_ref]
BRANCH_REF.cond_D1 [definition, in branch_ref]
BRANCH_REF.branch_backward_mono [lemma, in branch_ref]
BRANCH_REF.refines_ind_goes_wrong [lemma, in branch_ref]
BRANCH_REF.stuttering_is_branch_ind [lemma, in branch_ref]
BRANCH_REF.cond_D2_compose [lemma, in branch_ref]
BRANCH_BISIM.branch_ind'_branch' [lemma, in branch_bisim]
BRANCH_REF.stuttering_is_branch_backward [lemma, in branch_ref]
BRANCH_REF.branch_back_ind_to_no_stutter [lemma, in branch_ref]
BRANCH_BISIM.quotient.quot_weak_converges [lemma, in branch_bisim]
BRANCH_BISIM.rule_obs_system [instance, in branch_bisim]
BRANCH_REF.expand_prf1 [projection, in branch_ref]
BRANCH_BISIM.branch [definition, in branch_bisim]
BRANCH_REF.Q2st [inductive, in branch_ref]
BRANCH_BISIM.quotient.qst_loop [constructor, in branch_bisim]
BRANCH_BISIM.bisimilar_change_cond_bisim [lemma, in branch_bisim]
BRANCH_REF.branch_ind_no_stutter [definition, in branch_ref]
BRANCH_BISIM.branch_bisim.ind_equiv.Y [variable, in branch_bisim]
BRANCH_REF.q1x [projection, in branch_ref]
BRANCH_REF.branch_backward_ind_no_stutter_ind [lemma, in branch_ref]
BRANCH_BISIM.cond_D2 [definition, in branch_bisim]
BRANCH_REF.Q1Q2_wrong_expansion [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.D0_branch_ind.R [variable, in branch_bisim]
BRANCH_REF.refines_ind_mho_tau [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_D1_D0 [lemma, in branch_bisim]
BRANCH_REF.goes_wrong [inductive, in branch_ref]
BRANCH_REF.stuttering_closure_incl [lemma, in branch_ref]
BRANCH_BISIM.rule_state [inductive, in branch_bisim]
BRANCH_BISIM.branch_ind_D1 [lemma, in branch_bisim]
BRANCH_REF.accessible_trans [lemma, in branch_ref]
BRANCH_BISIM.quotient.quotient.X [variable, in branch_bisim]
BRANCH_REF.branch_ind_compose_inner [lemma, in branch_ref]
BRANCH_REF.wrong_rel_mho' [constructor, in branch_ref]
BRANCH_REF.refines_trans [lemma, in branch_ref]
BRANCH_REF.branch_backward_step_left [lemma, in branch_ref]
BRANCH_BISIM.stuttering_path [lemma, in branch_bisim]
BRANCH_REF.branch_branch_ind [lemma, in branch_ref]
BRANCH_BISIM.quotient.mkq [definition, in branch_bisim]
BRANCH_REF.wrong_bisim_iff_branch_ind_bisim [lemma, in branch_ref]
BRANCH_REF.branch_forward_ref_compose [lemma, in branch_ref]
BRANCH_REF.branch_ref.trans_backward.HR2 [variable, in branch_ref]
BRANCH_REF.branch_ref.expands_refine [section, in branch_ref]
BRANCH_REF.cond_D1_mono [lemma, in branch_ref]
BRANCH_BISIM.branch_ind_D1_bisim [lemma, in branch_bisim]
BRANCH_REF.branch_def [definition, in branch_ref]
BRANCH_REF.stuttering_path [lemma, in branch_ref]
BRANCH_BISIM.bisimilar_branch_branch' [lemma, in branch_bisim]
BRANCH_REF.loop_simulation [lemma, in branch_ref]
BRANCH_BISIM.ind_equiv [lemma, in branch_bisim]
BRANCH_REF.expand_prf2 [projection, in branch_ref]
BRANCH_REF.branch_to_no_stutter [lemma, in branch_ref]
BRANCH_REF.branch_backward_ind_mono [lemma, in branch_ref]
BRANCH_BISIM.bisimulation_D1_stuttering [lemma, in branch_bisim]
BRANCH_BISIM.quotient.is_quot [definition, in branch_bisim]
BRANCH_REF.branch_backward_step_left' [lemma, in branch_ref]
BRANCH_BISIM.branch_bisim.trans.Y [variable, in branch_bisim]
BRANCH_REF.branch_div2 [definition, in branch_ref]
BRANCH_REF.refines_mho_backward_no_stutter [lemma, in branch_ref]
BRANCH_REF.branch_ref.trans_forward.Z [variable, in branch_ref]
BRANCH_BISIM.branch_bisim.trans.HR2 [variable, in branch_bisim]
branch_ref [library]
branch_bisim [library]
brouwer_games_LPO [lemma, in bar_induction]
brouwer_thesis_on_games [record, in bar_induction]


C

C [variable, in compcert]
CF [definition, in strong_bisim]
CF_is_characteristic [lemma, in strong_bisim]
CF_main [definition, in strong_bisim]
CF_body [definition, in strong_bisim]
characteristic_other [lemma, in strong_bisim]
characteristic_self [lemma, in strong_bisim]
choices [record, in bar_induction]
CHOICE_REF.prune_choice_ref_converges [module, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.characteristic.E1 [variable, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.X' [variable, in choice_ref]
CHOICE_REF.run_choice [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2 [inductive, in choice_ref]
CHOICE_BEH_REF.choice_forward_intro [constructor, in choice_beh_ref]
CHOICE_REF.conv [constructor, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.characteristic.X [variable, in choice_beh_ref]
CHOICE_REF.gp_inj [projection, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.Xconverges [variable, in choice_ref]
CHOICE_REF.run_choice_eq [lemma, in choice_ref]
CHOICE_BEH_REF.may_weak_may [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.choice_ref_stable [lemma, in choice_ref]
CHOICE_REF.adequacy_choice [lemma, in choice_ref]
CHOICE_REF.choice_ref.bf_to_branch.X [variable, in choice_ref]
CHOICE_REF.choice_refinement [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.minimize_path [lemma, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.HR [variable, in choice_beh_ref]
CHOICE_BEH_REF.run_refinement_to_choice_forward [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.Y [variable, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.HR [variable, in choice_beh_ref]
CHOICE_BEH_REF.CF [definition, in choice_beh_ref]
CHOICE_REF.choice_refines'_refinement' [lemma, in choice_ref]
CHOICE_REF.bf_choice_related_runs2 [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_prune [lemma, in choice_ref]
CHOICE_REF.CF_body [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2action [constructor, in choice_ref]
CHOICE_BEH_REF.adequate1 [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2tauX [constructor, in choice_ref]
CHOICE_BEH_REF.stuttering_choice_refines_eq [lemma, in choice_beh_ref]
CHOICE_REF.box_back [constructor, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.characteristic.E0 [variable, in choice_beh_ref]
CHOICE_BEH_REF.models_denotable [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref.branch_to_bf.Y [variable, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21 [definition, in choice_ref]
CHOICE_REF.well_stageable [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q1tauY [constructor, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_prune [lemma, in choice_ref]
CHOICE_REF.global_pruning [record, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_global_pruning [lemma, in choice_ref]
CHOICE_BEH_REF.characteristic_self [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref.adequacy [section, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q2snd_branch_bisim [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21 [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.X [variable, in choice_ref]
CHOICE_BEH_REF.enables [definition, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.Q1action [constructor, in choice_ref]
CHOICE_BEH_REF.choice_refines'_trans [lemma, in choice_beh_ref]
CHOICE_BEH_REF.cb_interp_mode [definition, in choice_beh_ref]
CHOICE_REF.run_choice_comp [lemma, in choice_ref]
CHOICE_BEH_REF.run_choice_back [lemma, in choice_beh_ref]
CHOICE_REF.gp_abs [projection, in choice_ref]
CHOICE_BEH_REF.cb_mode [inductive, in choice_beh_ref]
CHOICE_REF.CF_is_characteristic [lemma, in choice_ref]
CHOICE_REF.choice_refines_trans [lemma, in choice_ref]
CHOICE_BEH_REF.cb_logic_input [instance, in choice_beh_ref]
CHOICE_REF.choice_ref.bf_to_branch.R [variable, in choice_ref]
CHOICE_REF.adequate1 [lemma, in choice_ref]
CHOICE_REF [module, in choice_ref]
CHOICE_REF.choice_ref [section, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch [section, in choice_beh_ref]
CHOICE_BEH_REF.CF_main [definition, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged [section, in choice_ref]
CHOICE_BEH_REF.run_choice_div [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2LTS [definition, in choice_ref]
CHOICE_REF.choice_forward_intro [constructor, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged [module, in choice_ref]
CHOICE_REF.models_denotable [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2LTS [definition, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.R [variable, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1LTS [definition, in choice_ref]
CHOICE_BEH_REF.choice_refinement_eq1 [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_refines'_refinement' [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref_to_pruning_converges [lemma, in choice_ref]
CHOICE_REF.possible_stable_offer [definition, in choice_ref]
CHOICE_REF.choice_ref.characteristic.E0 [variable, in choice_ref]
CHOICE_BEH_REF.box_back [constructor, in choice_beh_ref]
CHOICE_BEH_REF.choice_forward' [definition, in choice_beh_ref]
CHOICE_BEH_REF.run_choice [definition, in choice_beh_ref]
CHOICE_REF.choice_refinement_comp [lemma, in choice_ref]
CHOICE_REF.pruning_to_choice_ref [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.path_to_shared_stable_offer [inductive, in choice_ref]
CHOICE_REF.run_choice_sim_forth' [lemma, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.characteristic [section, in choice_beh_ref]
CHOICE_BEH_REF.characteristic_other [lemma, in choice_beh_ref]
CHOICE_BEH_REF.adequate2 [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref.adequacy.inner.X [variable, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges [section, in choice_ref]
CHOICE_BEH_REF.bf_choice_related_runs [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_refinement [lemma, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.R [variable, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.ptsso_nil [constructor, in choice_ref]
CHOICE_REF.choice_refines [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2step [inductive, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged.Y [variable, in choice_ref]
CHOICE_BEH_REF.branch_forward_ind_choice [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref.branch_to_bf.HR [variable, in choice_ref]
CHOICE_REF.offer_set [definition, in choice_ref]
CHOICE_REF.choice_ref_to_pruning_well_staged [lemma, in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner [section, in choice_ref]
CHOICE_BEH_REF.dia_back [constructor, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.X [variable, in choice_beh_ref]
CHOICE_BEH_REF.choice_Xclosure [lemma, in choice_beh_ref]
CHOICE_REF.choice_refinement' [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q2snd [definition, in choice_ref]
CHOICE_BEH_REF.run_choice_forth [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref.branch_to_bf [section, in choice_ref]
CHOICE_BEH_REF.choice_refinement_steps [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref.characteristic.E1 [variable, in choice_ref]
CHOICE_BEH_REF.conv [constructor, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.Hfin2 [variable, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.Y [variable, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1step [inductive, in choice_ref]
CHOICE_REF.bf_choice_related_runs [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.mkQ1 [constructor, in choice_ref]
CHOICE_BEH_REF.choice_to_bf_choice [lemma, in choice_beh_ref]
CHOICE_REF.run_choice_forward [definition, in choice_ref]
CHOICE_BEH_REF.box [constructor, in choice_beh_ref]
CHOICE_REF.choice_ref.bf_to_branch.HR [variable, in choice_ref]
CHOICE_REF.adequate3 [lemma, in choice_ref]
CHOICE_BEH_REF.run_refinement_to_choice [lemma, in choice_beh_ref]
CHOICE_BEH_REF.stuttering_choice_forward [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.q1fst_branch_bisim [lemma, in choice_ref]
CHOICE_REF.choice_ref.branch_to_bf.X [variable, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf [section, in choice_beh_ref]
CHOICE_BEH_REF.run_similar_choice_refl [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1 [inductive, in choice_ref]
CHOICE_BEH_REF.CF_is_characteristic [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_refines_steps [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_forward [inductive, in choice_beh_ref]
choice_set [definition, in bar_induction]
CHOICE_REF.prune_choice_ref_well_staged.shortest_path_to_shared_stable_offer [definition, in choice_ref]
CHOICE_BEH_REF.cb_atom [inductive, in choice_beh_ref]
CHOICE_BEH_REF.completeness [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner [section, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.R [variable, in choice_beh_ref]
CHOICE_BEH_REF.must_weak_must [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.Hfin1 [variable, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.Q2tauY [constructor, in choice_ref]
CHOICE_REF.run_choice_div_sim [lemma, in choice_ref]
CHOICE_BEH_REF.Xclosure_forth_sim [lemma, in choice_beh_ref]
CHOICE_REF.box [constructor, in choice_ref]
CHOICE_BEH_REF.bf_choice_to_choice [lemma, in choice_beh_ref]
CHOICE_REF.gp_prune [projection, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2tauY [constructor, in choice_ref]
CHOICE_REF.dia_back [constructor, in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner.Hfin2 [variable, in choice_ref]
CHOICE_REF.bare_pruning_refines [definition, in choice_ref]
CHOICE_REF.choice_mode [inductive, in choice_ref]
CHOICE_BEH_REF.choice_refinement'_comp [lemma, in choice_beh_ref]
CHOICE_BEH_REF.well_stageable [definition, in choice_beh_ref]
CHOICE_REF.choice_Xclosure [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.mkQ2 [constructor, in choice_ref]
CHOICE_BEH_REF.offer_set [definition, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.Q1LTS [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q2snd_branch_bisim [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_inj [lemma, in choice_ref]
CHOICE_REF.choice_ref.branch_to_bf.R [variable, in choice_ref]
CHOICE_BEH_REF.run_choice_trans [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice [definition, in choice_beh_ref]
CHOICE_REF.run_choice_trans [lemma, in choice_ref]
CHOICE_REF.choice_refines_steps [lemma, in choice_ref]
CHOICE_REF.bisimulation_choice_refinement [lemma, in choice_ref]
CHOICE_REF.choice_to_bf_choice [lemma, in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner.R [variable, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_inj [lemma, in choice_ref]
CHOICE_BEH_REF.choice_refinement_comp [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.X [variable, in choice_beh_ref]
CHOICE_REF.choice_refinement'_comp [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2 [inductive, in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner.Hfin1 [variable, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q1fst [definition, in choice_ref]
CHOICE_BEH_REF.CF_body [definition, in choice_beh_ref]
CHOICE_BEH_REF.bf_choice_related_runs2 [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy [section, in choice_beh_ref]
CHOICE_REF.gp_subgraph [projection, in choice_ref]
CHOICE_BEH_REF.offers [constructor, in choice_beh_ref]
CHOICE_BEH_REF.well_staged [definition, in choice_beh_ref]
CHOICE_BEH_REF.refines_choice_refl [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_refinement_eq2 [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.q2snd [definition, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref [section, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged.X [variable, in choice_ref]
CHOICE_BEH_REF [module, in choice_beh_ref]
CHOICE_REF.choice_ref.bf_to_branch.Y [variable, in choice_ref]
CHOICE_BEH_REF.forth_rev' [definition, in choice_beh_ref]
CHOICE_REF.CF [definition, in choice_ref]
CHOICE_BEH_REF.forth_rev [definition, in choice_beh_ref]
CHOICE_BEH_REF.choice_refines_eq [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2step [inductive, in choice_ref]
CHOICE_BEH_REF.cb_interp_atom [definition, in choice_beh_ref]
CHOICE_REF.characteristic_self [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2action [constructor, in choice_ref]
CHOICE_REF.completeness [lemma, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.Y [variable, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.Q2tauX [constructor, in choice_ref]
CHOICE_BEH_REF.branch_to_forth [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.q1fst_branch_bisim [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q1step [inductive, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1tauY [constructor, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.mkQ1 [constructor, in choice_ref]
CHOICE_BEH_REF.run_choice_comp [lemma, in choice_beh_ref]
CHOICE_BEH_REF.run_ref_to_choice [lemma, in choice_beh_ref]
CHOICE_BEH_REF.run_choice_forward [definition, in choice_beh_ref]
CHOICE_REF.interp_choice_mode [definition, in choice_ref]
CHOICE_BEH_REF.choice_no_stutter [definition, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1action [constructor, in choice_ref]
CHOICE_REF.CF_main [definition, in choice_ref]
CHOICE_REF.characteristic_other [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.Y [variable, in choice_ref]
CHOICE_BEH_REF.refines_branch_ind_choice [lemma, in choice_beh_ref]
CHOICE_REF.well_staged [definition, in choice_ref]
CHOICE_BEH_REF.circ [constructor, in choice_beh_ref]
CHOICE_REF.choice_refines' [definition, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q1 [inductive, in choice_ref]
CHOICE_REF.adequate4 [lemma, in choice_ref]
CHOICE_BEH_REF.run_choice_eq [lemma, in choice_beh_ref]
CHOICE_REF.choice_refines_eq [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_global_pruning [lemma, in choice_ref]
CHOICE_BEH_REF.choice_forward_ind [lemma, in choice_beh_ref]
CHOICE_REF.bf_choice_to_choice [lemma, in choice_ref]
CHOICE_REF.run_choice_bisim_back' [lemma, in choice_ref]
CHOICE_REF.choice_refines'_trans [lemma, in choice_ref]
CHOICE_REF.circ [constructor, in choice_ref]
CHOICE_REF.choice_atom [inductive, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_subgraph [lemma, in choice_ref]
CHOICE_REF.choice_refinement_steps [lemma, in choice_ref]
CHOICE_REF.ChoiceLogicInput [instance, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_subgraph [lemma, in choice_ref]
CHOICE_BEH_REF.choice_refinement_eq [lemma, in choice_beh_ref]
CHOICE_REF.adequacy [lemma, in choice_ref]
CHOICE_REF.choice_ref.characteristic.X [variable, in choice_ref]
CHOICE_BEH_REF.forth_rev'_forth_rev [lemma, in choice_beh_ref]
CHOICE_REF.interp_choice_atom [definition, in choice_ref]
CHOICE_REF.run_bisimilar_run_choice [lemma, in choice_ref]
CHOICE_BEH_REF.stuttering_choice_refinement [lemma, in choice_beh_ref]
CHOICE_BEH_REF.refinement_branch_ind_choice [lemma, in choice_beh_ref]
CHOICE_REF.choice_forward [inductive, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.ptsso_cons [constructor, in choice_ref]
CHOICE_BEH_REF.extended_run_push1'_ugh [lemma, in choice_beh_ref]
CHOICE_REF.adequacy_div2 [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q1fst [definition, in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.X [variable, in choice_beh_ref]
CHOICE_REF.choice_refinement_eq [lemma, in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.mkQ2 [constructor, in choice_ref]
CHOICE_BEH_REF.adequacy_choice [lemma, in choice_beh_ref]
CHOICE_REF.run_similar_choice_refl [lemma, in choice_ref]
CHOICE_BEH_REF.choice_refines_trans [lemma, in choice_beh_ref]
CHOICE_REF.run_bisimulation_run_choice [lemma, in choice_ref]
CHOICE_BEH_REF.stable [definition, in choice_beh_ref]
CHOICE_REF.pruning_refines [definition, in choice_ref]
CHOICE_REF.choice_forward_ind [lemma, in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner.Y [variable, in choice_ref]
CHOICE_REF.choice_ref.bf_to_branch [section, in choice_ref]
CHOICE_BEH_REF.refines_choice_refinement [lemma, in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged.Y_well_staged [variable, in choice_ref]
CHOICE_BEH_REF.adequacy [lemma, in choice_beh_ref]
CHOICE_BEH_REF.adequacy_div1 [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice' [definition, in choice_beh_ref]
CHOICE_BEH_REF.refines_choice_no_stutter_refinement [lemma, in choice_beh_ref]
CHOICE_BEH_REF.choice_refines_mho_step_star [lemma, in choice_beh_ref]
CHOICE_REF.choice_ref.characteristic [section, in choice_ref]
CHOICE_REF.offers [constructor, in choice_ref]
choice_ref [library]
choice_beh_ref [library]
ch_set [projection, in bar_induction]
ch_nil [projection, in bar_induction]
ch_prf [projection, in bar_induction]
CI [module, in iface]
classic [projection, in prelim]
classic_brouwer_thesis [lemma, in bar_induction]
closed [record, in bourbaki]
closed_restrict [lemma, in bourbaki]
closures [section, in base]
closures.R [variable, in base]
closures.X [variable, in base]
cl_chain [projection, in bourbaki]
cl_iso [projection, in bourbaki]
cl_incl [projection, in bourbaki]
cl_f [projection, in bourbaki]
comp [definition, in prelim]
compcert [library]
compcert_branch_backward_sim_run0 [lemma, in compcert]
compcert_obs [inductive, in compcert]
compcert_backward_sim [lemma, in compcert]
compcert_branch_backward_sim_run2 [lemma, in compcert]
compcert_branch_backward_sim_run1 [lemma, in compcert]
compcert_branch_forward_sim_run2 [lemma, in compcert]
compcert_forward_sim [lemma, in compcert]
CompCert_main_pass_correctness [lemma, in compcert]
compcert_refinement [lemma, in compcert]
compcert_fsim_match_push [lemma, in compcert]
compcert_branch_forward_sim_run1 [lemma, in compcert]
compcert_observations [instance, in compcert]
CompilerInterface [module, in iface]
COMPILER_INTERFACE.may_step_step [axiom, in iface]
COMPILER_INTERFACE.void_lts [definition, in iface]
COMPILER_INTERFACE.bisimilar [definition, in iface]
COMPILER_INTERFACE.mho [constructor, in iface]
COMPILER_INTERFACE.refines_mho_forward_no_stutter [axiom, in iface]
COMPILER_INTERFACE.enables [definition, in iface]
COMPILER_INTERFACE.refines_branch_ind_choice [axiom, in iface]
COMPILER_INTERFACE.branch_ind_no_stutter [definition, in iface]
COMPILER_INTERFACE.path_where [inductive, in iface]
COMPILER_INTERFACE.branch_forward_ind_intro [constructor, in iface]
COMPILER_INTERFACE.branch_backward_ind_no_stutter [inductive, in iface]
COMPILER_INTERFACE.refines_ind_refl [axiom, in iface]
COMPILER_INTERFACE.branch_backward_ind_no_stutter_ind [axiom, in iface]
COMPILER_INTERFACE.refines_ind_mho [axiom, in iface]
COMPILER_INTERFACE.branch_forward_ind_no_stutter [inductive, in iface]
COMPILER_INTERFACE.choice [definition, in iface]
COMPILER_INTERFACE.path_nil [constructor, in iface]
COMPILER_INTERFACE.path_inv_right [axiom, in iface]
COMPILER_INTERFACE.may_step_star [definition, in iface]
COMPILER_INTERFACE.paths.R [variable, in iface]
COMPILER_INTERFACE.O [projection, in iface]
COMPILER_INTERFACE.refines_ind_refinement [axiom, in iface]
COMPILER_INTERFACE.must_may_step [axiom, in iface]
COMPILER_INTERFACE.branch_forward_ind_ind [axiom, in iface]
COMPILER_INTERFACE.refines_ind_trans [axiom, in iface]
COMPILER_INTERFACE.must_may_step_star [axiom, in iface]
COMPILER_INTERFACE.inv [definition, in iface]
COMPILER_INTERFACE.reachable' [definition, in iface]
COMPILER_INTERFACE.branch_backward_ind_no_stutter_intro [constructor, in iface]
COMPILER_INTERFACE.contains_same [axiom, in iface]
COMPILER_INTERFACE.bisimulation_and [axiom, in iface]
COMPILER_INTERFACE.refines_choice_no_stutter_refinement [axiom, in iface]
COMPILER_INTERFACE.path_trans [axiom, in iface]
COMPILER_INTERFACE.compiler_interface [section, in iface]
COMPILER_INTERFACE.contains_eq [axiom, in iface]
COMPILER_INTERFACE.td_and [definition, in iface]
COMPILER_INTERFACE.choice_forward_ind [axiom, in iface]
COMPILER_INTERFACE.contains [definition, in iface]
COMPILER_INTERFACE.branch_forward_ind_no_stutter_ind [axiom, in iface]
COMPILER_INTERFACE.choice_refines_mho_step_star [axiom, in iface]
COMPILER_INTERFACE.bisimilar_sym [axiom, in iface]
COMPILER_INTERFACE.must_step_star [definition, in iface]
COMPILER_INTERFACE.LTS [record, in iface]
COMPILER_INTERFACE.transition_diagram [definition, in iface]
COMPILER_INTERFACE.bisim_ind_refl [axiom, in iface]
COMPILER_INTERFACE.refines_choice_refinement [axiom, in iface]
COMPILER_INTERFACE.must_step [definition, in iface]
COMPILER_INTERFACE.branch_backward_ind_ind [axiom, in iface]
COMPILER_INTERFACE.lift_map [definition, in iface]
COMPILER_INTERFACE.bisimulation [definition, in iface]
COMPILER_INTERFACE.goes_wrong [inductive, in iface]
COMPILER_INTERFACE.contains_uniq [axiom, in iface]
COMPILER_INTERFACE.branch_backward_ind [inductive, in iface]
COMPILER_INTERFACE.ObservationSystem [record, in iface]
COMPILER_INTERFACE.prove_branch_ind_bisim [axiom, in iface]
COMPILER_INTERFACE [module, in iface]
COMPILER_INTERFACE.lift [inductive, in iface]
COMPILER_INTERFACE.paths.X [variable, in iface]
COMPILER_INTERFACE.refines [definition, in iface]
COMPILER_INTERFACE.bisim_branch_ind_stutter_eq [axiom, in iface]
COMPILER_INTERFACE.go_wrong_later [constructor, in iface]
COMPILER_INTERFACE.branch_ind_stutter_eq [axiom, in iface]
COMPILER_INTERFACE.steps [projection, in iface]
COMPILER_INTERFACE.bisim_ind_trans [axiom, in iface]
COMPILER_INTERFACE.branch_ind [definition, in iface]
COMPILER_INTERFACE.lstate [definition, in iface]
COMPILER_INTERFACE.refines_ind_mho_goes_wrong [axiom, in iface]
COMPILER_INTERFACE.path_cons_right [axiom, in iface]
COMPILER_INTERFACE.observations_inhabited [projection, in iface]
COMPILER_INTERFACE.refines_ind_mho_tau [axiom, in iface]
COMPILER_INTERFACE.choice_refines_trans [axiom, in iface]
COMPILER_INTERFACE.choice_forward_intro [constructor, in iface]
COMPILER_INTERFACE.stuttering_choice_refines_eq [axiom, in iface]
COMPILER_INTERFACE.refines_ind_mho_step_star [axiom, in iface]
COMPILER_INTERFACE.choice_forward [inductive, in iface]
COMPILER_INTERFACE.and_refinement [axiom, in iface]
COMPILER_INTERFACE.choice_no_stutter [definition, in iface]
COMPILER_INTERFACE.refines_ind_goes_wrong [axiom, in iface]
COMPILER_INTERFACE.path_cons [constructor, in iface]
COMPILER_INTERFACE.into [constructor, in iface]
COMPILER_INTERFACE.goes_wrong_ind [axiom, in iface]
COMPILER_INTERFACE.refines_ind_no_stutter_refinement [axiom, in iface]
COMPILER_INTERFACE.refinement [definition, in iface]
COMPILER_INTERFACE.go_wrong_now [constructor, in iface]
COMPILER_INTERFACE.refines_choice_refl [axiom, in iface]
COMPILER_INTERFACE.paths [section, in iface]
COMPILER_INTERFACE.branch_backward_ind_intro [constructor, in iface]
COMPILER_INTERFACE.may_step [definition, in iface]
COMPILER_INTERFACE.refines_ind_mho_star [axiom, in iface]
COMPILER_INTERFACE.path_where_incl [axiom, in iface]
COMPILER_INTERFACE.refinement_and [axiom, in iface]
COMPILER_INTERFACE.and_bisimulation [axiom, in iface]
COMPILER_INTERFACE.state [projection, in iface]
COMPILER_INTERFACE.path_rt [axiom, in iface]
COMPILER_INTERFACE.branch_forward_ind_no_sutter_intro [constructor, in iface]
COMPILER_INTERFACE.branch_forward_ind [inductive, in iface]
COMPILER_INTERFACE.choice_forward' [definition, in iface]
compose_bisimulation [lemma, in strong_bisim]
comp_intro [lemma, in prelim]
contains [definition, in prelim]
contains_nn [lemma, in prelim]
contains_uniq [lemma, in prelim]
contains_eq [lemma, in prelim]
contains_same [lemma, in prelim]


D

dia [constructor, in strong_bisim]
done [constructor, in compcert]


E

ELTS [record, in ref_alternatives]
ELTS_Theory.accessable [definition, in strong_ref_complete]
ELTS_Theory.axiom_K5 [lemma, in strong_ref_complete]
ELTS_Theory.mode [inductive, in strong_ref_complete]
ELTS_Theory.adequate [lemma, in strong_ref_complete]
ELTS_Theory.expansion_refinement [lemma, in strong_ref_complete]
ELTS_Theory.box [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step2 [constructor, in strong_ref_complete]
ELTS_Theory.injectX [definition, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.Hstp [variable, in strong_ref_complete]
ELTS_Theory.interp_step [inductive, in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.Y [variable, in strong_ref_complete]
ELTS_Theory.box_successor [lemma, in strong_ref_complete]
ELTS_Theory.order_mode [definition, in strong_ref_complete]
ELTS_Theory.AXC_contrapose [lemma, in strong_ref_complete]
ELTS_Theory.world [record, in strong_ref_complete]
ELTS_Theory.dia_successor [lemma, in strong_ref_complete]
ELTS_Theory.subset_refinement [lemma, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.Hacc [variable, in strong_ref_complete]
ELTS_Theory.bar_AX [lemma, in strong_ref_complete]
ELTS_Theory.AX_K3 [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1 [definition, in strong_ref_complete]
ELTS_Theory.interpELTS [definition, in strong_ref_complete]
ELTS_Theory.root [projection, in strong_ref_complete]
ELTS_Theory.Y_interp_refinement_inv [definition, in strong_ref_complete]
ELTS_Theory.AX_K6 [constructor, in strong_ref_complete]
ELTS_Theory.injectY [definition, in strong_ref_complete]
ELTS_Theory.frame_condition2 [lemma, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.main_y' [variable, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step3 [constructor, in strong_ref_complete]
ELTS_Theory.Y_interp_refines [lemma, in strong_ref_complete]
ELTS_Theory.Y_interp_refinement [definition, in strong_ref_complete]
ELTS_Theory.interpolate_worlds [lemma, in strong_ref_complete]
ELTS_Theory.AXC_AX_derives [lemma, in strong_ref_complete]
ELTS_Theory.set_steps [definition, in strong_ref_complete]
ELTS_Theory.def_subset [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2 [definition, in strong_ref_complete]
ELTS_Theory.derives_nec [lemma, in strong_ref_complete]
ELTS_Theory.AX' [inductive, in strong_ref_complete]
ELTS_Theory.AXC_em [constructor, in strong_ref_complete]
ELTS_Theory.chaos [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2st [inductive, in strong_ref_complete]
ELTS_Theory.refinement_subset [lemma, in strong_ref_complete]
ELTS_Theory.AXC_dia1 [constructor, in strong_ref_complete]
ELTS_Theory.subset [definition, in strong_ref_complete]
ELTS_Theory.expands' [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1st [record, in strong_ref_complete]
ELTS_Theory.impl_free_completeness [lemma, in strong_ref_complete]
ELTS_Theory.box_FF_definite [lemma, in strong_ref_complete]
ELTS_Theory.X_interp_refines [lemma, in strong_ref_complete]
ELTS_Theory.cannonical_model_rank1 [lemma, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.X [variable, in strong_ref_complete]
ELTS_Theory.upd_root [definition, in strong_ref_complete]
ELTS_Theory.mho_expansion [record, in strong_ref_complete]
ELTS_Theory.expand_prf2 [projection, in strong_ref_complete]
ELTS_Theory.expands [definition, in strong_ref_complete]
ELTS_Theory.stp_withinY [constructor, in strong_ref_complete]
ELTS_Theory.AX_K3' [constructor, in strong_ref_complete]
ELTS_Theory.accessable_refl [lemma, in strong_ref_complete]
ELTS_Theory.AXC_definite [lemma, in strong_ref_complete]
ELTS_Theory.prime_definite_set [lemma, in strong_ref_complete]
ELTS_Theory.step_crash_w [definition, in strong_ref_complete]
ELTS_Theory.derives_box_dia [lemma, in strong_ref_complete]
ELTS_Theory.X_interp_refinement [definition, in strong_ref_complete]
ELTS_Theory.AX'_derives_AXC [lemma, in strong_ref_complete]
ELTS_Theory.AX_K4 [constructor, in strong_ref_complete]
ELTS_Theory.strong_ref_ordered_logic_input [instance, in strong_ref_complete]
ELTS_Theory.interpolate_worlds [section, in strong_ref_complete]
ELTS_Theory.cannonical_model_impl_free [lemma, in strong_ref_complete]
ELTS_Theory.frame_condition1 [lemma, in strong_ref_complete]
ELTS_Theory.empty_model [definition, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.Y [variable, in strong_ref_complete]
ELTS_Theory.refinement_compose [lemma, in strong_ref_complete]
ELTS_Theory.refines_trans [lemma, in strong_ref_complete]
ELTS_Theory.stp_startX [constructor, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.main_x [variable, in strong_ref_complete]
ELTS_Theory.deduction_impl_free [lemma, in strong_ref_complete]
ELTS_Theory.stp_withinX [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.XQ1_bisim [lemma, in strong_ref_complete]
ELTS_Theory.steps [projection, in strong_ref_complete]
ELTS_Theory.AX_valid [lemma, in strong_ref_complete]
ELTS_Theory.prime_theorems_or_definite [lemma, in strong_ref_complete]
ELTS_Theory.AXC_nnpp [lemma, in strong_ref_complete]
ELTS_Theory.unlift_prime [definition, in strong_ref_complete]
ELTS_Theory.refines_refl [lemma, in strong_ref_complete]
ELTS_Theory.ExpandRef.q1y [projection, in strong_ref_complete]
ELTS_Theory.definite_defined [lemma, in strong_ref_complete]
ELTS_Theory.rank1 [definition, in strong_ref_complete]
ELTS_Theory.definite [definition, in strong_ref_complete]
ELTS_Theory.prime_definite_definite_set [lemma, in strong_ref_complete]
ELTS_Theory.ExpandRef.refines_expands' [lemma, in strong_ref_complete]
ELTS_Theory.sys [projection, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2_Y_bisim [lemma, in strong_ref_complete]
ELTS_Theory.strong_ref_logic_input [instance, in strong_ref_complete]
ELTS_Theory.wrong_bisim_refinement [lemma, in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.HR [variable, in strong_ref_complete]
ELTS_Theory.accessable_trans [definition, in strong_ref_complete]
ELTS_Theory.dia_definite [lemma, in strong_ref_complete]
ELTS_Theory.definite_prime_set [definition, in strong_ref_complete]
ELTS_Theory.theorem_bar [lemma, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step5 [constructor, in strong_ref_complete]
ELTS_Theory.defined_definite [lemma, in strong_ref_complete]
ELTS_Theory.AX'_AXC_theorem [lemma, in strong_ref_complete]
ELTS_Theory.definite_set [definition, in strong_ref_complete]
ELTS_Theory.AXC_K1 [constructor, in strong_ref_complete]
ELTS_Theory.expand_prf3 [projection, in strong_ref_complete]
ELTS_Theory.stp_startY [constructor, in strong_ref_complete]
ELTS_Theory.AX_definite2 [constructor, in strong_ref_complete]
ELTS_Theory.soundness [lemma, in strong_ref_complete]
ELTS_Theory.stateY [constructor, in strong_ref_complete]
ELTS_Theory.unlift [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1step1 [constructor, in strong_ref_complete]
ELTS_Theory.wrong_bisim [definition, in strong_ref_complete]
ELTS_Theory.AX'_AXC_derives [lemma, in strong_ref_complete]
ELTS_Theory.wrong_bisimilar [definition, in strong_ref_complete]
ELTS_Theory.disjunctive_property_of_impl_free_theorems [lemma, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step4 [constructor, in strong_ref_complete]
ELTS_Theory.bar [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.mkQ2Y [constructor, in strong_ref_complete]
ELTS_Theory.dia [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1toQ2expand [lemma, in strong_ref_complete]
ELTS_Theory.derives_dia_FF [lemma, in strong_ref_complete]
ELTS_Theory.rank1_completeness [lemma, in strong_ref_complete]
ELTS_Theory.state [projection, in strong_ref_complete]
ELTS_Theory.derives_box_dia' [lemma, in strong_ref_complete]
ELTS_Theory.prime_set [variable, in strong_ref_complete]
ELTS_Theory.AX_K5 [constructor, in strong_ref_complete]
ELTS_Theory.expand_inj [projection, in strong_ref_complete]
ELTS_Theory.void_elts [definition, in strong_ref_complete]
ELTS_Theory.refines [definition, in strong_ref_complete]
ELTS_Theory.more_specs [definition, in strong_ref_complete]
ELTS_Theory.AXC_AX_theorem [lemma, in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref [section, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1step [inductive, in strong_ref_complete]
ELTS_Theory.step_crash_is [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step1 [constructor, in strong_ref_complete]
ELTS_Theory [module, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.ob [variable, in strong_ref_complete]
ELTS_Theory.interp_mode [definition, in strong_ref_complete]
ELTS_Theory.primeELTS [definition, in strong_ref_complete]
ELTS_Theory.AX'_AX [constructor, in strong_ref_complete]
ELTS_Theory.impl_free_rank1 [lemma, in strong_ref_complete]
ELTS_Theory.refinement_is_subset [lemma, in strong_ref_complete]
ELTS_Theory.refinement [definition, in strong_ref_complete]
ELTS_Theory.AXC_dia2 [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.mkQ1 [constructor, in strong_ref_complete]
ELTS_Theory.AXC_derives_AX [lemma, in strong_ref_complete]
ELTS_Theory.ExpandRef.q1x [projection, in strong_ref_complete]
ELTS_Theory.image_finite [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.q1H [projection, in strong_ref_complete]
ELTS_Theory.ExpandRef [module, in strong_ref_complete]
ELTS_Theory.AXC_box_dia [lemma, in strong_ref_complete]
ELTS_Theory.definitiveness_axiom2 [lemma, in strong_ref_complete]
ELTS_Theory.AX [inductive, in strong_ref_complete]
ELTS_Theory.AXC_boxTT [constructor, in strong_ref_complete]
ELTS_Theory.ELTS [record, in strong_ref_complete]
ELTS_Theory.stateX [constructor, in strong_ref_complete]
ELTS_Theory.bar_IPL [lemma, in strong_ref_complete]
ELTS_Theory.AX_K1 [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.X [variable, in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.R [variable, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1step2 [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step [inductive, in strong_ref_complete]
ELTS_Theory.more_specs_refinement [lemma, in strong_ref_complete]
ELTS_Theory.definitiveness_axiom1 [lemma, in strong_ref_complete]
ELTS_Theory.expand_prf1 [projection, in strong_ref_complete]
ELTS_Theory.AX'_em [constructor, in strong_ref_complete]
ELTS_Theory.refinement_refl [lemma, in strong_ref_complete]
ELTS_Theory.axiom_K6 [lemma, in strong_ref_complete]
ELTS_Theory.Y_interp_refines_inv [lemma, in strong_ref_complete]
ELTS_Theory.unit_is [definition, in strong_ref_complete]
ELTS_Theory.interp_st [inductive, in strong_ref_complete]
ELTS_Theory.AX_definite1 [constructor, in strong_ref_complete]
ELTS_Theory.ExpandRef.q2y [definition, in strong_ref_complete]
ELTS_Theory.AXC [inductive, in strong_ref_complete]
ELTS_Theory.start [constructor, in strong_ref_complete]
ELTS_Theory.AX_K2 [constructor, in strong_ref_complete]
ELTS_Theory.interpolate_worlds.main_x' [variable, in strong_ref_complete]
ELTS_Theory.unit_w [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1toQ2 [definition, in strong_ref_complete]
ELTS_Theory.ExpandRef.mkQ2 [constructor, in strong_ref_complete]
EM [record, in prelim]
enumerate [definition, in ref_alternatives]
EqdepElim [module, in base]
EqdepElim.eq_rect_eq [lemma, in base]
EqdepTh [module, in base]
equiv [definition, in strong_bisim]
equiv_trans [lemma, in strong_bisim]
equiv_sym [lemma, in strong_bisim]
equiv_refl [lemma, in strong_bisim]
eq_bisimulation [lemma, in strong_bisim]
exists_ext [lemma, in base]
existT_ext [lemma, in base]
exist_ext [lemma, in base]
expected [definition, in ref_alternatives]
extensionality [lemma, in base]


F

finite [definition, in finiteness]
finiteness [library]
finite_prefinite [lemma, in finiteness]
finite_nodup_lists [lemma, in finiteness]
finite_pairs [lemma, in finiteness]
finite_mapping [lemma, in finiteness]
finite_transform [lemma, in finiteness]
finite_select [lemma, in finiteness]
finite_lists_length_n [lemma, in finiteness]
forall_ext [lemma, in base]
forcesX [definition, in ref_alternatives]
forcesY [definition, in ref_alternatives]
forward_sim_to_beh_refine.L2 [variable, in compcert]
forward_sim_to_beh_refine.fsim [variable, in compcert]
forward_sim_to_beh_refine.L1 [variable, in compcert]
forward_sim_to_beh_refine.safe_dec [variable, in compcert]
forward_sim_to_beh_refine.L1recep [variable, in compcert]
forward_sim_to_beh_refine [section, in compcert]
forward_sim_to_beh_refine.L2determ [variable, in compcert]
fsim_refine [definition, in compcert]


I

iface [library]
image_finite [definition, in strong_bisim]
immed_safe_dec [definition, in compcert]
immed_safe [definition, in compcert]
impossible_list [lemma, in prelim]
imp_ext [lemma, in base]
inflationary [definition, in bourbaki]
initial_states_refine [lemma, in compcert]
interesting [definition, in ref_alternatives]
interp_mode_accessable [projection, in prelim]
interp_mode_monotone [projection, in prelim]
interp_sb_mode [definition, in strong_bisim]
interp_atom [projection, in prelim]
interp_atom_accessable [projection, in prelim]
interp_mode [projection, in prelim]
into [constructor, in prelim]
intro_world_step [constructor, in strong_bisim]
inv [definition, in prelim]
inv_comp [lemma, in prelim]
inv_eq [lemma, in prelim]
inv_bisimulation [lemma, in strong_bisim]
inv_intro [lemma, in prelim]
inv_union [lemma, in prelim]
inv_inv [lemma, in prelim]
is_quot [definition, in bourbaki]
is_interesting [definition, in ref_alternatives]


K

keep_uniq [definition, in ref_alternatives]


L

least_upper_bound [definition, in bourbaki]
left_to_rt [lemma, in base]
lift [inductive, in prelim]
lift_rel_incl' [lemma, in prelim]
lift_map [definition, in prelim]
lift_rel [definition, in prelim]
lift_join [definition, in prelim]
lift_rel_comp [lemma, in prelim]
lift_rel_mono [lemma, in prelim]
lift_rel_incl [lemma, in prelim]
limited_principle_of_omniscience' [definition, in bar_induction]
limited_principle_of_omniscience [definition, in bar_induction]
logic [library]
LOGIC_INPUT [record, in prelim]
LPO_eq [lemma, in bar_induction]
lts [section, in strong_bisim]
LTS [record, in strong_bisim]
LTS_TAU.lts_tau.finite_runs.Hfin [variable, in lts_tau]
LTS_REF.run_bisimilar [definition, in lts_ref]
LTS_TAU.step_run [definition, in lts_tau]
LTS_REF.steps [projection, in lts_ref]
LTS_REF.and_run_refinement [lemma, in lts_ref]
LTS_REF.weak_must_may_extend [lemma, in lts_ref]
LTS_REF.run_cycle_later [constructor, in lts_ref]
LTS_REF.run_transition_diagram [definition, in lts_ref]
LTS_REF.weak_may_extend [definition, in lts_ref]
LTS_REF.run_refinement [definition, in lts_ref]
LTS_TAU.hsys [projection, in lts_tau]
LTS_TAU.steps_plus [definition, in lts_tau]
LTS_REF.related_runs_incl [lemma, in lts_ref]
LTS_TAU.upd_root [definition, in lts_tau]
LTS_TAU.run_from [inductive, in lts_tau]
LTS_REF.must_may_extend [lemma, in lts_ref]
LTS_TAU.simulation_and [lemma, in lts_tau]
LTS_TAU.acyclic_run [definition, in lts_tau]
LTS_REF.hsys [projection, in lts_ref]
LTS_REF.SOS_to_LTS [definition, in lts_ref]
LTS_REF.bisimilar [definition, in lts_ref]
LTS_TAU.transition_diagram [definition, in lts_tau]
LTS_REF.weak_must_extend [definition, in lts_ref]
LTS_TAU.run_from_step [constructor, in lts_tau]
LTS_TAU.hdiverges_stable [lemma, in lts_tau]
LTS_TAU.hdiverges_mono [lemma, in lts_tau]
LTS_TAU.bisim_sim [lemma, in lts_tau]
LTS_REF.lts_halt [definition, in lts_ref]
LTS_REF.may_convergence_set [definition, in lts_ref]
LTS_REF.related_preruns [inductive, in lts_ref]
LTS_TAU.steps_star [definition, in lts_tau]
LTS_TAU.void_lts [definition, in lts_tau]
LTS_TAU.bisimulation [definition, in lts_tau]
LTS_REF.weak_path_run_rel [inductive, in lts_ref]
LTS_TAU.prev [projection, in lts_tau]
LTS_TAU.related_prerun_action [constructor, in lts_tau]
LTS_TAU.hdiverges_hconverges_dual [lemma, in lts_tau]
LTS_TAU.step_run_start_tau_run_from [lemma, in lts_tau]
LTS_TAU.path_obs_extend_intro [constructor, in lts_tau]
LTS_REF.acyclic_run [definition, in lts_ref]
LTS_REF.must_extend_star [definition, in lts_ref]
LTS_REF.hist_equiv [definition, in lts_ref]
LTS_TAU.weak_step_step_run [lemma, in lts_tau]
LTS_TAU.steps_tau [definition, in lts_tau]
LTS_REF.void_lts [definition, in lts_ref]
LTS_TAU.extended_run_steps_tau [lemma, in lts_tau]
LTS_REF.sys [projection, in lts_ref]
LTS_REF.run_cycle [inductive, in lts_ref]
LTS_REF.sos_irreducable [definition, in lts_ref]
LTS_TAU.run_bisimilar [definition, in lts_tau]
LTS_REF.td_and [definition, in lts_ref]
LTS_TAU.bisimulation_and [lemma, in lts_tau]
LTS_REF.related_prerun_action [constructor, in lts_ref]
LTS_TAU.run_simulation_and [lemma, in lts_tau]
LTS_TAU.sys [projection, in lts_tau]
LTS_TAU.extend_run [definition, in lts_tau]
LTS_TAU.step_star_extend_star [lemma, in lts_tau]
LTS_REF.prerun [definition, in lts_ref]
LTS_REF.curr [projection, in lts_ref]
LTS_REF.prev [projection, in lts_ref]
LTS_TAU.rtd_and [definition, in lts_tau]
LTS_REF.lts_ref.finite_runs [section, in lts_ref]
LTS_REF.run [record, in lts_ref]
LTS_REF.inv_bisimulation [lemma, in lts_ref]
LTS_REF.may_step [definition, in lts_ref]
LTS_TAU.LTS [record, in lts_tau]
LTS_REF.may_step_star [definition, in lts_ref]
LTS_TAU.div_from [definition, in lts_tau]
LTS_REF.may_extend_def [lemma, in lts_ref]
LTS_TAU.weak_path_run_rel_intro [constructor, in lts_tau]
LTS_TAU.lts_tau [section, in lts_tau]
LTS_TAU.strong_step_finite [lemma, in lts_tau]
LTS_REF.SOS_to_LTS_step_correct [lemma, in lts_ref]
LTS_TAU.step_run_decompose [lemma, in lts_tau]
LTS_TAU.bisimilar_sym [lemma, in lts_tau]
LTS_TAU.and_run_simulation [lemma, in lts_tau]
LTS_REF.run_from_start [constructor, in lts_ref]
LTS_REF.good_prerun [definition, in lts_ref]
LTS_REF.rtd_and [definition, in lts_ref]
LTS_TAU.run [record, in lts_tau]
LTS_TAU.good_run [projection, in lts_tau]
LTS_REF.sos_halt_dec [projection, in lts_ref]
LTS_REF.SOS_to_LTS_crash_correct [lemma, in lts_ref]
LTS_TAU.weak_step [definition, in lts_tau]
LTS_REF.weak_may_extend_def [lemma, in lts_ref]
LTS_TAU.run_bisimulation [definition, in lts_tau]
LTS_TAU.tau_paths_finite [lemma, in lts_tau]
LTS_TAU.run_ext [lemma, in lts_tau]
LTS_TAU.proc [record, in lts_tau]
LTS_REF.must_divergence_convergence_dual [lemma, in lts_ref]
LTS_REF.lts_ref.finite_runs.Hfin [variable, in lts_ref]
LTS_REF.step_star_extend_star [lemma, in lts_ref]
LTS_REF.weak_path_tau_rel_intro [constructor, in lts_ref]
LTS_REF.good_run [projection, in lts_ref]
LTS_TAU.sim_bisim [lemma, in lts_tau]
LTS_REF.run_bisimulation [definition, in lts_ref]
LTS_TAU.curr [projection, in lts_tau]
LTS_REF.extend_run [definition, in lts_ref]
LTS_REF.must_may_step_star [lemma, in lts_ref]
LTS_TAU.hrun [projection, in lts_tau]
LTS_REF.must_may_extend_star [lemma, in lts_ref]
LTS_REF.run_ext [lemma, in lts_ref]
LTS_TAU.root [projection, in lts_tau]
LTS_TAU.prerun_cycle_later [constructor, in lts_tau]
LTS_REF.weak_step_step_run [lemma, in lts_ref]
LTS_REF.may_hdivergence_set [definition, in lts_ref]
LTS_TAU.related_runs [definition, in lts_tau]
LTS_TAU.weak_image_finite_divergences [lemma, in lts_tau]
LTS_TAU.hist_equiv [definition, in lts_tau]
LTS_REF.may_must_extend [lemma, in lts_ref]
LTS_TAU.related_prerun_tau_right [constructor, in lts_tau]
LTS_REF.lts_ref.finite_runs.X [variable, in lts_ref]
LTS_REF.hst [definition, in lts_ref]
LTS_REF.SOS_decide [lemma, in lts_ref]
LTS_REF.hrun [projection, in lts_ref]
LTS_REF.lstate [definition, in lts_ref]
LTS_REF.may_divergence_set [definition, in lts_ref]
LTS_REF.acyclic_tau_paths_finite [lemma, in lts_ref]
LTS_REF.root [projection, in lts_ref]
LTS_REF.weak_image_finite_divergences [lemma, in lts_ref]
LTS_REF.weak_may_must_extend [lemma, in lts_ref]
LTS_REF.hist_accessable [definition, in lts_ref]
LTS_REF.may_extend_step [lemma, in lts_ref]
LTS_TAU.and_simulation [lemma, in lts_tau]
LTS_REF.may_step_plus [definition, in lts_ref]
LTS_REF.related_runs [definition, in lts_ref]
LTS_REF.bisimulation_and [lemma, in lts_ref]
LTS_TAU.related_runs_append [lemma, in lts_tau]
LTS_REF.weak_may_step [definition, in lts_ref]
LTS_REF.related_prerun_tau_right [constructor, in lts_ref]
LTS_TAU.weak_image_finite [definition, in lts_tau]
LTS_REF.must_converge [definition, in lts_ref]
LTS_REF.run_refines [definition, in lts_ref]
LTS_REF.sos_determ [projection, in lts_ref]
LTS_TAU.weak_paths_finite [definition, in lts_tau]
LTS_TAU.simulation [definition, in lts_tau]
LTS_REF [module, in lts_ref]
LTS_REF.inv_bisimilar [lemma, in lts_ref]
LTS_REF.run_bisimilar_refines [lemma, in lts_ref]
LTS_TAU.converges [definition, in lts_tau]
LTS_REF.ref_bisim [lemma, in lts_ref]
LTS_REF.step_run_start_append [lemma, in lts_ref]
LTS_TAU.inv_curr_rel [lemma, in lts_tau]
LTS_REF.curr_rel [definition, in lts_ref]
LTS_TAU.wd [definition, in lts_tau]
LTS_REF.SOS_to_LTS_deterministic [lemma, in lts_ref]
LTS_TAU.divergence_set [definition, in lts_tau]
LTS_REF.path_obs_extend [inductive, in lts_ref]
LTS_REF.must_extend_step [lemma, in lts_ref]
LTS_REF.inv_run_bisimulation [lemma, in lts_ref]
LTS_TAU.append_run_from [lemma, in lts_tau]
LTS_REF.append_run_from [lemma, in lts_ref]
LTS_REF.must_step_plus [definition, in lts_ref]
LTS_TAU.div_from_div_set [lemma, in lts_tau]
LTS_REF.run_from [inductive, in lts_ref]
LTS_TAU.related_prerun_end [constructor, in lts_tau]
LTS_TAU.weak_path_tau_rel_intro [constructor, in lts_tau]
LTS_TAU.hdiverges [definition, in lts_tau]
LTS_REF.state [projection, in lts_ref]
LTS_REF.prerun_cycle_later [constructor, in lts_ref]
LTS_REF.may_converge [definition, in lts_ref]
LTS_TAU.extended_run_decompose [lemma, in lts_tau]
LTS_TAU.append_run [definition, in lts_tau]
LTS_REF.append_run [definition, in lts_ref]
LTS_TAU.prerun_cycle_here [constructor, in lts_tau]
LTS_REF.may_extend_star [definition, in lts_ref]
LTS_TAU.related_preruns [inductive, in lts_tau]
LTS_REF.related_prerun_end [constructor, in lts_ref]
LTS_REF.must_convergence_set [definition, in lts_ref]
LTS_TAU.inv_run_bisimulation [lemma, in lts_tau]
LTS_TAU.steps [projection, in lts_tau]
LTS_TAU.run_similar [definition, in lts_tau]
LTS_TAU.acyclic_tau_paths_finite [lemma, in lts_tau]
LTS_REF.SOS_to_LTS_halt_correct [lemma, in lts_ref]
LTS_REF.refines [definition, in lts_ref]
LTS_REF.run_bisimulation_and [lemma, in lts_ref]
LTS_TAU.acyclic_obs_paths_finite [lemma, in lts_tau]
LTS_REF.strong_step_finite [lemma, in lts_ref]
LTS_REF.must_extend [definition, in lts_ref]
LTS_REF.lts_ref.SOS [section, in lts_ref]
LTS_TAU.extended_run_star_decompose [lemma, in lts_tau]
LTS_REF.accessible [definition, in lts_ref]
LTS_REF.weak_path_tau_rel [inductive, in lts_ref]
LTS_TAU.run_cycle_here [constructor, in lts_tau]
LTS_TAU.prerun_cycle [inductive, in lts_tau]
LTS_REF.must_diverge [definition, in lts_ref]
LTS_REF.step_run_start_run_from [lemma, in lts_ref]
LTS_REF.sos_state [projection, in lts_ref]
LTS_REF.start_run [definition, in lts_ref]
LTS_REF.may_hdiverge [definition, in lts_ref]
LTS_REF.refinement_and [lemma, in lts_ref]
LTS_REF.tau_paths_finite [lemma, in lts_ref]
LTS_REF.inv_run_bisimilar [lemma, in lts_ref]
LTS_REF.step_run_back_finite [lemma, in lts_ref]
LTS_REF.may_must_step [lemma, in lts_ref]
LTS_REF.must_hdiverge [definition, in lts_ref]
LTS_REF.may_must_extend_star [lemma, in lts_ref]
LTS_REF.run_from_step [constructor, in lts_ref]
LTS_REF.prerun_cycle_here [constructor, in lts_ref]
LTS_TAU.inv_bisimulation [lemma, in lts_tau]
LTS_REF.must_may_step [lemma, in lts_ref]
LTS_REF.sos_stuck [definition, in lts_ref]
LTS_TAU.run_from_start [constructor, in lts_tau]
LTS_REF.must_step_star [definition, in lts_ref]
LTS_REF.finite_divergences [definition, in lts_ref]
LTS_REF.weak_image_finite [definition, in lts_ref]
LTS_REF.related_preruns_incl [lemma, in lts_ref]
LTS_REF.may_must_step_star [lemma, in lts_ref]
LTS_REF.bisimulation [definition, in lts_ref]
LTS_TAU.finite_divergences [definition, in lts_tau]
LTS_REF.lts_ref [section, in lts_ref]
LTS_TAU.related_prerun_tau_left [constructor, in lts_tau]
LTS_REF.sos_step [projection, in lts_ref]
LTS_TAU.inv_run_bisimilar [lemma, in lts_tau]
LTS_TAU.hdivergence_set [definition, in lts_tau]
LTS_REF.refinement [definition, in lts_ref]
LTS_REF.may_diverge [definition, in lts_ref]
LTS_TAU.stable [definition, in lts_tau]
LTS_TAU.curr_rel [definition, in lts_tau]
LTS_REF.extended_run_star_decompose [lemma, in lts_ref]
LTS_TAU.start_run [definition, in lts_tau]
LTS_TAU.enables [definition, in lts_tau]
LTS_REF.must_divergence_set [definition, in lts_ref]
LTS_REF.bisimilar_sym [lemma, in lts_ref]
LTS_REF.may_divergence_convergence_dual [lemma, in lts_ref]
LTS_REF.LTS [record, in lts_ref]
LTS_TAU.hst [definition, in lts_tau]
LTS_TAU.history [record, in lts_tau]
LTS_REF.may_step_step [lemma, in lts_ref]
LTS_REF.may_extend_star_def [lemma, in lts_ref]
LTS_TAU.run_cycle_later [constructor, in lts_tau]
LTS_REF.related_prerun_tau_left [constructor, in lts_ref]
LTS_TAU.weak_image_finite_acyclic_runs [lemma, in lts_tau]
LTS_TAU.tau_path_extend_states_finite [lemma, in lts_tau]
LTS_TAU.run_bisim_sim [lemma, in lts_tau]
LTS_TAU.upd_run [definition, in lts_tau]
LTS_REF.prerun_cycle [inductive, in lts_ref]
LTS_REF.step_run_decompose [lemma, in lts_ref]
LTS_REF.history [record, in lts_ref]
LTS_REF.must_hdivergence_set [definition, in lts_ref]
LTS_REF.internally_deterministic [definition, in lts_ref]
LTS_TAU.run_bisimulation_and [lemma, in lts_tau]
LTS_REF.sos_halt [projection, in lts_ref]
LTS_REF.tau_path_extend_states_finite [lemma, in lts_ref]
LTS_REF.run_bisimilar_sym [lemma, in lts_ref]
LTS_TAU.weak_path_run_rel [inductive, in lts_tau]
LTS_REF.weak_image_finite_acyclic_runs [lemma, in lts_ref]
LTS_TAU.step_run_start_append [lemma, in lts_tau]
LTS_REF.SOS [record, in lts_ref]
LTS_TAU.run_sim_bisim [lemma, in lts_tau]
LTS_REF.transition_diagram [definition, in lts_ref]
LTS_REF.run_cycle_here [constructor, in lts_ref]
LTS_REF.and_run_bisimulation [lemma, in lts_ref]
LTS_REF.sos_halt_no_step [projection, in lts_ref]
LTS_REF.tau_path_from [definition, in lts_ref]
LTS_TAU.by_symmetry [lemma, in lts_tau]
LTS_REF.extended_run_decompose [lemma, in lts_ref]
LTS_TAU.inv_bisimilar [lemma, in lts_tau]
LTS_REF.and_refinement [lemma, in lts_ref]
LTS_TAU.extended_run_step [lemma, in lts_tau]
LTS_TAU.good_prerun [definition, in lts_tau]
LTS_TAU.td_and [definition, in lts_tau]
LTS_TAU.lts_tau.finite_runs [section, in lts_tau]
LTS_REF.weak_path_run_rel_intro [constructor, in lts_ref]
LTS_REF.process [record, in lts_ref]
LTS_TAU.weak_image_finite_acyclic_extensions [lemma, in lts_tau]
LTS_TAU.and_run_bisimulation [lemma, in lts_tau]
LTS_TAU.inv_related_runs [lemma, in lts_tau]
LTS_REF.weak_must_step [definition, in lts_ref]
LTS_REF.and_bisimulation [lemma, in lts_ref]
LTS_TAU.extended_run_star [definition, in lts_tau]
LTS_TAU.divergence_convergence_dual [lemma, in lts_tau]
LTS_REF.weak_image_finite_acyclic_extensions [lemma, in lts_ref]
LTS_TAU.tau_path_from [definition, in lts_tau]
LTS_TAU.hconvergence_set [definition, in lts_tau]
LTS_TAU.diverges [definition, in lts_tau]
LTS_TAU.bisimilar [definition, in lts_tau]
LTS_TAU.weak_path_tau_rel [inductive, in lts_tau]
LTS_REF.path_obs_extend_intro [constructor, in lts_ref]
LTS_TAU.equiv [definition, in lts_tau]
LTS_TAU.run_bisimilar_sym [lemma, in lts_tau]
LTS_REF.equiv [definition, in lts_ref]
LTS_TAU.convergence_set [definition, in lts_tau]
LTS_TAU.and_bisimulation [lemma, in lts_tau]
LTS_TAU [module, in lts_tau]
LTS_REF.weak_paths_finite [definition, in lts_ref]
LTS_REF.run_refinement_and [lemma, in lts_ref]
LTS_TAU.prerun [definition, in lts_tau]
LTS_REF.may_extend [definition, in lts_ref]
LTS_TAU.run_cycle [inductive, in lts_tau]
LTS_TAU.step_run_start_run_from [lemma, in lts_tau]
LTS_REF.acyclic_obs_paths_finite [lemma, in lts_ref]
LTS_TAU.state [projection, in lts_tau]
LTS_REF.step_run_start_tau_run_from [lemma, in lts_ref]
LTS_TAU.step_run_back_finite [lemma, in lts_tau]
LTS_TAU.run_transition_diagram [definition, in lts_tau]
LTS_TAU.run_simulation [definition, in lts_tau]
LTS_REF.may_extend_star_step [lemma, in lts_ref]
LTS_TAU.hconverges [definition, in lts_tau]
LTS_TAU.related_runs_incl [lemma, in lts_tau]
LTS_TAU.run_star_step_star [lemma, in lts_tau]
LTS_REF.must_step [definition, in lts_ref]
LTS_TAU.lts_tau.finite_runs.X [variable, in lts_tau]
LTS_REF.must_extend_star_step [lemma, in lts_ref]
LTS_TAU.path_obs_extend [inductive, in lts_tau]
LTS_TAU.extended_run [definition, in lts_tau]
lts_tau [library]
lts_ref [library]
lts.adequacy [section, in strong_bisim]
lts.adequacy.HfinX [variable, in strong_bisim]
lts.adequacy.HfinY [variable, in strong_bisim]
lts.adequacy.R [variable, in strong_bisim]
lts.adequacy.X [variable, in strong_bisim]
lts.adequacy.Y [variable, in strong_bisim]
lts.bisim [section, in strong_bisim]
lts.bisim.X [variable, in strong_bisim]
lts.bisim.Y [variable, in strong_bisim]
lts.mucalc [section, in strong_bisim]
lts.mucalc.characteristic [section, in strong_bisim]
lts.mucalc.characteristic.E1 [variable, in strong_bisim]
lts.mucalc.characteristic.X [variable, in strong_bisim]


M

make [definition, in ref_alternatives]
matching_states_refine [lemma, in compcert]
match_ev_none [constructor, in compcert]
match_ev_some [constructor, in compcert]
match_ev [inductive, in compcert]
maximal [definition, in bourbaki]
mho [constructor, in prelim]
mode [projection, in prelim]
mode [inductive, in strong_bisim]
MuCalc [module, in logic]
MuCalc.app [constructor, in logic]
MuCalc.arr [constructor, in logic]
MuCalc.atomic [constructor, in logic]
MuCalc.beta_rule [lemma, in logic]
MuCalc.cformula [definition, in logic]
MuCalc.CF_self [projection, in logic]
MuCalc.CF_other [projection, in logic]
MuCalc.characteristic_formula [record, in logic]
MuCalc.characteristic_iff_denotable_models [lemma, in logic]
MuCalc.completeness [lemma, in logic]
MuCalc.conj [constructor, in logic]
MuCalc.conj_intro [lemma, in logic]
MuCalc.conj_elim [lemma, in logic]
MuCalc.conj' [definition, in logic]
MuCalc.disj [constructor, in logic]
MuCalc.disj_intro [lemma, in logic]
MuCalc.disj_elim [lemma, in logic]
MuCalc.disj' [definition, in logic]
MuCalc.emptyE [definition, in logic]
MuCalc.entails [definition, in logic]
MuCalc.entails_TT [lemma, in logic]
MuCalc.env [record, in logic]
MuCalc.expressivity [lemma, in logic]
MuCalc.extend [definition, in logic]
MuCalc.extend_mdl_many [definition, in logic]
MuCalc.extend_mdl [definition, in logic]
MuCalc.extend_many [definition, in logic]
MuCalc.extend_mdl_many' [definition, in logic]
MuCalc.extend_mdl_deep [definition, in logic]
MuCalc.extend_many' [definition, in logic]
MuCalc.FF [definition, in logic]
MuCalc.FF_entails [lemma, in logic]
MuCalc.formula [inductive, in logic]
MuCalc.fsize [definition, in logic]
MuCalc.f_eq [definition, in logic]
MuCalc.f_and [definition, in logic]
MuCalc.f_or [definition, in logic]
MuCalc.impl [constructor, in logic]
MuCalc.inf [definition, in logic]
MuCalc.interp [definition, in logic]
MuCalc.interp_shift_var_lemma [lemma, in logic]
MuCalc.interp_shift_lemma [lemma, in logic]
MuCalc.interp_cformula [definition, in logic]
MuCalc.interp_monotone [lemma, in logic]
MuCalc.interp_shift_neg_many_lemma [lemma, in logic]
MuCalc.interp' [definition, in logic]
MuCalc.interp'_monotone [lemma, in logic]
MuCalc.kripke_monotone [definition, in logic]
MuCalc.lam [constructor, in logic]
MuCalc.max_model [definition, in logic]
MuCalc.me_nil [constructor, in logic]
MuCalc.me_cons [constructor, in logic]
MuCalc.min_model [definition, in logic]
MuCalc.modality [constructor, in logic]
MuCalc.model [definition, in logic]
MuCalc.models_denotable [lemma, in logic]
MuCalc.model_kripke [lemma, in logic]
MuCalc.model_apply [definition, in logic]
MuCalc.model_le [definition, in logic]
MuCalc.model_property [definition, in logic]
MuCalc.model_app [definition, in logic]
MuCalc.model_exts [inductive, in logic]
MuCalc.model_element [definition, in logic]
MuCalc.model_eq [lemma, in logic]
MuCalc.modus_ponens [lemma, in logic]
MuCalc.mu [constructor, in logic]
MuCalc.mucalc [section, in logic]
MuCalc.mucalc.characteristic_consequences.CF [variable, in logic]
MuCalc.mucalc.characteristic_consequences [section, in logic]
MuCalc.mucalc.characteristic_consequences.HCF [variable, in logic]
MuCalc.mucalc.E0 [variable, in logic]
MuCalc.mucalc.fixpoints [section, in logic]
MuCalc.mucalc.fixpoints.F [variable, in logic]
MuCalc.mucalc.fixpoints.t [variable, in logic]
MuCalc.mu_equation [lemma, in logic]
MuCalc.mu' [definition, in logic]
MuCalc.neg [definition, in logic]
MuCalc.nu [constructor, in logic]
MuCalc.nu_equation [lemma, in logic]
MuCalc.nu' [definition, in logic]
MuCalc.o [constructor, in logic]
MuCalc.premodel [definition, in logic]
MuCalc.replace_var [definition, in logic]
MuCalc.representation [definition, in logic]
MuCalc.representation_denotation [lemma, in logic]
MuCalc.representation' [definition, in logic]
MuCalc.representation'_denotation [lemma, in logic]
MuCalc.shift [definition, in logic]
MuCalc.shift_neg [definition, in logic]
MuCalc.shift_neg_many [definition, in logic]
MuCalc.shift_var' [definition, in logic]
MuCalc.shift_var [definition, in logic]
MuCalc.subst [definition, in logic]
MuCalc.subst_neg [definition, in logic]
MuCalc.subst_spec' [lemma, in logic]
MuCalc.subst_var_spec [lemma, in logic]
MuCalc.subst_spec [lemma, in logic]
MuCalc.subst_spec_full [lemma, in logic]
MuCalc.subst' [definition, in logic]
MuCalc.sup [definition, in logic]
MuCalc.sz [inductive, in logic]
MuCalc.szL [constructor, in logic]
MuCalc.szL_inj [lemma, in logic]
MuCalc.szO [constructor, in logic]
MuCalc.szS [constructor, in logic]
MuCalc.TT [definition, in logic]
MuCalc.typ [inductive, in logic]
MuCalc.valid [definition, in logic]
MuCalc.var [constructor, in logic]
MuCalc.Vars [projection, in logic]
MuCalc.Vars_typ [projection, in logic]
MuCalc.Vars_dec [projection, in logic]


N

NNPP [lemma, in prelim]
nodup_list_length [lemma, in finiteness]
normal [definition, in bourbaki]
normalize [definition, in ref_alternatives]
normal1 [lemma, in bourbaki]
normal2 [lemma, in bourbaki]


O

O [projection, in prelim]
ObservationSystem [record, in prelim]
observations_inhabited [projection, in prelim]
OBSERVATION_SYSTEM.O [axiom, in strong_ref_complete]
OBSERVATION_SYSTEM.O_inh [axiom, in strong_ref_complete]
OBSERVATION_SYSTEM.order_O_wf [axiom, in strong_ref_complete]
OBSERVATION_SYSTEM [module, in strong_ref_complete]
OBSERVATION_SYSTEM.order_O_total [axiom, in strong_ref_complete]
OBSERVATION_SYSTEM.order_O [axiom, in strong_ref_complete]
OBSERVATION_SYSTEM.order_O_trans [axiom, in strong_ref_complete]
obs_event [constructor, in compcert]
obs_terminate [constructor, in compcert]
omniscience [lemma, in bar_induction]
omniscience [section, in bar_induction]
omniscience.B [variable, in bar_induction]
omniscience.Bw [variable, in bar_induction]
omniscience.R [variable, in bar_induction]
omniscience.Rdec [variable, in bar_induction]
omniscience.R' [variable, in bar_induction]
omniscience.U [variable, in bar_induction]
ORDERED_LOGIC_INPUT [record, in prelim]
ordered_set [definition, in bourbaki]
order_mode_wf [projection, in prelim]
order_atom_wf [projection, in prelim]
order_mode [projection, in prelim]
order_atom_trans [projection, in prelim]
order_atom_total [projection, in prelim]
order_atom [projection, in prelim]
order_mode_trans [projection, in prelim]
order_options [inductive, in ref_alternatives]
order_mode_total [projection, in prelim]
ord_both [definition, in ref_alternatives]
or_ext [lemma, in base]
outer_closed [lemma, in bourbaki]


P

paths [section, in prelim]
paths.R [variable, in prelim]
paths.X [variable, in prelim]
path_where_incl [lemma, in prelim]
path_rt [lemma, in prelim]
path_where [inductive, in prelim]
path_cons [constructor, in prelim]
path_cons_right [lemma, in prelim]
path_nil [constructor, in prelim]
path_trans [lemma, in prelim]
path_inv_right [lemma, in prelim]
plus_decompose [lemma, in compcert]
prefinite [definition, in finiteness]
prelim [library]
proof_irr [lemma, in base]
PropLogic [module, in prop_logic]
PropLogic.A [constructor, in prop_logic]
PropLogic.admissable_formula [definition, in prop_logic]
PropLogic.alternate_prime_lemma [lemma, in prop_logic]
PropLogic.atomic [constructor, in prop_logic]
PropLogic.CONJ [constructor, in prop_logic]
PropLogic.conj [constructor, in prop_logic]
PropLogic.deduction [lemma, in prop_logic]
PropLogic.derives [inductive, in prop_logic]
PropLogic.derives_truth [lemma, in prop_logic]
PropLogic.derives_cut [constructor, in prop_logic]
PropLogic.derives_weaken [lemma, in prop_logic]
PropLogic.derives_logic [constructor, in prop_logic]
PropLogic.derives_collapse [lemma, in prop_logic]
PropLogic.derives_TT [lemma, in prop_logic]
PropLogic.derives_FF [lemma, in prop_logic]
PropLogic.derives_axiom [constructor, in prop_logic]
PropLogic.derives_set [definition, in prop_logic]
PropLogic.derives_conj [lemma, in prop_logic]
PropLogic.derives_disj [lemma, in prop_logic]
PropLogic.derives_reg [constructor, in prop_logic]
PropLogic.derives_assume [constructor, in prop_logic]
PropLogic.disj [constructor, in prop_logic]
PropLogic.DISJ [constructor, in prop_logic]
PropLogic.disjunctive_rearrange [lemma, in prop_logic]
PropLogic.disjunctive_elim [lemma, in prop_logic]
PropLogic.disjunctive_combine2 [lemma, in prop_logic]
PropLogic.disjunctive_combine [lemma, in prop_logic]
PropLogic.E0 [definition, in prop_logic]
PropLogic.FF [constructor, in prop_logic]
PropLogic.FF_ [constructor, in prop_logic]
PropLogic.formula [inductive, in prop_logic]
PropLogic.formula_to_syntax [definition, in prop_logic]
PropLogic.formula_to_syntax_inj [lemma, in prop_logic]
PropLogic.fsyn [inductive, in prop_logic]
PropLogic.fsyn_symbol_lt_M [constructor, in prop_logic]
PropLogic.fsyn_order [definition, in prop_logic]
PropLogic.fsyn_order_wf [lemma, in prop_logic]
PropLogic.fsyn_number [definition, in prop_logic]
PropLogic.fsyn_order_trans [lemma, in prop_logic]
PropLogic.fsyn_order_total [lemma, in prop_logic]
PropLogic.fsyn_symbol_lt_A [constructor, in prop_logic]
PropLogic.fsyn_symbol_lt [inductive, in prop_logic]
PropLogic.IMPL [constructor, in prop_logic]
PropLogic.impl [constructor, in prop_logic]
PropLogic.impl_adjoint1 [lemma, in prop_logic]
PropLogic.impl_adjoint2 [lemma, in prop_logic]
PropLogic.impl_free [definition, in prop_logic]
PropLogic.inflate_theory_iso [lemma, in prop_logic]
PropLogic.inflate_theory_inflationary [lemma, in prop_logic]
PropLogic.inflate_theory_fixpoint_maximal [lemma, in prop_logic]
PropLogic.inflate_theory [definition, in prop_logic]
PropLogic.interp [definition, in prop_logic]
PropLogic.interp_acc [lemma, in prop_logic]
PropLogic.interp' [definition, in prop_logic]
PropLogic.IPL [inductive, in prop_logic]
PropLogic.IPL_then1 [constructor, in prop_logic]
PropLogic.IPL_or1 [constructor, in prop_logic]
PropLogic.IPL_TT [constructor, in prop_logic]
PropLogic.IPL_valid [lemma, in prop_logic]
PropLogic.IPL_or2 [constructor, in prop_logic]
PropLogic.IPL_or3 [constructor, in prop_logic]
PropLogic.IPL_FF [constructor, in prop_logic]
PropLogic.IPL_then2 [constructor, in prop_logic]
PropLogic.IPL_and3 [constructor, in prop_logic]
PropLogic.IPL_and2 [constructor, in prop_logic]
PropLogic.IPL_and1 [constructor, in prop_logic]
PropLogic.kripke_monotone [definition, in prop_logic]
PropLogic.list_conj [definition, in prop_logic]
PropLogic.list_disj [definition, in prop_logic]
PropLogic.M [constructor, in prop_logic]
PropLogic.maximal_theory_avoiding_disjunctive [lemma, in prop_logic]
PropLogic.minimize_admissable_formula [lemma, in prop_logic]
PropLogic.modality [constructor, in prop_logic]
PropLogic.model [definition, in prop_logic]
PropLogic.model_kripke [lemma, in prop_logic]
PropLogic.model_eq [lemma, in prop_logic]
PropLogic.model_app [definition, in prop_logic]
PropLogic.model_le [definition, in prop_logic]
PropLogic.order_list_wf [lemma, in prop_logic]
PropLogic.order_formula_irr [lemma, in prop_logic]
PropLogic.order_list_struct [definition, in prop_logic]
PropLogic.order_formula_wf [lemma, in prop_logic]
PropLogic.order_list_struct_len [lemma, in prop_logic]
PropLogic.order_formula_trans [lemma, in prop_logic]
PropLogic.order_list_total [lemma, in prop_logic]
PropLogic.order_formula_total [lemma, in prop_logic]
PropLogic.order_list_trans [lemma, in prop_logic]
PropLogic.order_list [definition, in prop_logic]
PropLogic.order_formula [definition, in prop_logic]
PropLogic.premodel [definition, in prop_logic]
PropLogic.prime_set [record, in prop_logic]
PropLogic.prime_theory_avoiding [definition, in prop_logic]
PropLogic.prime_lemma [lemma, in prop_logic]
PropLogic.proplogic [section, in prop_logic]
PropLogic.proplogic.order_list.R [variable, in prop_logic]
PropLogic.proplogic.order_list [section, in prop_logic]
PropLogic.proplogic.order_list.A [variable, in prop_logic]
PropLogic.proplogic.prime_sets.AX [variable, in prop_logic]
PropLogic.proplogic.prime_sets [section, in prop_logic]
PropLogic.pset [projection, in prop_logic]
PropLogic.pset_closed [projection, in prop_logic]
PropLogic.pset_consistent [projection, in prop_logic]
PropLogic.pset_disjunctive [projection, in prop_logic]
PropLogic.pset_impl_free [projection, in prop_logic]
PropLogic.smallest_admissable_formula [definition, in prop_logic]
PropLogic.tavd_closed [projection, in prop_logic]
PropLogic.tavd_set [projection, in prop_logic]
PropLogic.tavd_impl_free [projection, in prop_logic]
PropLogic.tavd_contains [projection, in prop_logic]
PropLogic.tavd_avoids [projection, in prop_logic]
PropLogic.ta_chain_sup [definition, in prop_logic]
PropLogic.ta_ord [definition, in prop_logic]
PropLogic.ta_chain_complete [lemma, in prop_logic]
PropLogic.theorem [definition, in prop_logic]
PropLogic.theorems_valid [lemma, in prop_logic]
PropLogic.theorem_weaken [lemma, in prop_logic]
PropLogic.theory_avoiding [record, in prop_logic]
PropLogic.theory_avoiding_incr_ord [lemma, in prop_logic]
PropLogic.theory_avoiding0 [definition, in prop_logic]
PropLogic.theory_avoiding_incr [definition, in prop_logic]
PropLogic.TT [constructor, in prop_logic]
PropLogic.TT_ [constructor, in prop_logic]
PropLogic.unwind_derives [lemma, in prop_logic]
PropLogic.valid [definition, in prop_logic]
prop_ext [axiom, in base]
prop_soundness [lemma, in strong_bisim]
prop_logic [library]


Q

q [definition, in bourbaki]
quot [definition, in bourbaki]
q_eq [lemma, in bourbaki]


R

READY_PRUNE.ready_prune.mucalc.characteristic.X [variable, in strong_choice]
READY_PRUNE.ELTS [record, in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune.R [variable, in strong_choice]
READY_PRUNE.ready_prune.ref_prune.Y [variable, in strong_beh_choice]
READY_PRUNE.world_acc [definition, in strong_choice]
READY_PRUNE.steps [projection, in strong_beh_choice]
READY_PRUNE.Q1Q2_prune [lemma, in strong_beh_choice]
READY_PRUNE.wrong_rel_mho' [constructor, in strong_beh_choice]
READY_PRUNE.Q2step1 [constructor, in strong_choice]
READY_PRUNE.mkQ1 [constructor, in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.HfinX [variable, in strong_choice]
READY_PRUNE.lstate [definition, in strong_beh_choice]
READY_PRUNE.world [record, in strong_beh_choice]
READY_PRUNE.sys [projection, in strong_choice]
READY_PRUNE.Q2st [inductive, in strong_choice]
READY_PRUNE.expansion_refinement [lemma, in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.HfinX [variable, in strong_beh_choice]
READY_PRUNE.mkQ1 [constructor, in strong_choice]
READY_PRUNE.Q2step1 [constructor, in strong_beh_choice]
READY_PRUNE.Q2step [inductive, in strong_beh_choice]
READY_PRUNE.ready_sim [definition, in strong_choice]
READY_PRUNE.acc_refl [lemma, in strong_choice]
READY_PRUNE.prune_inj [projection, in strong_beh_choice]
READY_PRUNE.characteristic_self [lemma, in strong_choice]
READY_PRUNE.root [projection, in strong_choice]
READY_PRUNE.prune_sub [projection, in strong_beh_choice]
READY_PRUNE.ready_prune [section, in strong_beh_choice]
READY_PRUNE.global_pruning_bisim [lemma, in strong_choice]
READY_PRUNE.ready_sim [definition, in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune.X [variable, in strong_choice]
READY_PRUNE.ready_prune.adequacy.X [variable, in strong_choice]
READY_PRUNE.prop_soundness [lemma, in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy [section, in strong_beh_choice]
READY_PRUNE.enables [definition, in strong_beh_choice]
READY_PRUNE.bisimilar [definition, in strong_choice]
READY_PRUNE.box [constructor, in strong_beh_choice]
READY_PRUNE.offers [constructor, in strong_beh_choice]
READY_PRUNE.ready_ref [definition, in strong_beh_choice]
READY_PRUNE.wrong_bisimulation [definition, in strong_beh_choice]
READY_PRUNE.mkQ3_Y [constructor, in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune [section, in strong_beh_choice]
READY_PRUNE.ready_ref_refl [lemma, in strong_beh_choice]
READY_PRUNE.ready_ref_trans [lemma, in strong_beh_choice]
READY_PRUNE.XQ1_bisim [lemma, in strong_beh_choice]
READY_PRUNE.wrong_rel_into [constructor, in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc.characteristic [section, in strong_choice]
READY_PRUNE.interp_sc_atom [definition, in strong_beh_choice]
READY_PRUNE.enables [definition, in strong_choice]
READY_PRUNE.world [record, in strong_choice]
READY_PRUNE.sys [projection, in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.X [variable, in strong_beh_choice]
READY_PRUNE.characteristic_other [lemma, in strong_beh_choice]
READY_PRUNE.ready_ref_prune [lemma, in strong_choice]
READY_PRUNE.image_finite [definition, in strong_beh_choice]
READY_PRUNE.global_pruned [definition, in strong_beh_choice]
READY_PRUNE.Q3st [inductive, in strong_beh_choice]
READY_PRUNE.strong_choice_logic_input [instance, in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.Y [variable, in strong_choice]
READY_PRUNE.expand_inj [projection, in strong_beh_choice]
READY_PRUNE.prune_enable [projection, in strong_beh_choice]
READY_PRUNE.wrong_rel_mho [constructor, in strong_beh_choice]
READY_PRUNE.comp_ready_sim [lemma, in strong_beh_choice]
READY_PRUNE.expand_prune_extension [definition, in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune.Hp [variable, in strong_beh_choice]
READY_PRUNE.Q3step2 [constructor, in strong_beh_choice]
READY_PRUNE.Q2Q3_expand [lemma, in strong_beh_choice]
READY_PRUNE.smallest_expand_prune_extension [definition, in strong_beh_choice]
READY_PRUNE.Q3step4 [constructor, in strong_beh_choice]
READY_PRUNE.expand_prf3 [projection, in strong_beh_choice]
READY_PRUNE.Q3step3 [constructor, in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc.characteristic.X [variable, in strong_beh_choice]
READY_PRUNE.mkQ2 [constructor, in strong_choice]
READY_PRUNE.Q2Y_bisim [lemma, in strong_choice]
READY_PRUNE.ready_prune.ref_prune [section, in strong_choice]
READY_PRUNE.ready_ref_trans [lemma, in strong_choice]
READY_PRUNE.acc_trans [lemma, in strong_choice]
READY_PRUNE.strong_choice_logic_input [instance, in strong_choice]
READY_PRUNE.ready_prune.adequacy.R [variable, in strong_choice]
READY_PRUNE.Q3 [definition, in strong_beh_choice]
READY_PRUNE.ready_ref [definition, in strong_choice]
READY_PRUNE.box [constructor, in strong_choice]
READY_PRUNE.strong_ref_mho [lemma, in strong_beh_choice]
READY_PRUNE.expand_prf1 [projection, in strong_beh_choice]
READY_PRUNE.Q2st [inductive, in strong_beh_choice]
READY_PRUNE.CF [definition, in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune.Hp [variable, in strong_choice]
READY_PRUNE.must_enable [definition, in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.HfinY [variable, in strong_beh_choice]
READY_PRUNE.CF [definition, in strong_choice]
READY_PRUNE.XQ1_bisim [lemma, in strong_choice]
READY_PRUNE.offers [constructor, in strong_choice]
READY_PRUNE.ready_prune.ref_prune.R [variable, in strong_beh_choice]
READY_PRUNE [module, in strong_beh_choice]
READY_PRUNE.comp_ready_sim [lemma, in strong_choice]
READY_PRUNE.wrong_expanded [definition, in strong_beh_choice]
READY_PRUNE.Q1 [definition, in strong_choice]
READY_PRUNE.Q1step1 [constructor, in strong_beh_choice]
READY_PRUNE.ready_ref_refl [lemma, in strong_choice]
READY_PRUNE.Q1step [inductive, in strong_beh_choice]
READY_PRUNE.root [projection, in strong_beh_choice]
READY_PRUNE.Q3step1 [constructor, in strong_beh_choice]
READY_PRUNE.mode [inductive, in strong_choice]
READY_PRUNE.ready_prune.mucalc [section, in strong_choice]
READY_PRUNE.Q3step [inductive, in strong_beh_choice]
READY_PRUNE.state [projection, in strong_beh_choice]
READY_PRUNE.acc_refl [lemma, in strong_beh_choice]
READY_PRUNE.prune_sub [projection, in strong_choice]
READY_PRUNE.ready_ref_smallest [lemma, in strong_beh_choice]
READY_PRUNE.wrong_bisimilar [definition, in strong_beh_choice]
READY_PRUNE.Q3Y_bisim [lemma, in strong_beh_choice]
READY_PRUNE.mode [inductive, in strong_beh_choice]
READY_PRUNE.atom [inductive, in strong_choice]
READY_PRUNE.wrong_rel [inductive, in strong_beh_choice]
READY_PRUNE.atom [inductive, in strong_beh_choice]
READY_PRUNE.LTS [record, in strong_choice]
READY_PRUNE.image_finite [definition, in strong_choice]
READY_PRUNE.ready_prune.mucalc.characteristic.E1 [variable, in strong_choice]
READY_PRUNE.Q1st [inductive, in strong_beh_choice]
READY_PRUNE.adequate_ready_sim [lemma, in strong_beh_choice]
READY_PRUNE.Q1step [inductive, in strong_choice]
READY_PRUNE.Q2 [definition, in strong_beh_choice]
READY_PRUNE.wrong_rel' [inductive, in strong_beh_choice]
READY_PRUNE.prune_inj [projection, in strong_choice]
READY_PRUNE.eq_ready_sim [lemma, in strong_choice]
READY_PRUNE.acc_trans [lemma, in strong_beh_choice]
READY_PRUNE.eq_ready_sim [lemma, in strong_beh_choice]
READY_PRUNE.Q1st [inductive, in strong_choice]
READY_PRUNE.bisim_ready_sim [lemma, in strong_beh_choice]
READY_PRUNE.wrong_rel_into' [constructor, in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc [section, in strong_beh_choice]
READY_PRUNE.CF_is_characteristic [lemma, in strong_beh_choice]
READY_PRUNE.global_pruned_ref [definition, in strong_choice]
READY_PRUNE.ready_prune.ref_prune.Y [variable, in strong_choice]
READY_PRUNE.ready_prune.adequacy.Y [variable, in strong_beh_choice]
READY_PRUNE.ready_sim_comp [lemma, in strong_choice]
READY_PRUNE.Q2 [definition, in strong_choice]
READY_PRUNE.ready_prune.mucalc.characteristic.E1 [variable, in strong_beh_choice]
READY_PRUNE [module, in strong_choice]
READY_PRUNE.ready_prune.mucalc.characteristic [section, in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.R [variable, in strong_beh_choice]
READY_PRUNE.prop_soundness [lemma, in strong_choice]
READY_PRUNE.steps [projection, in strong_choice]
READY_PRUNE.wrong_expansion [record, in strong_beh_choice]
READY_PRUNE.bisim_ready_sim [lemma, in strong_choice]
READY_PRUNE.global_pruning [record, in strong_choice]
READY_PRUNE.adequacy [lemma, in strong_choice]
READY_PRUNE.characteristic_self [lemma, in strong_beh_choice]
READY_PRUNE.Q2step [inductive, in strong_choice]
READY_PRUNE.may_step [definition, in strong_beh_choice]
READY_PRUNE.must_step [definition, in strong_beh_choice]
READY_PRUNE.state [projection, in strong_choice]
READY_PRUNE.adequate_ready_sim [lemma, in strong_choice]
READY_PRUNE.ready_prune.adequacy.HfinY [variable, in strong_choice]
READY_PRUNE.Q2step2 [constructor, in strong_beh_choice]
READY_PRUNE.mho_valid [lemma, in strong_beh_choice]
READY_PRUNE.CF_body [definition, in strong_choice]
READY_PRUNE.interp_sc_mode [definition, in strong_beh_choice]
READY_PRUNE.ready_prune [section, in strong_choice]
READY_PRUNE.Q1Q2_prune [lemma, in strong_choice]
READY_PRUNE.interp_sc_mode [definition, in strong_choice]
READY_PRUNE.ready_prune.ref_prune.X [variable, in strong_beh_choice]
READY_PRUNE.CF_is_characteristic [lemma, in strong_choice]
READY_PRUNE.prune_enable [projection, in strong_choice]
READY_PRUNE.global_pruning_bisim [lemma, in strong_beh_choice]
READY_PRUNE.world_acc [definition, in strong_beh_choice]
READY_PRUNE.expand_prf2 [projection, in strong_beh_choice]
READY_PRUNE.bisim [definition, in strong_choice]
READY_PRUNE.adequacy [lemma, in strong_beh_choice]
READY_PRUNE.interp_sc_atom [definition, in strong_choice]
READY_PRUNE.CF_main [definition, in strong_beh_choice]
READY_PRUNE.mkQ2 [constructor, in strong_beh_choice]
READY_PRUNE.Q1step1 [constructor, in strong_choice]
READY_PRUNE.ready_sim_comp [lemma, in strong_beh_choice]
READY_PRUNE.global_pruning [record, in strong_beh_choice]
READY_PRUNE.Q1 [definition, in strong_beh_choice]
READY_PRUNE.CF_main [definition, in strong_choice]
READY_PRUNE.ready_prune.adequacy [section, in strong_choice]
READY_PRUNE.CF_body [definition, in strong_beh_choice]
READY_PRUNE.characteristic_other [lemma, in strong_choice]
READY_PRUNE.mkQ3 [constructor, in strong_beh_choice]
RefC [constructor, in ref_alternatives]
refinement [definition, in ref_alternatives]
refinement_strengthen' [definition, in ref_alternatives]
refinement_strengthen [definition, in ref_alternatives]
refines [definition, in ref_alternatives]
refines_strengthen [lemma, in ref_alternatives]
refines_symmetric [lemma, in ref_alternatives]
reflx [definition, in ref_alternatives]
ref_alt [section, in ref_alternatives]
ref_choices [record, in ref_alternatives]
ref_alternatives [library]
rel_union [definition, in prelim]
right_to_rt [lemma, in base]
root [projection, in strong_bisim]
rtl_refl [constructor, in base]
rtl_step [constructor, in base]
rtl_trans [lemma, in base]
rtr_step [constructor, in base]
rtr_refl [constructor, in base]
rtr_trans [lemma, in base]
rt_t_trans [lemma, in base]
rt_right [inductive, in base]
rt_inv [lemma, in base]
rt_to_right [lemma, in base]
rt_left [inductive, in base]
rt_mono [lemma, in base]
rt_to_left [lemma, in base]
rule [record, in bar_induction]
rule_following [definition, in bar_induction]
rule_nil [projection, in bar_induction]
rule_down [projection, in bar_induction]
rule_set [projection, in bar_induction]
run [constructor, in compcert]
R'dec [lemma, in bar_induction]
R'down [lemma, in bar_induction]
R'0 [lemma, in bar_induction]


S

securable [inductive, in bar_induction]
securable_induction [lemma, in bar_induction]
sec_incl [constructor, in bar_induction]
sec_mono [constructor, in bar_induction]
sec_hered [constructor, in bar_induction]
select_subset [lemma, in prelim]
semantics_lts_step [inductive, in compcert]
semantics_lts_state [inductive, in compcert]
semantics_LTS [definition, in compcert]
sem_lts_step_term [constructor, in compcert]
sem_lts_step_ok [constructor, in compcert]
sem_lts_step_wrong [constructor, in compcert]
seqt_logic [library]
SequentCompleteness [module, in strong_ref_complete2]
SequentCompleteness.adequate [lemma, in strong_ref_complete2]
SequentCompleteness.axioms_soundness [lemma, in strong_ref_complete2]
SequentCompleteness.axiom_Sq5 [lemma, in strong_ref_complete2]
SequentCompleteness.box_successor [lemma, in strong_ref_complete2]
SequentCompleteness.cannonical_model [lemma, in strong_ref_complete2]
SequentCompleteness.definite [definition, in strong_ref_complete2]
SequentCompleteness.definite_prime_set [definition, in strong_ref_complete2]
SequentCompleteness.definite_set [definition, in strong_ref_complete2]
SequentCompleteness.def_subset [definition, in strong_ref_complete2]
SequentCompleteness.derives_nec [lemma, in strong_ref_complete2]
SequentCompleteness.dia_successor [lemma, in strong_ref_complete2]
SequentCompleteness.disjunctive_property_of_theorems [lemma, in strong_ref_complete2]
SequentCompleteness.from_impl_free [lemma, in strong_ref_complete2]
SequentCompleteness.Hsequent [definition, in strong_ref_complete2]
SequentCompleteness.Hsequent_rank1 [lemma, in strong_ref_complete2]
SequentCompleteness.main [lemma, in strong_ref_complete2]
SequentCompleteness.PL [module, in strong_ref_complete2]
SequentCompleteness.primeELTS [definition, in strong_ref_complete2]
SequentCompleteness.prime_theorems_or_definite [lemma, in strong_ref_complete2]
SequentCompleteness.prime_definite_set [lemma, in strong_ref_complete2]
SequentCompleteness.prime_definite_definite_set [lemma, in strong_ref_complete2]
SequentCompleteness.prime_set [variable, in strong_ref_complete2]
SequentCompleteness.same_sequents [lemma, in strong_ref_complete2]
SequentCompleteness.sequent_list_conj [lemma, in strong_ref_complete2]
SequentCompleteness.sequent_list_conj2 [lemma, in strong_ref_complete2]
SequentCompleteness.sequent_completeness [lemma, in strong_ref_complete2]
SequentCompleteness.sequent_soundness [lemma, in strong_ref_complete2]
SequentCompleteness.set_steps [definition, in strong_ref_complete2]
SequentCompleteness.SqAX [inductive, in strong_ref_complete2]
SequentCompleteness.SqAX0 [constructor, in strong_ref_complete2]
SequentCompleteness.SqAX1 [constructor, in strong_ref_complete2]
SequentCompleteness.SqAX2 [constructor, in strong_ref_complete2]
SequentCompleteness.SqAX3 [constructor, in strong_ref_complete2]
SequentCompleteness.SqAX4 [constructor, in strong_ref_complete2]
SequentCompleteness.SqAX5 [constructor, in strong_ref_complete2]
SequentCompleteness.SqD1 [constructor, in strong_ref_complete2]
SequentCompleteness.SqD2 [constructor, in strong_ref_complete2]
SequentCompleteness.SqD3 [constructor, in strong_ref_complete2]
SequentCompleteness.sqt_reg_box [lemma, in strong_ref_complete2]
SequentCompleteness.subset [definition, in strong_ref_complete2]
SequentCompleteness.theorem [definition, in strong_ref_complete2]
SequentCompleteness.theorem_soundness [lemma, in strong_ref_complete2]
SequentCompleteness.theorem_completeness [lemma, in strong_ref_complete2]
SequentCompleteness.toH [definition, in strong_ref_complete2]
SequentCompleteness.toH_impl_free [lemma, in strong_ref_complete2]
SequentCompleteness.toH_interp [lemma, in strong_ref_complete2]
SequentCompleteness.unlift [definition, in strong_ref_complete2]
SequentCompleteness.valid_sequent [definition, in strong_ref_complete2]
SequentCompleteness.X [module, in strong_ref_complete2]
SequentLogic [module, in seqt_logic]
SequentLogic.admissable_formula [definition, in seqt_logic]
SequentLogic.alternate_prime_lemma [lemma, in seqt_logic]
SequentLogic.conj [constructor, in seqt_logic]
SequentLogic.CONJ [constructor, in seqt_logic]
SequentLogic.derives_set [definition, in seqt_logic]
SequentLogic.derives_sets [definition, in seqt_logic]
SequentLogic.derives_assume [definition, in seqt_logic]
SequentLogic.derives_weaken [lemma, in seqt_logic]
SequentLogic.derives_collapse [lemma, in seqt_logic]
SequentLogic.DISJ [constructor, in seqt_logic]
SequentLogic.disj [constructor, in seqt_logic]
SequentLogic.FF [constructor, in seqt_logic]
SequentLogic.FF_ [constructor, in seqt_logic]
SequentLogic.formula [inductive, in seqt_logic]
SequentLogic.formula_to_syntax [definition, in seqt_logic]
SequentLogic.formula_to_syntax_inj [lemma, in seqt_logic]
SequentLogic.fsyn [inductive, in seqt_logic]
SequentLogic.fsyn_symbol_lt_M [constructor, in seqt_logic]
SequentLogic.fsyn_order [definition, in seqt_logic]
SequentLogic.fsyn_order_trans [lemma, in seqt_logic]
SequentLogic.fsyn_symbol_lt [inductive, in seqt_logic]
SequentLogic.fsyn_order_wf [lemma, in seqt_logic]
SequentLogic.fsyn_order_total [lemma, in seqt_logic]
SequentLogic.fsyn_number [definition, in seqt_logic]
SequentLogic.inflate_theory_iso [lemma, in seqt_logic]
SequentLogic.inflate_theory_inflationary [lemma, in seqt_logic]
SequentLogic.inflate_theory_fixpoint_maximal [lemma, in seqt_logic]
SequentLogic.inflate_theory [definition, in seqt_logic]
SequentLogic.interp [definition, in seqt_logic]
SequentLogic.interp_acc [lemma, in seqt_logic]
SequentLogic.interp' [definition, in seqt_logic]
SequentLogic.kripke_monotone [definition, in seqt_logic]
SequentLogic.list_disj [definition, in seqt_logic]
SequentLogic.list_conj [definition, in seqt_logic]
SequentLogic.list_select [lemma, in seqt_logic]
SequentLogic.M [constructor, in seqt_logic]
SequentLogic.maximal_theory_avoiding_disjunctive [lemma, in seqt_logic]
SequentLogic.minimize_admissable_formula [lemma, in seqt_logic]
SequentLogic.modality [constructor, in seqt_logic]
SequentLogic.model [definition, in seqt_logic]
SequentLogic.model_kripke [lemma, in seqt_logic]
SequentLogic.model_eq [lemma, in seqt_logic]
SequentLogic.model_app [definition, in seqt_logic]
SequentLogic.model_le [definition, in seqt_logic]
SequentLogic.order_formula_irr [lemma, in seqt_logic]
SequentLogic.order_formula_trans [lemma, in seqt_logic]
SequentLogic.order_list_struct_len [lemma, in seqt_logic]
SequentLogic.order_formula [definition, in seqt_logic]
SequentLogic.order_formula_wf [lemma, in seqt_logic]
SequentLogic.order_list_trans [lemma, in seqt_logic]
SequentLogic.order_list_total [lemma, in seqt_logic]
SequentLogic.order_list [definition, in seqt_logic]
SequentLogic.order_list_wf [lemma, in seqt_logic]
SequentLogic.order_formula_total [lemma, in seqt_logic]
SequentLogic.order_list_struct [definition, in seqt_logic]
SequentLogic.premodel [definition, in seqt_logic]
SequentLogic.prime_theory_avoiding [definition, in seqt_logic]
SequentLogic.prime_lemma [lemma, in seqt_logic]
SequentLogic.prime_set [record, in seqt_logic]
SequentLogic.pset [projection, in seqt_logic]
SequentLogic.pset_consistent [projection, in seqt_logic]
SequentLogic.pset_disjunctive [projection, in seqt_logic]
SequentLogic.pset_closed [projection, in seqt_logic]
SequentLogic.seqtlogic [section, in seqt_logic]
SequentLogic.seqtlogic.order_list.A [variable, in seqt_logic]
SequentLogic.seqtlogic.order_list.R [variable, in seqt_logic]
SequentLogic.seqtlogic.order_list [section, in seqt_logic]
SequentLogic.seqtlogic.prime_sets.AX [variable, in seqt_logic]
SequentLogic.seqtlogic.prime_sets [section, in seqt_logic]
SequentLogic.sequent [inductive, in seqt_logic]
SequentLogic.sequent_list_disj1 [lemma, in seqt_logic]
SequentLogic.sequent_FF [lemma, in seqt_logic]
SequentLogic.sequent_list_disj2 [lemma, in seqt_logic]
SequentLogic.sequent_conj [lemma, in seqt_logic]
SequentLogic.smallest_admissable_formula [definition, in seqt_logic]
SequentLogic.sqt_disj_L [constructor, in seqt_logic]
SequentLogic.sqt_FF_L [constructor, in seqt_logic]
SequentLogic.sqt_conj_L [constructor, in seqt_logic]
SequentLogic.sqt_reg [constructor, in seqt_logic]
SequentLogic.sqt_cut [constructor, in seqt_logic]
SequentLogic.sqt_disj_R1 [constructor, in seqt_logic]
SequentLogic.sqt_conj_R [constructor, in seqt_logic]
SequentLogic.sqt_TT_R [constructor, in seqt_logic]
SequentLogic.sqt_assume' [lemma, in seqt_logic]
SequentLogic.sqt_assume [lemma, in seqt_logic]
SequentLogic.sqt_disj_R2 [constructor, in seqt_logic]
SequentLogic.sqt_weaken [constructor, in seqt_logic]
SequentLogic.sqt_AX [constructor, in seqt_logic]
SequentLogic.tavd_contains [projection, in seqt_logic]
SequentLogic.tavd_avoids [projection, in seqt_logic]
SequentLogic.tavd_set [projection, in seqt_logic]
SequentLogic.tavd_closed [projection, in seqt_logic]
SequentLogic.ta_chain_sup [definition, in seqt_logic]
SequentLogic.ta_chain_complete [lemma, in seqt_logic]
SequentLogic.ta_ord [definition, in seqt_logic]
SequentLogic.theory_avoiding [record, in seqt_logic]
SequentLogic.theory_avoiding_incr [definition, in seqt_logic]
SequentLogic.theory_avoiding0 [definition, in seqt_logic]
SequentLogic.theory_avoiding_incr_ord [lemma, in seqt_logic]
SequentLogic.TT [constructor, in seqt_logic]
SequentLogic.TT_ [constructor, in seqt_logic]
SequentLogic.valid [definition, in seqt_logic]
set_map' [definition, in prelim]
set_map [definition, in prelim]
side_order [projection, in ref_alternatives]
star_must_step_star [lemma, in compcert]
state [projection, in strong_bisim]
state [projection, in ref_alternatives]
steps [projection, in strong_bisim]
steps [projection, in ref_alternatives]
strengthen [definition, in ref_alternatives]
strengthen' [definition, in ref_alternatives]
STRONG_REF.expand_prf3 [projection, in strong_ref]
STRONG_REF.wrong_bisimulation [definition, in strong_ref]
STRONG_REF.wrong_expands' [definition, in strong_ref]
STRONG_REF.refines [definition, in strong_ref]
STRONG_REF.safe_eq3_2 [lemma, in strong_ref]
STRONG_REF.safe_eq3_1 [lemma, in strong_ref]
STRONG_REF.wrong_rel_into [constructor, in strong_ref]
STRONG_REF.CF_body [definition, in strong_ref]
STRONG_REF.may_step [definition, in strong_ref]
STRONG_REF.ExpandRef.refines_expands' [lemma, in strong_ref]
STRONG_REF.proc_acc [inductive, in strong_ref]
STRONG_REF.maximal [definition, in strong_ref]
STRONG_REF.strong_ref_mho [lemma, in strong_ref]
STRONG_REF.pmay_step [inductive, in strong_ref]
STRONG_REF.image_finite [definition, in strong_ref]
STRONG_REF.adequacy [lemma, in strong_ref]
STRONG_REF.ExpandRef.expandref.Y [variable, in strong_ref]
STRONG_REF.characteristic_other [lemma, in strong_ref]
STRONG_REF.bisimilar [definition, in strong_ref]
STRONG_REF.unrel [definition, in strong_ref]
STRONG_REF.CF_main [definition, in strong_ref]
STRONG_REF.ExpandRef.q1x [projection, in strong_ref]
STRONG_REF.lts_safe_is_safe [lemma, in strong_ref]
STRONG_REF.wrong_rel [inductive, in strong_ref]
STRONG_REF.LTS [record, in strong_ref]
STRONG_REF.ExpandRef.Q2 [definition, in strong_ref]
STRONG_REF.ExpandRef.Q1step1 [constructor, in strong_ref]
STRONG_REF.wrong_rel_mho [constructor, in strong_ref]
STRONG_REF.lts_state [projection, in strong_ref]
STRONG_REF.ExpandRef.expandref.HR [variable, in strong_ref]
STRONG_REF.ExpandRef.q1H [projection, in strong_ref]
STRONG_REF.lstate [definition, in strong_ref]
STRONG_REF.safe_proc [definition, in strong_ref]
STRONG_REF.refinement [definition, in strong_ref]
STRONG_REF.pstate [projection, in strong_ref]
STRONG_REF.CF_is_characteristic [lemma, in strong_ref]
STRONG_REF.strong_refinement [definition, in strong_ref]
STRONG_REF.ExpandRef.Q1 [definition, in strong_ref]
STRONG_REF.strong_ref_trans [lemma, in strong_ref]
STRONG_REF.expansion_refinement [lemma, in strong_ref]
STRONG_REF.ExpandRef.expandref [section, in strong_ref]
STRONG_REF.construct_counter2 [lemma, in strong_ref]
STRONG_REF.ExpandRef.Q1step2 [constructor, in strong_ref]
STRONG_REF.proc [record, in strong_ref]
STRONG_REF.ExpandRef.Q2_Y_bisim [lemma, in strong_ref]
STRONG_REF.safe_state [definition, in strong_ref]
STRONG_REF.box [constructor, in strong_ref]
STRONG_REF.classical_step [lemma, in strong_ref]
STRONG_REF.state [projection, in strong_ref]
STRONG_REF.steps [projection, in strong_ref]
STRONG_REF.ExpandRef.mkQ1 [constructor, in strong_ref]
STRONG_REF.construct_counter1 [lemma, in strong_ref]
STRONG_REF.IHM_INPUT [instance, in strong_ref]
STRONG_REF.ExpandRef.wrong_bisim_mho [lemma, in strong_ref]
STRONG_REF.pmust [constructor, in strong_ref]
STRONG_REF.safe_eq2 [lemma, in strong_ref]
STRONG_REF.safe_eq1 [lemma, in strong_ref]
STRONG_REF.ExpandRef.mkQ2Y [constructor, in strong_ref]
STRONG_REF.ExpandRef.Q1step [inductive, in strong_ref]
STRONG_REF.bisimulation [definition, in strong_ref]
STRONG_REF.ExpandRef.XQ1_bisim [lemma, in strong_ref]
STRONG_REF.strong_ref_mho' [lemma, in strong_ref]
STRONG_REF.ExpandRef.mkQ2 [constructor, in strong_ref]
STRONG_REF.strong_ref [definition, in strong_ref]
STRONG_REF.wrong_bisimilar [definition, in strong_ref]
STRONG_REF.ELTS [record, in strong_ref]
STRONG_REF.ExpandRef.expandref.X [variable, in strong_ref]
STRONG_REF.strong_refinement_eq [lemma, in strong_ref]
STRONG_REF.strong_refines_equiv' [lemma, in strong_ref]
STRONG_REF.ihm_mode [inductive, in strong_ref]
STRONG_REF [module, in strong_ref]
STRONG_REF.expand_inj [projection, in strong_ref]
STRONG_REF.ExpandRef.q1y [projection, in strong_ref]
STRONG_REF.classical_process [definition, in strong_ref]
STRONG_REF.wrong_expansion [record, in strong_ref]
STRONG_REF.ExpandRef.Q2step1 [constructor, in strong_ref]
STRONG_REF.ExpandRef.Q1toQ2 [definition, in strong_ref]
STRONG_REF.lts_steps [projection, in strong_ref]
STRONG_REF.lts_safe [definition, in strong_ref]
STRONG_REF.ref_eq [lemma, in strong_ref]
STRONG_REF.expand_prf1 [projection, in strong_ref]
STRONG_REF.ExpandRef.Q2st [inductive, in strong_ref]
STRONG_REF.safe_refine [lemma, in strong_ref]
STRONG_REF.ExpandRef.Q2step5 [constructor, in strong_ref]
STRONG_REF.psys [projection, in strong_ref]
STRONG_REF.mho_valid [lemma, in strong_ref]
STRONG_REF.strong_ref.mucalc.characteristic.X [variable, in strong_ref]
STRONG_REF.strong_ref.mucalc.characteristic.E1 [variable, in strong_ref]
STRONG_REF.ExpandRef.q2y [definition, in strong_ref]
strong_bisim_logic_input [instance, in strong_bisim]
STRONG_REF.ExpandRef.Q1toQ2expand [lemma, in strong_ref]
STRONG_REF.wrong_rel_mho' [constructor, in strong_ref]
STRONG_REF.strong_ref_wrong_rel [lemma, in strong_ref]
STRONG_REF.expand_prf2 [projection, in strong_ref]
STRONG_REF.characteristic_self [lemma, in strong_ref]
STRONG_REF.ref_eq' [lemma, in strong_ref]
STRONG_REF.strong_ref [section, in strong_ref]
STRONG_REF.lts_safe_refines [lemma, in strong_ref]
STRONG_REF.ExpandRef [module, in strong_ref]
STRONG_REF.ExpandRef.Q2step4 [constructor, in strong_ref]
STRONG_REF.reachable [definition, in strong_ref]
STRONG_REF.ExpandRef.Q2step2 [constructor, in strong_ref]
STRONG_REF.strong_refinement_comp [lemma, in strong_ref]
STRONG_REF.strong_refines_mho [lemma, in strong_ref]
STRONG_REF.ExpandRef.Q2step [inductive, in strong_ref]
STRONG_REF.strong_refinement_inv [lemma, in strong_ref]
STRONG_REF.wrong_rel' [inductive, in strong_ref]
STRONG_REF.wrong_expands [definition, in strong_ref]
STRONG_REF.dia [constructor, in strong_ref]
STRONG_REF.interp_ihm_mode [definition, in strong_ref]
STRONG_REF.wrong_rel_into' [constructor, in strong_ref]
STRONG_REF.strong_refines_equiv [lemma, in strong_ref]
STRONG_REF.ExpandRef.expandref.R [variable, in strong_ref]
STRONG_REF.wrong_bisim_sym [lemma, in strong_ref]
STRONG_REF.ExpandRef.Q1st [record, in strong_ref]
STRONG_REF.ExpandRef.refinement_refines [lemma, in strong_ref]
STRONG_REF.lts_lift [definition, in strong_ref]
STRONG_REF.strong_ref.mucalc.characteristic [section, in strong_ref]
STRONG_REF.pmust_step [inductive, in strong_ref]
STRONG_REF.ExpandRef.Q2step3 [constructor, in strong_ref]
STRONG_REF.pmay [constructor, in strong_ref]
STRONG_REF.pacc [constructor, in strong_ref]
STRONG_REF.CF [definition, in strong_ref]
STRONG_REF.strong_ref.mucalc [section, in strong_ref]
STRONG_REF.must_step [definition, in strong_ref]
STRONG_REF.strong_ref_refl [lemma, in strong_ref]
STRONG_REF.strong_refinement_trip [lemma, in strong_ref]
STRONG_REF.lts_unlift [definition, in strong_ref]
strong_choice [library]
strong_ref [library]
strong_ref_complete2 [library]
strong_bisim [library]
strong_ref_complete [library]
strong_beh_choice [library]
swap_order [definition, in ref_alternatives]
swap_choices [definition, in ref_alternatives]
swap_choices_inv [definition, in ref_alternatives]
sys [projection, in strong_bisim]


T

T [definition, in bar_induction]
t_rt [lemma, in base]
t_inv_left [lemma, in base]
T_dec [lemma, in bar_induction]
t_rt_trans [lemma, in base]
t_inv_right [lemma, in base]


U

Unil [lemma, in bar_induction]
union_intro [lemma, in prelim]
unpack [definition, in ref_alternatives]
upper_bound [definition, in bourbaki]


W

world [projection, in prelim]
world [record, in strong_bisim]
world_step [inductive, in strong_bisim]


X

Xpos [projection, in ref_alternatives]
XY [constructor, in ref_alternatives]


Y

Ypos [projection, in ref_alternatives]
YX [constructor, in ref_alternatives]


Z

zorn [lemma, in bourbaki]



Instance Index

B

BF_REF_LOGIC.bf_ref_div_logic_input [in bf_ref_logic]
BF_LOGIC.BackForth_LogicInput [in bf_logic]
BF_DIV_LOGIC.DivBackForth_LogicInput [in bf_div_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic_input [in bf_ref_div_logic]
BRANCH_BISIM.rule_obs_system [in branch_bisim]


C

CHOICE_BEH_REF.cb_logic_input [in choice_beh_ref]
CHOICE_REF.ChoiceLogicInput [in choice_ref]
compcert_observations [in compcert]


E

ELTS_Theory.strong_ref_ordered_logic_input [in strong_ref_complete]
ELTS_Theory.strong_ref_logic_input [in strong_ref_complete]


R

READY_PRUNE.strong_choice_logic_input [in strong_beh_choice]
READY_PRUNE.strong_choice_logic_input [in strong_choice]


S

STRONG_REF.IHM_INPUT [in strong_ref]
strong_bisim_logic_input [in strong_bisim]



Projection Index

A

accessable [in prelim]
accessable_refl [in prelim]
accessable_trans [in prelim]
atom [in prelim]


B

bar_securable [in bar_induction]
BRANCH_REF.q1y [in branch_ref]
BRANCH_REF.expand_prf3 [in branch_ref]
BRANCH_REF.q1H [in branch_ref]
BRANCH_REF.expand_inj [in branch_ref]
BRANCH_REF.expand_prf1 [in branch_ref]
BRANCH_REF.q1x [in branch_ref]
BRANCH_REF.expand_prf2 [in branch_ref]


C

CHOICE_REF.gp_inj [in choice_ref]
CHOICE_REF.gp_abs [in choice_ref]
CHOICE_REF.gp_prune [in choice_ref]
CHOICE_REF.gp_subgraph [in choice_ref]
ch_set [in bar_induction]
ch_nil [in bar_induction]
ch_prf [in bar_induction]
classic [in prelim]
cl_chain [in bourbaki]
cl_iso [in bourbaki]
cl_incl [in bourbaki]
cl_f [in bourbaki]
COMPILER_INTERFACE.O [in iface]
COMPILER_INTERFACE.steps [in iface]
COMPILER_INTERFACE.observations_inhabited [in iface]
COMPILER_INTERFACE.state [in iface]


E

ELTS_Theory.root [in strong_ref_complete]
ELTS_Theory.expand_prf2 [in strong_ref_complete]
ELTS_Theory.steps [in strong_ref_complete]
ELTS_Theory.ExpandRef.q1y [in strong_ref_complete]
ELTS_Theory.sys [in strong_ref_complete]
ELTS_Theory.expand_prf3 [in strong_ref_complete]
ELTS_Theory.state [in strong_ref_complete]
ELTS_Theory.expand_inj [in strong_ref_complete]
ELTS_Theory.ExpandRef.q1x [in strong_ref_complete]
ELTS_Theory.ExpandRef.q1H [in strong_ref_complete]
ELTS_Theory.expand_prf1 [in strong_ref_complete]


I

interp_mode_accessable [in prelim]
interp_mode_monotone [in prelim]
interp_atom [in prelim]
interp_atom_accessable [in prelim]
interp_mode [in prelim]


L

LTS_REF.steps [in lts_ref]
LTS_TAU.hsys [in lts_tau]
LTS_REF.hsys [in lts_ref]
LTS_TAU.prev [in lts_tau]
LTS_REF.sys [in lts_ref]
LTS_TAU.sys [in lts_tau]
LTS_REF.curr [in lts_ref]
LTS_REF.prev [in lts_ref]
LTS_TAU.good_run [in lts_tau]
LTS_REF.sos_halt_dec [in lts_ref]
LTS_REF.good_run [in lts_ref]
LTS_TAU.curr [in lts_tau]
LTS_TAU.hrun [in lts_tau]
LTS_TAU.root [in lts_tau]
LTS_REF.hrun [in lts_ref]
LTS_REF.root [in lts_ref]
LTS_REF.sos_determ [in lts_ref]
LTS_REF.state [in lts_ref]
LTS_TAU.steps [in lts_tau]
LTS_REF.sos_state [in lts_ref]
LTS_REF.sos_step [in lts_ref]
LTS_REF.sos_halt [in lts_ref]
LTS_REF.sos_halt_no_step [in lts_ref]
LTS_TAU.state [in lts_tau]


M

mode [in prelim]
MuCalc.CF_self [in logic]
MuCalc.CF_other [in logic]
MuCalc.Vars [in logic]
MuCalc.Vars_typ [in logic]
MuCalc.Vars_dec [in logic]


O

O [in prelim]
observations_inhabited [in prelim]
order_mode_wf [in prelim]
order_atom_wf [in prelim]
order_mode [in prelim]
order_atom_trans [in prelim]
order_atom_total [in prelim]
order_atom [in prelim]
order_mode_trans [in prelim]
order_mode_total [in prelim]


P

PropLogic.pset [in prop_logic]
PropLogic.pset_closed [in prop_logic]
PropLogic.pset_consistent [in prop_logic]
PropLogic.pset_disjunctive [in prop_logic]
PropLogic.pset_impl_free [in prop_logic]
PropLogic.tavd_closed [in prop_logic]
PropLogic.tavd_set [in prop_logic]
PropLogic.tavd_impl_free [in prop_logic]
PropLogic.tavd_contains [in prop_logic]
PropLogic.tavd_avoids [in prop_logic]


R

READY_PRUNE.steps [in strong_beh_choice]
READY_PRUNE.sys [in strong_choice]
READY_PRUNE.prune_inj [in strong_beh_choice]
READY_PRUNE.root [in strong_choice]
READY_PRUNE.prune_sub [in strong_beh_choice]
READY_PRUNE.sys [in strong_beh_choice]
READY_PRUNE.expand_inj [in strong_beh_choice]
READY_PRUNE.prune_enable [in strong_beh_choice]
READY_PRUNE.expand_prf3 [in strong_beh_choice]
READY_PRUNE.expand_prf1 [in strong_beh_choice]
READY_PRUNE.root [in strong_beh_choice]
READY_PRUNE.state [in strong_beh_choice]
READY_PRUNE.prune_sub [in strong_choice]
READY_PRUNE.prune_inj [in strong_choice]
READY_PRUNE.steps [in strong_choice]
READY_PRUNE.state [in strong_choice]
READY_PRUNE.prune_enable [in strong_choice]
READY_PRUNE.expand_prf2 [in strong_beh_choice]
root [in strong_bisim]
rule_nil [in bar_induction]
rule_down [in bar_induction]
rule_set [in bar_induction]


S

SequentLogic.pset [in seqt_logic]
SequentLogic.pset_consistent [in seqt_logic]
SequentLogic.pset_disjunctive [in seqt_logic]
SequentLogic.pset_closed [in seqt_logic]
SequentLogic.tavd_contains [in seqt_logic]
SequentLogic.tavd_avoids [in seqt_logic]
SequentLogic.tavd_set [in seqt_logic]
SequentLogic.tavd_closed [in seqt_logic]
side_order [in ref_alternatives]
state [in strong_bisim]
state [in ref_alternatives]
steps [in strong_bisim]
steps [in ref_alternatives]
STRONG_REF.expand_prf3 [in strong_ref]
STRONG_REF.ExpandRef.q1x [in strong_ref]
STRONG_REF.lts_state [in strong_ref]
STRONG_REF.ExpandRef.q1H [in strong_ref]
STRONG_REF.pstate [in strong_ref]
STRONG_REF.state [in strong_ref]
STRONG_REF.steps [in strong_ref]
STRONG_REF.expand_inj [in strong_ref]
STRONG_REF.ExpandRef.q1y [in strong_ref]
STRONG_REF.lts_steps [in strong_ref]
STRONG_REF.expand_prf1 [in strong_ref]
STRONG_REF.psys [in strong_ref]
STRONG_REF.expand_prf2 [in strong_ref]
sys [in strong_bisim]


W

world [in prelim]


X

Xpos [in ref_alternatives]


Y

Ypos [in ref_alternatives]



Record Index

B

BRANCH_REF.Q1st [in branch_ref]
BRANCH_REF.wrong_expansion [in branch_ref]
brouwer_thesis_on_games [in bar_induction]


C

choices [in bar_induction]
CHOICE_REF.global_pruning [in choice_ref]
closed [in bourbaki]
COMPILER_INTERFACE.LTS [in iface]
COMPILER_INTERFACE.ObservationSystem [in iface]


E

ELTS [in ref_alternatives]
ELTS_Theory.world [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1st [in strong_ref_complete]
ELTS_Theory.mho_expansion [in strong_ref_complete]
ELTS_Theory.ELTS [in strong_ref_complete]
EM [in prelim]


L

LOGIC_INPUT [in prelim]
LTS [in strong_bisim]
LTS_REF.run [in lts_ref]
LTS_TAU.LTS [in lts_tau]
LTS_TAU.run [in lts_tau]
LTS_TAU.proc [in lts_tau]
LTS_REF.LTS [in lts_ref]
LTS_TAU.history [in lts_tau]
LTS_REF.history [in lts_ref]
LTS_REF.SOS [in lts_ref]
LTS_REF.process [in lts_ref]


M

MuCalc.characteristic_formula [in logic]
MuCalc.env [in logic]


O

ObservationSystem [in prelim]
ORDERED_LOGIC_INPUT [in prelim]


P

PropLogic.prime_set [in prop_logic]
PropLogic.theory_avoiding [in prop_logic]


R

READY_PRUNE.ELTS [in strong_beh_choice]
READY_PRUNE.world [in strong_beh_choice]
READY_PRUNE.world [in strong_choice]
READY_PRUNE.LTS [in strong_choice]
READY_PRUNE.wrong_expansion [in strong_beh_choice]
READY_PRUNE.global_pruning [in strong_choice]
READY_PRUNE.global_pruning [in strong_beh_choice]
ref_choices [in ref_alternatives]
rule [in bar_induction]


S

SequentLogic.prime_set [in seqt_logic]
SequentLogic.theory_avoiding [in seqt_logic]
STRONG_REF.LTS [in strong_ref]
STRONG_REF.proc [in strong_ref]
STRONG_REF.ELTS [in strong_ref]
STRONG_REF.wrong_expansion [in strong_ref]
STRONG_REF.ExpandRef.Q1st [in strong_ref]


W

world [in strong_bisim]



Section Index

B

bar_induction [in bar_induction]
BF_DIV_LOGIC.bf_div_logic.adequacy [in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic [in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic.mu_calc [in bf_div_logic]
BF_REF_LOGIC.bf_ref_logic [in bf_ref_logic]
BF_BISIM.bf_bisim [in back_forth_bisim]
BF_REF.bf_ref.bf_to_branch [in back_forth_ref]
BF_REF.bf_ref.branch_to_bf [in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter [in back_forth_bisim]
BF_REF.bf_ref.bf_to_div [in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_branch [in back_forth_bisim]
BF_REF.bf_ref.bf_to_related_preruns [in back_forth_ref]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner [in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic [in bf_div_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic [in bf_ref_div_logic]
BF_REF_LOGIC.bf_ref_logic.characteristic [in bf_ref_logic]
BF_BISIM.bf_bisim.bf_to_related_preruns [in back_forth_bisim]
BF_LOGIC.bf_logic [in bf_logic]
BF_LOGIC.bf_logic.characteristic [in bf_logic]
BF_REF.bf_ref [in back_forth_ref]
BF_REF.bf_ref.X_stutter [in back_forth_ref]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner [in bf_ref_div_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy [in bf_ref_div_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic [in bf_ref_div_logic]
BF_BISIM.bf_bisim.branch_to_bf [in back_forth_bisim]
BF_REF_LOGIC.bf_ref_logic.safeify [in bf_ref_logic]
bourbaki [in bourbaki]
bourbaki.fixpoint [in bourbaki]
bourbaki.fixpoint.normal1 [in bourbaki]
BRANCH_BISIM.branch_bisim.D0_branch_ind [in branch_bisim]
BRANCH_BISIM.quotient.quotient [in branch_bisim]
BRANCH_BISIM.branch_bisim.trans [in branch_bisim]
BRANCH_BISIM.D0_to_brouwer [in branch_bisim]
BRANCH_BISIM.branch_bisim [in branch_bisim]
BRANCH_REF.branch_ref [in branch_ref]
BRANCH_REF.branch_ref.trans_backward [in branch_ref]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams [in branch_bisim]
BRANCH_REF.branch_ref.trans_forward [in branch_ref]
BRANCH_BISIM.branch_bisim.ind_equiv [in branch_bisim]
BRANCH_REF.branch_ref.expands_refine [in branch_ref]


C

CHOICE_REF.choice_ref.adequacy [in choice_ref]
CHOICE_REF.choice_ref [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.characteristic [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges [in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner [in choice_ref]
CHOICE_REF.choice_ref.branch_to_bf [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref [in choice_beh_ref]
CHOICE_REF.choice_ref.bf_to_branch [in choice_ref]
CHOICE_REF.choice_ref.characteristic [in choice_ref]
closures [in base]
COMPILER_INTERFACE.compiler_interface [in iface]
COMPILER_INTERFACE.paths [in iface]


E

ELTS_Theory.interpolate_worlds [in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref [in strong_ref_complete]


F

forward_sim_to_beh_refine [in compcert]


L

lts [in strong_bisim]
LTS_REF.lts_ref.finite_runs [in lts_ref]
LTS_TAU.lts_tau [in lts_tau]
LTS_REF.lts_ref.SOS [in lts_ref]
LTS_REF.lts_ref [in lts_ref]
LTS_TAU.lts_tau.finite_runs [in lts_tau]
lts.adequacy [in strong_bisim]
lts.bisim [in strong_bisim]
lts.mucalc [in strong_bisim]
lts.mucalc.characteristic [in strong_bisim]


M

MuCalc.mucalc [in logic]
MuCalc.mucalc.characteristic_consequences [in logic]
MuCalc.mucalc.fixpoints [in logic]


O

omniscience [in bar_induction]


P

paths [in prelim]
PropLogic.proplogic [in prop_logic]
PropLogic.proplogic.order_list [in prop_logic]
PropLogic.proplogic.prime_sets [in prop_logic]


R

READY_PRUNE.ready_prune [in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy [in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune [in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc.characteristic [in strong_choice]
READY_PRUNE.ready_prune.ref_prune [in strong_choice]
READY_PRUNE.ready_prune.mucalc [in strong_choice]
READY_PRUNE.ready_prune.mucalc [in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc.characteristic [in strong_beh_choice]
READY_PRUNE.ready_prune [in strong_choice]
READY_PRUNE.ready_prune.adequacy [in strong_choice]
ref_alt [in ref_alternatives]


S

SequentLogic.seqtlogic [in seqt_logic]
SequentLogic.seqtlogic.order_list [in seqt_logic]
SequentLogic.seqtlogic.prime_sets [in seqt_logic]
STRONG_REF.ExpandRef.expandref [in strong_ref]
STRONG_REF.strong_ref [in strong_ref]
STRONG_REF.strong_ref.mucalc.characteristic [in strong_ref]
STRONG_REF.strong_ref.mucalc [in strong_ref]



Lemma Index

A

adequacy [in strong_bisim]
adequate_bisimulation [in strong_bisim]
all_closed_closed [in bourbaki]
all_closed_x0 [in bourbaki]
all_closed_chain [in bourbaki]
and_ext' [in base]
and_ext [in base]


B

bar_induction_brouwer [in bar_induction]
bar_induction [in bar_induction]
BF_BISIM.curr_path [in back_forth_bisim]
BF_REF.div_back_ref_eq [in back_forth_ref]
BF_REF.step_run_acyclic_bisimilar [in back_forth_ref]
BF_REF.div_back_eq [in back_forth_ref]
BF_REF.safe_run_may_extend_star [in back_forth_ref]
BF_BISIM.Xclosure_back_sim' [in back_forth_bisim]
BF_REF.bf_branch_related_runs_bisim [in back_forth_ref]
BF_REF.bf_to_branch_forward [in back_forth_ref]
BF_REF.extended_run_push2 [in back_forth_ref]
BF_DIV_LOGIC.adequate2 [in bf_div_logic]
BF_BISIM.extended_run_push2 [in back_forth_bisim]
BF_REF_LOGIC.safety_safe_prerun [in bf_ref_logic]
BF_REF_LOGIC.safeify_safe [in bf_ref_logic]
BF_REF.bf_branch_related_runs [in back_forth_ref]
BF_BISIM.bf_to_related_runs [in back_forth_bisim]
BF_REF.bf_to_branch_sim [in back_forth_ref]
BF_REF.bf_branch_related_runs_div [in back_forth_ref]
BF_REF.bf_run_bisim_div_trans [in back_forth_ref]
BF_BISIM.Xclosure_bf_sim' [in back_forth_bisim]
BF_REF.branch_to_forth' [in back_forth_ref]
BF_REF.Xclosure_bf_sim [in back_forth_ref]
BF_REF_DIV_LOGIC.adequacy [in bf_ref_div_logic]
BF_REF_LOGIC.models_denotable [in bf_ref_logic]
BF_REF.Xclosure_incl [in back_forth_ref]
BF_DIV_LOGIC.CF_is_characteristic [in bf_div_logic]
BF_REF.branch_ind_div_bisim [in back_forth_ref]
BF_REF.bf_to_branch_curr [in back_forth_ref]
BF_REF.remove_tau_cycle_must [in back_forth_ref]
BF_REF_LOGIC.completeness [in bf_ref_logic]
BF_BISIM.bf_bisim_div_eq [in back_forth_bisim]
BF_REF.safe_run_weak_may_extend [in back_forth_ref]
BF_REF_DIV_LOGIC.proof_dual2 [in bf_ref_div_logic]
BF_REF_LOGIC.safeify_run_safe [in bf_ref_logic]
BF_LOGIC.characteristic_other [in bf_logic]
BF_REF.run_refines_safe [in back_forth_ref]
BF_REF.div_forth'_comp [in back_forth_ref]
BF_REF.branch_to_bf [in back_forth_ref]
BF_BISIM.bf_related_runs [in back_forth_bisim]
BF_REF_DIV_LOGIC.characteristic_self [in bf_ref_div_logic]
BF_BISIM.bf_bisimilar_div_refl [in back_forth_bisim]
BF_REF.bf_branch_related_runs2 [in back_forth_ref]
BF_REF.safe_run_weak_may_extend' [in back_forth_ref]
BF_BISIM.bf_bisim_div_comp [in back_forth_bisim]
BF_BISIM.bf_bisim_comp [in back_forth_bisim]
BF_BISIM.bf_sim_div_comp [in back_forth_bisim]
BF_REF.curr_path [in back_forth_ref]
BF_REF_LOGIC.safety_safe_curr [in bf_ref_logic]
BF_REF.back'_back [in back_forth_ref]
BF_REF.bf_to_condD1 [in back_forth_ref]
BF_REF_LOGIC.safeify_refines [in bf_ref_logic]
BF_BISIM.Xclosure_property [in back_forth_bisim]
BF_BISIM.bf_to_branch_bisimilar [in back_forth_bisim]
BF_REF.Xproperty_stutter' [in back_forth_ref]
BF_REF_DIV_LOGIC.characteristic_other [in bf_ref_div_logic]
BF_BISIM.Xclosure_bf_bisim [in back_forth_bisim]
BF_BISIM.back_sim'_sim [in back_forth_bisim]
BF_LOGIC.models_denotable [in bf_logic]
BF_BISIM.branch_to_bf_bisim [in back_forth_bisim]
BF_REF.bf_div_related_runs [in back_forth_ref]
BF_BISIM.bf_bisimilar_bisimulation [in back_forth_bisim]
BF_BISIM.bf_bisim_div_div' [in back_forth_bisim]
BF_REF.bf_bisimilar_div_refl [in back_forth_ref]
BF_REF.bf_to_branch_backward [in back_forth_ref]
BF_DIV_LOGIC.adequacy_div1 [in bf_div_logic]
BF_REF.extended_star_length_le [in back_forth_ref]
BF_BISIM.bf_branch_related_runs_div1 [in back_forth_bisim]
BF_REF.bf_to_related_preruns [in back_forth_ref]
BF_REF.back_back' [in back_forth_ref]
BF_DIV_LOGIC.adequacy_div2 [in bf_div_logic]
BF_BISIM.bf_bisimilar_simulation [in back_forth_bisim]
BF_REF_LOGIC.weak_may_extend_initial [in bf_ref_logic]
BF_REF.back_forth'_div_comp [in back_forth_ref]
BF_REF_LOGIC.characteristic_self [in bf_ref_logic]
BF_REF.extended_run_star_decompose_must [in back_forth_ref]
BF_REF_LOGIC.safeify_run_acc [in bf_ref_logic]
BF_BISIM.bf_bisimilar_div_trans [in back_forth_bisim]
BF_REF_DIV_LOGIC.models_denotable [in bf_ref_div_logic]
BF_LOGIC.completeness [in bf_logic]
BF_REF.bisimilar_mono_fixpoint [in back_forth_ref]
BF_BISIM.Xclosure_bf_sim [in back_forth_bisim]
BF_REF.back_forth_inv [in back_forth_ref]
BF_REF.bf_branch_related_runs_div2 [in back_forth_ref]
BF_REF.td_and_mono [in back_forth_ref]
BF_LOGIC.CF_is_characteristic [in bf_logic]
BF_REF_LOGIC.proof_dual1 [in bf_ref_logic]
BF_REF_DIV_LOGIC.completeness [in bf_ref_div_logic]
BF_REF_DIV_LOGIC.adequate2 [in bf_ref_div_logic]
BF_REF.step_run_remove_cycle [in back_forth_ref]
BF_BISIM.forth_sim_sim' [in back_forth_bisim]
BF_BISIM.related_runs_push [in back_forth_bisim]
BF_BISIM.remove_tau_cycle [in back_forth_bisim]
BF_BISIM.remove_tau_prerun_cycle [in back_forth_bisim]
BF_REF_LOGIC.safety_safe_run [in bf_ref_logic]
BF_BISIM.bf_to_branch_sim [in back_forth_bisim]
BF_REF_LOGIC.proof_dual2 [in bf_ref_logic]
BF_REF.weak_must_extend_finite [in back_forth_ref]
BF_LOGIC.proof_dual2 [in bf_logic]
BF_REF.related_runs_append [in back_forth_ref]
BF_REF.bf_div_ref_eq [in back_forth_ref]
BF_REF.Xclosure_forth_sim [in back_forth_ref]
BF_REF_LOGIC.safeify_safe' [in bf_ref_logic]
BF_REF.remove_tau_prerun_cycle [in back_forth_ref]
BF_REF.weak_may_extend_finite [in back_forth_ref]
BF_REF.safe_run_may_extend [in back_forth_ref]
BF_REF.extended_run_push2' [in back_forth_ref]
BF_REF.branch_to_back' [in back_forth_ref]
BF_REF.bf_bf' [in back_forth_ref]
BF_REF.Xclosure_back_sim [in back_forth_ref]
BF_REF.bisimilar_div_bisimulation [in back_forth_ref]
BF_BISIM.branch_to_bf_bisimilar [in back_forth_bisim]
BF_BISIM.Xclosure_incl [in back_forth_bisim]
BF_REF.bf'_bf [in back_forth_ref]
BF_REF.div_forth_ref_eq [in back_forth_ref]
BF_REF.step_run_acyclic_bisimilar_must [in back_forth_ref]
BF_LOGIC.proof_dual1 [in bf_logic]
BF_BISIM.back_related_runs [in back_forth_bisim]
BF_REF_LOGIC.safe_run_initial [in bf_ref_logic]
BF_BISIM.bf_sim_comp [in back_forth_bisim]
BF_REF_DIV_LOGIC.adequate1 [in bf_ref_div_logic]
BF_BISIM.extended_run_step_run [in back_forth_bisim]
BF_BISIM.step_run_remove_cycle [in back_forth_bisim]
BF_BISIM.bf_sim_div_eq [in back_forth_bisim]
BF_REF.run_bisim_ref [in back_forth_ref]
BF_BISIM.step_run_acyclic_bisimilar [in back_forth_bisim]
BF_REF.run_ref_bisim [in back_forth_ref]
BF_REF.safe_run_may_extend_star' [in back_forth_ref]
BF_DIV_LOGIC.models_denotable [in bf_div_logic]
BF_BISIM.back_sim_sim' [in back_forth_bisim]
BF_REF.bf_to_condD1' [in back_forth_ref]
BF_DIV_LOGIC.adequate3 [in bf_div_logic]
BF_REF.branch_to_bf_start [in back_forth_ref]
BF_REF.bf_div_forth_related_runs [in back_forth_ref]
BF_REF_LOGIC.safe_classical [in bf_ref_logic]
BF_BISIM.bf_sim_eq [in back_forth_bisim]
BF_REF.step_run_decompose_must [in back_forth_ref]
BF_DIV_LOGIC.completeness [in bf_div_logic]
BF_REF.bf_div_back_related_runs [in back_forth_ref]
BF_REF.safe_run_may_extend' [in back_forth_ref]
BF_REF.remove_tau_prerun_cycle_must [in back_forth_ref]
BF_BISIM.bf_branch_related_runs_div2 [in back_forth_bisim]
BF_BISIM.bf_bisim_eq [in back_forth_bisim]
BF_REF.Xclosure_property [in back_forth_ref]
BF_REF.bf_ref_trans [in back_forth_ref]
BF_REF.bf_branch_related_runs_div_bisim [in back_forth_ref]
BF_DIV_LOGIC.adequate1 [in bf_div_logic]
BF_LOGIC.characteristic_self [in bf_logic]
BF_REF.extended_run_push1' [in back_forth_ref]
BF_REF_LOGIC.CF_is_characteristic [in bf_ref_logic]
BF_REF.bf_sim_comp [in back_forth_ref]
BF_REF.step_run_remove_cycle_must [in back_forth_ref]
BF_REF_LOGIC.safe_classification [in bf_ref_logic]
BF_REF.extended_run_push1 [in back_forth_ref]
BF_REF.bf_div_refl [in back_forth_ref]
BF_REF.related_runs_push [in back_forth_ref]
BF_BISIM.bf_to_related_preruns [in back_forth_bisim]
BF_REF.forth'_forth [in back_forth_ref]
BF_DIV_LOGIC.characteristic_self [in bf_div_logic]
BF_REF_LOGIC.may_extend_initial [in bf_ref_logic]
BF_BISIM.Xproperty_stutter [in back_forth_bisim]
BF_BISIM.bf_bisim_trans [in back_forth_bisim]
BF_REF.weak_image_finite_acyclic_runs_must [in back_forth_ref]
BF_REF.bf_sim_eq [in back_forth_ref]
BF_REF.weak_image_finite_acyclic_extensions_must [in back_forth_ref]
BF_DIV_LOGIC.characteristic_other [in bf_div_logic]
BF_BISIM.bf_sim_sim' [in back_forth_bisim]
BF_REF.bf_branch_related_runs_div1 [in back_forth_ref]
BF_BISIM.bf_branch_related_runs_div [in back_forth_bisim]
BF_REF_LOGIC.characteristic_other [in bf_ref_logic]
BF_REF.div_forth_eq [in back_forth_ref]
BF_REF.Xproperty_stutter [in back_forth_ref]
BF_REF.curr_path' [in back_forth_ref]
BF_BISIM.extended_run_push1 [in back_forth_bisim]
BF_REF.bf_bisimilar_simulation [in back_forth_ref]
BF_BISIM.forth_sim'_sim [in back_forth_bisim]
BF_DIV_LOGIC.adequacy [in bf_div_logic]
BF_DIV_LOGIC.dual1 [in bf_div_logic]
BF_BISIM.extended_star_length_le [in back_forth_bisim]
BF_BISIM.bf_bisim_bisim' [in back_forth_bisim]
BF_REF.div_back'_comp [in back_forth_ref]
BF_BISIM.step_run_finite [in back_forth_bisim]
BF_REF_DIV_LOGIC.adequacy_div1 [in bf_ref_div_logic]
BF_BISIM.bf_sim_div_div' [in back_forth_bisim]
BF_BISIM.bf_branch_related_runs [in back_forth_bisim]
BF_BISIM.back_forth_div_Xclosure [in back_forth_bisim]
BF_REF_LOGIC.safety_defined [in bf_ref_logic]
BF_REF_LOGIC.classical_safety [in bf_ref_logic]
BF_REF.bf_to_branch [in back_forth_ref]
BF_REF.bf_to_related_runs [in back_forth_ref]
BF_REF.extended_run_decompose_must [in back_forth_ref]
BF_REF_DIV_LOGIC.CF_is_characteristic [in bf_ref_div_logic]
BF_REF.weak_must_extend_start_append [in back_forth_ref]
BF_REF.forth_forth' [in back_forth_ref]
BF_BISIM.branch_to_bf_sim [in back_forth_bisim]
BF_BISIM.bf_bisim_refl [in back_forth_bisim]
BF_BISIM.Xclosure_forth_sim' [in back_forth_bisim]
BF_REF_LOGIC.neg_safety_unsat [in bf_ref_logic]
BF_REF.bf_div_trans [in back_forth_ref]
BF_REF_DIV_LOGIC.proof_dual1 [in bf_ref_div_logic]
BF_BISIM.inv_Xclosure [in back_forth_bisim]
BF_REF.bf_ref_refl [in back_forth_ref]
BF_BISIM.bf_to_branch_bisim [in back_forth_bisim]
BF_BISIM.bf_branch_related_runs2 [in back_forth_bisim]
BF_DIV_LOGIC.dual2 [in bf_div_logic]
BF_REF.remove_tau_cycle [in back_forth_ref]
BF_BISIM.bf_sim'_sim [in back_forth_bisim]
BF_DIV_LOGIC.adequate4 [in bf_div_logic]
bisimilar_refl [in strong_bisim]
bisimilar_sym [in strong_bisim]
bisimilar_trans [in strong_bisim]
bisimilar_bisimulation [in strong_bisim]
bourbaki [in bourbaki]
BRANCH_REF.refines_div_refinement [in branch_ref]
BRANCH_BISIM.DX_interpolates [in branch_bisim]
BRANCH_REF.goes_wrong_step_star [in branch_ref]
BRANCH_BISIM.loop_bisimulation [in branch_bisim]
BRANCH_REF.branch_forward_ind_ind [in branch_ref]
BRANCH_BISIM.branch_bisim_compose [in branch_bisim]
BRANCH_BISIM.D0_ind_equiv_iff_brouwer_on_games [in branch_bisim]
BRANCH_BISIM.bisimilar_change_cond_sim [in branch_bisim]
BRANCH_REF.safe_refines_defined [in branch_ref]
BRANCH_BISIM.cond_D_D0 [in branch_bisim]
BRANCH_BISIM.sim_branch_stutter [in branch_bisim]
BRANCH_REF.refines_ind_mho [in branch_ref]
BRANCH_BISIM.equiv_trans [in branch_bisim]
BRANCH_BISIM.bisimilar_D1_cond_D0 [in branch_bisim]
BRANCH_BISIM.path_push_comp [in branch_bisim]
BRANCH_REF.branch_forward_back_ind_wrong [in branch_ref]
BRANCH_BISIM.bisimilar_D1_refl [in branch_bisim]
BRANCH_BISIM.branch_sim_ind_bisimilar [in branch_bisim]
BRANCH_BISIM.bisim_D1_branch_ind [in branch_bisim]
BRANCH_BISIM.branch_ind_compose_inner [in branch_bisim]
BRANCH_REF.stuttering_push_left [in branch_ref]
BRANCH_REF.branch_ind_to_no_stutter [in branch_ref]
BRANCH_BISIM.bisimilar_bisimulation_D [in branch_bisim]
BRANCH_REF.cond_D1_stutter [in branch_ref]
BRANCH_BISIM.bisimilar_branch_sim [in branch_bisim]
BRANCH_REF.branch_stutter_eq [in branch_ref]
BRANCH_BISIM.bisimilar_D1_eq [in branch_bisim]
BRANCH_BISIM.inv_stuttering [in branch_bisim]
BRANCH_REF.refines_refl [in branch_ref]
BRANCH_BISIM.is_branch_branch' [in branch_bisim]
BRANCH_REF.bisim_ind_trans [in branch_ref]
BRANCH_BISIM.branch_ind_securable [in branch_bisim]
BRANCH_BISIM.bisimilar_ind_trans [in branch_bisim]
BRANCH_REF.branch_D1_forward_ind [in branch_ref]
BRANCH_BISIM.bisimulation_bisimilar_D1 [in branch_bisim]
BRANCH_BISIM.bisimilar_D0_D1 [in branch_bisim]
BRANCH_REF.branch_div_ind [in branch_ref]
BRANCH_BISIM.bisimilar_equal_D_D0 [in branch_bisim]
BRANCH_REF.stuttering_inv [in branch_ref]
BRANCH_REF.branch_forward_ind_no_stutter_ind [in branch_ref]
BRANCH_BISIM.bisimilar_trans [in branch_bisim]
BRANCH_BISIM.bisimilar_ind_stuttering [in branch_bisim]
BRANCH_REF.branch_forward_to_no_stutter [in branch_ref]
BRANCH_REF.branch_back_ind_compose [in branch_ref]
BRANCH_REF.branch_ref_eq [in branch_ref]
BRANCH_REF.branch_ref_compose [in branch_ref]
BRANCH_BISIM.D1_D2 [in branch_bisim]
BRANCH_REF.XQ1_bisim [in branch_ref]
BRANCH_REF.bisim_branch_ind_stutter_eq [in branch_ref]
BRANCH_REF.safe_refines_ind_defined [in branch_ref]
BRANCH_BISIM.sim_seq_prefix [in branch_bisim]
BRANCH_REF.cond_D2'_compose [in branch_ref]
BRANCH_REF.branch_forward_step_right' [in branch_ref]
BRANCH_REF.bisim_ref [in branch_ref]
BRANCH_REF.stuttering_path' [in branch_ref]
BRANCH_BISIM.stuttering_closure_incl [in branch_bisim]
BRANCH_REF.refines_ind_mho_star [in branch_ref]
BRANCH_BISIM.D0bar_mono [in branch_bisim]
BRANCH_BISIM.bisimilar_D_D0 [in branch_bisim]
BRANCH_BISIM.D0_branch_ind [in branch_bisim]
BRANCH_REF.path_push_comp [in branch_ref]
BRANCH_REF.refines_ind_mho_goes_wrong [in branch_ref]
BRANCH_REF.branch_ind_compose_inner_back [in branch_ref]
BRANCH_REF.branch_ind_div [in branch_ref]
BRANCH_BISIM.branch_ind'_ind_stuttering [in branch_bisim]
BRANCH_BISIM.stuttering_closure_property [in branch_bisim]
BRANCH_REF.branch_ind_eq [in branch_ref]
BRANCH_BISIM.equiv_refl [in branch_bisim]
BRANCH_BISIM.stuttering_is_branch [in branch_bisim]
BRANCH_REF.branch_backward_ind_ind [in branch_ref]
BRANCH_BISIM.simulation_bisimilar_D1 [in branch_bisim]
BRANCH_REF.refinement_equiv [in branch_ref]
BRANCH_REF.branch_def_branch_safe [in branch_ref]
BRANCH_BISIM.branch_ind_ind' [in branch_bisim]
BRANCH_BISIM.bisimilar_D1_stuttering_closed [in branch_bisim]
BRANCH_REF.branch_ind_compose [in branch_ref]
BRANCH_REF.goes_wrong_ind [in branch_ref]
BRANCH_BISIM.bisimilar_ind_refl [in branch_bisim]
BRANCH_BISIM.D0_to_brouwer [in branch_bisim]
BRANCH_REF.branch_branch_ind_no_stutter [in branch_ref]
BRANCH_REF.branch_back_branch_ind [in branch_ref]
BRANCH_REF.cond_D2'_eq [in branch_ref]
BRANCH_BISIM.bisimilar_refl [in branch_bisim]
BRANCH_REF.safe_refines_safe [in branch_ref]
BRANCH_REF.refines_ind_trans [in branch_ref]
BRANCH_REF.cond_D1'_stutter [in branch_ref]
BRANCH_BISIM.quotient.quot_bisim [in branch_bisim]
BRANCH_REF.cond_D1_D2' [in branch_ref]
BRANCH_REF.branch_ind_stutter_eq [in branch_ref]
BRANCH_REF.branch_forward_ind_mono [in branch_ref]
BRANCH_BISIM.bisimilar_equal_D_DX [in branch_bisim]
BRANCH_REF.cond_D1'_mono [in branch_ref]
BRANCH_BISIM.rule_state_branch_sim [in branch_bisim]
BRANCH_REF.refines_div_refl [in branch_ref]
BRANCH_BISIM.bisimulation_ind_bisimilar [in branch_bisim]
BRANCH_REF.refines_div_stutter [in branch_ref]
BRANCH_BISIM.branch_sim_eq [in branch_bisim]
BRANCH_BISIM.finite_divergences_step_star [in branch_bisim]
BRANCH_REF.branch_def_safe [in branch_ref]
BRANCH_BISIM.bisimilar_D1_D [in branch_bisim]
BRANCH_REF.branch_back_to_no_stutter [in branch_ref]
BRANCH_BISIM.branch_ind_stutter [in branch_bisim]
BRANCH_REF.refines_ind_no_stutter_refinement [in branch_ref]
BRANCH_BISIM.interpolates_D_D0_equal [in branch_bisim]
BRANCH_BISIM.is_branch'_branch [in branch_bisim]
BRANCH_BISIM.D0bar_in_D0bar_Q [in branch_bisim]
BRANCH_REF.refines_refinement [in branch_ref]
BRANCH_REF.branch_backward_ref_compose [in branch_ref]
BRANCH_REF.bisim_ind_refl [in branch_ref]
BRANCH_BISIM.bisimilar_D1_trans [in branch_bisim]
BRANCH_REF.refines_div_trans [in branch_ref]
BRANCH_REF.refines_ind_refinement [in branch_ref]
BRANCH_BISIM.D1_branch_ind_classic [in branch_bisim]
BRANCH_BISIM.branch_sim_compose [in branch_bisim]
BRANCH_REF.branch_forward_branch_ind [in branch_ref]
BRANCH_BISIM.bisimulation_ind_compose [in branch_bisim]
BRANCH_REF.bisim_div_trans [in branch_ref]
BRANCH_BISIM.D1_branch_ind_bisimilar [in branch_bisim]
BRANCH_BISIM.path_run_ex_uniq [in branch_bisim]
BRANCH_REF.branch_forward_ind_D1 [in branch_ref]
BRANCH_REF.accessible_refl [in branch_ref]
BRANCH_REF.stuttering_is_branch_backward_ind [in branch_ref]
BRANCH_REF.loop_bisimulation [in branch_ref]
BRANCH_REF.branch_forward_ind_compose [in branch_ref]
BRANCH_BISIM.sim_D0_stuttering_ind [in branch_bisim]
BRANCH_BISIM.loop_simulation [in branch_bisim]
BRANCH_REF.refines_mho_forward_no_stutter [in branch_ref]
BRANCH_REF.bisim_branch_div_refl [in branch_ref]
BRANCH_BISIM.branch_ind_compose [in branch_bisim]
BRANCH_BISIM.branch_sim_ind_eq [in branch_bisim]
BRANCH_REF.wrong_expands_refine [in branch_ref]
BRANCH_REF.stuttering_is_branch_forward [in branch_ref]
BRANCH_BISIM.branch_sim_D1_compose [in branch_bisim]
BRANCH_REF.refines_ind_mho_path_where_mho [in branch_ref]
BRANCH_REF.Q2Y_bisim [in branch_ref]
BRANCH_REF.stuttering_push_right [in branch_ref]
BRANCH_REF.stuttering_is_branch_forward_ind [in branch_ref]
BRANCH_BISIM.bisimilar_change_cond [in branch_bisim]
BRANCH_REF.cond_D2_eq [in branch_ref]
BRANCH_REF.branch_D1'_backward_ind [in branch_ref]
BRANCH_REF.branch_forward_mono [in branch_ref]
BRANCH_REF.branch_forward_branch_ind_no_stutter [in branch_ref]
BRANCH_BISIM.branch_ind_branch [in branch_bisim]
BRANCH_BISIM.branch_ind_ind [in branch_bisim]
BRANCH_BISIM.D1_D0_sim [in branch_bisim]
BRANCH_REF.branch_forward_ind_to_no_stutter [in branch_ref]
BRANCH_REF.branch_forward_step_right [in branch_ref]
BRANCH_BISIM.D0_ind_equiv_LPO [in branch_bisim]
BRANCH_REF.branch_back_branch_ind_no_stutter [in branch_ref]
BRANCH_REF.refines_ind_refl [in branch_ref]
BRANCH_REF.path_push_comp_back [in branch_ref]
BRANCH_BISIM.sim_D0_stuttering_D1 [in branch_bisim]
BRANCH_BISIM.bisimilar_D1_cond_D [in branch_bisim]
BRANCH_REF.branch_expands_branch_ref [in branch_ref]
BRANCH_REF.branch_def_inv [in branch_ref]
BRANCH_REF.branch_backward_ind_D1' [in branch_ref]
BRANCH_REF.prove_branch_ind_bisim [in branch_ref]
BRANCH_BISIM.branch_ind'_ind [in branch_bisim]
BRANCH_BISIM.rule_state_D0_sim [in branch_bisim]
BRANCH_REF.refines_ind_mho_step_star [in branch_ref]
BRANCH_BISIM.simulation_D1_stuttering [in branch_bisim]
BRANCH_REF.safe_refines_ind_safe [in branch_ref]
BRANCH_BISIM.bisimilar_equal_D_D1 [in branch_bisim]
BRANCH_BISIM.equiv_sym [in branch_bisim]
BRANCH_BISIM.stuttering_closure_idem [in branch_bisim]
BRANCH_BISIM.D0bar_Q_hered [in branch_bisim]
BRANCH_BISIM.sim_stuttering_push [in branch_bisim]
BRANCH_BISIM.stuttering_closure_property_inv [in branch_bisim]
BRANCH_REF.cond_D1_D2 [in branch_ref]
BRANCH_REF.stuttering_is_branch [in branch_ref]
BRANCH_REF.branch_div12 [in branch_ref]
BRANCH_REF.branch_backward_mono [in branch_ref]
BRANCH_REF.refines_ind_goes_wrong [in branch_ref]
BRANCH_REF.stuttering_is_branch_ind [in branch_ref]
BRANCH_REF.cond_D2_compose [in branch_ref]
BRANCH_BISIM.branch_ind'_branch' [in branch_bisim]
BRANCH_REF.stuttering_is_branch_backward [in branch_ref]
BRANCH_REF.branch_back_ind_to_no_stutter [in branch_ref]
BRANCH_BISIM.quotient.quot_weak_converges [in branch_bisim]
BRANCH_BISIM.bisimilar_change_cond_bisim [in branch_bisim]
BRANCH_REF.branch_backward_ind_no_stutter_ind [in branch_ref]
BRANCH_REF.Q1Q2_wrong_expansion [in branch_ref]
BRANCH_REF.refines_ind_mho_tau [in branch_ref]
BRANCH_BISIM.bisimilar_D1_D0 [in branch_bisim]
BRANCH_REF.stuttering_closure_incl [in branch_ref]
BRANCH_BISIM.branch_ind_D1 [in branch_bisim]
BRANCH_REF.accessible_trans [in branch_ref]
BRANCH_REF.branch_ind_compose_inner [in branch_ref]
BRANCH_REF.refines_trans [in branch_ref]
BRANCH_REF.branch_backward_step_left [in branch_ref]
BRANCH_BISIM.stuttering_path [in branch_bisim]
BRANCH_REF.branch_branch_ind [in branch_ref]
BRANCH_REF.wrong_bisim_iff_branch_ind_bisim [in branch_ref]
BRANCH_REF.branch_forward_ref_compose [in branch_ref]
BRANCH_REF.cond_D1_mono [in branch_ref]
BRANCH_BISIM.branch_ind_D1_bisim [in branch_bisim]
BRANCH_REF.stuttering_path [in branch_ref]
BRANCH_BISIM.bisimilar_branch_branch' [in branch_bisim]
BRANCH_REF.loop_simulation [in branch_ref]
BRANCH_BISIM.ind_equiv [in branch_bisim]
BRANCH_REF.branch_to_no_stutter [in branch_ref]
BRANCH_REF.branch_backward_ind_mono [in branch_ref]
BRANCH_BISIM.bisimulation_D1_stuttering [in branch_bisim]
BRANCH_REF.branch_backward_step_left' [in branch_ref]
BRANCH_REF.refines_mho_backward_no_stutter [in branch_ref]
brouwer_games_LPO [in bar_induction]


C

CF_is_characteristic [in strong_bisim]
characteristic_other [in strong_bisim]
characteristic_self [in strong_bisim]
CHOICE_REF.run_choice_eq [in choice_ref]
CHOICE_BEH_REF.may_weak_may [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.choice_ref_stable [in choice_ref]
CHOICE_REF.adequacy_choice [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.minimize_path [in choice_ref]
CHOICE_BEH_REF.run_refinement_to_choice_forward [in choice_beh_ref]
CHOICE_REF.choice_refines'_refinement' [in choice_ref]
CHOICE_REF.bf_choice_related_runs2 [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_prune [in choice_ref]
CHOICE_BEH_REF.adequate1 [in choice_beh_ref]
CHOICE_BEH_REF.stuttering_choice_refines_eq [in choice_beh_ref]
CHOICE_BEH_REF.models_denotable [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_prune [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_global_pruning [in choice_ref]
CHOICE_BEH_REF.characteristic_self [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.q2snd_branch_bisim [in choice_ref]
CHOICE_BEH_REF.choice_refines'_trans [in choice_beh_ref]
CHOICE_REF.run_choice_comp [in choice_ref]
CHOICE_BEH_REF.run_choice_back [in choice_beh_ref]
CHOICE_REF.CF_is_characteristic [in choice_ref]
CHOICE_REF.choice_refines_trans [in choice_ref]
CHOICE_REF.adequate1 [in choice_ref]
CHOICE_BEH_REF.run_choice_div [in choice_beh_ref]
CHOICE_REF.models_denotable [in choice_ref]
CHOICE_BEH_REF.choice_refinement_eq1 [in choice_beh_ref]
CHOICE_BEH_REF.choice_refines'_refinement' [in choice_beh_ref]
CHOICE_REF.choice_ref_to_pruning_converges [in choice_ref]
CHOICE_REF.choice_refinement_comp [in choice_ref]
CHOICE_REF.pruning_to_choice_ref [in choice_ref]
CHOICE_REF.run_choice_sim_forth' [in choice_ref]
CHOICE_BEH_REF.characteristic_other [in choice_beh_ref]
CHOICE_BEH_REF.adequate2 [in choice_beh_ref]
CHOICE_BEH_REF.bf_choice_related_runs [in choice_beh_ref]
CHOICE_REF.prune_choice_refinement [in choice_ref]
CHOICE_BEH_REF.branch_forward_ind_choice [in choice_beh_ref]
CHOICE_REF.choice_ref_to_pruning_well_staged [in choice_ref]
CHOICE_BEH_REF.choice_Xclosure [in choice_beh_ref]
CHOICE_BEH_REF.run_choice_forth [in choice_beh_ref]
CHOICE_BEH_REF.choice_refinement_steps [in choice_beh_ref]
CHOICE_REF.bf_choice_related_runs [in choice_ref]
CHOICE_BEH_REF.choice_to_bf_choice [in choice_beh_ref]
CHOICE_REF.adequate3 [in choice_ref]
CHOICE_BEH_REF.run_refinement_to_choice [in choice_beh_ref]
CHOICE_BEH_REF.stuttering_choice_forward [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.q1fst_branch_bisim [in choice_ref]
CHOICE_BEH_REF.run_similar_choice_refl [in choice_beh_ref]
CHOICE_BEH_REF.CF_is_characteristic [in choice_beh_ref]
CHOICE_BEH_REF.choice_refines_steps [in choice_beh_ref]
CHOICE_BEH_REF.completeness [in choice_beh_ref]
CHOICE_BEH_REF.must_weak_must [in choice_beh_ref]
CHOICE_REF.run_choice_div_sim [in choice_ref]
CHOICE_BEH_REF.Xclosure_forth_sim [in choice_beh_ref]
CHOICE_BEH_REF.bf_choice_to_choice [in choice_beh_ref]
CHOICE_BEH_REF.choice_refinement'_comp [in choice_beh_ref]
CHOICE_REF.choice_Xclosure [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q2snd_branch_bisim [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_inj [in choice_ref]
CHOICE_BEH_REF.run_choice_trans [in choice_beh_ref]
CHOICE_REF.run_choice_trans [in choice_ref]
CHOICE_REF.choice_refines_steps [in choice_ref]
CHOICE_REF.bisimulation_choice_refinement [in choice_ref]
CHOICE_REF.choice_to_bf_choice [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_inj [in choice_ref]
CHOICE_BEH_REF.choice_refinement_comp [in choice_beh_ref]
CHOICE_REF.choice_refinement'_comp [in choice_ref]
CHOICE_BEH_REF.bf_choice_related_runs2 [in choice_beh_ref]
CHOICE_BEH_REF.refines_choice_refl [in choice_beh_ref]
CHOICE_BEH_REF.choice_refinement_eq2 [in choice_beh_ref]
CHOICE_BEH_REF.choice_refines_eq [in choice_beh_ref]
CHOICE_REF.characteristic_self [in choice_ref]
CHOICE_REF.completeness [in choice_ref]
CHOICE_BEH_REF.branch_to_forth [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.q1fst_branch_bisim [in choice_ref]
CHOICE_BEH_REF.run_choice_comp [in choice_beh_ref]
CHOICE_BEH_REF.run_ref_to_choice [in choice_beh_ref]
CHOICE_REF.characteristic_other [in choice_ref]
CHOICE_BEH_REF.refines_branch_ind_choice [in choice_beh_ref]
CHOICE_REF.adequate4 [in choice_ref]
CHOICE_BEH_REF.run_choice_eq [in choice_beh_ref]
CHOICE_REF.choice_refines_eq [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_global_pruning [in choice_ref]
CHOICE_BEH_REF.choice_forward_ind [in choice_beh_ref]
CHOICE_REF.bf_choice_to_choice [in choice_ref]
CHOICE_REF.run_choice_bisim_back' [in choice_ref]
CHOICE_REF.choice_refines'_trans [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21_subgraph [in choice_ref]
CHOICE_REF.choice_refinement_steps [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21_subgraph [in choice_ref]
CHOICE_BEH_REF.choice_refinement_eq [in choice_beh_ref]
CHOICE_REF.adequacy [in choice_ref]
CHOICE_BEH_REF.forth_rev'_forth_rev [in choice_beh_ref]
CHOICE_REF.run_bisimilar_run_choice [in choice_ref]
CHOICE_BEH_REF.stuttering_choice_refinement [in choice_beh_ref]
CHOICE_BEH_REF.refinement_branch_ind_choice [in choice_beh_ref]
CHOICE_BEH_REF.extended_run_push1'_ugh [in choice_beh_ref]
CHOICE_REF.adequacy_div2 [in choice_ref]
CHOICE_REF.choice_refinement_eq [in choice_ref]
CHOICE_BEH_REF.adequacy_choice [in choice_beh_ref]
CHOICE_REF.run_similar_choice_refl [in choice_ref]
CHOICE_BEH_REF.choice_refines_trans [in choice_beh_ref]
CHOICE_REF.run_bisimulation_run_choice [in choice_ref]
CHOICE_REF.choice_forward_ind [in choice_ref]
CHOICE_BEH_REF.refines_choice_refinement [in choice_beh_ref]
CHOICE_BEH_REF.adequacy [in choice_beh_ref]
CHOICE_BEH_REF.adequacy_div1 [in choice_beh_ref]
CHOICE_BEH_REF.refines_choice_no_stutter_refinement [in choice_beh_ref]
CHOICE_BEH_REF.choice_refines_mho_step_star [in choice_beh_ref]
classic_brouwer_thesis [in bar_induction]
closed_restrict [in bourbaki]
compcert_branch_backward_sim_run0 [in compcert]
compcert_backward_sim [in compcert]
compcert_branch_backward_sim_run2 [in compcert]
compcert_branch_backward_sim_run1 [in compcert]
compcert_branch_forward_sim_run2 [in compcert]
compcert_forward_sim [in compcert]
CompCert_main_pass_correctness [in compcert]
compcert_refinement [in compcert]
compcert_fsim_match_push [in compcert]
compcert_branch_forward_sim_run1 [in compcert]
compose_bisimulation [in strong_bisim]
comp_intro [in prelim]
contains_nn [in prelim]
contains_uniq [in prelim]
contains_eq [in prelim]
contains_same [in prelim]


E

ELTS_Theory.axiom_K5 [in strong_ref_complete]
ELTS_Theory.adequate [in strong_ref_complete]
ELTS_Theory.expansion_refinement [in strong_ref_complete]
ELTS_Theory.box_successor [in strong_ref_complete]
ELTS_Theory.AXC_contrapose [in strong_ref_complete]
ELTS_Theory.dia_successor [in strong_ref_complete]
ELTS_Theory.subset_refinement [in strong_ref_complete]
ELTS_Theory.bar_AX [in strong_ref_complete]
ELTS_Theory.frame_condition2 [in strong_ref_complete]
ELTS_Theory.Y_interp_refines [in strong_ref_complete]
ELTS_Theory.interpolate_worlds [in strong_ref_complete]
ELTS_Theory.AXC_AX_derives [in strong_ref_complete]
ELTS_Theory.derives_nec [in strong_ref_complete]
ELTS_Theory.refinement_subset [in strong_ref_complete]
ELTS_Theory.impl_free_completeness [in strong_ref_complete]
ELTS_Theory.box_FF_definite [in strong_ref_complete]
ELTS_Theory.X_interp_refines [in strong_ref_complete]
ELTS_Theory.cannonical_model_rank1 [in strong_ref_complete]
ELTS_Theory.accessable_refl [in strong_ref_complete]
ELTS_Theory.AXC_definite [in strong_ref_complete]
ELTS_Theory.prime_definite_set [in strong_ref_complete]
ELTS_Theory.derives_box_dia [in strong_ref_complete]
ELTS_Theory.AX'_derives_AXC [in strong_ref_complete]
ELTS_Theory.cannonical_model_impl_free [in strong_ref_complete]
ELTS_Theory.frame_condition1 [in strong_ref_complete]
ELTS_Theory.refinement_compose [in strong_ref_complete]
ELTS_Theory.refines_trans [in strong_ref_complete]
ELTS_Theory.deduction_impl_free [in strong_ref_complete]
ELTS_Theory.ExpandRef.XQ1_bisim [in strong_ref_complete]
ELTS_Theory.AX_valid [in strong_ref_complete]
ELTS_Theory.prime_theorems_or_definite [in strong_ref_complete]
ELTS_Theory.AXC_nnpp [in strong_ref_complete]
ELTS_Theory.refines_refl [in strong_ref_complete]
ELTS_Theory.definite_defined [in strong_ref_complete]
ELTS_Theory.prime_definite_definite_set [in strong_ref_complete]
ELTS_Theory.ExpandRef.refines_expands' [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2_Y_bisim [in strong_ref_complete]
ELTS_Theory.wrong_bisim_refinement [in strong_ref_complete]
ELTS_Theory.dia_definite [in strong_ref_complete]
ELTS_Theory.theorem_bar [in strong_ref_complete]
ELTS_Theory.defined_definite [in strong_ref_complete]
ELTS_Theory.AX'_AXC_theorem [in strong_ref_complete]
ELTS_Theory.soundness [in strong_ref_complete]
ELTS_Theory.AX'_AXC_derives [in strong_ref_complete]
ELTS_Theory.disjunctive_property_of_impl_free_theorems [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1toQ2expand [in strong_ref_complete]
ELTS_Theory.derives_dia_FF [in strong_ref_complete]
ELTS_Theory.rank1_completeness [in strong_ref_complete]
ELTS_Theory.derives_box_dia' [in strong_ref_complete]
ELTS_Theory.AXC_AX_theorem [in strong_ref_complete]
ELTS_Theory.impl_free_rank1 [in strong_ref_complete]
ELTS_Theory.refinement_is_subset [in strong_ref_complete]
ELTS_Theory.AXC_derives_AX [in strong_ref_complete]
ELTS_Theory.AXC_box_dia [in strong_ref_complete]
ELTS_Theory.definitiveness_axiom2 [in strong_ref_complete]
ELTS_Theory.bar_IPL [in strong_ref_complete]
ELTS_Theory.more_specs_refinement [in strong_ref_complete]
ELTS_Theory.definitiveness_axiom1 [in strong_ref_complete]
ELTS_Theory.refinement_refl [in strong_ref_complete]
ELTS_Theory.axiom_K6 [in strong_ref_complete]
ELTS_Theory.Y_interp_refines_inv [in strong_ref_complete]
EqdepElim.eq_rect_eq [in base]
equiv_trans [in strong_bisim]
equiv_sym [in strong_bisim]
equiv_refl [in strong_bisim]
eq_bisimulation [in strong_bisim]
exists_ext [in base]
existT_ext [in base]
exist_ext [in base]
extensionality [in base]


F

finite_prefinite [in finiteness]
finite_nodup_lists [in finiteness]
finite_pairs [in finiteness]
finite_mapping [in finiteness]
finite_transform [in finiteness]
finite_select [in finiteness]
finite_lists_length_n [in finiteness]
forall_ext [in base]


I

impossible_list [in prelim]
imp_ext [in base]
initial_states_refine [in compcert]
inv_comp [in prelim]
inv_eq [in prelim]
inv_bisimulation [in strong_bisim]
inv_intro [in prelim]
inv_union [in prelim]
inv_inv [in prelim]


L

left_to_rt [in base]
lift_rel_incl' [in prelim]
lift_rel_comp [in prelim]
lift_rel_mono [in prelim]
lift_rel_incl [in prelim]
LPO_eq [in bar_induction]
LTS_REF.and_run_refinement [in lts_ref]
LTS_REF.weak_must_may_extend [in lts_ref]
LTS_REF.related_runs_incl [in lts_ref]
LTS_REF.must_may_extend [in lts_ref]
LTS_TAU.simulation_and [in lts_tau]
LTS_TAU.hdiverges_stable [in lts_tau]
LTS_TAU.hdiverges_mono [in lts_tau]
LTS_TAU.bisim_sim [in lts_tau]
LTS_TAU.hdiverges_hconverges_dual [in lts_tau]
LTS_TAU.step_run_start_tau_run_from [in lts_tau]
LTS_TAU.weak_step_step_run [in lts_tau]
LTS_TAU.extended_run_steps_tau [in lts_tau]
LTS_TAU.bisimulation_and [in lts_tau]
LTS_TAU.run_simulation_and [in lts_tau]
LTS_TAU.step_star_extend_star [in lts_tau]
LTS_REF.inv_bisimulation [in lts_ref]
LTS_REF.may_extend_def [in lts_ref]
LTS_TAU.strong_step_finite [in lts_tau]
LTS_REF.SOS_to_LTS_step_correct [in lts_ref]
LTS_TAU.step_run_decompose [in lts_tau]
LTS_TAU.bisimilar_sym [in lts_tau]
LTS_TAU.and_run_simulation [in lts_tau]
LTS_REF.SOS_to_LTS_crash_correct [in lts_ref]
LTS_REF.weak_may_extend_def [in lts_ref]
LTS_TAU.tau_paths_finite [in lts_tau]
LTS_TAU.run_ext [in lts_tau]
LTS_REF.must_divergence_convergence_dual [in lts_ref]
LTS_REF.step_star_extend_star [in lts_ref]
LTS_TAU.sim_bisim [in lts_tau]
LTS_REF.must_may_step_star [in lts_ref]
LTS_REF.must_may_extend_star [in lts_ref]
LTS_REF.run_ext [in lts_ref]
LTS_REF.weak_step_step_run [in lts_ref]
LTS_TAU.weak_image_finite_divergences [in lts_tau]
LTS_REF.may_must_extend [in lts_ref]
LTS_REF.SOS_decide [in lts_ref]
LTS_REF.acyclic_tau_paths_finite [in lts_ref]
LTS_REF.weak_image_finite_divergences [in lts_ref]
LTS_REF.weak_may_must_extend [in lts_ref]
LTS_REF.may_extend_step [in lts_ref]
LTS_TAU.and_simulation [in lts_tau]
LTS_REF.bisimulation_and [in lts_ref]
LTS_TAU.related_runs_append [in lts_tau]
LTS_REF.inv_bisimilar [in lts_ref]
LTS_REF.run_bisimilar_refines [in lts_ref]
LTS_REF.ref_bisim [in lts_ref]
LTS_REF.step_run_start_append [in lts_ref]
LTS_TAU.inv_curr_rel [in lts_tau]
LTS_REF.SOS_to_LTS_deterministic [in lts_ref]
LTS_REF.must_extend_step [in lts_ref]
LTS_REF.inv_run_bisimulation [in lts_ref]
LTS_TAU.append_run_from [in lts_tau]
LTS_REF.append_run_from [in lts_ref]
LTS_TAU.div_from_div_set [in lts_tau]
LTS_TAU.extended_run_decompose [in lts_tau]
LTS_TAU.inv_run_bisimulation [in lts_tau]
LTS_TAU.acyclic_tau_paths_finite [in lts_tau]
LTS_REF.SOS_to_LTS_halt_correct [in lts_ref]
LTS_REF.run_bisimulation_and [in lts_ref]
LTS_TAU.acyclic_obs_paths_finite [in lts_tau]
LTS_REF.strong_step_finite [in lts_ref]
LTS_TAU.extended_run_star_decompose [in lts_tau]
LTS_REF.step_run_start_run_from [in lts_ref]
LTS_REF.refinement_and [in lts_ref]
LTS_REF.tau_paths_finite [in lts_ref]
LTS_REF.inv_run_bisimilar [in lts_ref]
LTS_REF.step_run_back_finite [in lts_ref]
LTS_REF.may_must_step [in lts_ref]
LTS_REF.may_must_extend_star [in lts_ref]
LTS_TAU.inv_bisimulation [in lts_tau]
LTS_REF.must_may_step [in lts_ref]
LTS_REF.related_preruns_incl [in lts_ref]
LTS_REF.may_must_step_star [in lts_ref]
LTS_TAU.inv_run_bisimilar [in lts_tau]
LTS_REF.extended_run_star_decompose [in lts_ref]
LTS_REF.bisimilar_sym [in lts_ref]
LTS_REF.may_divergence_convergence_dual [in lts_ref]
LTS_REF.may_step_step [in lts_ref]
LTS_REF.may_extend_star_def [in lts_ref]
LTS_TAU.weak_image_finite_acyclic_runs [in lts_tau]
LTS_TAU.tau_path_extend_states_finite [in lts_tau]
LTS_TAU.run_bisim_sim [in lts_tau]
LTS_REF.step_run_decompose [in lts_ref]
LTS_TAU.run_bisimulation_and [in lts_tau]
LTS_REF.tau_path_extend_states_finite [in lts_ref]
LTS_REF.run_bisimilar_sym [in lts_ref]
LTS_REF.weak_image_finite_acyclic_runs [in lts_ref]
LTS_TAU.step_run_start_append [in lts_tau]
LTS_TAU.run_sim_bisim [in lts_tau]
LTS_REF.and_run_bisimulation [in lts_ref]
LTS_TAU.by_symmetry [in lts_tau]
LTS_REF.extended_run_decompose [in lts_ref]
LTS_TAU.inv_bisimilar [in lts_tau]
LTS_REF.and_refinement [in lts_ref]
LTS_TAU.extended_run_step [in lts_tau]
LTS_TAU.weak_image_finite_acyclic_extensions [in lts_tau]
LTS_TAU.and_run_bisimulation [in lts_tau]
LTS_TAU.inv_related_runs [in lts_tau]
LTS_REF.and_bisimulation [in lts_ref]
LTS_TAU.divergence_convergence_dual [in lts_tau]
LTS_REF.weak_image_finite_acyclic_extensions [in lts_ref]
LTS_TAU.run_bisimilar_sym [in lts_tau]
LTS_TAU.and_bisimulation [in lts_tau]
LTS_REF.run_refinement_and [in lts_ref]
LTS_TAU.step_run_start_run_from [in lts_tau]
LTS_REF.acyclic_obs_paths_finite [in lts_ref]
LTS_REF.step_run_start_tau_run_from [in lts_ref]
LTS_TAU.step_run_back_finite [in lts_tau]
LTS_REF.may_extend_star_step [in lts_ref]
LTS_TAU.related_runs_incl [in lts_tau]
LTS_TAU.run_star_step_star [in lts_tau]
LTS_REF.must_extend_star_step [in lts_ref]


M

matching_states_refine [in compcert]
MuCalc.beta_rule [in logic]
MuCalc.characteristic_iff_denotable_models [in logic]
MuCalc.completeness [in logic]
MuCalc.conj_intro [in logic]
MuCalc.conj_elim [in logic]
MuCalc.disj_intro [in logic]
MuCalc.disj_elim [in logic]
MuCalc.entails_TT [in logic]
MuCalc.expressivity [in logic]
MuCalc.FF_entails [in logic]
MuCalc.interp_shift_var_lemma [in logic]
MuCalc.interp_shift_lemma [in logic]
MuCalc.interp_monotone [in logic]
MuCalc.interp_shift_neg_many_lemma [in logic]
MuCalc.interp'_monotone [in logic]
MuCalc.models_denotable [in logic]
MuCalc.model_kripke [in logic]
MuCalc.model_eq [in logic]
MuCalc.modus_ponens [in logic]
MuCalc.mu_equation [in logic]
MuCalc.nu_equation [in logic]
MuCalc.representation_denotation [in logic]
MuCalc.representation'_denotation [in logic]
MuCalc.subst_spec' [in logic]
MuCalc.subst_var_spec [in logic]
MuCalc.subst_spec [in logic]
MuCalc.subst_spec_full [in logic]
MuCalc.szL_inj [in logic]


N

NNPP [in prelim]
nodup_list_length [in finiteness]
normal1 [in bourbaki]
normal2 [in bourbaki]


O

omniscience [in bar_induction]
or_ext [in base]
outer_closed [in bourbaki]


P

path_where_incl [in prelim]
path_rt [in prelim]
path_cons_right [in prelim]
path_trans [in prelim]
path_inv_right [in prelim]
plus_decompose [in compcert]
proof_irr [in base]
PropLogic.alternate_prime_lemma [in prop_logic]
PropLogic.deduction [in prop_logic]
PropLogic.derives_truth [in prop_logic]
PropLogic.derives_weaken [in prop_logic]
PropLogic.derives_collapse [in prop_logic]
PropLogic.derives_TT [in prop_logic]
PropLogic.derives_FF [in prop_logic]
PropLogic.derives_conj [in prop_logic]
PropLogic.derives_disj [in prop_logic]
PropLogic.disjunctive_rearrange [in prop_logic]
PropLogic.disjunctive_elim [in prop_logic]
PropLogic.disjunctive_combine2 [in prop_logic]
PropLogic.disjunctive_combine [in prop_logic]
PropLogic.formula_to_syntax_inj [in prop_logic]
PropLogic.fsyn_order_wf [in prop_logic]
PropLogic.fsyn_order_trans [in prop_logic]
PropLogic.fsyn_order_total [in prop_logic]
PropLogic.impl_adjoint1 [in prop_logic]
PropLogic.impl_adjoint2 [in prop_logic]
PropLogic.inflate_theory_iso [in prop_logic]
PropLogic.inflate_theory_inflationary [in prop_logic]
PropLogic.inflate_theory_fixpoint_maximal [in prop_logic]
PropLogic.interp_acc [in prop_logic]
PropLogic.IPL_valid [in prop_logic]
PropLogic.maximal_theory_avoiding_disjunctive [in prop_logic]
PropLogic.minimize_admissable_formula [in prop_logic]
PropLogic.model_kripke [in prop_logic]
PropLogic.model_eq [in prop_logic]
PropLogic.order_list_wf [in prop_logic]
PropLogic.order_formula_irr [in prop_logic]
PropLogic.order_formula_wf [in prop_logic]
PropLogic.order_list_struct_len [in prop_logic]
PropLogic.order_formula_trans [in prop_logic]
PropLogic.order_list_total [in prop_logic]
PropLogic.order_formula_total [in prop_logic]
PropLogic.order_list_trans [in prop_logic]
PropLogic.prime_lemma [in prop_logic]
PropLogic.ta_chain_complete [in prop_logic]
PropLogic.theorems_valid [in prop_logic]
PropLogic.theorem_weaken [in prop_logic]
PropLogic.theory_avoiding_incr_ord [in prop_logic]
PropLogic.unwind_derives [in prop_logic]
prop_soundness [in strong_bisim]


Q

q_eq [in bourbaki]


R

READY_PRUNE.Q1Q2_prune [in strong_beh_choice]
READY_PRUNE.expansion_refinement [in strong_beh_choice]
READY_PRUNE.acc_refl [in strong_choice]
READY_PRUNE.characteristic_self [in strong_choice]
READY_PRUNE.global_pruning_bisim [in strong_choice]
READY_PRUNE.prop_soundness [in strong_beh_choice]
READY_PRUNE.ready_ref_refl [in strong_beh_choice]
READY_PRUNE.ready_ref_trans [in strong_beh_choice]
READY_PRUNE.XQ1_bisim [in strong_beh_choice]
READY_PRUNE.characteristic_other [in strong_beh_choice]
READY_PRUNE.ready_ref_prune [in strong_choice]
READY_PRUNE.comp_ready_sim [in strong_beh_choice]
READY_PRUNE.Q2Q3_expand [in strong_beh_choice]
READY_PRUNE.Q2Y_bisim [in strong_choice]
READY_PRUNE.ready_ref_trans [in strong_choice]
READY_PRUNE.acc_trans [in strong_choice]
READY_PRUNE.strong_ref_mho [in strong_beh_choice]
READY_PRUNE.XQ1_bisim [in strong_choice]
READY_PRUNE.comp_ready_sim [in strong_choice]
READY_PRUNE.ready_ref_refl [in strong_choice]
READY_PRUNE.acc_refl [in strong_beh_choice]
READY_PRUNE.ready_ref_smallest [in strong_beh_choice]
READY_PRUNE.Q3Y_bisim [in strong_beh_choice]
READY_PRUNE.adequate_ready_sim [in strong_beh_choice]
READY_PRUNE.eq_ready_sim [in strong_choice]
READY_PRUNE.acc_trans [in strong_beh_choice]
READY_PRUNE.eq_ready_sim [in strong_beh_choice]
READY_PRUNE.bisim_ready_sim [in strong_beh_choice]
READY_PRUNE.CF_is_characteristic [in strong_beh_choice]
READY_PRUNE.ready_sim_comp [in strong_choice]
READY_PRUNE.prop_soundness [in strong_choice]
READY_PRUNE.bisim_ready_sim [in strong_choice]
READY_PRUNE.adequacy [in strong_choice]
READY_PRUNE.characteristic_self [in strong_beh_choice]
READY_PRUNE.adequate_ready_sim [in strong_choice]
READY_PRUNE.mho_valid [in strong_beh_choice]
READY_PRUNE.Q1Q2_prune [in strong_choice]
READY_PRUNE.CF_is_characteristic [in strong_choice]
READY_PRUNE.global_pruning_bisim [in strong_beh_choice]
READY_PRUNE.adequacy [in strong_beh_choice]
READY_PRUNE.ready_sim_comp [in strong_beh_choice]
READY_PRUNE.characteristic_other [in strong_choice]
refines_strengthen [in ref_alternatives]
refines_symmetric [in ref_alternatives]
right_to_rt [in base]
rtl_trans [in base]
rtr_trans [in base]
rt_t_trans [in base]
rt_inv [in base]
rt_to_right [in base]
rt_mono [in base]
rt_to_left [in base]
R'dec [in bar_induction]
R'down [in bar_induction]
R'0 [in bar_induction]


S

securable_induction [in bar_induction]
select_subset [in prelim]
SequentCompleteness.adequate [in strong_ref_complete2]
SequentCompleteness.axioms_soundness [in strong_ref_complete2]
SequentCompleteness.axiom_Sq5 [in strong_ref_complete2]
SequentCompleteness.box_successor [in strong_ref_complete2]
SequentCompleteness.cannonical_model [in strong_ref_complete2]
SequentCompleteness.derives_nec [in strong_ref_complete2]
SequentCompleteness.dia_successor [in strong_ref_complete2]
SequentCompleteness.disjunctive_property_of_theorems [in strong_ref_complete2]
SequentCompleteness.from_impl_free [in strong_ref_complete2]
SequentCompleteness.Hsequent_rank1 [in strong_ref_complete2]
SequentCompleteness.main [in strong_ref_complete2]
SequentCompleteness.prime_theorems_or_definite [in strong_ref_complete2]
SequentCompleteness.prime_definite_set [in strong_ref_complete2]
SequentCompleteness.prime_definite_definite_set [in strong_ref_complete2]
SequentCompleteness.same_sequents [in strong_ref_complete2]
SequentCompleteness.sequent_list_conj [in strong_ref_complete2]
SequentCompleteness.sequent_list_conj2 [in strong_ref_complete2]
SequentCompleteness.sequent_completeness [in strong_ref_complete2]
SequentCompleteness.sequent_soundness [in strong_ref_complete2]
SequentCompleteness.sqt_reg_box [in strong_ref_complete2]
SequentCompleteness.theorem_soundness [in strong_ref_complete2]
SequentCompleteness.theorem_completeness [in strong_ref_complete2]
SequentCompleteness.toH_impl_free [in strong_ref_complete2]
SequentCompleteness.toH_interp [in strong_ref_complete2]
SequentLogic.alternate_prime_lemma [in seqt_logic]
SequentLogic.derives_weaken [in seqt_logic]
SequentLogic.derives_collapse [in seqt_logic]
SequentLogic.formula_to_syntax_inj [in seqt_logic]
SequentLogic.fsyn_order_trans [in seqt_logic]
SequentLogic.fsyn_order_wf [in seqt_logic]
SequentLogic.fsyn_order_total [in seqt_logic]
SequentLogic.inflate_theory_iso [in seqt_logic]
SequentLogic.inflate_theory_inflationary [in seqt_logic]
SequentLogic.inflate_theory_fixpoint_maximal [in seqt_logic]
SequentLogic.interp_acc [in seqt_logic]
SequentLogic.list_select [in seqt_logic]
SequentLogic.maximal_theory_avoiding_disjunctive [in seqt_logic]
SequentLogic.minimize_admissable_formula [in seqt_logic]
SequentLogic.model_kripke [in seqt_logic]
SequentLogic.model_eq [in seqt_logic]
SequentLogic.order_formula_irr [in seqt_logic]
SequentLogic.order_formula_trans [in seqt_logic]
SequentLogic.order_list_struct_len [in seqt_logic]
SequentLogic.order_formula_wf [in seqt_logic]
SequentLogic.order_list_trans [in seqt_logic]
SequentLogic.order_list_total [in seqt_logic]
SequentLogic.order_list_wf [in seqt_logic]
SequentLogic.order_formula_total [in seqt_logic]
SequentLogic.prime_lemma [in seqt_logic]
SequentLogic.sequent_list_disj1 [in seqt_logic]
SequentLogic.sequent_FF [in seqt_logic]
SequentLogic.sequent_list_disj2 [in seqt_logic]
SequentLogic.sequent_conj [in seqt_logic]
SequentLogic.sqt_assume' [in seqt_logic]
SequentLogic.sqt_assume [in seqt_logic]
SequentLogic.ta_chain_complete [in seqt_logic]
SequentLogic.theory_avoiding_incr_ord [in seqt_logic]
star_must_step_star [in compcert]
STRONG_REF.safe_eq3_2 [in strong_ref]
STRONG_REF.safe_eq3_1 [in strong_ref]
STRONG_REF.ExpandRef.refines_expands' [in strong_ref]
STRONG_REF.strong_ref_mho [in strong_ref]
STRONG_REF.adequacy [in strong_ref]
STRONG_REF.characteristic_other [in strong_ref]
STRONG_REF.lts_safe_is_safe [in strong_ref]
STRONG_REF.CF_is_characteristic [in strong_ref]
STRONG_REF.strong_ref_trans [in strong_ref]
STRONG_REF.expansion_refinement [in strong_ref]
STRONG_REF.construct_counter2 [in strong_ref]
STRONG_REF.ExpandRef.Q2_Y_bisim [in strong_ref]
STRONG_REF.classical_step [in strong_ref]
STRONG_REF.construct_counter1 [in strong_ref]
STRONG_REF.ExpandRef.wrong_bisim_mho [in strong_ref]
STRONG_REF.safe_eq2 [in strong_ref]
STRONG_REF.safe_eq1 [in strong_ref]
STRONG_REF.ExpandRef.XQ1_bisim [in strong_ref]
STRONG_REF.strong_ref_mho' [in strong_ref]
STRONG_REF.strong_refinement_eq [in strong_ref]
STRONG_REF.strong_refines_equiv' [in strong_ref]
STRONG_REF.ref_eq [in strong_ref]
STRONG_REF.safe_refine [in strong_ref]
STRONG_REF.mho_valid [in strong_ref]
STRONG_REF.ExpandRef.Q1toQ2expand [in strong_ref]
STRONG_REF.strong_ref_wrong_rel [in strong_ref]
STRONG_REF.characteristic_self [in strong_ref]
STRONG_REF.ref_eq' [in strong_ref]
STRONG_REF.lts_safe_refines [in strong_ref]
STRONG_REF.strong_refinement_comp [in strong_ref]
STRONG_REF.strong_refines_mho [in strong_ref]
STRONG_REF.strong_refinement_inv [in strong_ref]
STRONG_REF.strong_refines_equiv [in strong_ref]
STRONG_REF.wrong_bisim_sym [in strong_ref]
STRONG_REF.ExpandRef.refinement_refines [in strong_ref]
STRONG_REF.strong_ref_refl [in strong_ref]
STRONG_REF.strong_refinement_trip [in strong_ref]


T

t_rt [in base]
t_inv_left [in base]
T_dec [in bar_induction]
t_rt_trans [in base]
t_inv_right [in base]


U

Unil [in bar_induction]
union_intro [in prelim]


Z

zorn [in bourbaki]



Constructor Index

B

BF_REF_LOGIC.dia [in bf_ref_logic]
BF_DIV_LOGIC.dia [in bf_div_logic]
BF_REF_DIV_LOGIC.dia [in bf_ref_div_logic]
BF_DIV_LOGIC.box_back [in bf_div_logic]
BF_REF_DIV_LOGIC.box [in bf_ref_div_logic]
BF_LOGIC.dia_back [in bf_logic]
BF_REF_DIV_LOGIC.div [in bf_ref_div_logic]
BF_LOGIC.dia [in bf_logic]
BF_REF_LOGIC.box_back [in bf_ref_logic]
BF_REF_DIV_LOGIC.dia_back [in bf_ref_div_logic]
BF_REF_LOGIC.box [in bf_ref_logic]
BF_REF_DIV_LOGIC.box_back [in bf_ref_div_logic]
BF_REF_LOGIC.dia_back [in bf_ref_logic]
BF_LOGIC.box_back [in bf_logic]
BF_REF_DIV_LOGIC.conv [in bf_ref_div_logic]
BF_DIV_LOGIC.conv [in bf_div_logic]
BF_DIV_LOGIC.dia_back [in bf_div_logic]
BF_LOGIC.box [in bf_logic]
BF_DIV_LOGIC.div [in bf_div_logic]
BF_DIV_LOGIC.box [in bf_div_logic]
box [in strong_bisim]
BRANCH_REF.Q2step2 [in branch_ref]
BRANCH_REF.wrong_rel_into' [in branch_ref]
BRANCH_BISIM.rsm_init [in branch_bisim]
BRANCH_REF.mkQ1 [in branch_ref]
BRANCH_REF.wrong_rel_into [in branch_ref]
BRANCH_REF.branch_forward_ind_intro [in branch_ref]
BRANCH_REF.Q2step6 [in branch_ref]
BRANCH_BISIM.rule_step [in branch_bisim]
BRANCH_BISIM.rule_identify [in branch_bisim]
BRANCH_REF.Q1step2 [in branch_ref]
BRANCH_BISIM.branch_ind_intro [in branch_bisim]
BRANCH_BISIM.rule_init_identify [in branch_bisim]
BRANCH_REF.Q2step1 [in branch_ref]
BRANCH_REF.go_wrong_later [in branch_ref]
BRANCH_REF.Q2step3 [in branch_ref]
BRANCH_BISIM.rsm_seq [in branch_bisim]
BRANCH_REF.branch_backward_ind_intro [in branch_ref]
BRANCH_BISIM.rs_init [in branch_bisim]
BRANCH_REF.wrong_rel_mho [in branch_ref]
BRANCH_BISIM.rule_init_step [in branch_bisim]
BRANCH_REF.mkQ2 [in branch_ref]
BRANCH_REF.Q1step1 [in branch_ref]
BRANCH_BISIM.branch_ind'_intro [in branch_bisim]
BRANCH_REF.Q1step3 [in branch_ref]
BRANCH_REF.Q2step4 [in branch_ref]
BRANCH_REF.branch_backward_ind_no_stutter_intro [in branch_ref]
BRANCH_REF.branch_forward_ind_no_sutter_intro [in branch_ref]
BRANCH_BISIM.quotient.qst_main [in branch_bisim]
BRANCH_REF.go_wrong_now [in branch_ref]
BRANCH_REF.mkQ2Y [in branch_ref]
BRANCH_REF.Q2step5 [in branch_ref]
BRANCH_REF.Q1step4 [in branch_ref]
BRANCH_BISIM.rs_seq [in branch_bisim]
BRANCH_BISIM.quotient.qst_loop [in branch_bisim]
BRANCH_REF.wrong_rel_mho' [in branch_ref]


C

CHOICE_BEH_REF.choice_forward_intro [in choice_beh_ref]
CHOICE_REF.conv [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2action [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2tauX [in choice_ref]
CHOICE_REF.box_back [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q1tauY [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q1action [in choice_ref]
CHOICE_REF.choice_forward_intro [in choice_ref]
CHOICE_BEH_REF.box_back [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.ptsso_nil [in choice_ref]
CHOICE_BEH_REF.dia_back [in choice_beh_ref]
CHOICE_BEH_REF.conv [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.mkQ1 [in choice_ref]
CHOICE_BEH_REF.box [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.Q2tauY [in choice_ref]
CHOICE_REF.box [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2tauY [in choice_ref]
CHOICE_REF.dia_back [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.mkQ2 [in choice_ref]
CHOICE_BEH_REF.offers [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.Q2action [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2tauX [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1tauY [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.mkQ1 [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1action [in choice_ref]
CHOICE_BEH_REF.circ [in choice_beh_ref]
CHOICE_REF.circ [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.ptsso_cons [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.mkQ2 [in choice_ref]
CHOICE_REF.offers [in choice_ref]
COMPILER_INTERFACE.mho [in iface]
COMPILER_INTERFACE.branch_forward_ind_intro [in iface]
COMPILER_INTERFACE.path_nil [in iface]
COMPILER_INTERFACE.branch_backward_ind_no_stutter_intro [in iface]
COMPILER_INTERFACE.go_wrong_later [in iface]
COMPILER_INTERFACE.choice_forward_intro [in iface]
COMPILER_INTERFACE.path_cons [in iface]
COMPILER_INTERFACE.into [in iface]
COMPILER_INTERFACE.go_wrong_now [in iface]
COMPILER_INTERFACE.branch_backward_ind_intro [in iface]
COMPILER_INTERFACE.branch_forward_ind_no_sutter_intro [in iface]


D

dia [in strong_bisim]
done [in compcert]


E

ELTS_Theory.box [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step2 [in strong_ref_complete]
ELTS_Theory.AX_K3 [in strong_ref_complete]
ELTS_Theory.AX_K6 [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step3 [in strong_ref_complete]
ELTS_Theory.AXC_em [in strong_ref_complete]
ELTS_Theory.AXC_dia1 [in strong_ref_complete]
ELTS_Theory.stp_withinY [in strong_ref_complete]
ELTS_Theory.AX_K3' [in strong_ref_complete]
ELTS_Theory.AX_K4 [in strong_ref_complete]
ELTS_Theory.stp_startX [in strong_ref_complete]
ELTS_Theory.stp_withinX [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step5 [in strong_ref_complete]
ELTS_Theory.AXC_K1 [in strong_ref_complete]
ELTS_Theory.stp_startY [in strong_ref_complete]
ELTS_Theory.AX_definite2 [in strong_ref_complete]
ELTS_Theory.stateY [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1step1 [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step4 [in strong_ref_complete]
ELTS_Theory.ExpandRef.mkQ2Y [in strong_ref_complete]
ELTS_Theory.dia [in strong_ref_complete]
ELTS_Theory.AX_K5 [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step1 [in strong_ref_complete]
ELTS_Theory.AX'_AX [in strong_ref_complete]
ELTS_Theory.AXC_dia2 [in strong_ref_complete]
ELTS_Theory.ExpandRef.mkQ1 [in strong_ref_complete]
ELTS_Theory.AXC_boxTT [in strong_ref_complete]
ELTS_Theory.stateX [in strong_ref_complete]
ELTS_Theory.AX_K1 [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1step2 [in strong_ref_complete]
ELTS_Theory.AX'_em [in strong_ref_complete]
ELTS_Theory.AX_definite1 [in strong_ref_complete]
ELTS_Theory.start [in strong_ref_complete]
ELTS_Theory.AX_K2 [in strong_ref_complete]
ELTS_Theory.ExpandRef.mkQ2 [in strong_ref_complete]


I

into [in prelim]
intro_world_step [in strong_bisim]


L

LTS_REF.run_cycle_later [in lts_ref]
LTS_TAU.run_from_step [in lts_tau]
LTS_TAU.related_prerun_action [in lts_tau]
LTS_TAU.path_obs_extend_intro [in lts_tau]
LTS_REF.related_prerun_action [in lts_ref]
LTS_TAU.weak_path_run_rel_intro [in lts_tau]
LTS_REF.run_from_start [in lts_ref]
LTS_REF.weak_path_tau_rel_intro [in lts_ref]
LTS_TAU.prerun_cycle_later [in lts_tau]
LTS_TAU.related_prerun_tau_right [in lts_tau]
LTS_REF.related_prerun_tau_right [in lts_ref]
LTS_TAU.related_prerun_end [in lts_tau]
LTS_TAU.weak_path_tau_rel_intro [in lts_tau]
LTS_REF.prerun_cycle_later [in lts_ref]
LTS_TAU.prerun_cycle_here [in lts_tau]
LTS_REF.related_prerun_end [in lts_ref]
LTS_TAU.run_cycle_here [in lts_tau]
LTS_REF.run_from_step [in lts_ref]
LTS_REF.prerun_cycle_here [in lts_ref]
LTS_TAU.run_from_start [in lts_tau]
LTS_TAU.related_prerun_tau_left [in lts_tau]
LTS_TAU.run_cycle_later [in lts_tau]
LTS_REF.related_prerun_tau_left [in lts_ref]
LTS_REF.run_cycle_here [in lts_ref]
LTS_REF.weak_path_run_rel_intro [in lts_ref]
LTS_REF.path_obs_extend_intro [in lts_ref]


M

match_ev_none [in compcert]
match_ev_some [in compcert]
mho [in prelim]
MuCalc.app [in logic]
MuCalc.arr [in logic]
MuCalc.atomic [in logic]
MuCalc.conj [in logic]
MuCalc.disj [in logic]
MuCalc.impl [in logic]
MuCalc.lam [in logic]
MuCalc.me_nil [in logic]
MuCalc.me_cons [in logic]
MuCalc.modality [in logic]
MuCalc.mu [in logic]
MuCalc.nu [in logic]
MuCalc.o [in logic]
MuCalc.szL [in logic]
MuCalc.szO [in logic]
MuCalc.szS [in logic]
MuCalc.var [in logic]


O

obs_event [in compcert]
obs_terminate [in compcert]


P

path_cons [in prelim]
path_nil [in prelim]
PropLogic.A [in prop_logic]
PropLogic.atomic [in prop_logic]
PropLogic.CONJ [in prop_logic]
PropLogic.conj [in prop_logic]
PropLogic.derives_cut [in prop_logic]
PropLogic.derives_logic [in prop_logic]
PropLogic.derives_axiom [in prop_logic]
PropLogic.derives_reg [in prop_logic]
PropLogic.derives_assume [in prop_logic]
PropLogic.disj [in prop_logic]
PropLogic.DISJ [in prop_logic]
PropLogic.FF [in prop_logic]
PropLogic.FF_ [in prop_logic]
PropLogic.fsyn_symbol_lt_M [in prop_logic]
PropLogic.fsyn_symbol_lt_A [in prop_logic]
PropLogic.IMPL [in prop_logic]
PropLogic.impl [in prop_logic]
PropLogic.IPL_then1 [in prop_logic]
PropLogic.IPL_or1 [in prop_logic]
PropLogic.IPL_TT [in prop_logic]
PropLogic.IPL_or2 [in prop_logic]
PropLogic.IPL_or3 [in prop_logic]
PropLogic.IPL_FF [in prop_logic]
PropLogic.IPL_then2 [in prop_logic]
PropLogic.IPL_and3 [in prop_logic]
PropLogic.IPL_and2 [in prop_logic]
PropLogic.IPL_and1 [in prop_logic]
PropLogic.M [in prop_logic]
PropLogic.modality [in prop_logic]
PropLogic.TT [in prop_logic]
PropLogic.TT_ [in prop_logic]


R

READY_PRUNE.wrong_rel_mho' [in strong_beh_choice]
READY_PRUNE.Q2step1 [in strong_choice]
READY_PRUNE.mkQ1 [in strong_beh_choice]
READY_PRUNE.mkQ1 [in strong_choice]
READY_PRUNE.Q2step1 [in strong_beh_choice]
READY_PRUNE.box [in strong_beh_choice]
READY_PRUNE.offers [in strong_beh_choice]
READY_PRUNE.mkQ3_Y [in strong_beh_choice]
READY_PRUNE.wrong_rel_into [in strong_beh_choice]
READY_PRUNE.wrong_rel_mho [in strong_beh_choice]
READY_PRUNE.Q3step2 [in strong_beh_choice]
READY_PRUNE.Q3step4 [in strong_beh_choice]
READY_PRUNE.Q3step3 [in strong_beh_choice]
READY_PRUNE.mkQ2 [in strong_choice]
READY_PRUNE.box [in strong_choice]
READY_PRUNE.offers [in strong_choice]
READY_PRUNE.Q1step1 [in strong_beh_choice]
READY_PRUNE.Q3step1 [in strong_beh_choice]
READY_PRUNE.wrong_rel_into' [in strong_beh_choice]
READY_PRUNE.Q2step2 [in strong_beh_choice]
READY_PRUNE.mkQ2 [in strong_beh_choice]
READY_PRUNE.Q1step1 [in strong_choice]
READY_PRUNE.mkQ3 [in strong_beh_choice]
RefC [in ref_alternatives]
rtl_refl [in base]
rtl_step [in base]
rtr_step [in base]
rtr_refl [in base]
run [in compcert]


S

sec_incl [in bar_induction]
sec_mono [in bar_induction]
sec_hered [in bar_induction]
sem_lts_step_term [in compcert]
sem_lts_step_ok [in compcert]
sem_lts_step_wrong [in compcert]
SequentCompleteness.SqAX0 [in strong_ref_complete2]
SequentCompleteness.SqAX1 [in strong_ref_complete2]
SequentCompleteness.SqAX2 [in strong_ref_complete2]
SequentCompleteness.SqAX3 [in strong_ref_complete2]
SequentCompleteness.SqAX4 [in strong_ref_complete2]
SequentCompleteness.SqAX5 [in strong_ref_complete2]
SequentCompleteness.SqD1 [in strong_ref_complete2]
SequentCompleteness.SqD2 [in strong_ref_complete2]
SequentCompleteness.SqD3 [in strong_ref_complete2]
SequentLogic.conj [in seqt_logic]
SequentLogic.CONJ [in seqt_logic]
SequentLogic.DISJ [in seqt_logic]
SequentLogic.disj [in seqt_logic]
SequentLogic.FF [in seqt_logic]
SequentLogic.FF_ [in seqt_logic]
SequentLogic.fsyn_symbol_lt_M [in seqt_logic]
SequentLogic.M [in seqt_logic]
SequentLogic.modality [in seqt_logic]
SequentLogic.sqt_disj_L [in seqt_logic]
SequentLogic.sqt_FF_L [in seqt_logic]
SequentLogic.sqt_conj_L [in seqt_logic]
SequentLogic.sqt_reg [in seqt_logic]
SequentLogic.sqt_cut [in seqt_logic]
SequentLogic.sqt_disj_R1 [in seqt_logic]
SequentLogic.sqt_conj_R [in seqt_logic]
SequentLogic.sqt_TT_R [in seqt_logic]
SequentLogic.sqt_disj_R2 [in seqt_logic]
SequentLogic.sqt_weaken [in seqt_logic]
SequentLogic.sqt_AX [in seqt_logic]
SequentLogic.TT [in seqt_logic]
SequentLogic.TT_ [in seqt_logic]
STRONG_REF.wrong_rel_into [in strong_ref]
STRONG_REF.ExpandRef.Q1step1 [in strong_ref]
STRONG_REF.wrong_rel_mho [in strong_ref]
STRONG_REF.ExpandRef.Q1step2 [in strong_ref]
STRONG_REF.box [in strong_ref]
STRONG_REF.ExpandRef.mkQ1 [in strong_ref]
STRONG_REF.pmust [in strong_ref]
STRONG_REF.ExpandRef.mkQ2Y [in strong_ref]
STRONG_REF.ExpandRef.mkQ2 [in strong_ref]
STRONG_REF.ExpandRef.Q2step1 [in strong_ref]
STRONG_REF.ExpandRef.Q2step5 [in strong_ref]
STRONG_REF.wrong_rel_mho' [in strong_ref]
STRONG_REF.ExpandRef.Q2step4 [in strong_ref]
STRONG_REF.ExpandRef.Q2step2 [in strong_ref]
STRONG_REF.dia [in strong_ref]
STRONG_REF.wrong_rel_into' [in strong_ref]
STRONG_REF.ExpandRef.Q2step3 [in strong_ref]
STRONG_REF.pmay [in strong_ref]
STRONG_REF.pacc [in strong_ref]


X

XY [in ref_alternatives]


Y

YX [in ref_alternatives]



Inductive Index

B

BF_DIV_LOGIC.bf_mode [in bf_div_logic]
BF_REF_DIV_LOGIC.bf_mode [in bf_ref_div_logic]
BF_REF_LOGIC.bf_mode [in bf_ref_logic]
BF_LOGIC.bf_mode [in bf_logic]
BRANCH_REF.wrong_rel' [in branch_ref]
BRANCH_BISIM.rule_state_match [in branch_bisim]
BRANCH_REF.Q2step [in branch_ref]
BRANCH_BISIM.branch_ind [in branch_bisim]
BRANCH_REF.branch_forward_ind [in branch_ref]
BRANCH_BISIM.quotient.quot_step [in branch_bisim]
BRANCH_REF.wrong_rel [in branch_ref]
BRANCH_BISIM.rule_transition [in branch_bisim]
BRANCH_REF.Q1step [in branch_ref]
BRANCH_REF.branch_backward_ind [in branch_ref]
BRANCH_REF.branch_forward_ind_no_stutter [in branch_ref]
BRANCH_REF.branch_backward_ind_no_stutter [in branch_ref]
BRANCH_BISIM.branch_ind' [in branch_bisim]
BRANCH_REF.Q2st [in branch_ref]
BRANCH_REF.goes_wrong [in branch_ref]
BRANCH_BISIM.rule_state [in branch_bisim]


C

CHOICE_REF.prune_choice_ref_well_staged.Q2 [in choice_ref]
CHOICE_BEH_REF.cb_mode [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.path_to_shared_stable_offer [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2step [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1step [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1 [in choice_ref]
CHOICE_BEH_REF.choice_forward [in choice_beh_ref]
CHOICE_BEH_REF.cb_atom [in choice_beh_ref]
CHOICE_REF.choice_mode [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2 [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2step [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q1step [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q1 [in choice_ref]
CHOICE_REF.choice_atom [in choice_ref]
CHOICE_REF.choice_forward [in choice_ref]
compcert_obs [in compcert]
COMPILER_INTERFACE.path_where [in iface]
COMPILER_INTERFACE.branch_backward_ind_no_stutter [in iface]
COMPILER_INTERFACE.branch_forward_ind_no_stutter [in iface]
COMPILER_INTERFACE.goes_wrong [in iface]
COMPILER_INTERFACE.branch_backward_ind [in iface]
COMPILER_INTERFACE.lift [in iface]
COMPILER_INTERFACE.choice_forward [in iface]
COMPILER_INTERFACE.branch_forward_ind [in iface]


E

ELTS_Theory.mode [in strong_ref_complete]
ELTS_Theory.interp_step [in strong_ref_complete]
ELTS_Theory.AX' [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2st [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1step [in strong_ref_complete]
ELTS_Theory.AX [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2step [in strong_ref_complete]
ELTS_Theory.interp_st [in strong_ref_complete]
ELTS_Theory.AXC [in strong_ref_complete]


L

lift [in prelim]
LTS_TAU.run_from [in lts_tau]
LTS_REF.related_preruns [in lts_ref]
LTS_REF.weak_path_run_rel [in lts_ref]
LTS_REF.run_cycle [in lts_ref]
LTS_REF.path_obs_extend [in lts_ref]
LTS_REF.run_from [in lts_ref]
LTS_TAU.related_preruns [in lts_tau]
LTS_REF.weak_path_tau_rel [in lts_ref]
LTS_TAU.prerun_cycle [in lts_tau]
LTS_REF.prerun_cycle [in lts_ref]
LTS_TAU.weak_path_run_rel [in lts_tau]
LTS_TAU.weak_path_tau_rel [in lts_tau]
LTS_TAU.run_cycle [in lts_tau]
LTS_TAU.path_obs_extend [in lts_tau]


M

match_ev [in compcert]
mode [in strong_bisim]
MuCalc.formula [in logic]
MuCalc.model_exts [in logic]
MuCalc.sz [in logic]
MuCalc.typ [in logic]


O

order_options [in ref_alternatives]


P

path_where [in prelim]
PropLogic.derives [in prop_logic]
PropLogic.formula [in prop_logic]
PropLogic.fsyn [in prop_logic]
PropLogic.fsyn_symbol_lt [in prop_logic]
PropLogic.IPL [in prop_logic]


R

READY_PRUNE.Q2st [in strong_choice]
READY_PRUNE.Q2step [in strong_beh_choice]
READY_PRUNE.Q3st [in strong_beh_choice]
READY_PRUNE.Q2st [in strong_beh_choice]
READY_PRUNE.Q1step [in strong_beh_choice]
READY_PRUNE.mode [in strong_choice]
READY_PRUNE.Q3step [in strong_beh_choice]
READY_PRUNE.mode [in strong_beh_choice]
READY_PRUNE.atom [in strong_choice]
READY_PRUNE.wrong_rel [in strong_beh_choice]
READY_PRUNE.atom [in strong_beh_choice]
READY_PRUNE.Q1st [in strong_beh_choice]
READY_PRUNE.Q1step [in strong_choice]
READY_PRUNE.wrong_rel' [in strong_beh_choice]
READY_PRUNE.Q1st [in strong_choice]
READY_PRUNE.Q2step [in strong_choice]
rt_right [in base]
rt_left [in base]


S

securable [in bar_induction]
semantics_lts_step [in compcert]
semantics_lts_state [in compcert]
SequentCompleteness.SqAX [in strong_ref_complete2]
SequentLogic.formula [in seqt_logic]
SequentLogic.fsyn [in seqt_logic]
SequentLogic.fsyn_symbol_lt [in seqt_logic]
SequentLogic.sequent [in seqt_logic]
STRONG_REF.proc_acc [in strong_ref]
STRONG_REF.pmay_step [in strong_ref]
STRONG_REF.wrong_rel [in strong_ref]
STRONG_REF.ExpandRef.Q1step [in strong_ref]
STRONG_REF.ihm_mode [in strong_ref]
STRONG_REF.ExpandRef.Q2st [in strong_ref]
STRONG_REF.ExpandRef.Q2step [in strong_ref]
STRONG_REF.wrong_rel' [in strong_ref]
STRONG_REF.pmust_step [in strong_ref]


W

world_step [in strong_bisim]



Definition Index

A

all_closed [in bourbaki]
asdf [in ref_alternatives]
asdf' [in ref_alternatives]


B

bar [in bar_induction]
bar_induction_statement [in bar_induction]
BF_REF.safe_run [in back_forth_ref]
BF_REF_LOGIC.safeify_state [in bf_ref_logic]
BF_REF_LOGIC.safety [in bf_ref_logic]
BF_BISIM.Xclosure [in back_forth_bisim]
BF_BISIM.bf_sim_div [in back_forth_bisim]
BF_REF_DIV_LOGIC.CF [in bf_ref_div_logic]
BF_REF_LOGIC.safe_world [in bf_ref_logic]
BF_BISIM.bf_bisimilar_div [in back_forth_bisim]
BF_REF.div_back' [in back_forth_ref]
BF_BISIM.forth' [in back_forth_bisim]
BF_REF_LOGIC.safeify_prerun [in bf_ref_logic]
BF_REF_DIV_LOGIC.CF_body [in bf_ref_div_logic]
BF_LOGIC.CF_main [in bf_logic]
BF_REF_LOGIC.CF_body [in bf_ref_logic]
BF_REF.back' [in back_forth_ref]
BF_REF.safe_prerun [in back_forth_ref]
BF_DIV_LOGIC.CF_body [in bf_div_logic]
BF_REF.back [in back_forth_ref]
BF_BISIM.bf_bisim_div' [in back_forth_bisim]
BF_REF.back_forth [in back_forth_ref]
BF_REF.back_forth_div' [in back_forth_ref]
BF_REF.forth2 [in back_forth_ref]
BF_LOGIC.CF_body [in bf_logic]
BF_BISIM.forth [in back_forth_bisim]
BF_LOGIC.CF [in bf_logic]
BF_DIV_LOGIC.CF [in bf_div_logic]
BF_BISIM.back [in back_forth_bisim]
BF_REF.forth1 [in back_forth_ref]
BF_REF.back_forth' [in back_forth_ref]
BF_DIV_LOGIC.CF_main [in bf_div_logic]
BF_REF.div_back [in back_forth_ref]
BF_REF_LOGIC.CF_main [in bf_ref_logic]
BF_REF.td_mono [in back_forth_ref]
BF_REF.back_forth_div [in back_forth_ref]
BF_BISIM.back_forth_div' [in back_forth_bisim]
BF_REF.div_forth [in back_forth_ref]
BF_REF_LOGIC.safeify [in bf_ref_logic]
BF_REF.forth [in back_forth_ref]
BF_REF_DIV_LOGIC.bf_interp_mode [in bf_ref_div_logic]
BF_LOGIC.interp_bf_mode [in bf_logic]
BF_REF_LOGIC.classical_world [in bf_ref_logic]
BF_BISIM.back_forth_div [in back_forth_bisim]
BF_BISIM.back_forth [in back_forth_bisim]
BF_REF.Xproperty [in back_forth_ref]
BF_REF.Xclosure [in back_forth_ref]
BF_REF.div_forth' [in back_forth_ref]
BF_REF_LOGIC.initial_state_prerun [in bf_ref_logic]
BF_REF_LOGIC.CF [in bf_ref_logic]
BF_REF_LOGIC.safeify_run [in bf_ref_logic]
BF_REF_LOGIC.bf_interp_mode [in bf_ref_logic]
BF_REF_LOGIC.safeify_steps [in bf_ref_logic]
BF_BISIM.bf_bisimilar_div' [in back_forth_bisim]
BF_BISIM.back' [in back_forth_bisim]
BF_BISIM.bf_sim_div' [in back_forth_bisim]
BF_REF.forth' [in back_forth_ref]
BF_DIV_LOGIC.interp_bf_mode [in bf_div_logic]
BF_BISIM.bf_bisim_div [in back_forth_bisim]
BF_REF_LOGIC.safe_run_model [in bf_ref_logic]
BF_REF_LOGIC.unsafeify [in bf_ref_logic]
BF_REF_LOGIC.mk_safeify [in bf_ref_logic]
BF_BISIM.back_forth' [in back_forth_bisim]
BF_REF_DIV_LOGIC.CF_main [in bf_ref_div_logic]
BF_BISIM.Xproperty [in back_forth_bisim]
BF_REF_LOGIC.initial_state [in bf_ref_logic]
bisimilar [in strong_bisim]
bisimulation [in strong_bisim]
both [in ref_alternatives]
BRANCH_REF.safe_state [in branch_ref]
BRANCH_BISIM.cond_D1 [in branch_bisim]
BRANCH_REF.branch_no_stutter [in branch_ref]
BRANCH_BISIM.ruleLTS [in branch_bisim]
BRANCH_REF.cond_D1' [in branch_ref]
BRANCH_REF.wrong_expands [in branch_ref]
BRANCH_REF.cond_D2 [in branch_ref]
BRANCH_BISIM.weak_converges [in branch_bisim]
BRANCH_BISIM.quotient.in_quot [in branch_bisim]
BRANCH_REF.branch_backward_no_stutter [in branch_ref]
BRANCH_REF.wrong_bisim [in branch_ref]
BRANCH_BISIM.stuttering_property [in branch_bisim]
BRANCH_REF.branch_wrong [in branch_ref]
BRANCH_BISIM.stuttering_closure [in branch_bisim]
BRANCH_BISIM.is_taupath [in branch_bisim]
BRANCH_BISIM.cond_D0 [in branch_bisim]
BRANCH_REF.wrong_expands' [in branch_ref]
BRANCH_REF.q2y [in branch_ref]
BRANCH_REF.branch_forward [in branch_ref]
BRANCH_REF.state_def [in branch_ref]
BRANCH_REF.branch_forward_no_stutter [in branch_ref]
BRANCH_BISIM.cond_D [in branch_bisim]
BRANCH_BISIM.taupath_rule [in branch_bisim]
BRANCH_BISIM.droploop [in branch_bisim]
BRANCH_BISIM.quotient.quot [in branch_bisim]
BRANCH_REF.cond_D2' [in branch_ref]
BRANCH_BISIM.cond_DX [in branch_bisim]
BRANCH_REF.wrong_bisimilar [in branch_ref]
BRANCH_BISIM.D0bar_Q [in branch_bisim]
BRANCH_REF.Q1 [in branch_ref]
BRANCH_REF.Q2 [in branch_ref]
BRANCH_BISIM.branch' [in branch_bisim]
BRANCH_REF.reachable [in branch_ref]
BRANCH_BISIM.quotient.quotLTS [in branch_bisim]
BRANCH_REF.Q1toQ2 [in branch_ref]
BRANCH_REF.stuttering_closure [in branch_ref]
BRANCH_BISIM.D0bar [in branch_bisim]
BRANCH_REF.branch_backward [in branch_ref]
BRANCH_BISIM.is_taupath_aux [in branch_bisim]
BRANCH_REF.branch_ind [in branch_ref]
BRANCH_BISIM.path_run [in branch_bisim]
BRANCH_BISIM.path_st [in branch_bisim]
BRANCH_REF.branch_div [in branch_ref]
BRANCH_REF.branch [in branch_ref]
BRANCH_REF.reachable' [in branch_ref]
BRANCH_REF.cond_D1 [in branch_ref]
BRANCH_BISIM.branch [in branch_bisim]
BRANCH_REF.branch_ind_no_stutter [in branch_ref]
BRANCH_BISIM.cond_D2 [in branch_bisim]
BRANCH_BISIM.quotient.mkq [in branch_bisim]
BRANCH_REF.branch_def [in branch_ref]
BRANCH_BISIM.quotient.is_quot [in branch_bisim]
BRANCH_REF.branch_div2 [in branch_ref]


C

CF [in strong_bisim]
CF_main [in strong_bisim]
CF_body [in strong_bisim]
CHOICE_REF.run_choice [in choice_ref]
CHOICE_REF.choice_refinement [in choice_ref]
CHOICE_BEH_REF.CF [in choice_beh_ref]
CHOICE_REF.CF_body [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q21 [in choice_ref]
CHOICE_REF.well_stageable [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q21 [in choice_ref]
CHOICE_BEH_REF.enables [in choice_beh_ref]
CHOICE_BEH_REF.cb_interp_mode [in choice_beh_ref]
CHOICE_BEH_REF.CF_main [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q2LTS [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.Q2LTS [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.Q1LTS [in choice_ref]
CHOICE_REF.possible_stable_offer [in choice_ref]
CHOICE_BEH_REF.choice_forward' [in choice_beh_ref]
CHOICE_BEH_REF.run_choice [in choice_beh_ref]
CHOICE_REF.choice_refines [in choice_ref]
CHOICE_REF.offer_set [in choice_ref]
CHOICE_REF.choice_refinement' [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.q2snd [in choice_ref]
CHOICE_REF.run_choice_forward [in choice_ref]
choice_set [in bar_induction]
CHOICE_REF.prune_choice_ref_well_staged.shortest_path_to_shared_stable_offer [in choice_ref]
CHOICE_REF.bare_pruning_refines [in choice_ref]
CHOICE_BEH_REF.well_stageable [in choice_beh_ref]
CHOICE_BEH_REF.offer_set [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.Q1LTS [in choice_ref]
CHOICE_BEH_REF.choice [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.q1fst [in choice_ref]
CHOICE_BEH_REF.CF_body [in choice_beh_ref]
CHOICE_BEH_REF.well_staged [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.q2snd [in choice_ref]
CHOICE_BEH_REF.forth_rev' [in choice_beh_ref]
CHOICE_REF.CF [in choice_ref]
CHOICE_BEH_REF.forth_rev [in choice_beh_ref]
CHOICE_BEH_REF.cb_interp_atom [in choice_beh_ref]
CHOICE_BEH_REF.run_choice_forward [in choice_beh_ref]
CHOICE_REF.interp_choice_mode [in choice_ref]
CHOICE_BEH_REF.choice_no_stutter [in choice_beh_ref]
CHOICE_REF.CF_main [in choice_ref]
CHOICE_REF.well_staged [in choice_ref]
CHOICE_REF.choice_refines' [in choice_ref]
CHOICE_REF.interp_choice_atom [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.q1fst [in choice_ref]
CHOICE_BEH_REF.stable [in choice_beh_ref]
CHOICE_REF.pruning_refines [in choice_ref]
CHOICE_BEH_REF.choice' [in choice_beh_ref]
comp [in prelim]
COMPILER_INTERFACE.void_lts [in iface]
COMPILER_INTERFACE.bisimilar [in iface]
COMPILER_INTERFACE.enables [in iface]
COMPILER_INTERFACE.branch_ind_no_stutter [in iface]
COMPILER_INTERFACE.choice [in iface]
COMPILER_INTERFACE.may_step_star [in iface]
COMPILER_INTERFACE.inv [in iface]
COMPILER_INTERFACE.reachable' [in iface]
COMPILER_INTERFACE.td_and [in iface]
COMPILER_INTERFACE.contains [in iface]
COMPILER_INTERFACE.must_step_star [in iface]
COMPILER_INTERFACE.transition_diagram [in iface]
COMPILER_INTERFACE.must_step [in iface]
COMPILER_INTERFACE.lift_map [in iface]
COMPILER_INTERFACE.bisimulation [in iface]
COMPILER_INTERFACE.refines [in iface]
COMPILER_INTERFACE.branch_ind [in iface]
COMPILER_INTERFACE.lstate [in iface]
COMPILER_INTERFACE.choice_no_stutter [in iface]
COMPILER_INTERFACE.refinement [in iface]
COMPILER_INTERFACE.may_step [in iface]
COMPILER_INTERFACE.choice_forward' [in iface]
contains [in prelim]


E

ELTS_Theory.accessable [in strong_ref_complete]
ELTS_Theory.injectX [in strong_ref_complete]
ELTS_Theory.order_mode [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1 [in strong_ref_complete]
ELTS_Theory.interpELTS [in strong_ref_complete]
ELTS_Theory.Y_interp_refinement_inv [in strong_ref_complete]
ELTS_Theory.injectY [in strong_ref_complete]
ELTS_Theory.Y_interp_refinement [in strong_ref_complete]
ELTS_Theory.set_steps [in strong_ref_complete]
ELTS_Theory.def_subset [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q2 [in strong_ref_complete]
ELTS_Theory.chaos [in strong_ref_complete]
ELTS_Theory.subset [in strong_ref_complete]
ELTS_Theory.expands' [in strong_ref_complete]
ELTS_Theory.upd_root [in strong_ref_complete]
ELTS_Theory.expands [in strong_ref_complete]
ELTS_Theory.step_crash_w [in strong_ref_complete]
ELTS_Theory.X_interp_refinement [in strong_ref_complete]
ELTS_Theory.empty_model [in strong_ref_complete]
ELTS_Theory.unlift_prime [in strong_ref_complete]
ELTS_Theory.rank1 [in strong_ref_complete]
ELTS_Theory.definite [in strong_ref_complete]
ELTS_Theory.accessable_trans [in strong_ref_complete]
ELTS_Theory.definite_prime_set [in strong_ref_complete]
ELTS_Theory.definite_set [in strong_ref_complete]
ELTS_Theory.unlift [in strong_ref_complete]
ELTS_Theory.wrong_bisim [in strong_ref_complete]
ELTS_Theory.wrong_bisimilar [in strong_ref_complete]
ELTS_Theory.bar [in strong_ref_complete]
ELTS_Theory.void_elts [in strong_ref_complete]
ELTS_Theory.refines [in strong_ref_complete]
ELTS_Theory.more_specs [in strong_ref_complete]
ELTS_Theory.step_crash_is [in strong_ref_complete]
ELTS_Theory.interp_mode [in strong_ref_complete]
ELTS_Theory.primeELTS [in strong_ref_complete]
ELTS_Theory.refinement [in strong_ref_complete]
ELTS_Theory.image_finite [in strong_ref_complete]
ELTS_Theory.unit_is [in strong_ref_complete]
ELTS_Theory.ExpandRef.q2y [in strong_ref_complete]
ELTS_Theory.unit_w [in strong_ref_complete]
ELTS_Theory.ExpandRef.Q1toQ2 [in strong_ref_complete]
enumerate [in ref_alternatives]
equiv [in strong_bisim]
expected [in ref_alternatives]


F

finite [in finiteness]
forcesX [in ref_alternatives]
forcesY [in ref_alternatives]
fsim_refine [in compcert]


I

image_finite [in strong_bisim]
immed_safe_dec [in compcert]
immed_safe [in compcert]
inflationary [in bourbaki]
interesting [in ref_alternatives]
interp_sb_mode [in strong_bisim]
inv [in prelim]
is_quot [in bourbaki]
is_interesting [in ref_alternatives]


K

keep_uniq [in ref_alternatives]


L

least_upper_bound [in bourbaki]
lift_map [in prelim]
lift_rel [in prelim]
lift_join [in prelim]
limited_principle_of_omniscience' [in bar_induction]
limited_principle_of_omniscience [in bar_induction]
LTS_REF.run_bisimilar [in lts_ref]
LTS_TAU.step_run [in lts_tau]
LTS_REF.run_transition_diagram [in lts_ref]
LTS_REF.weak_may_extend [in lts_ref]
LTS_REF.run_refinement [in lts_ref]
LTS_TAU.steps_plus [in lts_tau]
LTS_TAU.upd_root [in lts_tau]
LTS_TAU.acyclic_run [in lts_tau]
LTS_REF.SOS_to_LTS [in lts_ref]
LTS_REF.bisimilar [in lts_ref]
LTS_TAU.transition_diagram [in lts_tau]
LTS_REF.weak_must_extend [in lts_ref]
LTS_REF.lts_halt [in lts_ref]
LTS_REF.may_convergence_set [in lts_ref]
LTS_TAU.steps_star [in lts_tau]
LTS_TAU.void_lts [in lts_tau]
LTS_TAU.bisimulation [in lts_tau]
LTS_REF.acyclic_run [in lts_ref]
LTS_REF.must_extend_star [in lts_ref]
LTS_REF.hist_equiv [in lts_ref]
LTS_TAU.steps_tau [in lts_tau]
LTS_REF.void_lts [in lts_ref]
LTS_REF.sos_irreducable [in lts_ref]
LTS_TAU.run_bisimilar [in lts_tau]
LTS_REF.td_and [in lts_ref]
LTS_TAU.extend_run [in lts_tau]
LTS_REF.prerun [in lts_ref]
LTS_TAU.rtd_and [in lts_tau]
LTS_REF.may_step [in lts_ref]
LTS_REF.may_step_star [in lts_ref]
LTS_TAU.div_from [in lts_tau]
LTS_REF.good_prerun [in lts_ref]
LTS_REF.rtd_and [in lts_ref]
LTS_TAU.weak_step [in lts_tau]
LTS_TAU.run_bisimulation [in lts_tau]
LTS_REF.run_bisimulation [in lts_ref]
LTS_REF.extend_run [in lts_ref]
LTS_REF.may_hdivergence_set [in lts_ref]
LTS_TAU.related_runs [in lts_tau]
LTS_TAU.hist_equiv [in lts_tau]
LTS_REF.hst [in lts_ref]
LTS_REF.lstate [in lts_ref]
LTS_REF.may_divergence_set [in lts_ref]
LTS_REF.hist_accessable [in lts_ref]
LTS_REF.may_step_plus [in lts_ref]
LTS_REF.related_runs [in lts_ref]
LTS_REF.weak_may_step [in lts_ref]
LTS_TAU.weak_image_finite [in lts_tau]
LTS_REF.must_converge [in lts_ref]
LTS_REF.run_refines [in lts_ref]
LTS_TAU.weak_paths_finite [in lts_tau]
LTS_TAU.simulation [in lts_tau]
LTS_TAU.converges [in lts_tau]
LTS_REF.curr_rel [in lts_ref]
LTS_TAU.wd [in lts_tau]
LTS_TAU.divergence_set [in lts_tau]
LTS_REF.must_step_plus [in lts_ref]
LTS_TAU.hdiverges [in lts_tau]
LTS_REF.may_converge [in lts_ref]
LTS_TAU.append_run [in lts_tau]
LTS_REF.append_run [in lts_ref]
LTS_REF.may_extend_star [in lts_ref]
LTS_REF.must_convergence_set [in lts_ref]
LTS_TAU.run_similar [in lts_tau]
LTS_REF.refines [in lts_ref]
LTS_REF.must_extend [in lts_ref]
LTS_REF.accessible [in lts_ref]
LTS_REF.must_diverge [in lts_ref]
LTS_REF.start_run [in lts_ref]
LTS_REF.may_hdiverge [in lts_ref]
LTS_REF.must_hdiverge [in lts_ref]
LTS_REF.sos_stuck [in lts_ref]
LTS_REF.must_step_star [in lts_ref]
LTS_REF.finite_divergences [in lts_ref]
LTS_REF.weak_image_finite [in lts_ref]
LTS_REF.bisimulation [in lts_ref]
LTS_TAU.finite_divergences [in lts_tau]
LTS_TAU.hdivergence_set [in lts_tau]
LTS_REF.refinement [in lts_ref]
LTS_REF.may_diverge [in lts_ref]
LTS_TAU.stable [in lts_tau]
LTS_TAU.curr_rel [in lts_tau]
LTS_TAU.start_run [in lts_tau]
LTS_TAU.enables [in lts_tau]
LTS_REF.must_divergence_set [in lts_ref]
LTS_TAU.hst [in lts_tau]
LTS_TAU.upd_run [in lts_tau]
LTS_REF.must_hdivergence_set [in lts_ref]
LTS_REF.internally_deterministic [in lts_ref]
LTS_REF.transition_diagram [in lts_ref]
LTS_REF.tau_path_from [in lts_ref]
LTS_TAU.good_prerun [in lts_tau]
LTS_TAU.td_and [in lts_tau]
LTS_REF.weak_must_step [in lts_ref]
LTS_TAU.extended_run_star [in lts_tau]
LTS_TAU.tau_path_from [in lts_tau]
LTS_TAU.hconvergence_set [in lts_tau]
LTS_TAU.diverges [in lts_tau]
LTS_TAU.bisimilar [in lts_tau]
LTS_TAU.equiv [in lts_tau]
LTS_REF.equiv [in lts_ref]
LTS_TAU.convergence_set [in lts_tau]
LTS_REF.weak_paths_finite [in lts_ref]
LTS_TAU.prerun [in lts_tau]
LTS_REF.may_extend [in lts_ref]
LTS_TAU.run_transition_diagram [in lts_tau]
LTS_TAU.run_simulation [in lts_tau]
LTS_TAU.hconverges [in lts_tau]
LTS_REF.must_step [in lts_ref]
LTS_TAU.extended_run [in lts_tau]


M

make [in ref_alternatives]
maximal [in bourbaki]
MuCalc.cformula [in logic]
MuCalc.conj' [in logic]
MuCalc.disj' [in logic]
MuCalc.emptyE [in logic]
MuCalc.entails [in logic]
MuCalc.extend [in logic]
MuCalc.extend_mdl_many [in logic]
MuCalc.extend_mdl [in logic]
MuCalc.extend_many [in logic]
MuCalc.extend_mdl_many' [in logic]
MuCalc.extend_mdl_deep [in logic]
MuCalc.extend_many' [in logic]
MuCalc.FF [in logic]
MuCalc.fsize [in logic]
MuCalc.f_eq [in logic]
MuCalc.f_and [in logic]
MuCalc.f_or [in logic]
MuCalc.inf [in logic]
MuCalc.interp [in logic]
MuCalc.interp_cformula [in logic]
MuCalc.interp' [in logic]
MuCalc.kripke_monotone [in logic]
MuCalc.max_model [in logic]
MuCalc.min_model [in logic]
MuCalc.model [in logic]
MuCalc.model_apply [in logic]
MuCalc.model_le [in logic]
MuCalc.model_property [in logic]
MuCalc.model_app [in logic]
MuCalc.model_element [in logic]
MuCalc.mu' [in logic]
MuCalc.neg [in logic]
MuCalc.nu' [in logic]
MuCalc.premodel [in logic]
MuCalc.replace_var [in logic]
MuCalc.representation [in logic]
MuCalc.representation' [in logic]
MuCalc.shift [in logic]
MuCalc.shift_neg [in logic]
MuCalc.shift_neg_many [in logic]
MuCalc.shift_var' [in logic]
MuCalc.shift_var [in logic]
MuCalc.subst [in logic]
MuCalc.subst_neg [in logic]
MuCalc.subst' [in logic]
MuCalc.sup [in logic]
MuCalc.TT [in logic]
MuCalc.valid [in logic]


N

normal [in bourbaki]
normalize [in ref_alternatives]


O

ordered_set [in bourbaki]
ord_both [in ref_alternatives]


P

prefinite [in finiteness]
PropLogic.admissable_formula [in prop_logic]
PropLogic.derives_set [in prop_logic]
PropLogic.E0 [in prop_logic]
PropLogic.formula_to_syntax [in prop_logic]
PropLogic.fsyn_order [in prop_logic]
PropLogic.fsyn_number [in prop_logic]
PropLogic.impl_free [in prop_logic]
PropLogic.inflate_theory [in prop_logic]
PropLogic.interp [in prop_logic]
PropLogic.interp' [in prop_logic]
PropLogic.kripke_monotone [in prop_logic]
PropLogic.list_conj [in prop_logic]
PropLogic.list_disj [in prop_logic]
PropLogic.model [in prop_logic]
PropLogic.model_app [in prop_logic]
PropLogic.model_le [in prop_logic]
PropLogic.order_list_struct [in prop_logic]
PropLogic.order_list [in prop_logic]
PropLogic.order_formula [in prop_logic]
PropLogic.premodel [in prop_logic]
PropLogic.prime_theory_avoiding [in prop_logic]
PropLogic.smallest_admissable_formula [in prop_logic]
PropLogic.ta_chain_sup [in prop_logic]
PropLogic.ta_ord [in prop_logic]
PropLogic.theorem [in prop_logic]
PropLogic.theory_avoiding0 [in prop_logic]
PropLogic.theory_avoiding_incr [in prop_logic]
PropLogic.valid [in prop_logic]


Q

q [in bourbaki]
quot [in bourbaki]


R

READY_PRUNE.world_acc [in strong_choice]
READY_PRUNE.lstate [in strong_beh_choice]
READY_PRUNE.ready_sim [in strong_choice]
READY_PRUNE.ready_sim [in strong_beh_choice]
READY_PRUNE.enables [in strong_beh_choice]
READY_PRUNE.bisimilar [in strong_choice]
READY_PRUNE.ready_ref [in strong_beh_choice]
READY_PRUNE.wrong_bisimulation [in strong_beh_choice]
READY_PRUNE.interp_sc_atom [in strong_beh_choice]
READY_PRUNE.enables [in strong_choice]
READY_PRUNE.image_finite [in strong_beh_choice]
READY_PRUNE.global_pruned [in strong_beh_choice]
READY_PRUNE.expand_prune_extension [in strong_beh_choice]
READY_PRUNE.smallest_expand_prune_extension [in strong_beh_choice]
READY_PRUNE.Q3 [in strong_beh_choice]
READY_PRUNE.ready_ref [in strong_choice]
READY_PRUNE.CF [in strong_beh_choice]
READY_PRUNE.must_enable [in strong_beh_choice]
READY_PRUNE.CF [in strong_choice]
READY_PRUNE.wrong_expanded [in strong_beh_choice]
READY_PRUNE.Q1 [in strong_choice]
READY_PRUNE.wrong_bisimilar [in strong_beh_choice]
READY_PRUNE.image_finite [in strong_choice]
READY_PRUNE.Q2 [in strong_beh_choice]
READY_PRUNE.global_pruned_ref [in strong_choice]
READY_PRUNE.Q2 [in strong_choice]
READY_PRUNE.may_step [in strong_beh_choice]
READY_PRUNE.must_step [in strong_beh_choice]
READY_PRUNE.CF_body [in strong_choice]
READY_PRUNE.interp_sc_mode [in strong_beh_choice]
READY_PRUNE.interp_sc_mode [in strong_choice]
READY_PRUNE.world_acc [in strong_beh_choice]
READY_PRUNE.bisim [in strong_choice]
READY_PRUNE.interp_sc_atom [in strong_choice]
READY_PRUNE.CF_main [in strong_beh_choice]
READY_PRUNE.Q1 [in strong_beh_choice]
READY_PRUNE.CF_main [in strong_choice]
READY_PRUNE.CF_body [in strong_beh_choice]
refinement [in ref_alternatives]
refinement_strengthen' [in ref_alternatives]
refinement_strengthen [in ref_alternatives]
refines [in ref_alternatives]
reflx [in ref_alternatives]
rel_union [in prelim]
rule_following [in bar_induction]


S

semantics_LTS [in compcert]
SequentCompleteness.definite [in strong_ref_complete2]
SequentCompleteness.definite_prime_set [in strong_ref_complete2]
SequentCompleteness.definite_set [in strong_ref_complete2]
SequentCompleteness.def_subset [in strong_ref_complete2]
SequentCompleteness.Hsequent [in strong_ref_complete2]
SequentCompleteness.primeELTS [in strong_ref_complete2]
SequentCompleteness.set_steps [in strong_ref_complete2]
SequentCompleteness.subset [in strong_ref_complete2]
SequentCompleteness.theorem [in strong_ref_complete2]
SequentCompleteness.toH [in strong_ref_complete2]
SequentCompleteness.unlift [in strong_ref_complete2]
SequentCompleteness.valid_sequent [in strong_ref_complete2]
SequentLogic.admissable_formula [in seqt_logic]
SequentLogic.derives_set [in seqt_logic]
SequentLogic.derives_sets [in seqt_logic]
SequentLogic.derives_assume [in seqt_logic]
SequentLogic.formula_to_syntax [in seqt_logic]
SequentLogic.fsyn_order [in seqt_logic]
SequentLogic.fsyn_number [in seqt_logic]
SequentLogic.inflate_theory [in seqt_logic]
SequentLogic.interp [in seqt_logic]
SequentLogic.interp' [in seqt_logic]
SequentLogic.kripke_monotone [in seqt_logic]
SequentLogic.list_disj [in seqt_logic]
SequentLogic.list_conj [in seqt_logic]
SequentLogic.model [in seqt_logic]
SequentLogic.model_app [in seqt_logic]
SequentLogic.model_le [in seqt_logic]
SequentLogic.order_formula [in seqt_logic]
SequentLogic.order_list [in seqt_logic]
SequentLogic.order_list_struct [in seqt_logic]
SequentLogic.premodel [in seqt_logic]
SequentLogic.prime_theory_avoiding [in seqt_logic]
SequentLogic.smallest_admissable_formula [in seqt_logic]
SequentLogic.ta_chain_sup [in seqt_logic]
SequentLogic.ta_ord [in seqt_logic]
SequentLogic.theory_avoiding_incr [in seqt_logic]
SequentLogic.theory_avoiding0 [in seqt_logic]
SequentLogic.valid [in seqt_logic]
set_map' [in prelim]
set_map [in prelim]
strengthen [in ref_alternatives]
strengthen' [in ref_alternatives]
STRONG_REF.wrong_bisimulation [in strong_ref]
STRONG_REF.wrong_expands' [in strong_ref]
STRONG_REF.refines [in strong_ref]
STRONG_REF.CF_body [in strong_ref]
STRONG_REF.may_step [in strong_ref]
STRONG_REF.maximal [in strong_ref]
STRONG_REF.image_finite [in strong_ref]
STRONG_REF.bisimilar [in strong_ref]
STRONG_REF.unrel [in strong_ref]
STRONG_REF.CF_main [in strong_ref]
STRONG_REF.ExpandRef.Q2 [in strong_ref]
STRONG_REF.lstate [in strong_ref]
STRONG_REF.safe_proc [in strong_ref]
STRONG_REF.refinement [in strong_ref]
STRONG_REF.strong_refinement [in strong_ref]
STRONG_REF.ExpandRef.Q1 [in strong_ref]
STRONG_REF.safe_state [in strong_ref]
STRONG_REF.bisimulation [in strong_ref]
STRONG_REF.strong_ref [in strong_ref]
STRONG_REF.wrong_bisimilar [in strong_ref]
STRONG_REF.classical_process [in strong_ref]
STRONG_REF.ExpandRef.Q1toQ2 [in strong_ref]
STRONG_REF.lts_safe [in strong_ref]
STRONG_REF.ExpandRef.q2y [in strong_ref]
STRONG_REF.reachable [in strong_ref]
STRONG_REF.wrong_expands [in strong_ref]
STRONG_REF.interp_ihm_mode [in strong_ref]
STRONG_REF.lts_lift [in strong_ref]
STRONG_REF.CF [in strong_ref]
STRONG_REF.must_step [in strong_ref]
STRONG_REF.lts_unlift [in strong_ref]
swap_order [in ref_alternatives]
swap_choices [in ref_alternatives]
swap_choices_inv [in ref_alternatives]


T

T [in bar_induction]


U

unpack [in ref_alternatives]
upper_bound [in bourbaki]



Module Index

B

BF_LOGIC [in bf_logic]
BF_REF_DIV_LOGIC [in bf_ref_div_logic]
BF_BISIM [in back_forth_bisim]
BF_REF [in back_forth_ref]
BF_DIV_LOGIC [in bf_div_logic]
BF_REF_LOGIC [in bf_ref_logic]
BRANCH_REF [in branch_ref]
BRANCH_BISIM.quotient [in branch_bisim]
BRANCH_BISIM [in branch_bisim]


C

CHOICE_REF.prune_choice_ref_converges [in choice_ref]
CHOICE_REF [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged [in choice_ref]
CHOICE_BEH_REF [in choice_beh_ref]
CI [in iface]
CompilerInterface [in iface]
COMPILER_INTERFACE [in iface]


E

ELTS_Theory [in strong_ref_complete]
ELTS_Theory.ExpandRef [in strong_ref_complete]
EqdepElim [in base]
EqdepTh [in base]


L

LTS_REF [in lts_ref]
LTS_TAU [in lts_tau]


M

MuCalc [in logic]


O

OBSERVATION_SYSTEM [in strong_ref_complete]


P

PropLogic [in prop_logic]


R

READY_PRUNE [in strong_beh_choice]
READY_PRUNE [in strong_choice]


S

SequentCompleteness [in strong_ref_complete2]
SequentCompleteness.PL [in strong_ref_complete2]
SequentCompleteness.X [in strong_ref_complete2]
SequentLogic [in seqt_logic]
STRONG_REF [in strong_ref]
STRONG_REF.ExpandRef [in strong_ref]



Axiom Index

C

COMPILER_INTERFACE.may_step_step [in iface]
COMPILER_INTERFACE.refines_mho_forward_no_stutter [in iface]
COMPILER_INTERFACE.refines_branch_ind_choice [in iface]
COMPILER_INTERFACE.refines_ind_refl [in iface]
COMPILER_INTERFACE.branch_backward_ind_no_stutter_ind [in iface]
COMPILER_INTERFACE.refines_ind_mho [in iface]
COMPILER_INTERFACE.path_inv_right [in iface]
COMPILER_INTERFACE.refines_ind_refinement [in iface]
COMPILER_INTERFACE.must_may_step [in iface]
COMPILER_INTERFACE.branch_forward_ind_ind [in iface]
COMPILER_INTERFACE.refines_ind_trans [in iface]
COMPILER_INTERFACE.must_may_step_star [in iface]
COMPILER_INTERFACE.contains_same [in iface]
COMPILER_INTERFACE.bisimulation_and [in iface]
COMPILER_INTERFACE.refines_choice_no_stutter_refinement [in iface]
COMPILER_INTERFACE.path_trans [in iface]
COMPILER_INTERFACE.contains_eq [in iface]
COMPILER_INTERFACE.choice_forward_ind [in iface]
COMPILER_INTERFACE.branch_forward_ind_no_stutter_ind [in iface]
COMPILER_INTERFACE.choice_refines_mho_step_star [in iface]
COMPILER_INTERFACE.bisimilar_sym [in iface]
COMPILER_INTERFACE.bisim_ind_refl [in iface]
COMPILER_INTERFACE.refines_choice_refinement [in iface]
COMPILER_INTERFACE.branch_backward_ind_ind [in iface]
COMPILER_INTERFACE.contains_uniq [in iface]
COMPILER_INTERFACE.prove_branch_ind_bisim [in iface]
COMPILER_INTERFACE.bisim_branch_ind_stutter_eq [in iface]
COMPILER_INTERFACE.branch_ind_stutter_eq [in iface]
COMPILER_INTERFACE.bisim_ind_trans [in iface]
COMPILER_INTERFACE.refines_ind_mho_goes_wrong [in iface]
COMPILER_INTERFACE.path_cons_right [in iface]
COMPILER_INTERFACE.refines_ind_mho_tau [in iface]
COMPILER_INTERFACE.choice_refines_trans [in iface]
COMPILER_INTERFACE.stuttering_choice_refines_eq [in iface]
COMPILER_INTERFACE.refines_ind_mho_step_star [in iface]
COMPILER_INTERFACE.and_refinement [in iface]
COMPILER_INTERFACE.refines_ind_goes_wrong [in iface]
COMPILER_INTERFACE.goes_wrong_ind [in iface]
COMPILER_INTERFACE.refines_ind_no_stutter_refinement [in iface]
COMPILER_INTERFACE.refines_choice_refl [in iface]
COMPILER_INTERFACE.refines_ind_mho_star [in iface]
COMPILER_INTERFACE.path_where_incl [in iface]
COMPILER_INTERFACE.refinement_and [in iface]
COMPILER_INTERFACE.and_bisimulation [in iface]
COMPILER_INTERFACE.path_rt [in iface]


O

OBSERVATION_SYSTEM.O [in strong_ref_complete]
OBSERVATION_SYSTEM.O_inh [in strong_ref_complete]
OBSERVATION_SYSTEM.order_O_wf [in strong_ref_complete]
OBSERVATION_SYSTEM.order_O_total [in strong_ref_complete]
OBSERVATION_SYSTEM.order_O [in strong_ref_complete]
OBSERVATION_SYSTEM.order_O_trans [in strong_ref_complete]


P

prop_ext [in base]



Variable Index

A

A [in compcert]


B

bar_induction.inclUY [in bar_induction]
bar_induction.U [in bar_induction]
bar_induction.A [in bar_induction]
bar_induction.Bw [in bar_induction]
bar_induction.R [in bar_induction]
bar_induction.Y [in bar_induction]
bar_induction.monoU [in bar_induction]
bar_induction.heredY [in bar_induction]
BF_REF.bf_ref.bf_to_branch.HRX [in back_forth_ref]
BF_REF_LOGIC.bf_ref_logic.safeify.X [in bf_ref_logic]
BF_LOGIC.bf_logic.characteristic.X [in bf_logic]
BF_BISIM.bf_bisim.bf_to_branch.HR [in back_forth_bisim]
BF_BISIM.bf_bisim.bf_to_related_preruns.H [in back_forth_bisim]
BF_REF.bf_ref.bf_to_div.Y [in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter.X [in back_forth_bisim]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.R [in bf_ref_div_logic]
BF_BISIM.bf_bisim.bf_to_related_preruns.R [in back_forth_bisim]
BF_BISIM.bf_bisim.bf_to_branch.Y [in back_forth_bisim]
BF_REF.bf_ref.X_stutter.HR [in back_forth_ref]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.Hfin1 [in bf_ref_div_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.X [in bf_ref_div_logic]
BF_BISIM.bf_bisim.bf_to_branch.HRX [in back_forth_bisim]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic.E0 [in bf_ref_div_logic]
BF_BISIM.bf_bisim.branch_to_bf.X [in back_forth_bisim]
BF_BISIM.bf_bisim.X_stutter.R [in back_forth_bisim]
BF_REF.bf_ref.bf_to_branch.R [in back_forth_ref]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic.E1 [in bf_ref_div_logic]
BF_REF.bf_ref.X_stutter.R [in back_forth_ref]
BF_BISIM.bf_bisim.branch_to_bf.R [in back_forth_bisim]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.R [in bf_div_logic]
BF_REF.bf_ref.bf_to_branch.X [in back_forth_ref]
BF_BISIM.bf_bisim.branch_to_bf.HR [in back_forth_bisim]
BF_BISIM.bf_bisim.bf_to_related_preruns.Y [in back_forth_bisim]
BF_REF.bf_ref.branch_to_bf.R [in back_forth_ref]
BF_REF.bf_ref.bf_to_branch.R' [in back_forth_ref]
BF_REF.bf_ref.branch_to_bf.HR [in back_forth_ref]
BF_REF_LOGIC.bf_ref_logic.E0 [in bf_ref_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.characteristic.X [in bf_ref_div_logic]
BF_LOGIC.bf_logic.characteristic.E0 [in bf_logic]
BF_REF.bf_ref.X_stutter.X [in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter.HRX [in back_forth_bisim]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.Hfin1 [in bf_div_logic]
BF_REF.bf_ref.bf_to_branch.Y [in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter.HR [in back_forth_bisim]
BF_REF.bf_ref.bf_to_branch.HR1 [in back_forth_ref]
BF_REF.bf_ref.branch_to_bf.X [in back_forth_ref]
BF_BISIM.bf_bisim.X_stutter.Y [in back_forth_bisim]
BF_REF.bf_ref.X_stutter.Y [in back_forth_ref]
BF_REF.bf_ref.X_stutter.HRX [in back_forth_ref]
BF_REF.bf_ref.bf_to_branch.HR2 [in back_forth_ref]
BF_REF.bf_ref.branch_to_bf.Y [in back_forth_ref]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.Y [in bf_ref_div_logic]
BF_REF.bf_ref.bf_to_related_preruns.H [in back_forth_ref]
BF_BISIM.bf_bisim.branch_to_bf.Y [in back_forth_bisim]
BF_REF.bf_ref.bf_to_div.H [in back_forth_ref]
BF_REF.bf_ref.bf_to_related_preruns.R [in back_forth_ref]
BF_REF.bf_ref.bf_to_related_preruns.R' [in back_forth_ref]
BF_REF.bf_ref.bf_to_related_preruns.X [in back_forth_ref]
BF_LOGIC.bf_logic.characteristic.E1 [in bf_logic]
BF_REF_DIV_LOGIC.bf_ref_div_logic.adequacy.inner.Hfin2 [in bf_ref_div_logic]
BF_BISIM.bf_bisim.bf_to_branch.X [in back_forth_bisim]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic.E0 [in bf_div_logic]
BF_REF_LOGIC.bf_ref_logic.characteristic.E1 [in bf_ref_logic]
BF_REF.bf_ref.bf_to_div.H0 [in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_related_preruns.R' [in back_forth_bisim]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.Hfin2 [in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic.E1 [in bf_div_logic]
BF_REF.bf_ref.bf_to_related_preruns.Y [in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_branch.R [in back_forth_bisim]
BF_REF.bf_ref.bf_to_div.H1 [in back_forth_ref]
BF_DIV_LOGIC.bf_div_logic.mu_calc.characteristic.X [in bf_div_logic]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.X [in bf_div_logic]
BF_REF_LOGIC.bf_ref_logic.characteristic.X [in bf_ref_logic]
BF_REF.bf_ref.bf_to_div.R [in back_forth_ref]
BF_REF.bf_ref.bf_to_div.R' [in back_forth_ref]
BF_BISIM.bf_bisim.bf_to_related_preruns.X [in back_forth_bisim]
BF_REF.bf_ref.bf_to_div.X [in back_forth_ref]
BF_DIV_LOGIC.bf_div_logic.adequacy.inner.Y [in bf_div_logic]
BF_REF.bf_ref.bf_to_branch.HR [in back_forth_ref]
bourbaki.A [in bourbaki]
bourbaki.chain_complete [in bourbaki]
bourbaki.choose [in bourbaki]
bourbaki.classic [in bourbaki]
bourbaki.fixpoint.f [in bourbaki]
bourbaki.fixpoint.f_inflate [in bourbaki]
bourbaki.fixpoint.f_iso [in bourbaki]
bourbaki.fixpoint.normal1.Hx [in bourbaki]
bourbaki.fixpoint.normal1.Hy [in bourbaki]
bourbaki.fixpoint.normal1.outer [in bourbaki]
bourbaki.fixpoint.normal1.x [in bourbaki]
bourbaki.fixpoint.normal1.y [in bourbaki]
bourbaki.fixpoint.x0 [in bourbaki]
bourbaki.fun_ext [in bourbaki]
bourbaki.prop_ext [in bourbaki]
bourbaki.R [in bourbaki]
bourbaki.Rrefl [in bourbaki]
bourbaki.Rtrans [in bourbaki]
BRANCH_BISIM.branch_bisim.D0_branch_ind.Y [in branch_bisim]
BRANCH_BISIM.branch_bisim.trans.R1 [in branch_bisim]
BRANCH_REF.branch_ref.trans_forward.R2 [in branch_ref]
BRANCH_BISIM.branch_bisim.D0_branch_ind.y [in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.Y [in branch_ref]
BRANCH_BISIM.branch_bisim.trans.Z [in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.R1 [in branch_ref]
BRANCH_BISIM.D0_to_brouwer.D0_sim_implies_ind_sim [in branch_bisim]
BRANCH_BISIM.D0_to_brouwer.rule [in branch_bisim]
BRANCH_BISIM.D0_to_brouwer.Bbar [in branch_bisim]
BRANCH_REF.branch_ref.expands_refine.Y [in branch_ref]
BRANCH_REF.branch_ref.trans_forward.Y [in branch_ref]
BRANCH_REF.branch_ref.trans_forward.HR2 [in branch_ref]
BRANCH_BISIM.branch_bisim.trans.R2 [in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.X [in branch_ref]
BRANCH_REF.branch_ref.trans_forward.R1 [in branch_ref]
BRANCH_BISIM.branch_bisim.D0_branch_ind.Hxy [in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.HR1 [in branch_ref]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams.X [in branch_bisim]
BRANCH_REF.branch_ref.expands_refine.HR [in branch_ref]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams.R [in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.H [in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.x [in branch_bisim]
BRANCH_BISIM.branch_bisim.trans.HR1 [in branch_bisim]
BRANCH_REF.branch_ref.expands_refine.X [in branch_ref]
BRANCH_BISIM.branch_bisim.D0_branch_ind.Bw [in branch_bisim]
BRANCH_REF.branch_ref.trans_forward.X [in branch_ref]
BRANCH_BISIM.D0_to_brouwer.B [in branch_bisim]
BRANCH_BISIM.branch_bisim.divergence_sensitive_diagrams.Y [in branch_bisim]
BRANCH_BISIM.branch_bisim.ind_equiv.X [in branch_bisim]
BRANCH_REF.branch_ref.trans_forward.HR1 [in branch_ref]
BRANCH_REF.branch_ref.trans_backward.Z [in branch_ref]
BRANCH_BISIM.branch_bisim.trans.X [in branch_bisim]
BRANCH_BISIM.branch_bisim.ind_equiv.R [in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.X [in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.R2 [in branch_ref]
BRANCH_REF.branch_ref.expands_refine.R [in branch_ref]
BRANCH_BISIM.D0_to_brouwer.A [in branch_bisim]
BRANCH_BISIM.branch_bisim.ind_equiv.Y [in branch_bisim]
BRANCH_BISIM.branch_bisim.D0_branch_ind.R [in branch_bisim]
BRANCH_BISIM.quotient.quotient.X [in branch_bisim]
BRANCH_REF.branch_ref.trans_backward.HR2 [in branch_ref]
BRANCH_BISIM.branch_bisim.trans.Y [in branch_bisim]
BRANCH_REF.branch_ref.trans_forward.Z [in branch_ref]
BRANCH_BISIM.branch_bisim.trans.HR2 [in branch_bisim]


C

C [in compcert]
CHOICE_BEH_REF.choice_beh_ref.characteristic.E1 [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.X' [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.characteristic.X [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.Xconverges [in choice_ref]
CHOICE_REF.choice_ref.bf_to_branch.X [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.HR [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.Y [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.HR [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.characteristic.E0 [in choice_beh_ref]
CHOICE_REF.choice_ref.branch_to_bf.Y [in choice_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.X [in choice_ref]
CHOICE_REF.choice_ref.bf_to_branch.R [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.R [in choice_beh_ref]
CHOICE_REF.choice_ref.characteristic.E0 [in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner.X [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.R [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged.Y [in choice_ref]
CHOICE_REF.choice_ref.branch_to_bf.HR [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.X [in choice_beh_ref]
CHOICE_REF.choice_ref.characteristic.E1 [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.Hfin2 [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.bf_to_branch.Y [in choice_beh_ref]
CHOICE_REF.choice_ref.bf_to_branch.HR [in choice_ref]
CHOICE_REF.choice_ref.branch_to_bf.X [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.R [in choice_beh_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.Hfin1 [in choice_beh_ref]
CHOICE_REF.choice_ref.adequacy.inner.Hfin2 [in choice_ref]
CHOICE_REF.choice_ref.branch_to_bf.R [in choice_ref]
CHOICE_REF.choice_ref.adequacy.inner.R [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.X [in choice_beh_ref]
CHOICE_REF.choice_ref.adequacy.inner.Hfin1 [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged.X [in choice_ref]
CHOICE_REF.choice_ref.bf_to_branch.Y [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.branch_to_bf.Y [in choice_beh_ref]
CHOICE_REF.prune_choice_ref_converges.prune_choice_ref_converges.Y [in choice_ref]
CHOICE_REF.choice_ref.characteristic.X [in choice_ref]
CHOICE_BEH_REF.choice_beh_ref.adequacy.inner.X [in choice_beh_ref]
CHOICE_REF.choice_ref.adequacy.inner.Y [in choice_ref]
CHOICE_REF.prune_choice_ref_well_staged.prune_choice_ref_well_staged.Y_well_staged [in choice_ref]
closures.R [in base]
closures.X [in base]
COMPILER_INTERFACE.paths.R [in iface]
COMPILER_INTERFACE.paths.X [in iface]


E

ELTS_Theory.interpolate_worlds.Hstp [in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.Y [in strong_ref_complete]
ELTS_Theory.interpolate_worlds.Hacc [in strong_ref_complete]
ELTS_Theory.interpolate_worlds.main_y' [in strong_ref_complete]
ELTS_Theory.interpolate_worlds.X [in strong_ref_complete]
ELTS_Theory.interpolate_worlds.Y [in strong_ref_complete]
ELTS_Theory.interpolate_worlds.main_x [in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.HR [in strong_ref_complete]
ELTS_Theory.prime_set [in strong_ref_complete]
ELTS_Theory.interpolate_worlds.ob [in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.X [in strong_ref_complete]
ELTS_Theory.ExpandRef.expandref.R [in strong_ref_complete]
ELTS_Theory.interpolate_worlds.main_x' [in strong_ref_complete]


F

forward_sim_to_beh_refine.L2 [in compcert]
forward_sim_to_beh_refine.fsim [in compcert]
forward_sim_to_beh_refine.L1 [in compcert]
forward_sim_to_beh_refine.safe_dec [in compcert]
forward_sim_to_beh_refine.L1recep [in compcert]
forward_sim_to_beh_refine.L2determ [in compcert]


L

LTS_TAU.lts_tau.finite_runs.Hfin [in lts_tau]
LTS_REF.lts_ref.finite_runs.Hfin [in lts_ref]
LTS_REF.lts_ref.finite_runs.X [in lts_ref]
LTS_TAU.lts_tau.finite_runs.X [in lts_tau]
lts.adequacy.HfinX [in strong_bisim]
lts.adequacy.HfinY [in strong_bisim]
lts.adequacy.R [in strong_bisim]
lts.adequacy.X [in strong_bisim]
lts.adequacy.Y [in strong_bisim]
lts.bisim.X [in strong_bisim]
lts.bisim.Y [in strong_bisim]
lts.mucalc.characteristic.E1 [in strong_bisim]
lts.mucalc.characteristic.X [in strong_bisim]


M

MuCalc.mucalc.characteristic_consequences.CF [in logic]
MuCalc.mucalc.characteristic_consequences.HCF [in logic]
MuCalc.mucalc.E0 [in logic]
MuCalc.mucalc.fixpoints.F [in logic]
MuCalc.mucalc.fixpoints.t [in logic]


O

omniscience.B [in bar_induction]
omniscience.Bw [in bar_induction]
omniscience.R [in bar_induction]
omniscience.Rdec [in bar_induction]
omniscience.R' [in bar_induction]
omniscience.U [in bar_induction]


P

paths.R [in prelim]
paths.X [in prelim]
PropLogic.proplogic.order_list.R [in prop_logic]
PropLogic.proplogic.order_list.A [in prop_logic]
PropLogic.proplogic.prime_sets.AX [in prop_logic]


R

READY_PRUNE.ready_prune.mucalc.characteristic.X [in strong_choice]
READY_PRUNE.ready_prune.ref_prune.R [in strong_choice]
READY_PRUNE.ready_prune.ref_prune.Y [in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.HfinX [in strong_choice]
READY_PRUNE.ready_prune.adequacy.HfinX [in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune.X [in strong_choice]
READY_PRUNE.ready_prune.adequacy.X [in strong_choice]
READY_PRUNE.ready_prune.adequacy.X [in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.Y [in strong_choice]
READY_PRUNE.ready_prune.ref_prune.Hp [in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc.characteristic.X [in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.R [in strong_choice]
READY_PRUNE.ready_prune.ref_prune.Hp [in strong_choice]
READY_PRUNE.ready_prune.adequacy.HfinY [in strong_beh_choice]
READY_PRUNE.ready_prune.ref_prune.R [in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc.characteristic.E1 [in strong_choice]
READY_PRUNE.ready_prune.ref_prune.Y [in strong_choice]
READY_PRUNE.ready_prune.adequacy.Y [in strong_beh_choice]
READY_PRUNE.ready_prune.mucalc.characteristic.E1 [in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.R [in strong_beh_choice]
READY_PRUNE.ready_prune.adequacy.HfinY [in strong_choice]
READY_PRUNE.ready_prune.ref_prune.X [in strong_beh_choice]


S

SequentCompleteness.prime_set [in strong_ref_complete2]
SequentLogic.seqtlogic.order_list.A [in seqt_logic]
SequentLogic.seqtlogic.order_list.R [in seqt_logic]
SequentLogic.seqtlogic.prime_sets.AX [in seqt_logic]
STRONG_REF.ExpandRef.expandref.Y [in strong_ref]
STRONG_REF.ExpandRef.expandref.HR [in strong_ref]
STRONG_REF.ExpandRef.expandref.X [in strong_ref]
STRONG_REF.strong_ref.mucalc.characteristic.X [in strong_ref]
STRONG_REF.strong_ref.mucalc.characteristic.E1 [in strong_ref]
STRONG_REF.ExpandRef.expandref.R [in strong_ref]



Library Index

B

back_forth_bisim
back_forth_ref
bar_induction
base
bf_div_logic
bf_logic
bf_ref_div_logic
bf_ref_logic
bourbaki
branch_ref
branch_bisim


C

choice_ref
choice_beh_ref
compcert


F

finiteness


I

iface


L

logic
lts_tau
lts_ref


P

prelim
prop_logic


R

ref_alternatives


S

seqt_logic
strong_choice
strong_ref
strong_ref_complete2
strong_bisim
strong_ref_complete
strong_beh_choice



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 _ other (2696 entries)
Instance 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 _ other (14 entries)
Projection 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 _ other (146 entries)
Record 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 _ other (48 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 _ other (96 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 _ other (1006 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 _ other (304 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 _ other (117 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 _ other (584 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 _ other (33 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 _ other (52 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 _ other (267 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 _ other (29 entries)

This page has been generated by coqdoc