Interaction Trees

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

(13103 entries)

Notation Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(51 entries)

Binder 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

(10298 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

(14 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

(32 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

(95 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

(820 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

(280 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

(22 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

(154 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

(133 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

(549 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

(122 entries)

Abbreviation 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

(46 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

(399 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

(88 entries)

---

Global Index

A

ab_:404 [binder, in ITree.Basics.CategoryFacts]
ab_c:34 [binder, in ITree.Basics.CategoryRelations]
ab_c:27 [binder, in ITree.Basics.CategoryRelations]
ab:100 [binder, in ITree.Core.KTreeFacts]
ab:207 [binder, in ITree.Basics.CategoryFacts]
ab:213 [binder, in ITree.Basics.CategoryFacts]
ab:22 [binder, in ITree.Interp.Handler]
ab:247 [binder, in ITree.Basics.CategoryFacts]
ab:29 [binder, in ITree.Basics.CategoryKleisli]
ab:30 [binder, in ITree.Indexed.Function]
ab:30 [binder, in ITree.Extra.Dijkstra.StateSpecT]
ab:33 [binder, in ITree.Basics.CategoryKleisliFacts]
ab:334 [binder, in ITree.Basics.CategoryFacts]
ab:340 [binder, in ITree.Basics.CategoryFacts]
ab:395 [binder, in ITree.Basics.CategoryFacts]
ab:408 [binder, in ITree.Basics.CategoryFacts]
ab:438 [binder, in ITree.Basics.CategoryFacts]
ab:53 [binder, in ITree.Interp.HandlerFacts]
ab:56 [binder, in ITree.Interp.HandlerFacts]
ab:56 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
ab:58 [binder, in ITree.Basics.CategoryKleisliFacts]
ab:59 [binder, in ITree.Interp.HandlerFacts]
ab:62 [binder, in ITree.Interp.HandlerFacts]
ab:77 [binder, in ITree.Basics.CategoryKleisliFacts]
ab:8 [binder, in ITree.Core.KTreeFacts]
ab:83 [binder, in ITree.Core.KTreeFacts]
ab:84 [binder, in ITree.Basics.CategoryKleisliFacts]
ab:87 [binder, in ITree.Extra.Dijkstra.StateSpecT]
ac:106 [binder, in ITree.Basics.CategoryFacts]
ac:113 [binder, in ITree.Basics.CategoryFacts]
ac:120 [binder, in ITree.Basics.CategoryFacts]
ac:69 [binder, in ITree.Basics.CategoryKleisliFacts]
ac:80 [binder, in ITree.Basics.CategoryFacts]
ac:86 [binder, in ITree.Basics.CategoryFacts]
add [definition, in ITree.Extra.Dijkstra.StateIOTrace]
agrees_itree [definition, in ITree.Extra.IForest]
agree_itree_Returns [lemma, in ITree.Extra.IForest]
all_finite_bind_inv_left [lemma, in ITree.Props.Finite]
all_finite_bind_inv [lemma, in ITree.Props.Finite]
all_finite_bind_weak [lemma, in ITree.Props.Finite]
all_finite_bind [lemma, in ITree.Props.Finite]
all_finite_eutt [instance, in ITree.Props.Finite]
all_finite_eutt_r [lemma, in ITree.Props.Finite]
all_finite_eutt_l [lemma, in ITree.Props.Finite]
all_finite_Vis_inv [lemma, in ITree.Props.Finite]
all_finite_Tau_inv [lemma, in ITree.Props.Finite]
all_finite_Vis [lemma, in ITree.Props.Finite]
all_finite_Tau [lemma, in ITree.Props.Finite]
all_finite_Ret [lemma, in ITree.Props.Finite]
all_finiteVis [constructor, in ITree.Props.Finite]
all_finiteTau [constructor, in ITree.Props.Finite]
all_finiteRet [constructor, in ITree.Props.Finite]
all_finite [inductive, in ITree.Props.Finite]
all_infinite_not_converge [lemma, in ITree.Props.Infinite]
all_infinite [definition, in ITree.Props.Infinite]
all_infiniteF_mono' [lemma, in ITree.Props.Infinite]
all_infiniteF_mono [lemma, in ITree.Props.Infinite]
all_infinite_ [definition, in ITree.Props.Infinite]
all_infiniteF [inductive, in ITree.Props.Infinite]
all_infinite_bind [lemma, in ITree.Props.EuttNoRet]
all_infinite_euttNoRet [lemma, in ITree.Props.EuttNoRet]
all_infinite_bind_append [lemma, in ITree.Extra.ITrace.ITraceFacts]
amonot [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
AM:52 [binder, in ITree.Basics.Basics]
AM:63 [binder, in ITree.Basics.Basics]
AM:73 [binder, in ITree.Basics.Basics]
AM:80 [binder, in ITree.Basics.Basics]
AM:89 [binder, in ITree.Basics.Basics]
ans:114 [binder, in ITree.Extra.ITrace.ITracePrefix]
ans:120 [binder, in ITree.Extra.ITrace.ITraceBind]
ans:137 [binder, in ITree.Extra.ITrace.ITracePrefix]
ans:217 [binder, in ITree.Extra.ITrace.ITraceBind]
ans:22 [binder, in ITree.Extra.ITrace.ITracePrefix]
ans:246 [binder, in ITree.Extra.ITrace.ITraceBind]
ans:274 [binder, in ITree.Extra.ITrace.ITraceBind]
ans:42 [binder, in ITree.Extra.ITrace.ITracePrefix]
ans:6 [binder, in ITree.Extra.ITrace.ITraceDefinition]
any_finite_bind_inv_left [lemma, in ITree.Props.Finite]
any_finite_bind_inv_weak [lemma, in ITree.Props.Finite]
any_finite_bind_inv [lemma, in ITree.Props.Finite]
any_finite_bind [lemma, in ITree.Props.Finite]
any_finite_eutt [instance, in ITree.Props.Finite]
any_finite_eutt_r [lemma, in ITree.Props.Finite]
any_finite_eutt_l [lemma, in ITree.Props.Finite]
any_finite_Vis_inv [lemma, in ITree.Props.Finite]
any_finite_Tau_inv [lemma, in ITree.Props.Finite]
any_finite_Vis [lemma, in ITree.Props.Finite]
any_finite_Tau [lemma, in ITree.Props.Finite]
any_finite_Ret [lemma, in ITree.Props.Finite]
any_finiteVis [constructor, in ITree.Props.Finite]
any_finiteTau [constructor, in ITree.Props.Finite]
any_finiteRet [constructor, in ITree.Props.Finite]
any_finite [inductive, in ITree.Props.Finite]
any_infinite_proper_eutt [instance, in ITree.Props.Infinite]
any_infinite [definition, in ITree.Props.Infinite]
any_infiniteF__mono [lemma, in ITree.Props.Infinite]
any_infiniteF_mono [lemma, in ITree.Props.Infinite]
any_infinite_ [definition, in ITree.Props.Infinite]
any_infiniteF [inductive, in ITree.Props.Infinite]
app [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
append [definition, in ITree.Extra.ITrace.ITraceDefinition]
append_div [lemma, in ITree.Extra.ITrace.ITraceFacts]
append_assoc [lemma, in ITree.Extra.ITrace.ITraceFacts]
append_nil [lemma, in ITree.Extra.ITrace.ITraceFacts]
append_vis [lemma, in ITree.Extra.ITrace.ITraceFacts]
Applicative_itree [instance, in ITree.Core.ITreeDefinition]
Apply [record, in ITree.Basics.CategoryOps]
Apply [inductive, in ITree.Basics.CategoryOps]
apply_monot [lemma, in ITree.Extra.Dijkstra.TracesIT]
Apply_Fun [instance, in ITree.Basics.Function]
apply_Fun [definition, in ITree.Basics.Function]
apply_ [projection, in ITree.Basics.CategoryOps]
apply_ [constructor, in ITree.Basics.CategoryOps]
apply_IFun' [definition, in ITree.Indexed.Function]
apply_IFun [definition, in ITree.Indexed.Function]
Apply_C:213 [binder, in ITree.Basics.CategoryTheory]
app_inf [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
app_trace [definition, in ITree.Interp.Traces]
app' [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
ask [definition, in ITree.Events.Reader]
Ask [constructor, in ITree.Events.Reader]
AssocIso [abbreviation, in ITree.Basics.CategoryTheory]
AssocIso_C:245 [binder, in ITree.Basics.CategoryTheory]
AssocIso_C:241 [binder, in ITree.Basics.CategoryTheory]
AssocL [record, in ITree.Basics.CategoryOps]
AssocL [inductive, in ITree.Basics.CategoryOps]
AssocLAssocL [record, in ITree.Basics.CategoryTheory]
AssocLAssocL [inductive, in ITree.Basics.CategoryTheory]
AssocLAssocL_Product [instance, in ITree.Basics.CategoryFacts]
AssocLAssocL_Coproduct [instance, in ITree.Basics.CategoryFacts]
AssocLMono_Product [instance, in ITree.Basics.CategoryFacts]
AssocLMono_Coproduct [instance, in ITree.Basics.CategoryFacts]
AssocLUnit [record, in ITree.Basics.CategoryTheory]
AssocLUnit [inductive, in ITree.Basics.CategoryTheory]
AssocL_Product [instance, in ITree.Basics.CategoryOps]
AssocL_Coproduct [instance, in ITree.Basics.CategoryOps]
AssocL_prod [instance, in ITree.Basics.CategoryRelations]
AssocL_sum [instance, in ITree.Basics.CategoryRelations]
AssocL_bif:325 [binder, in ITree.Basics.CategoryTheory]
AssocL_bif:237 [binder, in ITree.Basics.CategoryTheory]
AssocR [record, in ITree.Basics.CategoryOps]
AssocR [inductive, in ITree.Basics.CategoryOps]
AssocRAssocR [record, in ITree.Basics.CategoryTheory]
AssocRAssocR [inductive, in ITree.Basics.CategoryTheory]
AssocRAssocR_Product [instance, in ITree.Basics.CategoryFacts]
AssocRAssocR_Coproduct [instance, in ITree.Basics.CategoryFacts]
AssocRAssocR_sum_rel [instance, in ITree.Basics.CategoryRelations]
AssocRAssocR_prod_rel [instance, in ITree.Basics.CategoryRelations]
AssocRMono_Product [instance, in ITree.Basics.CategoryFacts]
AssocRMono_Coproduct [instance, in ITree.Basics.CategoryFacts]
AssocRUnit [record, in ITree.Basics.CategoryTheory]
AssocRUnit [inductive, in ITree.Basics.CategoryTheory]
AssocRUnit_Product [instance, in ITree.Basics.CategoryFacts]
AssocRUnit_Coproduct [instance, in ITree.Basics.CategoryFacts]
AssocRUnit_sum_rel [instance, in ITree.Basics.CategoryRelations]
AssocRUnit_prod_rel [instance, in ITree.Basics.CategoryRelations]
AssocR_Product [instance, in ITree.Basics.CategoryOps]
AssocR_Coproduct [instance, in ITree.Basics.CategoryOps]
AssocR_prod [instance, in ITree.Basics.CategoryRelations]
AssocR_sum [instance, in ITree.Basics.CategoryRelations]
AssocR_bif:324 [binder, in ITree.Basics.CategoryTheory]
AssocR_bif:236 [binder, in ITree.Basics.CategoryTheory]
assoc_l_ [abbreviation, in ITree.Basics.CategoryOps]
assoc_r_ [abbreviation, in ITree.Basics.CategoryOps]
assoc_l [projection, in ITree.Basics.CategoryOps]
assoc_l [constructor, in ITree.Basics.CategoryOps]
assoc_r [projection, in ITree.Basics.CategoryOps]
assoc_r [constructor, in ITree.Basics.CategoryOps]
assoc_r_snd [lemma, in ITree.Basics.CategoryFacts]
assoc_l_fst [lemma, in ITree.Basics.CategoryFacts]
assoc_l_snd [lemma, in ITree.Basics.CategoryFacts]
assoc_r_fst [lemma, in ITree.Basics.CategoryFacts]
assoc_l_assoc_l [projection, in ITree.Basics.CategoryTheory]
assoc_l_assoc_l [constructor, in ITree.Basics.CategoryTheory]
assoc_l_unit [projection, in ITree.Basics.CategoryTheory]
assoc_l_unit [constructor, in ITree.Basics.CategoryTheory]
assoc_r_assoc_r [projection, in ITree.Basics.CategoryTheory]
assoc_r_assoc_r [constructor, in ITree.Basics.CategoryTheory]
assoc_r_unit [projection, in ITree.Basics.CategoryTheory]
assoc_r_unit [constructor, in ITree.Basics.CategoryTheory]
assoc_l_mono [lemma, in ITree.Basics.CategoryTheory]
assoc_r_mono [lemma, in ITree.Basics.CategoryTheory]
as_IFun [definition, in ITree.Indexed.Function]
Axioms [library]
a_bc:35 [binder, in ITree.Basics.CategoryRelations]
a_bc:28 [binder, in ITree.Basics.CategoryRelations]
a':109 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A':111 [binder, in ITree.Events.StateFacts]
a':123 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a':125 [binder, in ITree.Events.StateFacts]
a':162 [binder, in ITree.Basics.CategoryFacts]
a':18 [binder, in ITree.Extra.Dijkstra.IterRel]
a':19 [binder, in ITree.Extra.Dijkstra.IterRel]
a':21 [binder, in ITree.Extra.Dijkstra.IterRel]
a':22 [binder, in ITree.Extra.Dijkstra.IterRel]
a':23 [binder, in ITree.Extra.Dijkstra.IterRel]
a':24 [binder, in ITree.Extra.Dijkstra.IterRel]
a':362 [binder, in ITree.Basics.CategoryFacts]
a':39 [binder, in ITree.Basics.CategoryRelations]
a':43 [binder, in ITree.Basics.CategoryRelations]
a':69 [binder, in ITree.Basics.CategoryRelations]
a':7 [binder, in ITree.Extra.Dijkstra.IterRel]
a':80 [binder, in ITree.Basics.CategoryRelations]
a':84 [binder, in ITree.Basics.CategoryRelations]
a':87 [binder, in ITree.Basics.CategoryRelations]
a':89 [binder, in ITree.Basics.CategoryRelations]
A':90 [binder, in ITree.Events.StateFacts]
a':90 [binder, in ITree.Props.Infinite]
a':92 [binder, in ITree.Basics.CategoryRelations]
a':97 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a0:11 [binder, in ITree.Eq.Paco2]
a0:113 [binder, in ITree.Core.KTreeFacts]
a0:123 [binder, in ITree.Interp.InterpFacts]
a0:124 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a0:142 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a0:16 [binder, in ITree.Eq.Paco2]
A0:180 [binder, in ITree.Extra.ITrace.ITraceBind]
a0:19 [binder, in ITree.Eq.Paco2]
A0:244 [binder, in ITree.Extra.ITrace.ITraceBind]
A0:260 [binder, in ITree.Extra.ITrace.ITraceBind]
A0:272 [binder, in ITree.Extra.ITrace.ITraceBind]
A0:282 [binder, in ITree.Extra.ITrace.ITraceBind]
a0:40 [binder, in ITree.Eq.Paco2]
a0:43 [binder, in ITree.Extra.Dijkstra.IterRel]
a0:43 [binder, in ITree.Eq.Paco2]
a0:67 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a0:82 [binder, in ITree.Core.KTreeFacts]
a0:93 [binder, in ITree.Core.KTreeFacts]
A1:1 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
a1:10 [binder, in ITree.Indexed.Relation]
a1:104 [binder, in ITree.Basics.CategoryTheory]
A1:106 [binder, in ITree.Extra.Secure.SecureEqBind]
a1:12 [binder, in ITree.Eq.Paco2]
A1:131 [binder, in ITree.Extra.Secure.SecureEqBind]
a1:146 [binder, in ITree.Extra.Secure.SecureEqBind]
A1:153 [binder, in ITree.Extra.Secure.SecureEqBind]
a1:166 [binder, in ITree.Extra.Secure.SecureEqBind]
a1:168 [binder, in ITree.Extra.Secure.SecureEqBind]
a1:17 [binder, in ITree.Eq.Paco2]
a1:20 [binder, in ITree.Eq.Paco2]
a1:225 [binder, in ITree.Basics.HeterogeneousRelations]
A1:280 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a1:293 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a1:3 [binder, in ITree.Eq.Shallow]
A1:302 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a1:31 [binder, in ITree.Extra.Dijkstra.IterRel]
A1:31 [binder, in ITree.Basics.HeterogeneousRelations]
a1:315 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a1:317 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a1:37 [binder, in ITree.Extra.Dijkstra.IterRel]
a1:39 [binder, in ITree.Extra.Dijkstra.IterRel]
a1:39 [binder, in ITree.Basics.HeterogeneousRelations]
a1:41 [binder, in ITree.Eq.Paco2]
A1:43 [binder, in ITree.Basics.HeterogeneousRelations]
a1:44 [binder, in ITree.Extra.Dijkstra.IterRel]
a1:44 [binder, in ITree.Eq.Paco2]
a1:45 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a1:468 [binder, in ITree.Extra.IForest]
a1:484 [binder, in ITree.Extra.IForest]
a1:489 [binder, in ITree.Extra.IForest]
a1:70 [binder, in ITree.Extra.Dijkstra.IterRel]
a1:70 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a1:72 [binder, in ITree.Extra.Dijkstra.IterRel]
a1:8 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
A1:81 [binder, in ITree.Extra.Secure.SecureEqBind]
a1:97 [binder, in ITree.Basics.CategoryKleisliFacts]
a2:10 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
a2:105 [binder, in ITree.Basics.CategoryKleisliFacts]
a2:105 [binder, in ITree.Basics.CategoryTheory]
A2:107 [binder, in ITree.Extra.Secure.SecureEqBind]
a2:11 [binder, in ITree.Indexed.Relation]
A2:132 [binder, in ITree.Extra.Secure.SecureEqBind]
a2:147 [binder, in ITree.Extra.Secure.SecureEqBind]
A2:154 [binder, in ITree.Extra.Secure.SecureEqBind]
a2:167 [binder, in ITree.Extra.Secure.SecureEqBind]
a2:169 [binder, in ITree.Extra.Secure.SecureEqBind]
A2:2 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
a2:226 [binder, in ITree.Basics.HeterogeneousRelations]
A2:281 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a2:294 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A2:303 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a2:316 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a2:318 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a2:32 [binder, in ITree.Extra.Dijkstra.IterRel]
A2:32 [binder, in ITree.Basics.HeterogeneousRelations]
a2:38 [binder, in ITree.Extra.Dijkstra.IterRel]
a2:4 [binder, in ITree.Eq.Shallow]
a2:40 [binder, in ITree.Extra.Dijkstra.IterRel]
a2:40 [binder, in ITree.Basics.HeterogeneousRelations]
A2:44 [binder, in ITree.Basics.HeterogeneousRelations]
a2:46 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a2:71 [binder, in ITree.Extra.Dijkstra.IterRel]
a2:73 [binder, in ITree.Extra.Dijkstra.IterRel]
A2:82 [binder, in ITree.Extra.Secure.SecureEqBind]
A:1 [binder, in ITree.Basics.Function]
A:1 [binder, in ITree.Axioms]
A:1 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:1 [binder, in ITree.Interp.Handler]
A:1 [binder, in ITree.Extra.Dijkstra.IterRel]
A:1 [binder, in ITree.Interp.HandlerFacts]
A:1 [binder, in ITree.Indexed.Relation]
A:1 [binder, in ITree.Basics.FunctionFacts]
A:1 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:1 [binder, in ITree.Eq.Shallow]
A:1 [binder, in ITree.Basics.HeterogeneousRelations]
a:1 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:1 [binder, in ITree.Extra.Secure.Labels]
A:1 [binder, in ITree.Eq.Eqit]
a:10 [binder, in ITree.Basics.Function]
a:10 [binder, in ITree.Basics.CategoryOps]
a:10 [binder, in ITree.Props.Infinite]
a:10 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:10 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:10 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:10 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:10 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:10 [binder, in ITree.Basics.CategorySub]
A:10 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
A:100 [binder, in ITree.Props.Finite]
A:100 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:100 [binder, in ITree.Basics.CategoryRelations]
a:100 [binder, in ITree.Basics.CategoryTheory]
A:101 [binder, in ITree.Basics.HeterogeneousRelations]
A:101 [binder, in ITree.Extra.ITrace.ITracePreds]
A:102 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:102 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:102 [binder, in ITree.Basics.CategoryFacts]
A:103 [binder, in ITree.Props.Finite]
A:103 [binder, in ITree.Basics.Basics]
a:103 [binder, in ITree.Basics.CategoryRelations]
A:103 [binder, in ITree.Basics.HeterogeneousRelations]
A:103 [binder, in ITree.Extra.ITrace.ITracePreds]
A:103 [binder, in ITree.Simple]
a:104 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:104 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:104 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:105 [binder, in ITree.Extra.IForest]
a:105 [binder, in ITree.Events.StateFacts]
a:105 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:105 [binder, in ITree.Basics.HeterogeneousRelations]
a:106 [binder, in ITree.Basics.CategoryOps]
a:106 [binder, in ITree.Basics.Basics]
A:106 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:106 [binder, in ITree.Basics.CategoryRelations]
a:106 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:106 [binder, in ITree.Extra.ITrace.ITracePreds]
a:106 [binder, in ITree.Simple]
A:107 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:107 [binder, in ITree.Basics.Basics]
A:108 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:108 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:108 [binder, in ITree.Basics.HeterogeneousRelations]
a:109 [binder, in ITree.Basics.CategoryFacts]
a:109 [binder, in ITree.Basics.CategoryRelations]
A:109 [binder, in ITree.Simple]
A:11 [binder, in ITree.Basics.Function]
A:11 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:11 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
A:11 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:11 [binder, in ITree.Extra.Secure.SecureEqBind]
A:11 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:11 [binder, in ITree.Core.Subevent]
A:11 [binder, in ITree.Basics.HeterogeneousRelations]
A:11 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:11 [binder, in ITree.Extra.ITrace.ITracePreds]
A:110 [binder, in ITree.Events.StateFacts]
A:110 [binder, in ITree.Core.KTreeFacts]
A:110 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:110 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:110 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:110 [binder, in ITree.Basics.CategoryRelations]
A:111 [binder, in ITree.Interp.InterpFacts]
a:111 [binder, in ITree.Basics.CategoryRelations]
a:112 [binder, in ITree.Basics.CategoryOps]
A:112 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:112 [binder, in ITree.Extra.ITrace.ITracePrefix]
A:112 [binder, in ITree.Extra.ITrace.ITracePreds]
a:113 [binder, in ITree.Extra.IForest]
a:113 [binder, in ITree.Basics.CategoryKleisliFacts]
A:113 [binder, in ITree.Basics.Basics]
A:113 [binder, in ITree.Extra.Secure.SecureEqBind]
a:114 [binder, in ITree.Basics.CategoryOps]
a:114 [binder, in ITree.Core.KTreeFacts]
A:114 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:114 [binder, in ITree.Eq.Rutt]
a:114 [binder, in ITree.Basics.CategoryRelations]
A:114 [binder, in ITree.Basics.HeterogeneousRelations]
a:114 [binder, in ITree.Extra.ITrace.ITracePreds]
A:115 [binder, in ITree.Props.Finite]
a:115 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:115 [binder, in ITree.Basics.CategoryRelations]
a:116 [binder, in ITree.Basics.CategoryFacts]
a:117 [binder, in ITree.Basics.CategoryOps]
a:117 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:117 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:117 [binder, in ITree.Eq.Rutt]
A:117 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:117 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:118 [binder, in ITree.Extra.ITrace.ITraceBind]
a:118 [binder, in ITree.Basics.Basics]
a:118 [binder, in ITree.Basics.CategoryTheory]
A:119 [binder, in ITree.Extra.Secure.SecureEqBind]
A:119 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:12 [binder, in ITree.Basics.Function]
a:12 [binder, in ITree.Eq.EuttExtras]
a:12 [binder, in ITree.Basics.CategoryKleisliFacts]
a:12 [binder, in ITree.Basics.Basics]
a:12 [binder, in ITree.Extra.Dijkstra.IterRel]
A:12 [binder, in ITree.Props.EuttNoRet]
A:12 [binder, in ITree.Indexed.Relation]
a:12 [binder, in ITree.Basics.FunctionFacts]
a:12 [binder, in ITree.Basics.CategoryFacts]
a:12 [binder, in ITree.Basics.CategoryTheory]
a:120 [binder, in ITree.Core.KTreeFacts]
A:120 [binder, in ITree.Basics.Basics]
A:120 [binder, in ITree.Interp.InterpFacts]
A:121 [binder, in ITree.Props.Finite]
A:121 [binder, in ITree.Basics.Basics]
A:121 [binder, in ITree.Basics.HeterogeneousRelations]
A:122 [binder, in ITree.Basics.Basics]
a:123 [binder, in ITree.Basics.CategoryOps]
A:123 [binder, in ITree.Basics.Basics]
a:123 [binder, in ITree.Basics.CategoryFacts]
a:123 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:124 [binder, in ITree.Basics.CategoryOps]
a:124 [binder, in ITree.Events.StateFacts]
A:124 [binder, in ITree.Basics.Basics]
a:124 [binder, in ITree.Interp.InterpFacts]
A:124 [binder, in ITree.Basics.HeterogeneousRelations]
a:125 [binder, in ITree.Basics.CategoryOps]
A:125 [binder, in ITree.Eq.Rutt]
a:125 [binder, in ITree.Basics.CategoryFacts]
a:126 [binder, in ITree.Basics.CategoryOps]
A:126 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:126 [binder, in ITree.Basics.HeterogeneousRelations]
a:128 [binder, in ITree.Events.StateFacts]
A:128 [binder, in ITree.Eq.Rutt]
A:128 [binder, in ITree.Interp.InterpFacts]
A:128 [binder, in ITree.Basics.HeterogeneousRelations]
a:129 [binder, in ITree.Basics.CategoryFacts]
A:13 [binder, in ITree.Basics.Function]
A:13 [binder, in ITree.Extra.IForest]
a:13 [binder, in ITree.Basics.CategoryOps]
A:13 [binder, in ITree.Interp.HandlerFacts]
a:13 [binder, in ITree.Core.Subevent]
A:13 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:130 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:130 [binder, in ITree.Basics.HeterogeneousRelations]
A:132 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:132 [binder, in ITree.Interp.InterpFacts]
A:132 [binder, in ITree.Basics.HeterogeneousRelations]
A:133 [binder, in ITree.Events.StateFacts]
a:133 [binder, in ITree.Basics.CategoryTheory]
a:134 [binder, in ITree.Basics.CategoryOps]
a:134 [binder, in ITree.Basics.CategoryFacts]
A:134 [binder, in ITree.Basics.HeterogeneousRelations]
A:135 [binder, in ITree.Extra.ITrace.ITracePrefix]
A:135 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:137 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:137 [binder, in ITree.Basics.HeterogeneousRelations]
A:138 [binder, in ITree.Extra.Secure.SecureEqBind]
a:139 [binder, in ITree.Basics.CategoryFacts]
a:14 [binder, in ITree.Basics.CategoryKleisli]
A:14 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:14 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:14 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
a:14 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:14 [binder, in ITree.Core.Subevent]
A:14 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:14 [binder, in ITree.Extra.ITrace.ITracePreds]
A:140 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:140 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:140 [binder, in ITree.Basics.CategoryOps]
A:140 [binder, in ITree.Basics.HeterogeneousRelations]
a:140 [binder, in ITree.Basics.CategoryTheory]
A:141 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:141 [binder, in ITree.Basics.CategoryFacts]
a:141 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:142 [binder, in ITree.Basics.CategoryOps]
A:142 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:142 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:143 [binder, in ITree.Events.StateFacts]
a:143 [binder, in ITree.Basics.CategoryFacts]
a:145 [binder, in ITree.Basics.CategoryOps]
a:145 [binder, in ITree.Events.StateFacts]
a:145 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:147 [binder, in ITree.Basics.HeterogeneousRelations]
a:147 [binder, in ITree.Basics.CategoryTheory]
A:148 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a:148 [binder, in ITree.Events.StateFacts]
A:148 [binder, in ITree.Eq.Rutt]
a:149 [binder, in ITree.Basics.CategoryFacts]
A:15 [binder, in ITree.Eq.EuttExtras]
A:15 [binder, in ITree.Basics.Monad]
a:15 [binder, in ITree.Basics.CategoryKleisliFacts]
A:15 [binder, in ITree.Props.Finite]
A:15 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:15 [binder, in ITree.Basics.Basics]
A:15 [binder, in ITree.Extra.ITrace.ITracePrefix]
a:15 [binder, in ITree.Extra.Dijkstra.IterRel]
a:15 [binder, in ITree.Basics.MonadState]
A:15 [binder, in ITree.Basics.FunctionFacts]
a:15 [binder, in ITree.Basics.CategoryRelations]
A:150 [binder, in ITree.Basics.HeterogeneousRelations]
a:151 [binder, in ITree.Basics.CategoryOps]
A:151 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:151 [binder, in ITree.Eq.Rutt]
A:151 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:152 [binder, in ITree.Basics.CategoryOps]
A:152 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:153 [binder, in ITree.Eq.UpToTaus]
a:153 [binder, in ITree.Basics.CategoryOps]
A:153 [binder, in ITree.Basics.HeterogeneousRelations]
a:154 [binder, in ITree.Basics.CategoryOps]
a:155 [binder, in ITree.Basics.CategoryFacts]
a:156 [binder, in ITree.Eq.UpToTaus]
a:156 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:156 [binder, in ITree.Basics.HeterogeneousRelations]
a:156 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:157 [binder, in ITree.Extra.ITrace.ITraceBind]
A:157 [binder, in ITree.Eq.Eqit]
A:158 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:158 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:158 [binder, in ITree.Basics.CategoryTheory]
a:159 [binder, in ITree.Extra.ITrace.ITraceBind]
A:159 [binder, in ITree.Basics.HeterogeneousRelations]
A:16 [binder, in ITree.Extra.Dijkstra.TracesIT]
a:16 [binder, in ITree.Basics.CategoryFunctor]
a:16 [binder, in ITree.Props.Leaf]
A:16 [binder, in ITree.Extra.Secure.SecureEqBind]
a:16 [binder, in ITree.Basics.CategoryFacts]
a:16 [binder, in ITree.Core.Subevent]
A:16 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:160 [binder, in ITree.Basics.CategoryOps]
A:160 [binder, in ITree.Basics.HeterogeneousRelations]
A:161 [binder, in ITree.Events.StateFacts]
A:161 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:161 [binder, in ITree.Basics.CategoryFacts]
A:163 [binder, in ITree.Basics.HeterogeneousRelations]
a:164 [binder, in ITree.Basics.CategoryOps]
a:165 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:166 [binder, in ITree.Extra.ITrace.ITraceBind]
A:166 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:168 [binder, in ITree.Extra.ITrace.ITraceBind]
A:168 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:168 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:168 [binder, in ITree.Basics.HeterogeneousRelations]
a:17 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:17 [binder, in ITree.Events.FailFacts]
A:17 [binder, in ITree.Props.EuttNoRet]
a:17 [binder, in ITree.Basics.CategoryRelations]
A:17 [binder, in ITree.Basics.HeterogeneousRelations]
a:17 [binder, in ITree.Basics.CategoryTheory]
a:170 [binder, in ITree.Basics.CategoryFacts]
A:170 [binder, in ITree.Basics.HeterogeneousRelations]
a:170 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:171 [binder, in ITree.Basics.CategoryOps]
A:172 [binder, in ITree.Events.StateFacts]
a:172 [binder, in ITree.Basics.CategoryTheory]
A:173 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:173 [binder, in ITree.Basics.CategoryFacts]
A:173 [binder, in ITree.Basics.HeterogeneousRelations]
A:174 [binder, in ITree.Extra.ITrace.ITraceBind]
a:174 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:175 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:176 [binder, in ITree.Basics.CategoryFacts]
A:177 [binder, in ITree.Basics.HeterogeneousRelations]
a:178 [binder, in ITree.Basics.CategoryOps]
a:178 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:179 [binder, in ITree.Basics.CategoryFacts]
A:179 [binder, in ITree.Basics.HeterogeneousRelations]
a:179 [binder, in ITree.Basics.CategoryTheory]
a:18 [binder, in ITree.Basics.Function]
a:18 [binder, in ITree.Extra.IForest]
A:18 [binder, in ITree.Events.ExceptionFacts]
a:18 [binder, in ITree.Basics.CategoryKleisliFacts]
a:18 [binder, in ITree.Props.Finite]
a:18 [binder, in ITree.Basics.CategoryFunctor]
A:18 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:18 [binder, in ITree.Basics.CategoryRelations]
A:18 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:18 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
A:181 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:182 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:182 [binder, in ITree.Basics.CategoryFacts]
A:182 [binder, in ITree.Basics.HeterogeneousRelations]
A:183 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:185 [binder, in ITree.Extra.ITrace.ITraceBind]
a:185 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:186 [binder, in ITree.Extra.ITrace.ITraceBind]
a:186 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:186 [binder, in ITree.Basics.CategoryFacts]
a:186 [binder, in ITree.Basics.CategoryTheory]
a:187 [binder, in ITree.Basics.CategoryOps]
A:187 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:188 [binder, in ITree.Basics.CategoryFacts]
a:19 [binder, in ITree.Basics.CategoryOps]
A:19 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
A:19 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:19 [binder, in ITree.Props.Leaf]
A:19 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
a:19 [binder, in ITree.Basics.MonadState]
a:19 [binder, in ITree.Indexed.Relation]
A:19 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:19 [binder, in ITree.Eq.Rutt]
a:19 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:19 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:19 [binder, in ITree.Basics.CategorySub]
A:191 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:191 [binder, in ITree.Basics.CategoryFacts]
A:192 [binder, in ITree.Extra.ITrace.ITraceBind]
a:194 [binder, in ITree.Extra.ITrace.ITraceBind]
A:196 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:197 [binder, in ITree.Basics.CategoryFacts]
a:197 [binder, in ITree.Basics.CategoryTheory]
a:198 [binder, in ITree.Props.Finite]
a:198 [binder, in ITree.Basics.CategoryFacts]
a:199 [binder, in ITree.Basics.CategoryOps]
a:199 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:199 [binder, in ITree.Basics.CategoryFacts]
A:2 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:2 [binder, in ITree.Core.KTreeFacts]
A:2 [binder, in ITree.Props.Finite]
a:2 [binder, in ITree.Basics.CategoryKleisli]
A:2 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:2 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:2 [binder, in ITree.Props.Leaf]
A:2 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:2 [binder, in ITree.Props.EuttNoRet]
a:2 [binder, in ITree.Core.ITreeMonad]
A:2 [binder, in ITree.Props.Cofinite]
a:2 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:2 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
A:2 [binder, in ITree.Eq.Eqit]
a:2 [binder, in ITree.Eq.Paco2]
A:20 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:20 [binder, in ITree.Extra.IForest]
A:20 [binder, in ITree.Basics.Monad]
A:20 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:20 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:20 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:20 [binder, in ITree.Extra.ITrace.ITracePrefix]
a:20 [binder, in ITree.Extra.Dijkstra.IterRel]
A:20 [binder, in ITree.Indexed.Relation]
A:200 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:200 [binder, in ITree.Basics.CategoryFacts]
a:201 [binder, in ITree.Basics.CategoryFacts]
A:201 [binder, in ITree.Basics.HeterogeneousRelations]
a:202 [binder, in ITree.Basics.CategoryFacts]
A:203 [binder, in ITree.Extra.ITrace.ITraceBind]
A:203 [binder, in ITree.Extra.IForest]
A:203 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:203 [binder, in ITree.Basics.CategoryFacts]
a:204 [binder, in ITree.Extra.IForest]
a:204 [binder, in ITree.Basics.CategoryOps]
a:205 [binder, in ITree.Extra.ITrace.ITraceBind]
a:205 [binder, in ITree.Basics.CategoryOps]
a:209 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:209 [binder, in ITree.Basics.CategoryFacts]
a:21 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:21 [binder, in ITree.Basics.Function]
a:21 [binder, in ITree.Extra.IForest]
a:21 [binder, in ITree.Basics.CategoryKleisliFacts]
A:21 [binder, in ITree.Basics.HeterogeneousRelations]
a:21 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:21 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:21 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:21 [binder, in ITree.Interp.RecursionFacts]
a:210 [binder, in ITree.Basics.CategoryOps]
A:210 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:211 [binder, in ITree.Basics.HeterogeneousRelations]
A:213 [binder, in ITree.Basics.HeterogeneousRelations]
a:214 [binder, in ITree.Basics.CategoryOps]
A:215 [binder, in ITree.Extra.ITrace.ITraceBind]
A:215 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:216 [binder, in ITree.Extra.IForest]
A:216 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:216 [binder, in ITree.Basics.CategoryTheory]
A:218 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:218 [binder, in ITree.Basics.CategoryFacts]
a:22 [binder, in ITree.Basics.Basics]
a:22 [binder, in ITree.Props.EuttNoRet]
a:22 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:220 [binder, in ITree.Basics.CategoryOps]
A:220 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:220 [binder, in ITree.Basics.HeterogeneousRelations]
A:222 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:222 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:223 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:224 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:225 [binder, in ITree.Basics.CategoryTheory]
A:226 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:227 [binder, in ITree.Basics.HeterogeneousRelations]
a:228 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:228 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:229 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:229 [binder, in ITree.Basics.CategoryFacts]
a:23 [binder, in ITree.Basics.CategoryOps]
A:23 [binder, in ITree.Interp.Recursion]
a:23 [binder, in ITree.Basics.MonadState]
a:23 [binder, in ITree.Extra.Secure.SecureEqWcompat]
a:23 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:23 [binder, in ITree.Eq.Paco2]
a:23 [binder, in ITree.Basics.CategorySub]
A:230 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:230 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:232 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:232 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:234 [binder, in ITree.Basics.HeterogeneousRelations]
A:235 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:236 [binder, in ITree.Basics.CategoryFacts]
A:236 [binder, in ITree.Simple]
a:238 [binder, in ITree.Basics.CategoryTheory]
A:24 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:24 [binder, in ITree.Basics.Monad]
a:24 [binder, in ITree.Basics.CategoryKleisliFacts]
a:24 [binder, in ITree.Basics.CategoryFunctor]
a:24 [binder, in ITree.Basics.Basics]
A:24 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:24 [binder, in ITree.Props.EuttNoRet]
a:24 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:24 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
A:24 [binder, in ITree.Basics.CategoryRelations]
A:24 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
A:240 [binder, in ITree.Simple]
a:242 [binder, in ITree.Basics.CategoryTheory]
a:243 [binder, in ITree.Basics.CategoryFacts]
a:243 [binder, in ITree.Simple]
A:244 [binder, in ITree.Basics.HeterogeneousRelations]
A:245 [binder, in ITree.Simple]
A:246 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:246 [binder, in ITree.Basics.CategoryTheory]
A:248 [binder, in ITree.Basics.HeterogeneousRelations]
A:25 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:25 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:25 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:25 [binder, in ITree.Basics.CategoryOps]
a:25 [binder, in ITree.Basics.CategoryKleisli]
A:25 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:25 [binder, in ITree.Props.Infinite]
a:25 [binder, in ITree.Extra.Dijkstra.IterRel]
a:25 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
A:25 [binder, in ITree.Indexed.Function]
A:25 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:25 [binder, in ITree.Extra.Secure.SecureEqWcompat]
a:25 [binder, in ITree.Eq.Rutt]
a:250 [binder, in ITree.Basics.CategoryFacts]
a:251 [binder, in ITree.Extra.ITrace.ITraceBind]
a:252 [binder, in ITree.Basics.CategoryFacts]
A:254 [binder, in ITree.Basics.HeterogeneousRelations]
a:255 [binder, in ITree.Basics.CategoryTheory]
a:256 [binder, in ITree.Basics.CategoryFacts]
A:26 [binder, in ITree.Extra.ITrace.ITraceDefinition]
a:26 [binder, in ITree.Extra.Dijkstra.IterRel]
A:26 [binder, in ITree.Indexed.Relation]
A:26 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:26 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:26 [binder, in ITree.Basics.HeterogeneousRelations]
A:26 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:26 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:260 [binder, in ITree.Basics.CategoryTheory]
a:261 [binder, in ITree.Basics.CategoryFacts]
A:264 [binder, in ITree.Extra.ITrace.ITraceBind]
a:264 [binder, in ITree.Basics.CategoryTheory]
a:266 [binder, in ITree.Basics.CategoryFacts]
A:266 [binder, in ITree.Basics.HeterogeneousRelations]
a:266 [binder, in ITree.Basics.CategoryTheory]
a:268 [binder, in ITree.Basics.CategoryFacts]
a:268 [binder, in ITree.Basics.CategoryTheory]
a:269 [binder, in ITree.Basics.CategoryTheory]
A:27 [binder, in ITree.Interp.Recursion]
A:27 [binder, in ITree.Basics.CategoryKleisliFacts]
A:27 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:27 [binder, in ITree.Basics.Basics]
A:27 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:27 [binder, in ITree.Extra.Dijkstra.IterRel]
A:27 [binder, in ITree.Props.EuttNoRet]
a:27 [binder, in ITree.Basics.MonadState]
A:27 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:27 [binder, in ITree.Extra.Secure.SecureEqWcompat]
a:27 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:27 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:270 [binder, in ITree.Basics.CategoryFacts]
a:271 [binder, in ITree.Basics.CategoryTheory]
a:273 [binder, in ITree.Basics.CategoryTheory]
A:274 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:275 [binder, in ITree.Basics.CategoryTheory]
a:276 [binder, in ITree.Basics.CategoryFacts]
A:276 [binder, in ITree.Basics.HeterogeneousRelations]
A:278 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:278 [binder, in ITree.Basics.HeterogeneousRelations]
a:279 [binder, in ITree.Basics.CategoryTheory]
A:28 [binder, in ITree.Basics.Function]
a:28 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:28 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:28 [binder, in ITree.Basics.CategorySub]
a:280 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:282 [binder, in ITree.Extra.IForest]
a:282 [binder, in ITree.Basics.CategoryFacts]
a:283 [binder, in ITree.Extra.IForest]
A:287 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:287 [binder, in ITree.Extra.IForest]
a:288 [binder, in ITree.Extra.IForest]
a:288 [binder, in ITree.Basics.CategoryFacts]
A:288 [binder, in ITree.Basics.HeterogeneousRelations]
A:29 [binder, in ITree.Basics.CategoryKleisliFacts]
a:29 [binder, in ITree.Props.Finite]
A:29 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:29 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:29 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:29 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
a:29 [binder, in ITree.Basics.CategoryFacts]
a:29 [binder, in ITree.Basics.CategoryTheory]
a:29 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
A:291 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:292 [binder, in ITree.Basics.HeterogeneousRelations]
a:293 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:294 [binder, in ITree.Basics.CategoryTheory]
a:297 [binder, in ITree.Basics.CategoryFacts]
A:298 [binder, in ITree.Basics.HeterogeneousRelations]
a:298 [binder, in ITree.Basics.CategoryTheory]
a:3 [binder, in ITree.Basics.Tacs]
A:3 [binder, in ITree.Basics.Function]
A:3 [binder, in ITree.Basics.Monad]
A:3 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:3 [binder, in ITree.Props.Leaf]
A:3 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
A:3 [binder, in ITree.Basics.FunctionFacts]
a:3 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:3 [binder, in ITree.Basics.HeterogeneousRelations]
A:3 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:30 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a:30 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:30 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:30 [binder, in ITree.Basics.CategoryKleisliFacts]
a:30 [binder, in ITree.Basics.CategoryFunctor]
A:30 [binder, in ITree.Props.Infinite]
a:30 [binder, in ITree.Props.Leaf]
A:30 [binder, in ITree.Extra.ITrace.ITraceDefinition]
A:30 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:30 [binder, in ITree.Extra.Dijkstra.IterRel]
a:30 [binder, in ITree.Extra.Secure.SecureEqWcompat]
a:300 [binder, in ITree.Basics.CategoryFacts]
a:302 [binder, in ITree.Basics.HeterogeneousRelations]
a:303 [binder, in ITree.Basics.CategoryFacts]
a:304 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:304 [binder, in ITree.Basics.HeterogeneousRelations]
a:306 [binder, in ITree.Basics.CategoryFacts]
a:308 [binder, in ITree.Basics.HeterogeneousRelations]
a:309 [binder, in ITree.Basics.CategoryFacts]
A:31 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:31 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:31 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:31 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:31 [binder, in ITree.Basics.CategoryOps]
A:31 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:31 [binder, in ITree.Basics.MonadState]
A:31 [binder, in ITree.Extra.Secure.SecureEqBind]
a:31 [binder, in ITree.Extra.Secure.SecureEqWcompat]
a:31 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:31 [binder, in ITree.Basics.CategoryRelations]
A:31 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
A:31 [binder, in ITree.Extra.ITrace.ITracePreds]
A:310 [binder, in ITree.Basics.HeterogeneousRelations]
a:311 [binder, in ITree.Basics.CategoryTheory]
a:313 [binder, in ITree.Basics.CategoryFacts]
A:314 [binder, in ITree.Basics.HeterogeneousRelations]
a:314 [binder, in ITree.Basics.CategoryTheory]
a:315 [binder, in ITree.Basics.CategoryFacts]
A:316 [binder, in ITree.Basics.HeterogeneousRelations]
a:318 [binder, in ITree.Basics.CategoryFacts]
A:318 [binder, in ITree.Basics.HeterogeneousRelations]
A:32 [binder, in ITree.Extra.ITrace.ITraceBind]
A:32 [binder, in ITree.Basics.Monad]
A:32 [binder, in ITree.Interp.Recursion]
A:32 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:32 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:32 [binder, in ITree.Props.Infinite]
a:32 [binder, in ITree.Extra.ITrace.ITraceDefinition]
A:32 [binder, in ITree.Indexed.Relation]
a:32 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:322 [binder, in ITree.Basics.CategoryTheory]
a:324 [binder, in ITree.Basics.CategoryFacts]
a:325 [binder, in ITree.Basics.CategoryFacts]
a:326 [binder, in ITree.Basics.CategoryFacts]
A:326 [binder, in ITree.Basics.HeterogeneousRelations]
a:327 [binder, in ITree.Basics.CategoryFacts]
a:327 [binder, in ITree.Basics.CategoryTheory]
a:328 [binder, in ITree.Basics.CategoryFacts]
a:329 [binder, in ITree.Basics.CategoryFacts]
A:33 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:33 [binder, in ITree.Extra.IForest]
A:33 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:33 [binder, in ITree.Extra.ITrace.ITraceDefinition]
a:33 [binder, in ITree.Extra.Dijkstra.IterRel]
A:33 [binder, in ITree.Props.EuttNoRet]
A:33 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
a:33 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:33 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:33 [binder, in ITree.Interp.RecursionFacts]
A:33 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
a:330 [binder, in ITree.Basics.CategoryFacts]
A:331 [binder, in ITree.Extra.ITrace.ITraceBind]
a:336 [binder, in ITree.Extra.ITrace.ITraceBind]
a:336 [binder, in ITree.Basics.CategoryFacts]
a:337 [binder, in ITree.Extra.ITrace.ITraceBind]
a:337 [binder, in ITree.Basics.CategoryTheory]
A:34 [binder, in ITree.Basics.Function]
a:34 [binder, in ITree.Basics.CategoryKleisli]
A:34 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:34 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:34 [binder, in ITree.Basics.CategoryFacts]
a:345 [binder, in ITree.Basics.CategoryFacts]
a:35 [binder, in ITree.Extra.ITrace.ITraceBind]
A:35 [binder, in ITree.Basics.CategoryKleisliFacts]
a:35 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:35 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:35 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:35 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:35 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
A:35 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
a:352 [binder, in ITree.Basics.CategoryTheory]
a:357 [binder, in ITree.Basics.CategoryTheory]
a:358 [binder, in ITree.Basics.CategoryFacts]
a:36 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:36 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:36 [binder, in ITree.Extra.Dijkstra.IterRel]
a:36 [binder, in ITree.Basics.MonadState]
A:36 [binder, in ITree.Extra.Secure.SecureEqBind]
a:36 [binder, in ITree.Extra.Secure.SecureEqWcompat]
a:36 [binder, in ITree.Basics.CategoryTheory]
A:36 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
a:361 [binder, in ITree.Basics.CategoryFacts]
a:364 [binder, in ITree.Basics.CategoryTheory]
a:367 [binder, in ITree.Basics.CategoryFacts]
A:37 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a:37 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:37 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:37 [binder, in ITree.Basics.CategoryOps]
A:37 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:37 [binder, in ITree.Extra.ITrace.ITraceDefinition]
a:37 [binder, in ITree.Extra.Secure.SecureEqWcompat]
A:37 [binder, in ITree.Interp.RecursionFacts]
a:371 [binder, in ITree.Basics.CategoryTheory]
a:373 [binder, in ITree.Basics.CategoryFacts]
A:38 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:38 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:38 [binder, in ITree.Interp.Recursion]
a:38 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:38 [binder, in ITree.Basics.Basics]
A:38 [binder, in ITree.Props.EuttNoRet]
A:38 [binder, in ITree.Indexed.Relation]
a:38 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:38 [binder, in ITree.Extra.Secure.SecureEqWcompat]
a:380 [binder, in ITree.Basics.CategoryTheory]
a:382 [binder, in ITree.Basics.CategoryFacts]
a:383 [binder, in ITree.Basics.CategoryTheory]
a:385 [binder, in ITree.Basics.CategoryFacts]
A:39 [binder, in ITree.Basics.Function]
A:39 [binder, in ITree.Extra.IForest]
A:39 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:39 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:39 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:39 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:390 [binder, in ITree.Basics.CategoryFacts]
a:397 [binder, in ITree.Basics.CategoryFacts]
a:398 [binder, in ITree.Basics.CategoryFacts]
A:4 [binder, in ITree.Extra.Dijkstra.TracesIT]
a:4 [binder, in ITree.Basics.CategoryOps]
A:4 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:4 [binder, in ITree.Extra.ITrace.ITraceDefinition]
a:4 [binder, in ITree.Basics.Basics]
A:4 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:4 [binder, in ITree.Extra.Dijkstra.IterRel]
A:4 [binder, in ITree.Interp.HandlerFacts]
a:4 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:4 [binder, in ITree.Extra.Secure.Labels]
A:4 [binder, in ITree.Extra.ITrace.ITracePreds]
a:40 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:40 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:40 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:40 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:40 [binder, in ITree.Extra.ITrace.ITracePrefix]
A:40 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:403 [binder, in ITree.Extra.IForest]
a:404 [binder, in ITree.Extra.IForest]
a:405 [binder, in ITree.Basics.CategoryFacts]
A:408 [binder, in ITree.Extra.IForest]
a:409 [binder, in ITree.Extra.IForest]
A:41 [binder, in ITree.Extra.IForest]
a:41 [binder, in ITree.Props.Finite]
a:41 [binder, in ITree.Basics.CategoryFunctor]
A:41 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:41 [binder, in ITree.Extra.ITrace.ITraceDefinition]
A:41 [binder, in ITree.Extra.Dijkstra.IterRel]
A:41 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:41 [binder, in ITree.Basics.CategorySub]
A:41 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
a:410 [binder, in ITree.Basics.CategoryFacts]
A:412 [binder, in ITree.Extra.IForest]
a:414 [binder, in ITree.Extra.IForest]
a:415 [binder, in ITree.Basics.CategoryFacts]
a:42 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:42 [binder, in ITree.Extra.Dijkstra.TracesIT]
a:42 [binder, in ITree.Basics.CategoryOps]
A:42 [binder, in ITree.Basics.CategoryKleisliFacts]
a:42 [binder, in ITree.Basics.CategoryFunctor]
A:42 [binder, in ITree.Props.Infinite]
a:42 [binder, in ITree.Basics.CategoryTheory]
A:42 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:42 [binder, in ITree.Interp.RecursionFacts]
A:421 [binder, in ITree.Extra.IForest]
a:421 [binder, in ITree.Basics.CategoryFacts]
a:427 [binder, in ITree.Extra.IForest]
a:427 [binder, in ITree.Basics.CategoryFacts]
A:429 [binder, in ITree.Extra.IForest]
A:43 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a:43 [binder, in ITree.Extra.ITrace.ITraceDefinition]
A:43 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:43 [binder, in ITree.Basics.MonadState]
A:43 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:43 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
a:430 [binder, in ITree.Basics.CategoryFacts]
a:433 [binder, in ITree.Basics.CategoryFacts]
a:434 [binder, in ITree.Extra.IForest]
A:436 [binder, in ITree.Extra.IForest]
a:44 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:44 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:44 [binder, in ITree.Basics.Function]
A:44 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:44 [binder, in ITree.Indexed.Relation]
a:44 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:442 [binder, in ITree.Extra.IForest]
A:444 [binder, in ITree.Extra.IForest]
a:449 [binder, in ITree.Extra.IForest]
A:45 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:45 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:45 [binder, in ITree.Interp.Recursion]
A:45 [binder, in ITree.Extra.Dijkstra.IterRel]
a:45 [binder, in ITree.Basics.CategorySub]
A:451 [binder, in ITree.Extra.IForest]
A:455 [binder, in ITree.Extra.IForest]
a:457 [binder, in ITree.Extra.IForest]
A:459 [binder, in ITree.Extra.IForest]
a:46 [binder, in ITree.Basics.CategoryOps]
A:46 [binder, in ITree.Props.Infinite]
a:46 [binder, in ITree.Basics.CategoryRelations]
A:46 [binder, in ITree.Extra.ITrace.ITracePreds]
A:46 [binder, in ITree.Eq.Paco2]
a:464 [binder, in ITree.Extra.IForest]
A:47 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:47 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:47 [binder, in ITree.Extra.Dijkstra.IterRel]
A:47 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:47 [binder, in ITree.Basics.CategoryFacts]
A:47 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:47 [binder, in ITree.Basics.CategorySub]
a:474 [binder, in ITree.Extra.IForest]
a:48 [binder, in ITree.Extra.Dijkstra.TracesIT]
a:48 [binder, in ITree.Extra.IForest]
a:48 [binder, in ITree.Interp.Recursion]
A:48 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:48 [binder, in ITree.Extra.Dijkstra.IterRel]
A:48 [binder, in ITree.Props.EuttNoRet]
a:48 [binder, in ITree.Basics.MonadState]
a:48 [binder, in ITree.Eq.Paco2]
a:480 [binder, in ITree.Extra.IForest]
a:485 [binder, in ITree.Extra.IForest]
A:49 [binder, in ITree.Basics.CategoryKleisliFacts]
A:49 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
A:49 [binder, in ITree.Indexed.Relation]
A:49 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:49 [binder, in ITree.Basics.CategorySub]
A:5 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:5 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:5 [binder, in ITree.Basics.Tacs]
A:5 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:5 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
a:5 [binder, in ITree.Props.Finite]
a:5 [binder, in ITree.Basics.CategoryKleisli]
A:5 [binder, in ITree.Eq.Rutt]
A:5 [binder, in ITree.Props.Cofinite]
A:5 [binder, in ITree.Basics.FunctionFacts]
A:5 [binder, in ITree.Extra.Secure.Labels]
a:5 [binder, in ITree.Basics.CategorySub]
a:50 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:50 [binder, in ITree.Extra.IForest]
a:50 [binder, in ITree.Basics.CategoryOps]
A:50 [binder, in ITree.Interp.Recursion]
A:50 [binder, in ITree.Props.Leaf]
A:50 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:50 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
a:50 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:50 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
a:50 [binder, in ITree.Basics.CategoryRelations]
a:50 [binder, in ITree.Basics.CategoryTheory]
a:50 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:501 [binder, in ITree.Extra.IForest]
a:509 [binder, in ITree.Extra.IForest]
a:51 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a:51 [binder, in ITree.Extra.Dijkstra.IterRel]
A:51 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:51 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:51 [binder, in ITree.Events.State]
a:51 [binder, in ITree.Basics.CategorySub]
a:513 [binder, in ITree.Extra.IForest]
A:518 [binder, in ITree.Extra.IForest]
a:52 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:52 [binder, in ITree.Extra.IForest]
a:52 [binder, in ITree.Interp.Recursion]
A:52 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
A:52 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
a:52 [binder, in ITree.Eq.Paco2]
A:521 [binder, in ITree.Extra.IForest]
A:526 [binder, in ITree.Extra.IForest]
a:529 [binder, in ITree.Extra.IForest]
A:53 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:53 [binder, in ITree.Props.Infinite]
A:53 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:53 [binder, in ITree.Basics.MonadState]
A:53 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:53 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
A:532 [binder, in ITree.Extra.IForest]
a:54 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:54 [binder, in ITree.Interp.Recursion]
a:54 [binder, in ITree.Basics.CategoryKleisliFacts]
A:54 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:54 [binder, in ITree.Props.EuttNoRet]
a:54 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
a:54 [binder, in ITree.Basics.CategoryRelations]
A:54 [binder, in ITree.Basics.HeterogeneousRelations]
a:54 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:540 [binder, in ITree.Extra.IForest]
a:545 [binder, in ITree.Extra.IForest]
A:547 [binder, in ITree.Extra.IForest]
a:549 [binder, in ITree.Extra.IForest]
a:55 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:55 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:55 [binder, in ITree.Basics.CategoryOps]
A:55 [binder, in ITree.Basics.CategoryKleisliFacts]
A:55 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:55 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:55 [binder, in ITree.Props.Infinite]
a:55 [binder, in ITree.Props.Leaf]
A:55 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:55 [binder, in ITree.Basics.MonadState]
a:55 [binder, in ITree.Basics.CategoryFacts]
a:55 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:55 [binder, in ITree.Eq.Paco2]
A:556 [binder, in ITree.Extra.IForest]
A:56 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:56 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:56 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
a:56 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:56 [binder, in ITree.Basics.CategoryTheory]
a:56 [binder, in ITree.Basics.CategorySub]
a:561 [binder, in ITree.Extra.IForest]
A:563 [binder, in ITree.Extra.IForest]
A:569 [binder, in ITree.Extra.IForest]
A:57 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:57 [binder, in ITree.Extra.ITrace.ITraceBind]
A:57 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:57 [binder, in ITree.Props.Infinite]
A:57 [binder, in ITree.Basics.HeterogeneousRelations]
a:571 [binder, in ITree.Extra.IForest]
A:574 [binder, in ITree.Extra.IForest]
A:577 [binder, in ITree.Extra.IForest]
a:58 [binder, in ITree.Interp.Recursion]
A:58 [binder, in ITree.Core.KTreeFacts]
a:58 [binder, in ITree.Props.Infinite]
a:58 [binder, in ITree.Props.EuttNoRet]
A:58 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:58 [binder, in ITree.Eq.Paco2]
A:580 [binder, in ITree.Extra.IForest]
A:581 [binder, in ITree.Extra.IForest]
A:585 [binder, in ITree.Extra.IForest]
A:587 [binder, in ITree.Extra.IForest]
a:59 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
a:59 [binder, in ITree.Extra.IForest]
A:59 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:59 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:59 [binder, in ITree.Basics.HeterogeneousRelations]
A:591 [binder, in ITree.Extra.IForest]
A:594 [binder, in ITree.Extra.IForest]
A:599 [binder, in ITree.Extra.IForest]
A:6 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:6 [binder, in ITree.Extra.ITrace.ITraceBind]
A:6 [binder, in ITree.Basics.Function]
a:6 [binder, in ITree.Events.FailFacts]
A:6 [binder, in ITree.Eq.EuttExtras]
a:6 [binder, in ITree.Basics.CategoryKleisliFacts]
a:6 [binder, in ITree.Basics.CategoryFunctor]
a:6 [binder, in ITree.Props.EuttNoRet]
A:6 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:6 [binder, in ITree.Basics.CategoryRelations]
a:6 [binder, in ITree.Basics.MonadProp]
A:6 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
A:60 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:60 [binder, in ITree.Basics.CategoryKleisliFacts]
A:60 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:60 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:60 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:60 [binder, in ITree.Basics.CategoryRelations]
a:609 [binder, in ITree.Extra.IForest]
A:61 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:61 [binder, in ITree.Extra.IForest]
a:61 [binder, in ITree.Basics.CategoryOps]
a:61 [binder, in ITree.Basics.MonadState]
A:61 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:61 [binder, in ITree.Basics.CategoryFacts]
A:61 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
a:610 [binder, in ITree.Extra.IForest]
a:611 [binder, in ITree.Extra.IForest]
A:62 [binder, in ITree.Basics.CategoryKleisliFacts]
A:62 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:62 [binder, in ITree.Basics.HeterogeneousRelations]
a:622 [binder, in ITree.Extra.IForest]
A:623 [binder, in ITree.Eq.Eqit]
A:63 [binder, in ITree.Extra.IForest]
A:63 [binder, in ITree.Props.EuttNoRet]
A:63 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:63 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:64 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:64 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:64 [binder, in ITree.Events.StateFacts]
A:64 [binder, in ITree.Basics.CategoryKleisliFacts]
a:64 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:64 [binder, in ITree.Props.Leaf]
A:64 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:64 [binder, in ITree.Basics.HeterogeneousRelations]
A:64 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:642 [binder, in ITree.Extra.IForest]
A:65 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:65 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:65 [binder, in ITree.Basics.CategoryOps]
A:65 [binder, in ITree.Core.KTreeFacts]
A:65 [binder, in ITree.Extra.Dijkstra.IterRel]
a:65 [binder, in ITree.Basics.CategoryRelations]
a:66 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
A:66 [binder, in ITree.Basics.CategoryKleisliFacts]
A:66 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:67 [binder, in ITree.Props.Infinite]
A:67 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
a:67 [binder, in ITree.Basics.MonadState]
A:67 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:67 [binder, in ITree.Basics.CategoryFacts]
A:68 [binder, in ITree.Core.KTreeFacts]
a:68 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:68 [binder, in ITree.Props.EuttNoRet]
a:68 [binder, in ITree.Basics.CategoryTheory]
a:69 [binder, in ITree.Basics.CategoryOps]
a:69 [binder, in ITree.Props.Infinite]
A:69 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:69 [binder, in ITree.Extra.Dijkstra.IterRel]
A:69 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:69 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:69 [binder, in ITree.Extra.ITrace.ITracePreds]
a:7 [binder, in ITree.Basics.Tacs]
a:7 [binder, in ITree.Extra.IForest]
A:7 [binder, in ITree.Props.Infinite]
A:7 [binder, in ITree.Extra.ITrace.ITraceDefinition]
a:7 [binder, in ITree.Basics.Basics]
A:7 [binder, in ITree.Interp.HandlerFacts]
a:7 [binder, in ITree.Basics.MonadState]
A:7 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:7 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
a:7 [binder, in ITree.Basics.CategoryFacts]
a:7 [binder, in ITree.Basics.CategoryTheory]
a:7 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
a:7 [binder, in ITree.Basics.MonadProp]
a:7 [binder, in ITree.Basics.CategorySub]
a:70 [binder, in ITree.Extra.IForest]
a:70 [binder, in ITree.Props.Leaf]
A:70 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
a:70 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:70 [binder, in ITree.Basics.HeterogeneousRelations]
a:70 [binder, in ITree.Basics.CategoryTheory]
A:71 [binder, in ITree.Core.KTreeFacts]
A:71 [binder, in ITree.Basics.CategoryKleisliFacts]
A:71 [binder, in ITree.Props.Infinite]
A:71 [binder, in ITree.Basics.CategoryRelations]
A:71 [binder, in ITree.Extra.ITrace.ITracePreds]
a:72 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:72 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:72 [binder, in ITree.Extra.IForest]
A:72 [binder, in ITree.Basics.CategoryKleisliFacts]
A:72 [binder, in ITree.Props.Leaf]
A:72 [binder, in ITree.Props.EuttNoRet]
A:72 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:72 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:73 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:73 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:73 [binder, in ITree.Basics.CategoryOps]
A:73 [binder, in ITree.Basics.CategoryKleisliFacts]
A:73 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:73 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:73 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:73 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:73 [binder, in ITree.Interp.InterpFacts]
A:74 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:74 [binder, in ITree.Extra.IForest]
A:74 [binder, in ITree.Basics.CategoryKleisliFacts]
a:74 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:74 [binder, in ITree.Props.Infinite]
A:74 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:74 [binder, in ITree.Extra.Dijkstra.IterRel]
A:74 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:75 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:75 [binder, in ITree.Basics.CategoryKleisliFacts]
A:75 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:75 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:75 [binder, in ITree.Extra.Dijkstra.IterRel]
A:75 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:76 [binder, in ITree.Basics.CategoryOps]
A:76 [binder, in ITree.Core.KTreeFacts]
a:76 [binder, in ITree.Props.Infinite]
A:76 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:76 [binder, in ITree.Basics.CategoryFacts]
a:76 [binder, in ITree.Basics.CategoryRelations]
A:77 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:77 [binder, in ITree.Extra.Dijkstra.StateSpecT]
A:77 [binder, in ITree.Basics.HeterogeneousRelations]
A:78 [binder, in ITree.Basics.CategoryKleisliFacts]
A:78 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:78 [binder, in ITree.Props.Infinite]
a:78 [binder, in ITree.Props.Leaf]
A:78 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:78 [binder, in ITree.Props.EuttNoRet]
A:78 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:79 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:79 [binder, in ITree.Extra.Secure.SecureEqHalt]
A:79 [binder, in ITree.Core.KTreeFacts]
A:79 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:79 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:8 [binder, in ITree.Basics.CategoryKleisliFacts]
A:8 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:8 [binder, in ITree.Basics.MonadState]
A:8 [binder, in ITree.Eq.Rutt]
A:8 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:8 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
a:8 [binder, in ITree.Basics.CategoryFacts]
A:8 [binder, in ITree.Core.Subevent]
A:8 [binder, in ITree.Basics.CategoryRelations]
A:8 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
A:8 [binder, in ITree.Extra.Secure.Labels]
A:8 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
a:80 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:80 [binder, in ITree.Props.Infinite]
A:80 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:80 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:806 [binder, in ITree.Eq.Eqit]
a:809 [binder, in ITree.Eq.Eqit]
A:81 [binder, in ITree.Extra.Dijkstra.TracesIT]
a:81 [binder, in ITree.Basics.CategoryOps]
a:81 [binder, in ITree.Basics.CategoryKleisliFacts]
a:81 [binder, in ITree.Props.Infinite]
a:81 [binder, in ITree.Basics.CategoryTheory]
A:811 [binder, in ITree.Eq.Eqit]
A:82 [binder, in ITree.Basics.CategoryKleisliFacts]
A:82 [binder, in ITree.Props.Finite]
A:82 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
a:82 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:82 [binder, in ITree.Props.Infinite]
A:82 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:82 [binder, in ITree.Basics.CategoryFacts]
a:82 [binder, in ITree.Basics.CategoryRelations]
A:82 [binder, in ITree.Basics.HeterogeneousRelations]
a:825 [binder, in ITree.Eq.Eqit]
A:827 [binder, in ITree.Eq.Eqit]
a:83 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:832 [binder, in ITree.Eq.Eqit]
A:834 [binder, in ITree.Eq.Eqit]
a:839 [binder, in ITree.Eq.Eqit]
A:84 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:84 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:84 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:843 [binder, in ITree.Eq.Eqit]
A:85 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:85 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:85 [binder, in ITree.Basics.CategoryOps]
A:85 [binder, in ITree.Basics.CategoryKleisliFacts]
a:85 [binder, in ITree.Props.Leaf]
a:85 [binder, in ITree.Extra.Dijkstra.StateSpecT]
a:85 [binder, in ITree.Basics.CategoryRelations]
a:85 [binder, in ITree.Basics.CategoryTheory]
A:85 [binder, in ITree.Extra.ITrace.ITracePreds]
a:857 [binder, in ITree.Eq.Eqit]
A:858 [binder, in ITree.Eq.Eqit]
A:86 [binder, in ITree.Eq.Shallow]
a:868 [binder, in ITree.Eq.Eqit]
A:869 [binder, in ITree.Eq.Eqit]
A:87 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:87 [binder, in ITree.Basics.HeterogeneousRelations]
a:879 [binder, in ITree.Eq.Eqit]
A:88 [binder, in ITree.Core.KTreeFacts]
a:88 [binder, in ITree.Basics.CategoryKleisliFacts]
A:88 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:88 [binder, in ITree.Props.Infinite]
A:88 [binder, in ITree.Extra.Secure.SecureEqBind]
a:88 [binder, in ITree.Basics.CategoryRelations]
A:881 [binder, in ITree.Eq.Eqit]
a:89 [binder, in ITree.Basics.CategoryOps]
A:89 [binder, in ITree.Events.StateFacts]
A:89 [binder, in ITree.Basics.CategoryKleisliFacts]
a:89 [binder, in ITree.Props.Infinite]
A:89 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:89 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:891 [binder, in ITree.Eq.Eqit]
A:893 [binder, in ITree.Eq.Eqit]
a:899 [binder, in ITree.Eq.Eqit]
a:9 [binder, in ITree.Basics.Tacs]
a:9 [binder, in ITree.Extra.ITrace.ITraceBind]
A:9 [binder, in ITree.Axioms]
A:9 [binder, in ITree.Basics.Monad]
a:9 [binder, in ITree.Basics.CategoryKleisli]
a:9 [binder, in ITree.Basics.Basics]
A:9 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:9 [binder, in ITree.Props.EuttNoRet]
A:9 [binder, in ITree.Basics.FunctionFacts]
a:9 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:9 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
A:90 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:901 [binder, in ITree.Eq.Eqit]
a:907 [binder, in ITree.Eq.Eqit]
A:91 [binder, in ITree.Events.ExceptionFacts]
a:91 [binder, in ITree.Basics.CategoryFacts]
a:91 [binder, in ITree.Basics.CategoryRelations]
a:91 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
A:92 [binder, in ITree.Extra.Dijkstra.TracesIT]
A:92 [binder, in ITree.Props.Infinite]
A:93 [binder, in ITree.Basics.CategoryKleisliFacts]
A:93 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:93 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:93 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:93 [binder, in ITree.Basics.HeterogeneousRelations]
a:94 [binder, in ITree.Core.KTreeFacts]
A:94 [binder, in ITree.Props.Finite]
a:94 [binder, in ITree.Props.Infinite]
A:94 [binder, in ITree.Extra.Secure.SecureEqBind]
A:94 [binder, in ITree.Extra.Secure.SecureStateHandler]
a:94 [binder, in ITree.Basics.CategoryRelations]
A:94 [binder, in ITree.Basics.HeterogeneousRelations]
A:95 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:95 [binder, in ITree.Extra.Secure.SecureEqHalt]
a:95 [binder, in ITree.Events.ExceptionFacts]
A:95 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
A:95 [binder, in ITree.Extra.ITrace.ITraceFacts]
A:95 [binder, in ITree.Basics.HeterogeneousRelations]
A:96 [binder, in ITree.Basics.HeterogeneousRelations]
a:97 [binder, in ITree.Basics.CategoryOps]
A:97 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
A:97 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
a:97 [binder, in ITree.Extra.ITrace.ITraceFacts]
a:97 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
a:97 [binder, in ITree.Basics.CategoryRelations]
A:97 [binder, in ITree.Basics.HeterogeneousRelations]
a:98 [binder, in ITree.Basics.CategoryOps]
A:98 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:98 [binder, in ITree.Extra.Secure.SecureStateHandler]
A:98 [binder, in ITree.Basics.HeterogeneousRelations]
A:98 [binder, in ITree.Extra.ITrace.ITracePreds]
A:99 [binder, in ITree.Basics.HeterogeneousRelations]
A:99 [binder, in ITree.Simple]

B

base [constructor, in ITree.Extra.Dijkstra.IterRel]
BasicFacts [section, in ITree.Basics.CategoryKleisliFacts]
Basics [library]
bc:107 [binder, in ITree.Basics.CategoryFacts]
bc:114 [binder, in ITree.Basics.CategoryFacts]
bc:121 [binder, in ITree.Basics.CategoryFacts]
bc:248 [binder, in ITree.Basics.CategoryFacts]
bc:34 [binder, in ITree.Basics.CategoryKleisliFacts]
bc:409 [binder, in ITree.Basics.CategoryFacts]
bc:53 [binder, in ITree.Basics.CategoryKleisliFacts]
bc:70 [binder, in ITree.Basics.CategoryKleisliFacts]
bd:249 [binder, in ITree.Basics.CategoryFacts]
bd:81 [binder, in ITree.Basics.CategoryFacts]
bd:87 [binder, in ITree.Basics.CategoryFacts]
Bifunctor [record, in ITree.Basics.CategoryTheory]
BifunctorFacts [section, in ITree.Basics.CategoryFacts]
BifunctorLaws [section, in ITree.Basics.CategoryTheory]
Bifunctor_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
Bifunctor_Fun_prod [instance, in ITree.Basics.FunctionFacts]
Bifunctor_Product [instance, in ITree.Basics.CategoryFacts]
Bifunctor_Coproduct [instance, in ITree.Basics.CategoryFacts]
Bifunctor_bif:75 [binder, in ITree.Basics.CategoryFacts]
Bifunctor_sum_rel [instance, in ITree.Basics.CategoryRelations]
Bifunctor_prod_rel [instance, in ITree.Basics.CategoryRelations]
bifunctor_proper_bimap [projection, in ITree.Basics.CategoryTheory]
bifunctor_bimap_cat [projection, in ITree.Basics.CategoryTheory]
bifunctor_bimap_id [projection, in ITree.Basics.CategoryTheory]
bif:128 [binder, in ITree.Basics.CategoryTheory]
bif:16 [binder, in ITree.Basics.CategorySub]
bif:167 [binder, in ITree.Basics.CategoryTheory]
bif:193 [binder, in ITree.Basics.CategoryOps]
bif:224 [binder, in ITree.Basics.CategoryFacts]
bif:234 [binder, in ITree.Basics.CategoryTheory]
bif:25 [binder, in ITree.Basics.CategoryFacts]
bif:29 [binder, in ITree.Basics.CategoryOps]
bif:308 [binder, in ITree.Basics.CategoryTheory]
bif:346 [binder, in ITree.Basics.CategoryTheory]
bif:351 [binder, in ITree.Basics.CategoryFacts]
bif:73 [binder, in ITree.Basics.CategoryFacts]
bif:94 [binder, in ITree.Basics.CategoryOps]
bif:97 [binder, in ITree.Basics.CategoryFacts]
bif:97 [binder, in ITree.Basics.CategoryTheory]
bimap [projection, in ITree.Basics.CategoryOps]
Bimap [record, in ITree.Basics.CategoryOps]
bimap [constructor, in ITree.Basics.CategoryOps]
Bimap [inductive, in ITree.Basics.CategoryOps]
BimapCat [record, in ITree.Basics.CategoryTheory]
BimapCat [inductive, in ITree.Basics.CategoryTheory]
BimapCat_Fun_prod [instance, in ITree.Basics.FunctionFacts]
BimapCat_Product [instance, in ITree.Basics.CategoryFacts]
BimapCat_Coproduct [instance, in ITree.Basics.CategoryFacts]
BimapCat_bif:28 [binder, in ITree.Basics.CategoryFacts]
BimapCat_sum_rel [instance, in ITree.Basics.CategoryRelations]
BimapCat_prod_rel [instance, in ITree.Basics.CategoryRelations]
BimapId [record, in ITree.Basics.CategoryTheory]
BimapId [inductive, in ITree.Basics.CategoryTheory]
BimapId_Fun_prod [instance, in ITree.Basics.FunctionFacts]
BimapId_Product [instance, in ITree.Basics.CategoryFacts]
BimapId_Coproduct [instance, in ITree.Basics.CategoryFacts]
BimapId_bif:27 [binder, in ITree.Basics.CategoryFacts]
BimapId_sum_rel [instance, in ITree.Basics.CategoryRelations]
BimapId_prod_rel [instance, in ITree.Basics.CategoryRelations]
BimapProper_Fun_prod [instance, in ITree.Basics.FunctionFacts]
Bimap_Product [instance, in ITree.Basics.CategoryOps]
Bimap_Coproduct [instance, in ITree.Basics.CategoryOps]
bimap_cat_kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
bimap_id_kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
bimap_pure_id [lemma, in ITree.Basics.CategoryKleisliFacts]
bimap_id_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
bimap_snd [lemma, in ITree.Basics.CategoryFacts]
bimap_fst [lemma, in ITree.Basics.CategoryFacts]
bimap_pair_unfold [lemma, in ITree.Basics.CategoryFacts]
bimap_case [lemma, in ITree.Basics.CategoryFacts]
bimap_case_unfold [lemma, in ITree.Basics.CategoryFacts]
bimap_slide' [lemma, in ITree.Basics.CategoryFacts]
bimap_slide [lemma, in ITree.Basics.CategoryFacts]
Bimap_bif:74 [binder, in ITree.Basics.CategoryFacts]
Bimap_bif:26 [binder, in ITree.Basics.CategoryFacts]
Bimap_prod_rel [instance, in ITree.Basics.CategoryRelations]
Bimap_sum_rel [instance, in ITree.Basics.CategoryRelations]
Bimap_bif:309 [binder, in ITree.Basics.CategoryTheory]
Bimap_bif:235 [binder, in ITree.Basics.CategoryTheory]
bimap_cat [projection, in ITree.Basics.CategoryTheory]
bimap_cat [constructor, in ITree.Basics.CategoryTheory]
bimap_id [projection, in ITree.Basics.CategoryTheory]
bimap_id [constructor, in ITree.Basics.CategoryTheory]
Bimap_bif:98 [binder, in ITree.Basics.CategoryTheory]
bimap_sub_unfold [lemma, in ITree.Basics.CategorySub]
Bimap_sub [definition, in ITree.Basics.CategorySub]
Bimap_C:31 [binder, in ITree.Basics.CategorySub]
bindC [definition, in ITree.Eq.UpToTaus]
bindpi [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
bindpi_bindpi [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
bindpi_retpi [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
bindpi_monot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
bind_split_diverge [lemma, in ITree.Extra.Dijkstra.TracesIT]
bind_ts1 [definition, in ITree.Extra.Dijkstra.TracesIT]
bind_ts1_all [definition, in ITree.Extra.Dijkstra.TracesIT]
bind_trigger_refine [lemma, in ITree.Extra.ITrace.ITraceBind]
bind_peel_ret_tau_aux [lemma, in ITree.Extra.ITrace.ITraceBind]
BIND_BIND_COUNTEREXAMPLE.bind_bind_counterexample [lemma, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.not_bind_left_assoc [lemma, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.bind_right_assoc [lemma, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.t [definition, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.KC [definition, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.KB [definition, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.PA [definition, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.Pick [constructor, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.ND [inductive, in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE [module, in ITree.Extra.IForest]
bind_bind_iforest [lemma, in ITree.Extra.IForest]
bind_ret [lemma, in ITree.Extra.IForest]
bind_stronger [definition, in ITree.Extra.IForest]
bind_Propt_Proper2 [instance, in ITree.Extra.IForest]
bind_iforest_Proper [instance, in ITree.Extra.IForest]
bind_iforest_bind_iforest' [lemma, in ITree.Extra.IForest]
bind_iforest' [definition, in ITree.Extra.IForest]
bind_iforest_stronger [definition, in ITree.Extra.IForest]
bind_iforest [definition, in ITree.Extra.IForest]
bind_bind [projection, in ITree.Basics.Monad]
bind_ret_r [projection, in ITree.Basics.Monad]
bind_ret_l [projection, in ITree.Basics.Monad]
bind_iter [lemma, in ITree.Core.KTreeFacts]
bind_pred_resp_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
bind_ret_failure [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
bind_ex [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
bind_pres [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
bind_traces [definition, in ITree.Interp.Traces]
bind_vis_ [lemma, in ITree.Eq.Shallow]
bind_tau_ [lemma, in ITree.Eq.Shallow]
bind_ret_ [lemma, in ITree.Eq.Shallow]
bind_del [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
bind_map [lemma, in ITree.Eq.Eqit]
bind_bind [lemma, in ITree.Eq.Eqit]
bind_ret_r' [lemma, in ITree.Eq.Eqit]
bind_ret_r [lemma, in ITree.Eq.Eqit]
bind_trigger [lemma, in ITree.Eq.Eqit]
bind_vis [lemma, in ITree.Eq.Eqit]
bind_tau [lemma, in ITree.Eq.Eqit]
bind_ret_l [lemma, in ITree.Eq.Eqit]
bind_ [abbreviation, in ITree.Eq.Eqit]
bisim [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
bisimConsF [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
bisimF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
bisimNil [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
bisimulation_is_eq [axiom, in ITree.Eq.EqAxiom]
bisim_equiv [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
bisim_monot [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
bisim_ [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
body1:116 [binder, in ITree.Extra.Secure.SecureEqBind]
body1:141 [binder, in ITree.Extra.Secure.SecureEqBind]
body1:164 [binder, in ITree.Extra.Secure.SecureEqBind]
body1:17 [binder, in ITree.Core.KTreeFacts]
body1:290 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
body1:313 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
body1:32 [binder, in ITree.Core.KTreeFacts]
body1:49 [binder, in ITree.Core.KTreeFacts]
body1:91 [binder, in ITree.Extra.Secure.SecureEqBind]
body2:117 [binder, in ITree.Extra.Secure.SecureEqBind]
body2:142 [binder, in ITree.Extra.Secure.SecureEqBind]
body2:165 [binder, in ITree.Extra.Secure.SecureEqBind]
body2:18 [binder, in ITree.Core.KTreeFacts]
body2:291 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
body2:314 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
body2:33 [binder, in ITree.Core.KTreeFacts]
body2:50 [binder, in ITree.Core.KTreeFacts]
body2:92 [binder, in ITree.Extra.Secure.SecureEqBind]
body:144 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:153 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:164 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:170 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:189 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:19 [binder, in ITree.Events.FailFacts]
body:21 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
body:47 [binder, in ITree.Interp.Recursion]
body:56 [binder, in ITree.Interp.Recursion]
body:67 [binder, in ITree.Props.HasPost]
body:93 [binder, in ITree.Events.ExceptionFacts]
br:11 [binder, in ITree.Extra.ITrace.ITracePrefix]
br:29 [binder, in ITree.Extra.ITrace.ITracePrefix]
br:9 [binder, in ITree.Extra.ITrace.ITracePrefix]
bs:10 [binder, in ITree.Extra.ITrace.ITracePrefix]
bs:14 [binder, in ITree.Extra.ITrace.ITracePrefix]
bs:30 [binder, in ITree.Extra.ITrace.ITracePrefix]
burn [definition, in ITree.Core.ITreeDefinition]
burn_eutt_r [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
B':113 [binder, in ITree.Events.StateFacts]
b':126 [binder, in ITree.Extra.ITrace.ITraceBind]
b':135 [binder, in ITree.Extra.ITrace.ITraceBind]
b':164 [binder, in ITree.Basics.CategoryFacts]
b':237 [binder, in ITree.Extra.ITrace.ITraceFacts]
b':290 [binder, in ITree.Basics.CategoryFacts]
b':328 [binder, in ITree.Extra.ITrace.ITraceBind]
b':369 [binder, in ITree.Basics.CategoryFacts]
b':66 [binder, in ITree.Extra.Dijkstra.TracesIT]
b':68 [binder, in ITree.Basics.CategoryRelations]
b':79 [binder, in ITree.Basics.CategoryRelations]
b':81 [binder, in ITree.Extra.ITrace.ITraceBind]
b1':145 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1':145 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1':185 [binder, in ITree.Eq.Eqit]
b1':196 [binder, in ITree.Eq.Eqit]
b1:1 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b1:105 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:105 [binder, in ITree.Extra.Secure.SecureEqHalt]
B1:105 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:105 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:106 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:106 [binder, in ITree.Basics.CategoryKleisliFacts]
b1:106 [binder, in ITree.Basics.CategoryTheory]
b1:109 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:110 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:110 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b1:111 [binder, in ITree.Eq.Eqit]
b1:112 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:112 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:113 [binder, in ITree.Props.Leaf]
b1:113 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:117 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:118 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:123 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:124 [binder, in ITree.Eq.Eqit]
b1:125 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:125 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:13 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b1:130 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:130 [binder, in ITree.Extra.Secure.SecureEqHalt]
B1:130 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:131 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:132 [binder, in ITree.Props.Leaf]
b1:133 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:135 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:139 [binder, in ITree.Eq.Eqit]
b1:140 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:143 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:143 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:145 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:15 [binder, in ITree.Extra.Secure.SecureStateHandler]
b1:15 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
b1:151 [binder, in ITree.Extra.ITrace.ITracePrefix]
B1:155 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:157 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:159 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:163 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:163 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:163 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:166 [binder, in ITree.Eq.Eqit]
b1:167 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:167 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:168 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:169 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:169 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:174 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:174 [binder, in ITree.Eq.Eqit]
b1:177 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:177 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:177 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:178 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:183 [binder, in ITree.Eq.Eqit]
b1:189 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:189 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:191 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:194 [binder, in ITree.Eq.Eqit]
b1:209 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:218 [binder, in ITree.Basics.HeterogeneousRelations]
b1:218 [binder, in ITree.Eq.Eqit]
b1:220 [binder, in ITree.Eq.Eqit]
b1:225 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:226 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:228 [binder, in ITree.Eq.Eqit]
b1:233 [binder, in ITree.Eq.Eqit]
b1:235 [binder, in ITree.Eq.Eqit]
b1:237 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:239 [binder, in ITree.Eq.Eqit]
b1:241 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:246 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:247 [binder, in ITree.Eq.Eqit]
b1:252 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:252 [binder, in ITree.Eq.Eqit]
b1:254 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:257 [binder, in ITree.Eq.Eqit]
b1:261 [binder, in ITree.Eq.Eqit]
b1:263 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:266 [binder, in ITree.Eq.Eqit]
b1:269 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:271 [binder, in ITree.Eq.Eqit]
b1:276 [binder, in ITree.Eq.Eqit]
B1:279 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:28 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:280 [binder, in ITree.Eq.Eqit]
b1:283 [binder, in ITree.Eq.Eqit]
b1:284 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:285 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:285 [binder, in ITree.Eq.Eqit]
b1:287 [binder, in ITree.Eq.Eqit]
B1:304 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:308 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:317 [binder, in ITree.Eq.Eqit]
b1:319 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:325 [binder, in ITree.Eq.Eqit]
B1:33 [binder, in ITree.Basics.HeterogeneousRelations]
b1:33 [binder, in ITree.Eq.Eqit]
b1:338 [binder, in ITree.Eq.Eqit]
b1:34 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:34 [binder, in ITree.Extra.ITrace.ITracePreds]
b1:348 [binder, in ITree.Extra.IForest]
b1:349 [binder, in ITree.Eq.Eqit]
b1:362 [binder, in ITree.Extra.IForest]
b1:363 [binder, in ITree.Eq.Eqit]
b1:371 [binder, in ITree.Eq.Eqit]
b1:377 [binder, in ITree.Extra.IForest]
b1:389 [binder, in ITree.Extra.IForest]
b1:39 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b1:39 [binder, in ITree.Eq.Eqit]
b1:397 [binder, in ITree.Eq.Eqit]
b1:41 [binder, in ITree.Basics.HeterogeneousRelations]
b1:434 [binder, in ITree.Eq.Eqit]
b1:448 [binder, in ITree.Eq.Eqit]
B1:45 [binder, in ITree.Basics.HeterogeneousRelations]
b1:452 [binder, in ITree.Eq.Eqit]
b1:473 [binder, in ITree.Eq.Eqit]
b1:48 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:48 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:489 [binder, in ITree.Eq.Eqit]
b1:51 [binder, in ITree.Eq.Eqit]
b1:543 [binder, in ITree.Eq.Eqit]
b1:55 [binder, in ITree.Eq.Eqit]
b1:557 [binder, in ITree.Eq.Eqit]
b1:57 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b1:61 [binder, in ITree.Eq.Eqit]
b1:62 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:63 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:638 [binder, in ITree.Eq.Eqit]
b1:642 [binder, in ITree.Eq.Eqit]
b1:651 [binder, in ITree.Eq.Eqit]
b1:658 [binder, in ITree.Eq.Eqit]
b1:662 [binder, in ITree.Eq.Eqit]
b1:67 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:67 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:678 [binder, in ITree.Eq.Eqit]
b1:68 [binder, in ITree.Extra.ITrace.ITraceFacts]
b1:7 [binder, in ITree.Eq.Eqit]
b1:709 [binder, in ITree.Eq.Eqit]
b1:71 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:736 [binder, in ITree.Eq.Eqit]
b1:74 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:74 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:741 [binder, in ITree.Eq.Eqit]
b1:749 [binder, in ITree.Eq.Eqit]
b1:76 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b1:761 [binder, in ITree.Eq.Eqit]
b1:8 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:8 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:8 [binder, in ITree.Extra.Secure.SecureEqHalt]
b1:8 [binder, in ITree.Extra.Secure.SecureEqBind]
B1:80 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:820 [binder, in ITree.Eq.Eqit]
b1:83 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b1:84 [binder, in ITree.Eq.Eqit]
b1:849 [binder, in ITree.Eq.Eqit]
b1:85 [binder, in ITree.Extra.Secure.SecureEqBind]
b1:87 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:885 [binder, in ITree.Eq.Eqit]
b1:89 [binder, in ITree.Extra.ITrace.ITracePreds]
b1:90 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b1:92 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:92 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:92 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:95 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b1:96 [binder, in ITree.Props.Leaf]
b1:98 [binder, in ITree.Basics.CategoryKleisliFacts]
b1:98 [binder, in ITree.Extra.ITrace.ITracePrefix]
b1:98 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2':146 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2':146 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2':186 [binder, in ITree.Eq.Eqit]
b2':197 [binder, in ITree.Eq.Eqit]
B2:104 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:106 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:106 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:106 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:107 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:107 [binder, in ITree.Basics.CategoryKleisliFacts]
b2:107 [binder, in ITree.Basics.CategoryTheory]
b2:110 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:111 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:111 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b2:112 [binder, in ITree.Eq.Eqit]
b2:113 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:113 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:114 [binder, in ITree.Props.Leaf]
b2:114 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:118 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:119 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:124 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:125 [binder, in ITree.Eq.Eqit]
b2:126 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:126 [binder, in ITree.Extra.Secure.SecureEqHalt]
B2:129 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:131 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:131 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:132 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:133 [binder, in ITree.Props.Leaf]
b2:134 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:136 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:14 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b2:140 [binder, in ITree.Eq.Eqit]
b2:141 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:144 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:144 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:146 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:149 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:152 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:154 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
B2:156 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:158 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:16 [binder, in ITree.Extra.Secure.SecureStateHandler]
b2:16 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
b2:160 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:164 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:164 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:167 [binder, in ITree.Eq.Eqit]
b2:168 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:168 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:169 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:170 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:170 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:175 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:175 [binder, in ITree.Eq.Eqit]
b2:178 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:178 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:178 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:179 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:184 [binder, in ITree.Eq.Eqit]
b2:19 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:190 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:190 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:192 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:193 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:195 [binder, in ITree.Eq.Eqit]
b2:2 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b2:208 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:210 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:219 [binder, in ITree.Basics.HeterogeneousRelations]
b2:219 [binder, in ITree.Eq.Eqit]
b2:221 [binder, in ITree.Eq.Eqit]
b2:226 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:227 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:229 [binder, in ITree.Eq.Eqit]
b2:234 [binder, in ITree.Eq.Eqit]
b2:236 [binder, in ITree.Eq.Eqit]
b2:238 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:240 [binder, in ITree.Eq.Eqit]
b2:242 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:247 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:248 [binder, in ITree.Eq.Eqit]
b2:253 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:253 [binder, in ITree.Eq.Eqit]
b2:255 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:258 [binder, in ITree.Eq.Eqit]
b2:262 [binder, in ITree.Eq.Eqit]
b2:264 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:267 [binder, in ITree.Eq.Eqit]
b2:270 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:272 [binder, in ITree.Eq.Eqit]
b2:277 [binder, in ITree.Eq.Eqit]
B2:278 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:281 [binder, in ITree.Eq.Eqit]
b2:284 [binder, in ITree.Eq.Eqit]
b2:285 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:286 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:286 [binder, in ITree.Eq.Eqit]
b2:288 [binder, in ITree.Eq.Eqit]
b2:29 [binder, in ITree.Extra.Secure.SecureEqBind]
B2:305 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:309 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:318 [binder, in ITree.Eq.Eqit]
b2:320 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:326 [binder, in ITree.Eq.Eqit]
b2:339 [binder, in ITree.Eq.Eqit]
B2:34 [binder, in ITree.Basics.HeterogeneousRelations]
b2:34 [binder, in ITree.Eq.Eqit]
b2:349 [binder, in ITree.Extra.IForest]
b2:35 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:35 [binder, in ITree.Extra.ITrace.ITracePreds]
b2:356 [binder, in ITree.Eq.Eqit]
b2:363 [binder, in ITree.Extra.IForest]
b2:364 [binder, in ITree.Eq.Eqit]
b2:372 [binder, in ITree.Eq.Eqit]
b2:378 [binder, in ITree.Extra.IForest]
b2:390 [binder, in ITree.Extra.IForest]
b2:390 [binder, in ITree.Eq.Eqit]
b2:40 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b2:40 [binder, in ITree.Eq.Eqit]
b2:42 [binder, in ITree.Basics.HeterogeneousRelations]
b2:435 [binder, in ITree.Eq.Eqit]
b2:449 [binder, in ITree.Eq.Eqit]
b2:453 [binder, in ITree.Eq.Eqit]
B2:46 [binder, in ITree.Basics.HeterogeneousRelations]
b2:474 [binder, in ITree.Eq.Eqit]
b2:49 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:49 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:490 [binder, in ITree.Eq.Eqit]
b2:52 [binder, in ITree.Eq.Eqit]
b2:544 [binder, in ITree.Eq.Eqit]
b2:558 [binder, in ITree.Eq.Eqit]
b2:56 [binder, in ITree.Eq.Eqit]
b2:58 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:58 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b2:62 [binder, in ITree.Eq.Eqit]
b2:63 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:639 [binder, in ITree.Eq.Eqit]
b2:64 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:643 [binder, in ITree.Eq.Eqit]
b2:652 [binder, in ITree.Eq.Eqit]
b2:659 [binder, in ITree.Eq.Eqit]
b2:663 [binder, in ITree.Eq.Eqit]
b2:679 [binder, in ITree.Eq.Eqit]
b2:68 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:68 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:69 [binder, in ITree.Extra.ITrace.ITraceFacts]
b2:710 [binder, in ITree.Eq.Eqit]
b2:72 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:737 [binder, in ITree.Eq.Eqit]
b2:742 [binder, in ITree.Eq.Eqit]
b2:75 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:75 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:750 [binder, in ITree.Eq.Eqit]
b2:762 [binder, in ITree.Eq.Eqit]
b2:77 [binder, in ITree.Extra.Secure.SecureEqWcompat]
B2:79 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:79 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:8 [binder, in ITree.Eq.Eqit]
b2:821 [binder, in ITree.Eq.Eqit]
b2:84 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b2:85 [binder, in ITree.Eq.Eqit]
b2:850 [binder, in ITree.Eq.Eqit]
b2:86 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:88 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:886 [binder, in ITree.Eq.Eqit]
b2:9 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:9 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:9 [binder, in ITree.Extra.Secure.SecureEqHalt]
b2:9 [binder, in ITree.Extra.Secure.SecureEqBind]
b2:90 [binder, in ITree.Extra.ITrace.ITracePreds]
b2:91 [binder, in ITree.Extra.Secure.SecureEqWcompat]
b2:93 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:93 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:96 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b2:97 [binder, in ITree.Props.Leaf]
b2:99 [binder, in ITree.Basics.CategoryKleisliFacts]
b2:99 [binder, in ITree.Extra.ITrace.ITracePrefix]
b2:99 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b3:120 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b3:147 [binder, in ITree.Extra.ITrace.ITracePrefix]
b3:191 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b3:191 [binder, in ITree.Extra.Secure.SecureEqHalt]
b4:121 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b4:192 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b4:192 [binder, in ITree.Extra.Secure.SecureEqHalt]
b:10 [binder, in ITree.Basics.Tacs]
b:10 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:10 [binder, in ITree.Axioms]
b:10 [binder, in ITree.Basics.CategoryKleisli]
B:10 [binder, in ITree.Props.EuttNoRet]
B:10 [binder, in ITree.Basics.FunctionFacts]
b:10 [binder, in ITree.Basics.HeterogeneousRelations]
b:10 [binder, in ITree.Extra.ITrace.ITracePreds]
B:100 [binder, in ITree.Simple]
b:101 [binder, in ITree.Basics.CategoryRelations]
b:101 [binder, in ITree.Basics.CategoryTheory]
B:103 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:103 [binder, in ITree.Basics.CategoryFacts]
b:104 [binder, in ITree.Extra.ITrace.ITraceBind]
B:104 [binder, in ITree.Props.Finite]
b:104 [binder, in ITree.Basics.CategoryRelations]
B:104 [binder, in ITree.Simple]
b:105 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:106 [binder, in ITree.Events.StateFacts]
B:106 [binder, in ITree.Basics.HeterogeneousRelations]
b:107 [binder, in ITree.Basics.CategoryOps]
b:107 [binder, in ITree.Basics.CategoryRelations]
B:108 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
b:108 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:108 [binder, in ITree.Basics.Basics]
B:109 [binder, in ITree.Basics.HeterogeneousRelations]
b:11 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b:11 [binder, in ITree.Basics.CategorySub]
b:110 [binder, in ITree.Basics.CategoryFacts]
B:110 [binder, in ITree.Simple]
B:111 [binder, in ITree.Core.KTreeFacts]
B:111 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:111 [binder, in ITree.Extra.ITrace.ITracePrefix]
B:112 [binder, in ITree.Events.StateFacts]
b:112 [binder, in ITree.Basics.CategoryRelations]
b:113 [binder, in ITree.Basics.CategoryOps]
b:114 [binder, in ITree.Basics.CategoryKleisliFacts]
B:114 [binder, in ITree.Basics.Basics]
b:115 [binder, in ITree.Basics.CategoryOps]
B:115 [binder, in ITree.Eq.Rutt]
B:115 [binder, in ITree.Basics.HeterogeneousRelations]
B:116 [binder, in ITree.Props.Finite]
b:117 [binder, in ITree.Basics.Basics]
b:117 [binder, in ITree.Basics.CategoryFacts]
b:118 [binder, in ITree.Basics.CategoryOps]
B:118 [binder, in ITree.Eq.Rutt]
b:119 [binder, in ITree.Extra.ITrace.ITracePrefix]
b:119 [binder, in ITree.Basics.CategoryTheory]
B:12 [binder, in ITree.Basics.HeterogeneousRelations]
b:120 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:120 [binder, in ITree.Extra.Secure.SecureStateHandler]
b:121 [binder, in ITree.Core.KTreeFacts]
B:121 [binder, in ITree.Interp.InterpFacts]
b:124 [binder, in ITree.Basics.CategoryFacts]
b:125 [binder, in ITree.Extra.ITrace.ITraceBind]
b:125 [binder, in ITree.Extra.ITrace.ITracePrefix]
B:125 [binder, in ITree.Basics.HeterogeneousRelations]
B:126 [binder, in ITree.Eq.Rutt]
b:126 [binder, in ITree.Basics.CategoryFacts]
B:127 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:127 [binder, in ITree.Basics.HeterogeneousRelations]
b:129 [binder, in ITree.Events.StateFacts]
B:129 [binder, in ITree.Eq.Rutt]
B:129 [binder, in ITree.Interp.InterpFacts]
B:129 [binder, in ITree.Basics.HeterogeneousRelations]
b:13 [binder, in ITree.Eq.EuttExtras]
b:13 [binder, in ITree.Basics.CategoryKleisliFacts]
B:13 [binder, in ITree.Props.EuttNoRet]
B:13 [binder, in ITree.Indexed.Relation]
b:13 [binder, in ITree.Basics.FunctionFacts]
b:13 [binder, in ITree.Basics.CategoryFacts]
b:13 [binder, in ITree.Basics.CategoryTheory]
b:130 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:130 [binder, in ITree.Basics.CategoryFacts]
b:131 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
B:131 [binder, in ITree.Extra.Secure.SecureStateHandler]
B:131 [binder, in ITree.Basics.HeterogeneousRelations]
B:133 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:133 [binder, in ITree.Basics.HeterogeneousRelations]
b:134 [binder, in ITree.Extra.ITrace.ITraceBind]
B:134 [binder, in ITree.Events.StateFacts]
b:134 [binder, in ITree.Basics.CategoryTheory]
b:135 [binder, in ITree.Basics.CategoryOps]
b:135 [binder, in ITree.Basics.CategoryFacts]
B:135 [binder, in ITree.Basics.HeterogeneousRelations]
b:136 [binder, in ITree.Extra.ITrace.ITraceFacts]
B:138 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:138 [binder, in ITree.Extra.Secure.SecureStateHandler]
B:138 [binder, in ITree.Basics.HeterogeneousRelations]
B:14 [binder, in ITree.Basics.Function]
B:14 [binder, in ITree.Extra.IForest]
b:14 [binder, in ITree.Basics.CategoryOps]
B:14 [binder, in ITree.Interp.HandlerFacts]
b:140 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b:140 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:140 [binder, in ITree.Basics.CategoryFacts]
b:141 [binder, in ITree.Extra.ITrace.ITraceBind]
b:141 [binder, in ITree.Basics.CategoryOps]
B:141 [binder, in ITree.Basics.HeterogeneousRelations]
b:141 [binder, in ITree.Basics.CategoryTheory]
b:142 [binder, in ITree.Basics.CategoryFacts]
b:143 [binder, in ITree.Basics.CategoryOps]
B:143 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:143 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:144 [binder, in ITree.Events.StateFacts]
b:144 [binder, in ITree.Basics.CategoryFacts]
b:146 [binder, in ITree.Basics.CategoryOps]
b:147 [binder, in ITree.Extra.ITrace.ITraceBind]
B:148 [binder, in ITree.Basics.HeterogeneousRelations]
b:148 [binder, in ITree.Basics.CategoryTheory]
b:149 [binder, in ITree.Events.StateFacts]
B:149 [binder, in ITree.Eq.Rutt]
b:15 [binder, in ITree.Basics.CategoryKleisli]
B:15 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
b:150 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:150 [binder, in ITree.Basics.CategoryFacts]
b:151 [binder, in ITree.Extra.ITrace.ITraceFacts]
B:152 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:152 [binder, in ITree.Eq.Rutt]
b:154 [binder, in ITree.Eq.UpToTaus]
b:156 [binder, in ITree.Basics.CategoryFacts]
b:157 [binder, in ITree.Eq.UpToTaus]
B:158 [binder, in ITree.Extra.Secure.SecureStateHandler]
B:158 [binder, in ITree.Eq.Eqit]
b:159 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:159 [binder, in ITree.Basics.CategoryTheory]
B:16 [binder, in ITree.Eq.EuttExtras]
B:16 [binder, in ITree.Basics.Monad]
b:16 [binder, in ITree.Basics.CategoryKleisliFacts]
b:16 [binder, in ITree.Basics.MonadState]
B:16 [binder, in ITree.Basics.FunctionFacts]
b:161 [binder, in ITree.Basics.CategoryOps]
B:162 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:163 [binder, in ITree.Basics.CategoryFacts]
B:164 [binder, in ITree.Basics.HeterogeneousRelations]
b:165 [binder, in ITree.Basics.CategoryOps]
B:169 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:169 [binder, in ITree.Basics.HeterogeneousRelations]
b:17 [binder, in ITree.Extra.IForest]
b:17 [binder, in ITree.Axioms]
b:17 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:17 [binder, in ITree.Basics.CategoryFacts]
b:171 [binder, in ITree.Basics.CategoryFacts]
B:171 [binder, in ITree.Basics.HeterogeneousRelations]
b:172 [binder, in ITree.Basics.CategoryOps]
b:173 [binder, in ITree.Basics.CategoryTheory]
b:174 [binder, in ITree.Basics.CategoryFacts]
B:174 [binder, in ITree.Basics.HeterogeneousRelations]
B:176 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:177 [binder, in ITree.Basics.CategoryFacts]
B:178 [binder, in ITree.Basics.HeterogeneousRelations]
b:179 [binder, in ITree.Basics.CategoryOps]
B:18 [binder, in ITree.Props.EuttNoRet]
B:18 [binder, in ITree.Basics.HeterogeneousRelations]
b:18 [binder, in ITree.Basics.CategoryTheory]
b:180 [binder, in ITree.Basics.CategoryFacts]
b:180 [binder, in ITree.Basics.CategoryTheory]
b:183 [binder, in ITree.Basics.CategoryFacts]
B:183 [binder, in ITree.Basics.HeterogeneousRelations]
B:184 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:184 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:187 [binder, in ITree.Basics.CategoryFacts]
b:187 [binder, in ITree.Basics.CategoryTheory]
b:188 [binder, in ITree.Basics.CategoryOps]
B:188 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:189 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:189 [binder, in ITree.Basics.CategoryFacts]
b:19 [binder, in ITree.Basics.CategoryKleisliFacts]
b:19 [binder, in ITree.Basics.CategoryFunctor]
b:19 [binder, in ITree.Basics.CategoryRelations]
b:192 [binder, in ITree.Basics.CategoryFacts]
b:193 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:195 [binder, in ITree.Extra.ITrace.ITraceBind]
B:197 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:197 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:198 [binder, in ITree.Basics.CategoryTheory]
b:199 [binder, in ITree.Props.Finite]
B:2 [binder, in ITree.Basics.Function]
B:2 [binder, in ITree.Axioms]
B:2 [binder, in ITree.Interp.Handler]
B:2 [binder, in ITree.Interp.HandlerFacts]
B:2 [binder, in ITree.Indexed.Relation]
B:2 [binder, in ITree.Basics.FunctionFacts]
B:2 [binder, in ITree.Basics.HeterogeneousRelations]
b:20 [binder, in ITree.Axioms]
B:20 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
b:20 [binder, in ITree.Basics.MonadState]
B:20 [binder, in ITree.Eq.Rutt]
B:20 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
b:20 [binder, in ITree.Extra.ITrace.ITracePreds]
b:20 [binder, in ITree.Basics.CategorySub]
b:200 [binder, in ITree.Basics.CategoryOps]
B:202 [binder, in ITree.Basics.HeterogeneousRelations]
B:204 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:204 [binder, in ITree.Basics.CategoryFacts]
b:205 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:206 [binder, in ITree.Extra.ITrace.ITraceBind]
b:206 [binder, in ITree.Basics.CategoryOps]
b:207 [binder, in ITree.Props.Finite]
B:21 [binder, in ITree.Indexed.Relation]
b:210 [binder, in ITree.Basics.CategoryFacts]
b:211 [binder, in ITree.Basics.CategoryOps]
B:212 [binder, in ITree.Basics.HeterogeneousRelations]
b:213 [binder, in ITree.Extra.ITrace.ITraceFacts]
B:214 [binder, in ITree.Basics.HeterogeneousRelations]
b:215 [binder, in ITree.Basics.CategoryOps]
b:217 [binder, in ITree.Basics.CategoryTheory]
b:218 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:219 [binder, in ITree.Basics.CategoryFacts]
B:22 [binder, in ITree.Basics.Function]
b:22 [binder, in ITree.Basics.CategoryKleisliFacts]
B:22 [binder, in ITree.Basics.HeterogeneousRelations]
B:22 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
B:221 [binder, in ITree.Basics.HeterogeneousRelations]
b:222 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:223 [binder, in ITree.Extra.ITrace.ITraceBind]
B:225 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:226 [binder, in ITree.Basics.CategoryTheory]
B:228 [binder, in ITree.Basics.HeterogeneousRelations]
B:229 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:23 [binder, in ITree.Props.EuttNoRet]
b:230 [binder, in ITree.Basics.CategoryFacts]
b:231 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:233 [binder, in ITree.Extra.ITrace.ITraceBind]
B:235 [binder, in ITree.Basics.HeterogeneousRelations]
b:237 [binder, in ITree.Basics.CategoryFacts]
B:237 [binder, in ITree.Simple]
b:239 [binder, in ITree.Basics.CategoryTheory]
B:24 [binder, in ITree.Interp.Recursion]
b:24 [binder, in ITree.Extra.ITrace.ITraceDefinition]
b:24 [binder, in ITree.Basics.MonadState]
b:24 [binder, in ITree.Basics.CategorySub]
B:241 [binder, in ITree.Simple]
b:243 [binder, in ITree.Basics.CategoryTheory]
b:244 [binder, in ITree.Basics.CategoryFacts]
B:245 [binder, in ITree.Basics.HeterogeneousRelations]
B:246 [binder, in ITree.Simple]
b:247 [binder, in ITree.Basics.CategoryTheory]
B:249 [binder, in ITree.Basics.HeterogeneousRelations]
B:25 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:25 [binder, in ITree.Basics.Monad]
b:25 [binder, in ITree.Basics.CategoryKleisliFacts]
b:25 [binder, in ITree.Basics.CategoryFunctor]
b:25 [binder, in ITree.Props.EuttNoRet]
B:25 [binder, in ITree.Basics.CategoryRelations]
b:250 [binder, in ITree.Eq.Eqit]
b:251 [binder, in ITree.Basics.CategoryFacts]
b:252 [binder, in ITree.Extra.ITrace.ITraceBind]
b:253 [binder, in ITree.Extra.ITrace.ITraceBind]
b:253 [binder, in ITree.Basics.CategoryFacts]
B:255 [binder, in ITree.Basics.HeterogeneousRelations]
b:255 [binder, in ITree.Eq.Eqit]
b:256 [binder, in ITree.Basics.CategoryTheory]
b:257 [binder, in ITree.Basics.CategoryFacts]
B:26 [binder, in ITree.Basics.CategoryOps]
b:26 [binder, in ITree.Basics.CategoryKleisli]
b:26 [binder, in ITree.Props.Leaf]
B:26 [binder, in ITree.Indexed.Function]
b:26 [binder, in ITree.Eq.Rutt]
B:26 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
b:261 [binder, in ITree.Basics.CategoryTheory]
b:262 [binder, in ITree.Basics.CategoryFacts]
b:263 [binder, in ITree.Eq.Eqit]
b:267 [binder, in ITree.Basics.CategoryFacts]
B:267 [binder, in ITree.Basics.HeterogeneousRelations]
b:269 [binder, in ITree.Basics.CategoryFacts]
b:269 [binder, in ITree.Eq.Eqit]
b:27 [binder, in ITree.Extra.ITrace.ITraceBind]
B:27 [binder, in ITree.Extra.ITrace.ITraceDefinition]
B:27 [binder, in ITree.Indexed.Relation]
B:27 [binder, in ITree.Basics.HeterogeneousRelations]
b:271 [binder, in ITree.Basics.CategoryFacts]
b:274 [binder, in ITree.Eq.Eqit]
b:276 [binder, in ITree.Basics.CategoryTheory]
b:277 [binder, in ITree.Basics.CategoryFacts]
B:277 [binder, in ITree.Basics.HeterogeneousRelations]
B:279 [binder, in ITree.Basics.HeterogeneousRelations]
B:28 [binder, in ITree.Interp.Recursion]
B:28 [binder, in ITree.Basics.CategoryKleisliFacts]
B:28 [binder, in ITree.Props.EuttNoRet]
b:28 [binder, in ITree.Basics.MonadState]
B:28 [binder, in ITree.Extra.Dijkstra.StateSpecT]
b:280 [binder, in ITree.Basics.CategoryTheory]
b:282 [binder, in ITree.Eq.Eqit]
b:283 [binder, in ITree.Basics.CategoryFacts]
b:284 [binder, in ITree.Extra.IForest]
b:289 [binder, in ITree.Extra.IForest]
b:289 [binder, in ITree.Basics.CategoryFacts]
B:289 [binder, in ITree.Basics.HeterogeneousRelations]
B:29 [binder, in ITree.Basics.Function]
B:29 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
b:29 [binder, in ITree.Basics.CategorySub]
b:291 [binder, in ITree.Extra.ITrace.ITraceBind]
B:293 [binder, in ITree.Basics.HeterogeneousRelations]
B:294 [binder, in ITree.Extra.ITrace.ITraceBind]
b:295 [binder, in ITree.Basics.CategoryTheory]
B:298 [binder, in ITree.Extra.ITrace.ITraceBind]
b:298 [binder, in ITree.Basics.CategoryFacts]
b:299 [binder, in ITree.Basics.CategoryTheory]
B:3 [binder, in ITree.Core.KTreeFacts]
b:3 [binder, in ITree.Basics.CategoryKleisli]
B:3 [binder, in ITree.Props.EuttNoRet]
B:3 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
B:3 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
b:30 [binder, in ITree.Extra.Dijkstra.TracesIT]
b:30 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:30 [binder, in ITree.Basics.CategoryFacts]
b:30 [binder, in ITree.Basics.CategoryTheory]
b:301 [binder, in ITree.Basics.CategoryFacts]
b:303 [binder, in ITree.Basics.HeterogeneousRelations]
b:304 [binder, in ITree.Basics.CategoryFacts]
b:305 [binder, in ITree.Extra.ITrace.ITraceBind]
b:307 [binder, in ITree.Basics.CategoryFacts]
b:309 [binder, in ITree.Basics.HeterogeneousRelations]
B:31 [binder, in ITree.Basics.CategoryKleisliFacts]
b:31 [binder, in ITree.Basics.CategoryFunctor]
b:31 [binder, in ITree.Props.Leaf]
b:310 [binder, in ITree.Basics.CategoryFacts]
b:312 [binder, in ITree.Extra.ITrace.ITraceBind]
b:312 [binder, in ITree.Basics.CategoryTheory]
b:314 [binder, in ITree.Basics.CategoryFacts]
b:315 [binder, in ITree.Basics.CategoryTheory]
b:316 [binder, in ITree.Basics.CategoryFacts]
b:319 [binder, in ITree.Basics.CategoryFacts]
b:32 [binder, in ITree.Basics.CategoryOps]
b:32 [binder, in ITree.Basics.MonadState]
b:32 [binder, in ITree.Extra.Secure.SecureEqWcompat]
B:32 [binder, in ITree.Basics.CategoryRelations]
b:325 [binder, in ITree.Extra.ITrace.ITraceBind]
b:328 [binder, in ITree.Basics.CategoryTheory]
b:329 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
B:33 [binder, in ITree.Extra.ITrace.ITraceBind]
B:33 [binder, in ITree.Basics.Monad]
B:33 [binder, in ITree.Interp.Recursion]
B:33 [binder, in ITree.Indexed.Relation]
b:331 [binder, in ITree.Basics.CategoryFacts]
b:333 [binder, in ITree.Extra.ITrace.ITraceBind]
b:337 [binder, in ITree.Basics.CategoryFacts]
b:338 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b:338 [binder, in ITree.Basics.CategoryTheory]
B:34 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:34 [binder, in ITree.Extra.IForest]
b:34 [binder, in ITree.Events.ExceptionFacts]
B:34 [binder, in ITree.Props.EuttNoRet]
b:34 [binder, in ITree.Extra.Secure.SecureEqWcompat]
B:34 [binder, in ITree.Interp.RecursionFacts]
b:344 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
b:346 [binder, in ITree.Basics.CategoryFacts]
B:35 [binder, in ITree.Basics.Function]
b:35 [binder, in ITree.Basics.CategoryKleisli]
b:35 [binder, in ITree.Props.Leaf]
B:35 [binder, in ITree.Extra.Dijkstra.StateSpecT]
b:35 [binder, in ITree.Basics.CategoryFacts]
b:353 [binder, in ITree.Basics.CategoryTheory]
b:358 [binder, in ITree.Basics.CategoryTheory]
b:359 [binder, in ITree.Basics.CategoryFacts]
b:36 [binder, in ITree.Basics.Function]
B:36 [binder, in ITree.Basics.CategoryKleisliFacts]
B:36 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
b:363 [binder, in ITree.Basics.CategoryFacts]
b:365 [binder, in ITree.Basics.CategoryTheory]
b:368 [binder, in ITree.Basics.CategoryFacts]
B:37 [binder, in ITree.Props.Infinite]
b:37 [binder, in ITree.Basics.MonadState]
b:372 [binder, in ITree.Basics.CategoryTheory]
b:374 [binder, in ITree.Basics.CategoryFacts]
b:38 [binder, in ITree.Basics.CategoryOps]
B:38 [binder, in ITree.Extra.ITrace.ITraceDefinition]
B:38 [binder, in ITree.Interp.RecursionFacts]
b:381 [binder, in ITree.Basics.CategoryTheory]
b:383 [binder, in ITree.Basics.CategoryFacts]
b:384 [binder, in ITree.Basics.CategoryTheory]
b:386 [binder, in ITree.Basics.CategoryFacts]
b:39 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:39 [binder, in ITree.Interp.Recursion]
B:39 [binder, in ITree.Props.EuttNoRet]
B:39 [binder, in ITree.Indexed.Relation]
b:391 [binder, in ITree.Basics.CategoryFacts]
b:399 [binder, in ITree.Basics.CategoryFacts]
b:4 [binder, in ITree.Basics.Tacs]
B:4 [binder, in ITree.Basics.Function]
B:4 [binder, in ITree.Basics.FunctionFacts]
B:4 [binder, in ITree.Basics.HeterogeneousRelations]
B:40 [binder, in ITree.Basics.Function]
B:40 [binder, in ITree.Extra.IForest]
b:40 [binder, in ITree.Props.Infinite]
b:40 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:406 [binder, in ITree.Basics.CategoryFacts]
b:41 [binder, in ITree.Props.Leaf]
b:41 [binder, in ITree.Basics.MonadState]
B:41 [binder, in ITree.Extra.Dijkstra.StateSpecT]
b:411 [binder, in ITree.Basics.CategoryFacts]
B:413 [binder, in ITree.Extra.IForest]
b:415 [binder, in ITree.Extra.IForest]
b:416 [binder, in ITree.Basics.CategoryFacts]
B:42 [binder, in ITree.Extra.IForest]
B:42 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:42 [binder, in ITree.Basics.CategorySub]
B:42 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
B:422 [binder, in ITree.Extra.IForest]
b:422 [binder, in ITree.Basics.CategoryFacts]
b:426 [binder, in ITree.Extra.IForest]
b:428 [binder, in ITree.Basics.CategoryFacts]
b:43 [binder, in ITree.Basics.CategoryOps]
B:43 [binder, in ITree.Basics.CategoryKleisliFacts]
b:43 [binder, in ITree.Basics.CategoryFunctor]
B:43 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
B:43 [binder, in ITree.Interp.RecursionFacts]
B:430 [binder, in ITree.Extra.IForest]
b:431 [binder, in ITree.Basics.CategoryFacts]
b:433 [binder, in ITree.Extra.IForest]
b:434 [binder, in ITree.Basics.CategoryFacts]
B:437 [binder, in ITree.Extra.IForest]
B:44 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b:44 [binder, in ITree.Basics.MonadState]
b:441 [binder, in ITree.Extra.IForest]
B:445 [binder, in ITree.Extra.IForest]
b:448 [binder, in ITree.Extra.IForest]
B:45 [binder, in ITree.Indexed.Relation]
b:45 [binder, in ITree.Extra.Dijkstra.StateSpecT]
b:45 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:457 [binder, in ITree.Eq.Eqit]
B:46 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
B:46 [binder, in ITree.Extra.Secure.SecureEqHalt]
B:46 [binder, in ITree.Interp.Recursion]
b:46 [binder, in ITree.Basics.CategorySub]
B:460 [binder, in ITree.Extra.IForest]
b:460 [binder, in ITree.Eq.Eqit]
b:465 [binder, in ITree.Extra.IForest]
b:47 [binder, in ITree.Extra.Dijkstra.TracesIT]
b:47 [binder, in ITree.Basics.CategoryOps]
b:47 [binder, in ITree.Extra.ITrace.ITraceDefinition]
b:475 [binder, in ITree.Extra.IForest]
B:48 [binder, in ITree.Extra.Dijkstra.StateSpecT]
b:48 [binder, in ITree.Basics.CategoryFacts]
B:48 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
b:48 [binder, in ITree.Basics.CategorySub]
b:481 [binder, in ITree.Extra.IForest]
b:486 [binder, in ITree.Extra.IForest]
b:49 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:49 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:49 [binder, in ITree.Props.EuttNoRet]
b:49 [binder, in ITree.Basics.MonadState]
b:49 [binder, in ITree.Eq.Paco2]
b:5 [binder, in ITree.Basics.CategoryOps]
B:5 [binder, in ITree.Interp.HandlerFacts]
b:5 [binder, in ITree.Basics.MonadProp]
B:50 [binder, in ITree.Basics.CategoryKleisliFacts]
B:50 [binder, in ITree.Indexed.Relation]
b:50 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:50 [binder, in ITree.Basics.CategorySub]
B:50 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
b:51 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:51 [binder, in ITree.Extra.IForest]
b:51 [binder, in ITree.Basics.CategoryOps]
B:51 [binder, in ITree.Interp.Recursion]
B:51 [binder, in ITree.Props.Leaf]
b:51 [binder, in ITree.Basics.CategoryTheory]
b:51 [binder, in ITree.Extra.ITrace.ITracePreds]
b:514 [binder, in ITree.Extra.IForest]
B:519 [binder, in ITree.Extra.IForest]
b:52 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
b:52 [binder, in ITree.Extra.ITrace.ITraceBind]
B:52 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
b:52 [binder, in ITree.Events.State]
b:52 [binder, in ITree.Basics.CategorySub]
B:522 [binder, in ITree.Extra.IForest]
b:53 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:53 [binder, in ITree.Extra.IForest]
B:53 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
b:53 [binder, in ITree.Extra.ITrace.ITraceFacts]
B:533 [binder, in ITree.Extra.IForest]
b:54 [binder, in ITree.Basics.MonadState]
B:54 [binder, in ITree.Extra.Dijkstra.StateSpecT]
B:541 [binder, in ITree.Extra.IForest]
B:548 [binder, in ITree.Extra.IForest]
b:55 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:55 [binder, in ITree.Interp.Recursion]
b:55 [binder, in ITree.Props.EuttNoRet]
b:55 [binder, in ITree.Basics.CategoryRelations]
B:557 [binder, in ITree.Extra.IForest]
b:56 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b:56 [binder, in ITree.Extra.Secure.SecureEqHalt]
b:56 [binder, in ITree.Basics.CategoryOps]
B:56 [binder, in ITree.Basics.CategoryKleisliFacts]
b:56 [binder, in ITree.Props.Leaf]
b:56 [binder, in ITree.Props.EuttNoRet]
b:56 [binder, in ITree.Basics.MonadState]
B:56 [binder, in ITree.Extra.Secure.SecureStateHandler]
B:57 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:57 [binder, in ITree.Basics.CategoryTheory]
b:57 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
b:57 [binder, in ITree.Basics.CategorySub]
b:572 [binder, in ITree.Extra.IForest]
b:58 [binder, in ITree.Extra.ITrace.ITraceFacts]
B:59 [binder, in ITree.Core.KTreeFacts]
b:59 [binder, in ITree.Props.EuttNoRet]
B:59 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
b:6 [binder, in ITree.Basics.Tacs]
b:6 [binder, in ITree.Basics.CategoryKleisli]
B:6 [binder, in ITree.Eq.Rutt]
B:6 [binder, in ITree.Basics.FunctionFacts]
b:6 [binder, in ITree.Basics.CategorySub]
b:60 [binder, in ITree.Extra.Dijkstra.TracesIT]
b:60 [binder, in ITree.Props.EuttNoRet]
b:60 [binder, in ITree.Extra.ITrace.ITracePreds]
B:600 [binder, in ITree.Extra.IForest]
B:61 [binder, in ITree.Basics.CategoryKleisliFacts]
B:61 [binder, in ITree.Basics.CategoryRelations]
b:615 [binder, in ITree.Extra.IForest]
b:616 [binder, in ITree.Extra.IForest]
b:619 [binder, in ITree.Extra.IForest]
B:62 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:62 [binder, in ITree.Extra.IForest]
b:62 [binder, in ITree.Basics.MonadState]
b:623 [binder, in ITree.Extra.IForest]
B:624 [binder, in ITree.Eq.Eqit]
b:626 [binder, in ITree.Extra.IForest]
B:63 [binder, in ITree.Basics.CategoryKleisliFacts]
B:63 [binder, in ITree.Props.Infinite]
b:63 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
b:632 [binder, in ITree.Extra.IForest]
b:637 [binder, in ITree.Extra.IForest]
b:64 [binder, in ITree.Extra.ITrace.ITraceBind]
B:64 [binder, in ITree.Extra.IForest]
B:64 [binder, in ITree.Props.EuttNoRet]
B:64 [binder, in ITree.Extra.Dijkstra.StateSpecT]
b:64 [binder, in ITree.Basics.CategoryRelations]
b:65 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:65 [binder, in ITree.Events.StateFacts]
B:65 [binder, in ITree.Basics.CategoryKleisliFacts]
B:65 [binder, in ITree.Props.Leaf]
b:65 [binder, in ITree.Extra.ITrace.ITracePrefix]
B:65 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
B:65 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
B:66 [binder, in ITree.Core.KTreeFacts]
b:66 [binder, in ITree.Props.Infinite]
B:67 [binder, in ITree.Basics.CategoryKleisliFacts]
b:68 [binder, in ITree.Basics.MonadState]
b:68 [binder, in ITree.Basics.CategoryFacts]
B:69 [binder, in ITree.Core.KTreeFacts]
b:69 [binder, in ITree.Props.Leaf]
B:69 [binder, in ITree.Props.EuttNoRet]
b:69 [binder, in ITree.Basics.CategoryTheory]
B:7 [binder, in ITree.Extra.ITrace.ITraceBind]
B:7 [binder, in ITree.Basics.Function]
B:7 [binder, in ITree.Eq.EuttExtras]
b:7 [binder, in ITree.Basics.CategoryKleisliFacts]
b:7 [binder, in ITree.Basics.CategoryFunctor]
b:7 [binder, in ITree.Props.EuttNoRet]
B:7 [binder, in ITree.Basics.CategoryRelations]
b:70 [binder, in ITree.Extra.ITrace.ITraceBind]
B:70 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
b:71 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
b:71 [binder, in ITree.Basics.CategoryTheory]
B:72 [binder, in ITree.Core.KTreeFacts]
B:72 [binder, in ITree.Basics.CategoryRelations]
B:74 [binder, in ITree.Extra.Dijkstra.StateSpecT]
B:75 [binder, in ITree.Extra.IForest]
b:75 [binder, in ITree.Basics.CategoryRelations]
B:76 [binder, in ITree.Basics.CategoryKleisliFacts]
B:76 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:76 [binder, in ITree.Extra.ITrace.ITracePrefix]
b:77 [binder, in ITree.Basics.CategoryOps]
B:77 [binder, in ITree.Core.KTreeFacts]
b:77 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:77 [binder, in ITree.Basics.CategoryFacts]
b:78 [binder, in ITree.Extra.ITrace.ITracePreds]
B:79 [binder, in ITree.Basics.CategoryKleisliFacts]
b:79 [binder, in ITree.Props.Leaf]
B:79 [binder, in ITree.Props.EuttNoRet]
b:8 [binder, in ITree.Basics.Tacs]
b:8 [binder, in ITree.Extra.ITrace.ITracePrefix]
b:8 [binder, in ITree.Events.Nondeterminism]
B:8 [binder, in ITree.Interp.HandlerFacts]
b:8 [binder, in ITree.Basics.CategoryTheory]
b:8 [binder, in ITree.Basics.MonadProp]
b:8 [binder, in ITree.Basics.CategorySub]
b:80 [binder, in ITree.Extra.Dijkstra.TracesIT]
b:80 [binder, in ITree.Extra.ITrace.ITraceBind]
B:80 [binder, in ITree.Core.KTreeFacts]
B:80 [binder, in ITree.Extra.Dijkstra.StateSpecT]
B:807 [binder, in ITree.Eq.Eqit]
b:81 [binder, in ITree.Extra.ITrace.ITracePrefix]
B:812 [binder, in ITree.Eq.Eqit]
b:82 [binder, in ITree.Basics.CategoryOps]
b:82 [binder, in ITree.Basics.CategoryTheory]
b:82 [binder, in ITree.Extra.ITrace.ITracePreds]
b:824 [binder, in ITree.Eq.Eqit]
B:828 [binder, in ITree.Eq.Eqit]
B:83 [binder, in ITree.Basics.CategoryKleisliFacts]
B:83 [binder, in ITree.Props.Finite]
b:83 [binder, in ITree.Basics.CategoryFacts]
b:831 [binder, in ITree.Eq.Eqit]
B:835 [binder, in ITree.Eq.Eqit]
b:838 [binder, in ITree.Eq.Eqit]
B:844 [binder, in ITree.Eq.Eqit]
B:85 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:859 [binder, in ITree.Eq.Eqit]
B:86 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b:86 [binder, in ITree.Extra.Dijkstra.TracesIT]
b:86 [binder, in ITree.Extra.ITrace.ITraceBind]
B:86 [binder, in ITree.Extra.Secure.SecureEqHalt]
b:86 [binder, in ITree.Basics.CategoryOps]
B:86 [binder, in ITree.Basics.CategoryKleisliFacts]
b:86 [binder, in ITree.Props.Leaf]
b:86 [binder, in ITree.Basics.CategoryTheory]
B:87 [binder, in ITree.Eq.Shallow]
B:870 [binder, in ITree.Eq.Eqit]
B:882 [binder, in ITree.Eq.Eqit]
b:89 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:89 [binder, in ITree.Core.KTreeFacts]
B:89 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:894 [binder, in ITree.Eq.Eqit]
b:9 [binder, in ITree.Basics.CategoryKleisliFacts]
B:9 [binder, in ITree.Eq.Rutt]
b:9 [binder, in ITree.Basics.CategoryFacts]
b:9 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
B:9 [binder, in ITree.Basics.CategoryRelations]
b:90 [binder, in ITree.Basics.CategoryOps]
B:90 [binder, in ITree.Basics.CategoryKleisliFacts]
B:90 [binder, in ITree.Extra.Secure.SecureStateHandler]
B:902 [binder, in ITree.Eq.Eqit]
b:91 [binder, in ITree.Extra.Dijkstra.TracesIT]
b:91 [binder, in ITree.Extra.ITrace.ITracePrefix]
B:92 [binder, in ITree.Events.ExceptionFacts]
b:92 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:92 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:92 [binder, in ITree.Basics.CategoryFacts]
b:94 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
b:94 [binder, in ITree.Extra.Secure.SecureEqHalt]
B:94 [binder, in ITree.Basics.CategoryKleisliFacts]
B:94 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:95 [binder, in ITree.Extra.Dijkstra.TracesIT]
B:95 [binder, in ITree.Props.Finite]
B:95 [binder, in ITree.Extra.Secure.SecureStateHandler]
b:95 [binder, in ITree.Basics.CategoryRelations]
B:96 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
B:96 [binder, in ITree.Extra.Secure.SecureEqHalt]
b:97 [binder, in ITree.Extra.ITrace.ITracePrefix]
B:98 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
b:98 [binder, in ITree.Extra.ITrace.ITraceFacts]
b:98 [binder, in ITree.Basics.CategoryRelations]
B:99 [binder, in ITree.Extra.ITrace.ITracePreds]

C

call [definition, in ITree.Interp.Recursion]
Call [constructor, in ITree.Interp.Recursion]
callE [inductive, in ITree.Interp.Recursion]
calling [definition, in ITree.Interp.Recursion]
calling' [definition, in ITree.Interp.Recursion]
can_return_Vis [constructor, in ITree.Events.State]
can_return_Tau [constructor, in ITree.Events.State]
can_return_Ret [constructor, in ITree.Events.State]
can_return [inductive, in ITree.Events.State]
Carrier [module, in ITree.Basics.CategoryOps]
Carrier.binop [abbreviation, in ITree.Basics.CategoryOps]
Carrier.Hom [abbreviation, in ITree.Basics.CategoryOps]
CartesianClosed [section, in ITree.Basics.CategoryOps]
CartesianClosed [record, in ITree.Basics.CategoryTheory]
CartesianClosed_Fun [instance, in ITree.Basics.FunctionFacts]
CartesianClosure [section, in ITree.Basics.FunctionFacts]
CartesianClosureLaws [section, in ITree.Basics.CategoryTheory]
CartesianConstruct [section, in ITree.Basics.CategoryOps]
CartesianConstruct.Fst_PROD [variable, in ITree.Basics.CategoryOps]
CartesianConstruct.Id_C [variable, in ITree.Basics.CategoryOps]
CartesianConstruct.PROD [variable, in ITree.Basics.CategoryOps]
CartesianConstruct.Prod_PROD [variable, in ITree.Basics.CategoryOps]
CartesianConstruct.Snd_PROD [variable, in ITree.Basics.CategoryOps]
CartesianConstruct.T [variable, in ITree.Basics.CategoryOps]
CartesianConstruct.Terminal_T [variable, in ITree.Basics.CategoryOps]
cartesian_proper_curry_ [projection, in ITree.Basics.CategoryTheory]
cartesian_curry_apply [projection, in ITree.Basics.CategoryTheory]
cartesian_product [projection, in ITree.Basics.CategoryTheory]
cartesian_terminal [projection, in ITree.Basics.CategoryTheory]
Case [record, in ITree.Basics.CategoryOps]
Case [inductive, in ITree.Basics.CategoryOps]
CaseInl [record, in ITree.Basics.CategoryTheory]
CaseInl [inductive, in ITree.Basics.CategoryTheory]
CaseInl_Handler [instance, in ITree.Interp.HandlerFacts]
CaseInl_rel [instance, in ITree.Basics.CategoryRelations]
CaseInr [record, in ITree.Basics.CategoryTheory]
CaseInr [inductive, in ITree.Basics.CategoryTheory]
CaseInr_Handler [instance, in ITree.Interp.HandlerFacts]
CaseInr_rel [instance, in ITree.Basics.CategoryRelations]
CaseUniversal [record, in ITree.Basics.CategoryTheory]
CaseUniversal [inductive, in ITree.Basics.CategoryTheory]
CaseUniversal_Handler [instance, in ITree.Interp.HandlerFacts]
CaseUniversal_rel [instance, in ITree.Basics.CategoryRelations]
case_sum [instance, in ITree.Basics.Function]
case_iforest_handler_correct [lemma, in ITree.Extra.IForest]
Case_bif:183 [binder, in ITree.Basics.CategoryOps]
case__ [abbreviation, in ITree.Basics.CategoryOps]
case_ [projection, in ITree.Basics.CategoryOps]
case_ [constructor, in ITree.Basics.CategoryOps]
case_r' [lemma, in ITree.Basics.CategoryKleisliFacts]
case_r [lemma, in ITree.Basics.CategoryKleisliFacts]
case_l' [lemma, in ITree.Basics.CategoryKleisliFacts]
case_l [lemma, in ITree.Basics.CategoryKleisliFacts]
case_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
Case_Kleisli [instance, in ITree.Basics.CategoryKleisli]
Case_sum1_Handler [instance, in ITree.Interp.Handler]
Case_sum1 [instance, in ITree.Indexed.Function]
case_sum1 [definition, in ITree.Indexed.Function]
Case_C:352 [binder, in ITree.Basics.CategoryFacts]
case_eta' [lemma, in ITree.Basics.CategoryFacts]
case_eta [lemma, in ITree.Basics.CategoryFacts]
case_inr' [lemma, in ITree.Basics.CategoryFacts]
case_inl' [lemma, in ITree.Basics.CategoryFacts]
Case_C:98 [binder, in ITree.Basics.CategoryFacts]
case_rel [inductive, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Case_rel [instance, in ITree.Basics.CategoryRelations]
Case_C:347 [binder, in ITree.Basics.CategoryTheory]
case_universal [projection, in ITree.Basics.CategoryTheory]
case_universal [constructor, in ITree.Basics.CategoryTheory]
case_inr [projection, in ITree.Basics.CategoryTheory]
case_inr [constructor, in ITree.Basics.CategoryTheory]
case_inl [projection, in ITree.Basics.CategoryTheory]
case_inl [constructor, in ITree.Basics.CategoryTheory]
Case_C:129 [binder, in ITree.Basics.CategoryTheory]
Case_sub [instance, in ITree.Basics.CategorySub]
Case_C:34 [binder, in ITree.Basics.CategorySub]
cat [projection, in ITree.Basics.CategoryOps]
Cat [record, in ITree.Basics.CategoryOps]
cat [constructor, in ITree.Basics.CategoryOps]
Cat [inductive, in ITree.Basics.CategoryOps]
CatAssoc [record, in ITree.Basics.CategoryTheory]
CatAssoc [inductive, in ITree.Basics.CategoryTheory]
CatAssoc_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
CatAssoc_Handler [instance, in ITree.Interp.HandlerFacts]
CatAssoc_C:11 [binder, in ITree.Basics.CategoryFacts]
CatAssoc_rel [instance, in ITree.Basics.CategoryRelations]
catch_body:20 [binder, in ITree.Events.Exception]
CatC:49 [binder, in ITree.Basics.CategoryTheory]
CatC:5 [binder, in ITree.Basics.CategoryFacts]
CatC:5 [binder, in ITree.Basics.CategoryTheory]
CatC:67 [binder, in ITree.Basics.CategoryTheory]
CatC:79 [binder, in ITree.Basics.CategoryTheory]
Category [record, in ITree.Basics.CategoryTheory]
Category [library]
CategoryFacts [section, in ITree.Basics.CategoryFacts]
CategoryFacts [library]
CategoryFunctor [library]
CategoryKleisli [library]
CategoryKleisliFacts [library]
CategoryOps [library]
CategoryRelations [library]
CategorySub [library]
CategoryTheory [library]
Category_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
Category_Handler [instance, in ITree.Interp.HandlerFacts]
Category_Fun [instance, in ITree.Basics.FunctionFacts]
Category_C:350 [binder, in ITree.Basics.CategoryFacts]
Category_C:223 [binder, in ITree.Basics.CategoryFacts]
Category_C:96 [binder, in ITree.Basics.CategoryFacts]
Category_C:72 [binder, in ITree.Basics.CategoryFacts]
Category_rel [instance, in ITree.Basics.CategoryRelations]
category_proper_cat [projection, in ITree.Basics.CategoryTheory]
category_cat_assoc [projection, in ITree.Basics.CategoryTheory]
category_cat_id_r [projection, in ITree.Basics.CategoryTheory]
category_cat_id_l [projection, in ITree.Basics.CategoryTheory]
Category_C:54 [binder, in ITree.Basics.CategorySub]
Category_sub [instance, in ITree.Basics.CategorySub]
Category_C:44 [binder, in ITree.Basics.CategorySub]
CatIdL [record, in ITree.Basics.CategoryTheory]
CatIdL [inductive, in ITree.Basics.CategoryTheory]
CatIdL_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
CatIdL_Handler [instance, in ITree.Interp.HandlerFacts]
CatIdL_C:6 [binder, in ITree.Basics.CategoryFacts]
CatIdL_rel [instance, in ITree.Basics.CategoryRelations]
CatIdR [record, in ITree.Basics.CategoryTheory]
CatIdR [inductive, in ITree.Basics.CategoryTheory]
CatIdR_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
CatIdR_Handler [instance, in ITree.Interp.HandlerFacts]
CatIdR_rel [instance, in ITree.Basics.CategoryRelations]
CatLaws [section, in ITree.Basics.CategoryTheory]
CatNotations [module, in ITree.Basics.CategoryOps]
_ >>> _ (cat_scope) [notation, in ITree.Basics.CategoryOps]
_ ⩯ _ (cat_scope) [notation, in ITree.Basics.CategoryOps]
CatOps [section, in ITree.Basics.CategoryOps]
Cat_Fun [instance, in ITree.Basics.Function]
Cat_C:182 [binder, in ITree.Basics.CategoryOps]
Cat_C:129 [binder, in ITree.Basics.CategoryOps]
Cat_C:101 [binder, in ITree.Basics.CategoryOps]
cat_iter [lemma, in ITree.Core.KTreeFacts]
cat_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
Cat_Kleisli [instance, in ITree.Basics.CategoryKleisli]
Cat_Handler [instance, in ITree.Interp.Handler]
Cat_IFun [instance, in ITree.Indexed.Function]
cat_Fun_assoc [instance, in ITree.Basics.FunctionFacts]
cat_Fun_CatIdR [instance, in ITree.Basics.FunctionFacts]
cat_Fun_CatIdL [instance, in ITree.Basics.FunctionFacts]
cat_eq2_r [lemma, in ITree.Basics.CategoryFacts]
cat_eq2_l [lemma, in ITree.Basics.CategoryFacts]
cat_from_loop [lemma, in ITree.Basics.CategoryFacts]
Cat_C:349 [binder, in ITree.Basics.CategoryFacts]
Cat_C:222 [binder, in ITree.Basics.CategoryFacts]
cat_case [lemma, in ITree.Basics.CategoryFacts]
Cat_C:95 [binder, in ITree.Basics.CategoryFacts]
Cat_C:71 [binder, in ITree.Basics.CategoryFacts]
Cat_C:51 [binder, in ITree.Basics.CategoryFacts]
Cat_rel [instance, in ITree.Basics.CategoryRelations]
Cat_C:345 [binder, in ITree.Basics.CategoryTheory]
Cat_C:307 [binder, in ITree.Basics.CategoryTheory]
Cat_C:233 [binder, in ITree.Basics.CategoryTheory]
Cat_C:205 [binder, in ITree.Basics.CategoryTheory]
Cat_C:166 [binder, in ITree.Basics.CategoryTheory]
Cat_C:127 [binder, in ITree.Basics.CategoryTheory]
Cat_C:96 [binder, in ITree.Basics.CategoryTheory]
Cat_Op [instance, in ITree.Basics.CategoryTheory]
cat_assoc [projection, in ITree.Basics.CategoryTheory]
cat_assoc [constructor, in ITree.Basics.CategoryTheory]
cat_id_r [projection, in ITree.Basics.CategoryTheory]
cat_id_r [constructor, in ITree.Basics.CategoryTheory]
cat_id_l [projection, in ITree.Basics.CategoryTheory]
cat_id_l [constructor, in ITree.Basics.CategoryTheory]
Cat_sub [instance, in ITree.Basics.CategorySub]
Cat_C:15 [binder, in ITree.Basics.CategorySub]
ca':121 [binder, in ITree.Events.StateFacts]
ca:120 [binder, in ITree.Events.StateFacts]
ca:133 [binder, in ITree.Interp.InterpFacts]
ca:140 [binder, in ITree.Events.StateFacts]
ca:233 [binder, in ITree.Basics.CategoryFacts]
ca:240 [binder, in ITree.Basics.CategoryFacts]
cb:234 [binder, in ITree.Basics.CategoryFacts]
cb:241 [binder, in ITree.Basics.CategoryFacts]
cb:95 [binder, in ITree.Core.KTreeFacts]
cb:97 [binder, in ITree.Core.KTreeFacts]
cd:108 [binder, in ITree.Basics.CategoryFacts]
cd:115 [binder, in ITree.Basics.CategoryFacts]
cd:122 [binder, in ITree.Basics.CategoryFacts]
cd:208 [binder, in ITree.Basics.CategoryFacts]
cd:214 [binder, in ITree.Basics.CategoryFacts]
cd:335 [binder, in ITree.Basics.CategoryFacts]
cd:341 [binder, in ITree.Basics.CategoryFacts]
cd:396 [binder, in ITree.Basics.CategoryFacts]
cd:402 [binder, in ITree.Basics.CategoryFacts]
cd:439 [binder, in ITree.Basics.CategoryFacts]
CHECK:21 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:21 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:21 [binder, in ITree.Extra.Secure.SecureEqHalt]
CHECK:24 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:24 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:24 [binder, in ITree.Extra.Secure.SecureEqHalt]
CHECK:27 [binder, in ITree.Eq.Eqit]
CHECK:31 [binder, in ITree.Eq.Eqit]
CHECK:57 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:61 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:61 [binder, in ITree.Extra.Secure.SecureEqHalt]
CHECK:64 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:69 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:69 [binder, in ITree.Extra.Secure.SecureEqHalt]
choice [definition, in ITree.Axioms]
choose [definition, in ITree.Events.Nondeterminism]
choose1 [definition, in ITree.Events.Nondeterminism]
CIHH:133 [binder, in ITree.Eq.UpToTaus]
CIHH:149 [binder, in ITree.Eq.UpToTaus]
CIHL:130 [binder, in ITree.Eq.UpToTaus]
CIHL:145 [binder, in ITree.Eq.UpToTaus]
CIH:137 [binder, in ITree.Extra.ITrace.ITraceFacts]
classic [definition, in ITree.Axioms]
classicT_inhabited [lemma, in ITree.Axioms]
classicT:113 [binder, in ITree.Extra.ITrace.ITraceFacts]
classicT:2 [binder, in ITree.Extra.ITrace.ITraceBind]
classic_converge [lemma, in ITree.Props.Infinite]
classic_wf [lemma, in ITree.Extra.Dijkstra.IterRel]
classic_converge_itrace [lemma, in ITree.Extra.ITrace.ITraceFacts]
classic_empty [lemma, in ITree.Extra.ITrace.ITraceFacts]
classic_empty [definition, in ITree.Extra.Secure.SecureEqEuttHalt]
classic_empty [lemma, in ITree.Extra.Secure.Labels]
CLOD:95 [binder, in ITree.Eq.UpToTaus]
CLOL:92 [binder, in ITree.Eq.UpToTaus]
CLOL:94 [binder, in ITree.Eq.UpToTaus]
CLOR:104 [binder, in ITree.Eq.UpToTaus]
CLOR:107 [binder, in ITree.Eq.UpToTaus]
CLOV:93 [binder, in ITree.Eq.UpToTaus]
clo:160 [binder, in ITree.Eq.Eqit]
clo:26 [binder, in ITree.Eq.Paco2]
clo:57 [binder, in ITree.Eq.UpToTaus]
CMP:117 [binder, in ITree.Props.Leaf]
CMP:232 [binder, in ITree.Eq.Eqit]
CMP:243 [binder, in ITree.Eq.Eqit]
CMP:366 [binder, in ITree.Extra.IForest]
CMP:682 [binder, in ITree.Eq.Eqit]
CM:14 [binder, in ITree.Basics.MonadState]
CocartesianConstruct [section, in ITree.Basics.CategoryOps]
CocartesianConstruct.Coprod_SUM [variable, in ITree.Basics.CategoryOps]
CocartesianConstruct.I [variable, in ITree.Basics.CategoryOps]
CocartesianConstruct.Id_C [variable, in ITree.Basics.CategoryOps]
CocartesianConstruct.Initial_I [variable, in ITree.Basics.CategoryOps]
CocartesianConstruct.Inl_SUM [variable, in ITree.Basics.CategoryOps]
CocartesianConstruct.Inr_SUM [variable, in ITree.Basics.CategoryOps]
CocartesianConstruct.SUM [variable, in ITree.Basics.CategoryOps]
CocartesianOps [section, in ITree.Basics.CategoryOps]
Cofinite [library]
combine_prepost [lemma, in ITree.Extra.Dijkstra.StateDelaySpec]
combine_prepost_aux [lemma, in ITree.Extra.Dijkstra.StateDelaySpec]
compose_pure_r [lemma, in ITree.Basics.CategoryKleisliFacts]
compose_pure_l [lemma, in ITree.Basics.CategoryKleisliFacts]
compose_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
compose_assoc [lemma, in ITree.Basics.HeterogeneousRelations]
COMP:90 [binder, in ITree.Eq.UpToTaus]
Concurrency [library]
Cons [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
ConsF [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
cons_found [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
cons_search [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
cont_a [constructor, in ITree.Extra.Dijkstra.PureITreeDijkstra]
cont_a_pred_resp_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
cont_visF [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
cont_vis [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
converge_trace_prefix [lemma, in ITree.Extra.ITrace.ITracePrefix]
converge_itrace_ev_list [lemma, in ITree.Extra.ITrace.ITraceFacts]
conv_vis [constructor, in ITree.Props.Infinite]
conv_ret [constructor, in ITree.Props.Infinite]
Coproduct [record, in ITree.Basics.CategoryTheory]
CoproductFacts [section, in ITree.Basics.CategoryFacts]
CoproductLaws [section, in ITree.Basics.CategoryTheory]
Coproduct_C:96 [binder, in ITree.Basics.CategoryOps]
Coproduct_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
Coproduct_Handler [instance, in ITree.Interp.HandlerFacts]
Coproduct_Fun [instance, in ITree.Basics.FunctionFacts]
Coproduct_C:355 [binder, in ITree.Basics.CategoryFacts]
Coproduct_C:101 [binder, in ITree.Basics.CategoryFacts]
Coproduct_rel [instance, in ITree.Basics.CategoryRelations]
coproduct_proper_case [projection, in ITree.Basics.CategoryTheory]
coproduct_case_universal [projection, in ITree.Basics.CategoryTheory]
coproduct_case_inr [projection, in ITree.Basics.CategoryTheory]
coproduct_case_inl [projection, in ITree.Basics.CategoryTheory]
Coproduct_sub [instance, in ITree.Basics.CategorySub]
Coproduct_C:55 [binder, in ITree.Basics.CategorySub]
coprod_split [lemma, in ITree.Basics.CategoryFacts]
Counterexamples [module, in ITree.Props.Finite]
Counterexamples.DFk [lemma, in ITree.Props.Finite]
Counterexamples.DFt [lemma, in ITree.Props.Finite]
Counterexamples.fail [abbreviation, in ITree.Props.Finite]
Counterexamples.fail_not_any_finite [lemma, in ITree.Props.Finite]
Counterexamples.fail_all_finite [lemma, in ITree.Props.Finite]
Counterexamples.k [definition, in ITree.Props.Finite]
Counterexamples.NotDFtk [lemma, in ITree.Props.Finite]
Counterexamples.spin_not_any_finite [lemma, in ITree.Props.Finite]
Counterexamples.t [definition, in ITree.Props.Finite]
crl [constructor, in ITree.Extra.Secure.SecureEqProgInsensFacts]
crr [constructor, in ITree.Extra.Secure.SecureEqProgInsensFacts]
ctx:120 [binder, in ITree.Simple]
ctx:126 [binder, in ITree.Simple]
ctx:17 [binder, in ITree.Interp.Recursion]
ctx:255 [binder, in ITree.Simple]
ctx:260 [binder, in ITree.Simple]
ctx:3 [binder, in ITree.Interp.Recursion]
ctx:3 [binder, in ITree.Interp.RecursionFacts]
ctx:51 [binder, in ITree.Interp.RecursionFacts]
ctx:9 [binder, in ITree.Interp.Recursion]
Curry [record, in ITree.Basics.CategoryOps]
Curry [inductive, in ITree.Basics.CategoryOps]
CurryApply [record, in ITree.Basics.CategoryTheory]
CurryApply [inductive, in ITree.Basics.CategoryTheory]
CurryApply_Fun [instance, in ITree.Basics.FunctionFacts]
Curry_Fun [instance, in ITree.Basics.Function]
curry_ [projection, in ITree.Basics.CategoryOps]
curry_ [constructor, in ITree.Basics.CategoryOps]
curry_apply [projection, in ITree.Basics.CategoryTheory]
curry_apply [constructor, in ITree.Basics.CategoryTheory]
Curry_C:214 [binder, in ITree.Basics.CategoryTheory]
curry_sig [lemma, in ITree.Eq.Paco2]
c':292 [binder, in ITree.Basics.CategoryFacts]
c':376 [binder, in ITree.Basics.CategoryFacts]
c':67 [binder, in ITree.Basics.CategoryRelations]
c':78 [binder, in ITree.Basics.CategoryRelations]
c1:100 [binder, in ITree.Basics.CategoryKleisliFacts]
c1:108 [binder, in ITree.Basics.CategoryKleisliFacts]
c1:108 [binder, in ITree.Basics.CategoryTheory]
C1:28 [binder, in ITree.Basics.CategoryFunctor]
C1:297 [binder, in ITree.Extra.IForest]
C1:3 [binder, in ITree.Basics.CategoryFunctor]
c2:101 [binder, in ITree.Basics.CategoryKleisliFacts]
c2:109 [binder, in ITree.Basics.CategoryKleisliFacts]
c2:109 [binder, in ITree.Basics.CategoryTheory]
C2:29 [binder, in ITree.Basics.CategoryFunctor]
C2:298 [binder, in ITree.Extra.IForest]
C2:4 [binder, in ITree.Basics.CategoryFunctor]
C:10 [binder, in ITree.Basics.CategoryRelations]
C:100 [binder, in ITree.Basics.CategoryOps]
c:102 [binder, in ITree.Basics.CategoryRelations]
c:104 [binder, in ITree.Basics.CategoryFacts]
c:105 [binder, in ITree.Basics.CategoryRelations]
c:108 [binder, in ITree.Basics.CategoryOps]
c:108 [binder, in ITree.Basics.CategoryRelations]
C:11 [binder, in ITree.Basics.FunctionFacts]
c:111 [binder, in ITree.Basics.CategoryFacts]
c:113 [binder, in ITree.Basics.CategoryRelations]
c:115 [binder, in ITree.Basics.CategoryKleisliFacts]
c:116 [binder, in ITree.Basics.CategoryOps]
c:118 [binder, in ITree.Basics.CategoryFacts]
c:119 [binder, in ITree.Basics.CategoryOps]
c:120 [binder, in ITree.Basics.CategoryTheory]
c:122 [binder, in ITree.Core.KTreeFacts]
C:124 [binder, in ITree.Basics.CategoryTheory]
c:127 [binder, in ITree.Basics.CategoryFacts]
C:128 [binder, in ITree.Basics.CategoryOps]
c:13 [binder, in ITree.Events.FailFacts]
c:13 [binder, in ITree.Basics.CategoryRelations]
C:130 [binder, in ITree.Interp.InterpFacts]
c:131 [binder, in ITree.Basics.CategoryFacts]
C:135 [binder, in ITree.Events.StateFacts]
c:135 [binder, in ITree.Basics.CategoryTheory]
c:136 [binder, in ITree.Basics.CategoryOps]
c:136 [binder, in ITree.Basics.CategoryFacts]
c:14 [binder, in ITree.Basics.FunctionFacts]
c:14 [binder, in ITree.Basics.CategoryFacts]
C:142 [binder, in ITree.Basics.HeterogeneousRelations]
c:142 [binder, in ITree.Basics.CategoryTheory]
c:144 [binder, in ITree.Basics.CategoryOps]
c:145 [binder, in ITree.Basics.CategoryFacts]
c:147 [binder, in ITree.Basics.CategoryOps]
C:149 [binder, in ITree.Basics.HeterogeneousRelations]
c:149 [binder, in ITree.Basics.CategoryTheory]
C:15 [binder, in ITree.Basics.Function]
c:15 [binder, in ITree.Basics.CategoryOps]
C:15 [binder, in ITree.Interp.HandlerFacts]
c:151 [binder, in ITree.Basics.CategoryFacts]
C:156 [binder, in ITree.Basics.CategoryOps]
c:157 [binder, in ITree.Basics.CategoryFacts]
C:159 [binder, in ITree.Eq.Eqit]
c:160 [binder, in ITree.Basics.CategoryTheory]
C:163 [binder, in ITree.Basics.CategoryTheory]
c:165 [binder, in ITree.Basics.CategoryFacts]
C:165 [binder, in ITree.Basics.HeterogeneousRelations]
c:166 [binder, in ITree.Basics.CategoryOps]
C:169 [binder, in ITree.Basics.CategoryOps]
c:17 [binder, in ITree.Basics.CategoryKleisliFacts]
C:17 [binder, in ITree.Basics.FunctionFacts]
c:172 [binder, in ITree.Basics.CategoryFacts]
c:174 [binder, in ITree.Basics.CategoryTheory]
C:175 [binder, in ITree.Basics.CategoryOps]
c:175 [binder, in ITree.Basics.CategoryFacts]
c:178 [binder, in ITree.Basics.CategoryFacts]
c:18 [binder, in ITree.Basics.CategoryFacts]
c:181 [binder, in ITree.Basics.CategoryFacts]
c:181 [binder, in ITree.Basics.CategoryTheory]
c:184 [binder, in ITree.Basics.CategoryFacts]
c:188 [binder, in ITree.Basics.CategoryTheory]
c:189 [binder, in ITree.Basics.CategoryOps]
c:19 [binder, in ITree.Basics.CategoryTheory]
c:190 [binder, in ITree.Basics.CategoryFacts]
C:192 [binder, in ITree.Basics.CategoryOps]
c:193 [binder, in ITree.Basics.CategoryFacts]
c:199 [binder, in ITree.Basics.CategoryTheory]
C:2 [binder, in ITree.Basics.CategoryOps]
C:2 [binder, in ITree.Basics.CategoryFacts]
C:2 [binder, in ITree.Basics.CategoryTheory]
C:2 [binder, in ITree.Basics.CategorySub]
c:20 [binder, in ITree.Basics.CategoryKleisliFacts]
c:20 [binder, in ITree.Basics.CategoryFunctor]
c:20 [binder, in ITree.Basics.CategoryRelations]
C:202 [binder, in ITree.Basics.CategoryTheory]
C:203 [binder, in ITree.Basics.HeterogeneousRelations]
C:205 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
c:205 [binder, in ITree.Basics.CategoryFacts]
c:207 [binder, in ITree.Basics.CategoryOps]
c:211 [binder, in ITree.Basics.CategoryFacts]
c:212 [binder, in ITree.Basics.CategoryOps]
c:216 [binder, in ITree.Basics.CategoryOps]
C:216 [binder, in ITree.Basics.CategoryFacts]
c:218 [binder, in ITree.Basics.CategoryTheory]
c:227 [binder, in ITree.Basics.CategoryTheory]
C:23 [binder, in ITree.Basics.Function]
c:23 [binder, in ITree.Basics.CategoryKleisliFacts]
c:23 [binder, in ITree.Interp.RecursionFacts]
C:230 [binder, in ITree.Basics.CategoryTheory]
c:231 [binder, in ITree.Basics.CategoryFacts]
C:236 [binder, in ITree.Basics.HeterogeneousRelations]
c:238 [binder, in ITree.Basics.CategoryFacts]
c:240 [binder, in ITree.Basics.CategoryTheory]
c:244 [binder, in ITree.Basics.CategoryTheory]
c:245 [binder, in ITree.Basics.CategoryFacts]
C:246 [binder, in ITree.Basics.HeterogeneousRelations]
c:248 [binder, in ITree.Basics.CategoryTheory]
C:250 [binder, in ITree.Basics.HeterogeneousRelations]
c:254 [binder, in ITree.Basics.CategoryFacts]
c:258 [binder, in ITree.Basics.CategoryFacts]
C:26 [binder, in ITree.Basics.Monad]
c:26 [binder, in ITree.Basics.CategoryKleisliFacts]
C:26 [binder, in ITree.Basics.CategoryRelations]
c:263 [binder, in ITree.Basics.CategoryFacts]
C:268 [binder, in ITree.Basics.HeterogeneousRelations]
c:27 [binder, in ITree.Basics.CategoryKleisli]
C:27 [binder, in ITree.Indexed.Function]
c:272 [binder, in ITree.Basics.CategoryFacts]
c:278 [binder, in ITree.Basics.CategoryFacts]
C:28 [binder, in ITree.Basics.CategoryOps]
C:280 [binder, in ITree.Basics.HeterogeneousRelations]
c:281 [binder, in ITree.Basics.CategoryTheory]
c:284 [binder, in ITree.Basics.CategoryFacts]
C:290 [binder, in ITree.Basics.HeterogeneousRelations]
c:291 [binder, in ITree.Basics.CategoryFacts]
C:294 [binder, in ITree.Basics.HeterogeneousRelations]
c:299 [binder, in ITree.Basics.CategoryFacts]
C:3 [binder, in ITree.Interp.HandlerFacts]
C:30 [binder, in ITree.Basics.Function]
c:300 [binder, in ITree.Basics.CategoryTheory]
c:302 [binder, in ITree.Basics.CategoryFacts]
C:304 [binder, in ITree.Basics.CategoryTheory]
c:305 [binder, in ITree.Basics.CategoryFacts]
c:308 [binder, in ITree.Basics.CategoryFacts]
c:31 [binder, in ITree.Basics.CategoryFacts]
c:31 [binder, in ITree.Basics.CategoryTheory]
c:311 [binder, in ITree.Basics.CategoryFacts]
c:317 [binder, in ITree.Basics.CategoryFacts]
C:32 [binder, in ITree.Basics.CategoryKleisliFacts]
c:320 [binder, in ITree.Basics.CategoryFacts]
c:329 [binder, in ITree.Basics.CategoryTheory]
c:33 [binder, in ITree.Basics.Function]
c:33 [binder, in ITree.Basics.CategoryOps]
c:33 [binder, in ITree.Basics.MonadState]
C:33 [binder, in ITree.Basics.CategoryRelations]
c:332 [binder, in ITree.Basics.CategoryFacts]
c:338 [binder, in ITree.Basics.CategoryFacts]
c:339 [binder, in ITree.Basics.CategoryTheory]
C:342 [binder, in ITree.Basics.CategoryTheory]
C:343 [binder, in ITree.Basics.CategoryFacts]
c:359 [binder, in ITree.Basics.CategoryTheory]
c:36 [binder, in ITree.Basics.CategoryFacts]
c:360 [binder, in ITree.Basics.CategoryFacts]
c:364 [binder, in ITree.Basics.CategoryFacts]
c:366 [binder, in ITree.Basics.CategoryTheory]
C:37 [binder, in ITree.Basics.CategoryKleisliFacts]
c:370 [binder, in ITree.Basics.CategoryFacts]
c:375 [binder, in ITree.Basics.CategoryFacts]
c:38 [binder, in ITree.Basics.MonadState]
c:385 [binder, in ITree.Basics.CategoryTheory]
c:387 [binder, in ITree.Basics.CategoryFacts]
c:39 [binder, in ITree.Basics.CategoryOps]
c:392 [binder, in ITree.Basics.CategoryFacts]
C:4 [binder, in ITree.Core.KTreeFacts]
c:400 [binder, in ITree.Basics.CategoryFacts]
c:407 [binder, in ITree.Basics.CategoryFacts]
C:41 [binder, in ITree.Basics.Function]
c:417 [binder, in ITree.Basics.CategoryFacts]
C:42 [binder, in ITree.Extra.Dijkstra.StateSpecT]
c:423 [binder, in ITree.Basics.CategoryFacts]
c:429 [binder, in ITree.Basics.CategoryFacts]
c:43 [binder, in ITree.Basics.Function]
c:432 [binder, in ITree.Basics.CategoryFacts]
c:435 [binder, in ITree.Basics.CategoryFacts]
C:44 [binder, in ITree.Basics.CategoryKleisliFacts]
c:44 [binder, in ITree.Basics.CategoryFunctor]
C:45 [binder, in ITree.Basics.CategoryFacts]
C:46 [binder, in ITree.Basics.CategoryTheory]
C:5 [binder, in ITree.Basics.HeterogeneousRelations]
C:50 [binder, in ITree.Props.EuttNoRet]
C:51 [binder, in ITree.Basics.CategoryKleisliFacts]
c:52 [binder, in ITree.Basics.CategoryOps]
c:56 [binder, in ITree.Basics.CategoryRelations]
c:57 [binder, in ITree.Basics.CategoryOps]
C:57 [binder, in ITree.Basics.CategoryKleisliFacts]
c:57 [binder, in ITree.Props.EuttNoRet]
c:57 [binder, in ITree.Basics.MonadState]
c:58 [binder, in ITree.Basics.CategorySub]
C:6 [binder, in ITree.Interp.HandlerFacts]
C:601 [binder, in ITree.Extra.IForest]
c:61 [binder, in ITree.Props.EuttNoRet]
C:62 [binder, in ITree.Basics.CategoryRelations]
c:63 [binder, in ITree.Basics.CategoryRelations]
C:64 [binder, in ITree.Basics.CategoryTheory]
C:65 [binder, in ITree.Basics.CategoryFacts]
C:68 [binder, in ITree.Basics.CategoryKleisliFacts]
c:69 [binder, in ITree.Basics.MonadState]
C:7 [binder, in ITree.Basics.FunctionFacts]
c:72 [binder, in ITree.Basics.CategoryTheory]
C:73 [binder, in ITree.Basics.CategoryRelations]
c:74 [binder, in ITree.Basics.CategoryRelations]
C:76 [binder, in ITree.Basics.CategoryTheory]
c:78 [binder, in ITree.Basics.CategoryOps]
c:78 [binder, in ITree.Basics.CategoryFacts]
c:84 [binder, in ITree.Basics.CategoryFacts]
C:845 [binder, in ITree.Eq.Eqit]
C:883 [binder, in ITree.Eq.Eqit]
C:89 [binder, in ITree.Basics.CategoryFacts]
C:90 [binder, in ITree.Core.KTreeFacts]
C:91 [binder, in ITree.Basics.CategoryKleisliFacts]
C:93 [binder, in ITree.Basics.CategoryOps]
C:93 [binder, in ITree.Basics.CategoryTheory]
C:95 [binder, in ITree.Basics.CategoryKleisliFacts]
c:99 [binder, in ITree.Core.KTreeFacts]
c:99 [binder, in ITree.Basics.CategoryRelations]

D

DagC:80 [binder, in ITree.Basics.CategoryTheory]
dagger [projection, in ITree.Basics.CategoryOps]
Dagger [record, in ITree.Basics.CategoryOps]
dagger [constructor, in ITree.Basics.CategoryOps]
Dagger [inductive, in ITree.Basics.CategoryOps]
Dagger [section, in ITree.Basics.CategoryOps]
DaggerFunctor_rel [instance, in ITree.Basics.CategoryRelations]
DaggerInvolution [record, in ITree.Basics.CategoryTheory]
DaggerInvolution [inductive, in ITree.Basics.CategoryTheory]
DaggerInvolution_rel [instance, in ITree.Basics.CategoryRelations]
DaggerLaws [record, in ITree.Basics.CategoryTheory]
DaggerLaws [section, in ITree.Basics.CategoryTheory]
DaggerLaws_rel [instance, in ITree.Basics.CategoryRelations]
Dagger_rel [instance, in ITree.Basics.CategoryRelations]
dagger_functor [projection, in ITree.Basics.CategoryTheory]
dagger_involution [projection, in ITree.Basics.CategoryTheory]
dagger_invol [projection, in ITree.Basics.CategoryTheory]
dagger_invol [constructor, in ITree.Basics.CategoryTheory]
Dagger_Op [instance, in ITree.Basics.CategoryTheory]
dc:235 [binder, in ITree.Basics.CategoryFacts]
dc:242 [binder, in ITree.Basics.CategoryFacts]
dc:403 [binder, in ITree.Basics.CategoryFacts]
Decide [constructor, in ITree.Extra.Dijkstra.TracesIT]
decide_ex_satisfies_spec [lemma, in ITree.Extra.Dijkstra.TracesIT]
decide_ex_post [definition, in ITree.Extra.Dijkstra.TracesIT]
decide_ex_pre [definition, in ITree.Extra.Dijkstra.TracesIT]
decide_ex [definition, in ITree.Extra.Dijkstra.TracesIT]
decompose_trace_refine_bind [lemma, in ITree.Extra.ITrace.ITraceBind]
decurry_flip [definition, in ITree.Extra.Dijkstra.StateSpecT]
Delay [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelayIn [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpec [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecEq [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecEqEquiv [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecInput [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecMonad [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecMonad [library]
DelaySpecMonadLaws [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecMonadMorph [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecObs [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecOrder [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecOrderM [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
delay_eventless [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
dep [definition, in ITree.Events.Dependent]
Dep [constructor, in ITree.Events.Dependent]
depE [inductive, in ITree.Events.Dependent]
Dependent [library]
determinize [definition, in ITree.Extra.ITrace.ITraceFacts]
Determinize [section, in ITree.Extra.ITrace.ITraceFacts]
determinize_ [definition, in ITree.Extra.ITrace.ITraceFacts]
diagonal_prop_PER [lemma, in ITree.Basics.HeterogeneousRelations]
diagonal_prop_TransitiveH [lemma, in ITree.Basics.HeterogeneousRelations]
diagonal_prop_SymmetricH [lemma, in ITree.Basics.HeterogeneousRelations]
diagonal_prop [definition, in ITree.Basics.HeterogeneousRelations]
DijkstraMonad [definition, in ITree.Extra.Dijkstra.DijkstraMonad]
DijkstraMonad [section, in ITree.Extra.Dijkstra.DijkstraMonad]
DijkstraMonad [library]
DijkstraProp [definition, in ITree.Extra.Dijkstra.DijkstraMonad]
distinguish_bind [lemma, in ITree.Extra.IForest]
DIVCHECK:165 [binder, in ITree.Extra.Secure.SecureStateHandler]
divergent [definition, in ITree.Extra.IForest]
divergent_cont [definition, in ITree.Extra.IForest]
diverges_with_spin [lemma, in ITree.Extra.Secure.SecureStateHandler]
diverges_secure_equiv_halt_l [lemma, in ITree.Extra.Secure.SecureStateHandler]
diverges_secure_equiv_halt_r [lemma, in ITree.Extra.Secure.SecureStateHandler]
diverges_with_halt [lemma, in ITree.Extra.Secure.SecureStateHandler]
diverges_with_bind [lemma, in ITree.Extra.Secure.SecureStateHandler]
diverges_with [definition, in ITree.Extra.Secure.SecureStateHandler]
diverges_with_ [definition, in ITree.Extra.Secure.SecureStateHandler]
diverges_vis [constructor, in ITree.Extra.Secure.SecureStateHandler]
diverges_tau [constructor, in ITree.Extra.Secure.SecureStateHandler]
diverges_with' [inductive, in ITree.Extra.Secure.SecureStateHandler]
diverges_with_bind [lemma, in ITree.Extra.Secure.SecureStateHandlerPi]
diverges_with_spin [lemma, in ITree.Extra.Secure.SecureStateHandlerPi]
diverge_with_respectful_handler [lemma, in ITree.Extra.Secure.SecureStateHandler]
DivTau [constructor, in ITree.Props.Infinite]
DivVis [constructor, in ITree.Props.Infinite]
div_spec [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
div_spec_amonot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
div_spec_monot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
div_spin_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
dmonot [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
DynPrePost [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
DynPrePostListRef [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
DynPrePostRef [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
D:1 [binder, in ITree.Interp.Recursion]
D:1 [binder, in ITree.Interp.RecursionFacts]
d:10 [binder, in ITree.Events.MapDefault]
d:105 [binder, in ITree.Basics.CategoryFacts]
d:109 [binder, in ITree.Basics.CategoryOps]
d:11 [binder, in ITree.Interp.Recursion]
d:112 [binder, in ITree.Basics.CategoryFacts]
D:114 [binder, in ITree.Simple]
d:116 [binder, in ITree.Basics.CategoryKleisliFacts]
D:117 [binder, in ITree.Simple]
d:119 [binder, in ITree.Basics.CategoryFacts]
D:12 [binder, in ITree.Interp.Recursion]
d:121 [binder, in ITree.Basics.CategoryTheory]
d:121 [binder, in ITree.Simple]
D:123 [binder, in ITree.Simple]
d:127 [binder, in ITree.Simple]
d:13 [binder, in ITree.Events.MapDefault]
d:137 [binder, in ITree.Basics.CategoryOps]
d:14 [binder, in ITree.Interp.Recursion]
D:143 [binder, in ITree.Basics.HeterogeneousRelations]
d:146 [binder, in ITree.Basics.CategoryFacts]
D:15 [binder, in ITree.Interp.Recursion]
d:15 [binder, in ITree.Events.Dependent]
d:152 [binder, in ITree.Basics.CategoryFacts]
d:158 [binder, in ITree.Basics.CategoryFacts]
D:18 [binder, in ITree.Interp.Recursion]
D:18 [binder, in ITree.Basics.FunctionFacts]
d:185 [binder, in ITree.Basics.CategoryFacts]
d:20 [binder, in ITree.Events.MapDefaultFacts]
d:20 [binder, in ITree.Basics.CategoryTheory]
D:204 [binder, in ITree.Basics.HeterogeneousRelations]
d:206 [binder, in ITree.Basics.CategoryFacts]
d:21 [binder, in ITree.Basics.CategoryRelations]
d:21 [binder, in ITree.Events.MapDefaultFacts]
d:212 [binder, in ITree.Basics.CategoryFacts]
d:22 [binder, in ITree.Interp.Recursion]
d:22 [binder, in ITree.Events.MapDefault]
d:22 [binder, in ITree.Events.MapDefaultFacts]
d:232 [binder, in ITree.Basics.CategoryFacts]
d:233 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
D:237 [binder, in ITree.Basics.HeterogeneousRelations]
d:239 [binder, in ITree.Basics.CategoryFacts]
d:246 [binder, in ITree.Basics.CategoryFacts]
D:247 [binder, in ITree.Basics.HeterogeneousRelations]
D:249 [binder, in ITree.Simple]
d:25 [binder, in ITree.Events.MapDefault]
d:25 [binder, in ITree.Interp.RecursionFacts]
D:251 [binder, in ITree.Basics.HeterogeneousRelations]
D:252 [binder, in ITree.Simple]
d:256 [binder, in ITree.Simple]
D:257 [binder, in ITree.Simple]
d:26 [binder, in ITree.Events.MapDefaultFacts]
d:261 [binder, in ITree.Simple]
D:269 [binder, in ITree.Basics.HeterogeneousRelations]
d:27 [binder, in ITree.Interp.RecursionFacts]
d:273 [binder, in ITree.Basics.CategoryFacts]
d:277 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
d:279 [binder, in ITree.Basics.CategoryFacts]
D:281 [binder, in ITree.Basics.HeterogeneousRelations]
d:282 [binder, in ITree.Basics.CategoryTheory]
d:284 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
d:285 [binder, in ITree.Basics.CategoryFacts]
d:290 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
D:291 [binder, in ITree.Basics.HeterogeneousRelations]
D:295 [binder, in ITree.Basics.HeterogeneousRelations]
d:297 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
d:3 [binder, in ITree.Events.MapDefault]
d:30 [binder, in ITree.Events.MapDefault]
D:30 [binder, in ITree.Interp.RecursionFacts]
d:301 [binder, in ITree.Basics.CategoryTheory]
d:31 [binder, in ITree.Events.MapDefault]
d:312 [binder, in ITree.Basics.CategoryFacts]
d:32 [binder, in ITree.Basics.CategoryFacts]
d:32 [binder, in ITree.Events.MapDefaultFacts]
d:333 [binder, in ITree.Basics.CategoryFacts]
d:339 [binder, in ITree.Basics.CategoryFacts]
d:34 [binder, in ITree.Basics.CategoryOps]
d:37 [binder, in ITree.Basics.CategoryFacts]
d:37 [binder, in ITree.Events.MapDefaultFacts]
D:38 [binder, in ITree.Basics.CategoryKleisliFacts]
d:388 [binder, in ITree.Basics.CategoryFacts]
d:393 [binder, in ITree.Basics.CategoryFacts]
d:401 [binder, in ITree.Basics.CategoryFacts]
d:41 [binder, in ITree.Events.MapDefaultFacts]
d:436 [binder, in ITree.Basics.CategoryFacts]
D:45 [binder, in ITree.Basics.CategoryKleisliFacts]
D:46 [binder, in ITree.Interp.RecursionFacts]
d:49 [binder, in ITree.Events.MapDefaultFacts]
D:49 [binder, in ITree.Interp.RecursionFacts]
d:50 [binder, in ITree.Events.MapDefaultFacts]
d:52 [binder, in ITree.Interp.HandlerFacts]
d:57 [binder, in ITree.Basics.CategoryRelations]
d:58 [binder, in ITree.Interp.HandlerFacts]
d:59 [binder, in ITree.Events.MapDefaultFacts]
d:59 [binder, in ITree.Basics.CategorySub]
d:61 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
d:69 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
D:7 [binder, in ITree.Interp.Recursion]
d:7 [binder, in ITree.Events.MapDefault]
d:79 [binder, in ITree.Basics.CategoryFacts]
d:85 [binder, in ITree.Basics.CategoryFacts]

E

ea:12 [binder, in ITree.Extra.ITrace.ITraceFacts]
eeq [instance, in ITree.Basics.Function]
eeq_case_sum [instance, in ITree.Basics.FunctionFacts]
EffectObs [record, in ITree.Extra.Dijkstra.DijkstraMonad]
EffectObs [inductive, in ITree.Extra.Dijkstra.DijkstraMonad]
EffectObservation [section, in ITree.Extra.Dijkstra.DijkstraMonad]
EffectObsMW:20 [binder, in ITree.Extra.Dijkstra.StateSpecT]
EffectObsStateT [instance, in ITree.Extra.Dijkstra.StateSpecT]
eff_hom_e [record, in ITree.Events.State]
eff_hom_e [section, in ITree.Events.State]
eff_hom_prop [definition, in ITree.Events.State]
ei:93 [binder, in ITree.Basics.Basics]
ek:182 [binder, in ITree.Simple]
ek:37 [binder, in ITree.Simple]
ek:613 [binder, in ITree.Eq.Eqit]
ek:82 [binder, in ITree.Eq.Shallow]
elim_void1 [definition, in ITree.Indexed.Sum]
embed [projection, in ITree.Core.Subevent]
embed [constructor, in ITree.Core.Subevent]
Embeddable [record, in ITree.Core.Subevent]
Embeddable [inductive, in ITree.Core.Subevent]
Embeddable_itree [instance, in ITree.Core.Subevent]
Embeddable_forall [instance, in ITree.Core.Subevent]
Embed:4 [binder, in ITree.Basics.CategorySub]
emp [constructor, in ITree.Extra.Secure.Labels]
empty [projection, in ITree.Basics.CategoryOps]
empty [constructor, in ITree.Basics.CategoryOps]
empty [inductive, in ITree.Extra.Secure.Labels]
encode [definition, in ITree.Extra.Dijkstra.TracesIT]
encode [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
encode [definition, in ITree.Extra.Dijkstra.StateIOTrace]
encode_dyn [definition, in ITree.Extra.Dijkstra.TracesIT]
encode_list_dyn [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
encode_dyn_correct [lemma, in ITree.Extra.Dijkstra.StateDelaySpec]
encode_dyn [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
encode_list [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
encode_pair_correct [lemma, in ITree.Extra.Dijkstra.StateDelaySpec]
encode_pair [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
encode_correct [lemma, in ITree.Extra.Dijkstra.StateDelaySpec]
endo [abbreviation, in ITree.Interp.Recursion]
enocde_list_dyn_correct [lemma, in ITree.Extra.Dijkstra.StateDelaySpec]
enocde_list_correct [lemma, in ITree.Extra.Dijkstra.StateDelaySpec]
entry:68 [binder, in ITree.Props.HasPost]
env [definition, in ITree.Extra.Dijkstra.StateIOTrace]
env:21 [binder, in ITree.Events.Map]
env:27 [binder, in ITree.Events.MapDefault]
Eq [library]
EqAxiom [library]
eqeq [definition, in ITree.Eq.Shallow]
EqERet [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
EqETau [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
EqETauL [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
EqETauR [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqit [abbreviation, in ITree.Eq.Eqit]
eqit [definition, in ITree.Eq.Eqit]
eqit [section, in ITree.Eq.Eqit]
Eqit [library]
eqitC [definition, in ITree.Eq.Eqit]
eqitC_dist [lemma, in ITree.Eq.Eqit]
eqitC_wcompat [lemma, in ITree.Eq.Eqit]
eqitC_mon [lemma, in ITree.Eq.Eqit]
eqitE [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitEF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_trans [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_inv_Tau [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_imp_eventlessr [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_imp_eventlessl [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_imp_eutt [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_monot [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_ [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitF [inductive, in ITree.Eq.Eqit]
eqitF_observe_peel_cont_vis [lemma, in ITree.Extra.ITrace.ITraceBind]
eqitF_mon [lemma, in ITree.Extra.ITrace.ITraceBind]
eqitF_r_refl [lemma, in ITree.Extra.ITrace.ITraceBind]
eqitF_flip [lemma, in ITree.Eq.Eqit]
eqitF_Proper_R2 [instance, in ITree.Eq.Eqit]
eqitF_Proper_R [instance, in ITree.Eq.Eqit]
eqitF_VisF_gen [lemma, in ITree.Eq.Eqit]
eqitF_inv_VisF [lemma, in ITree.Eq.Eqit]
eqitF_inv_VisF_weak [lemma, in ITree.Eq.Eqit]
eqitF_inv_VisF_r [lemma, in ITree.Eq.Eqit]
eqitF_mono [lemma, in ITree.Eq.Eqit]
eqitgen_cong_eqit_eq [instance, in ITree.Eq.Eqit]
eqitgen_cong_eqit [instance, in ITree.Eq.Eqit]
eqitree_inv_bind_tau [lemma, in ITree.Eq.Eqit]
eqitree_inv_bind_vis [lemma, in ITree.Eq.Eqit]
eqitree_inv_bind_ret [lemma, in ITree.Eq.Eqit]
eqitree_Tau [lemma, in ITree.Eq.Eqit]
eqitree_inv_Ret [lemma, in ITree.Eq.Eqit]
eqitree_inv_Tau_r [lemma, in ITree.Eq.Eqit]
eqitree_inv_Vis_r [lemma, in ITree.Eq.Eqit]
eqitree_inv_Ret_r [lemma, in ITree.Eq.Eqit]
eqit_secure_imp_pi_eqit_scure [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
eqit_secure_sym [lemma, in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secureC_mon [lemma, in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secureC [definition, in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure_trans_clo_intro [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure_trans_clo [inductive, in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure [definition, in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure_sym [lemma, in ITree.Extra.Secure.SecureEqHalt]
eqit_secureC_mon [lemma, in ITree.Extra.Secure.SecureEqHalt]
eqit_secureC [definition, in ITree.Extra.Secure.SecureEqHalt]
eqit_secure_trans_clo_intro [constructor, in ITree.Extra.Secure.SecureEqHalt]
eqit_secure_trans_clo [inductive, in ITree.Extra.Secure.SecureEqHalt]
eqit_secure [definition, in ITree.Extra.Secure.SecureEqHalt]
eqit_ret_gen [lemma, in ITree.Eq.UpToTaus]
eqit_Returns_bind'' [lemma, in ITree.Extra.IForest]
eqit_Returns_bind' [lemma, in ITree.Extra.IForest]
eqit_Returns_clo_bind [lemma, in ITree.Extra.IForest]
eqit_Returns_bind_clo [inductive, in ITree.Extra.IForest]
eqit_bind_Returns_inv [lemma, in ITree.Extra.IForest]
eqit_clo_bind_gen [lemma, in ITree.Props.Leaf]
eqit_Leaf_clo_bind [lemma, in ITree.Props.Leaf]
eqit_Leaf_bind_clo [inductive, in ITree.Props.Leaf]
eqit_bind_shalt_aux2 [lemma, in ITree.Extra.Secure.SecureEqBind]
eqit_bind_shalt_aux1 [lemma, in ITree.Extra.Secure.SecureEqBind]
eqit_secureC_wcompat_id' [lemma, in ITree.Extra.Secure.SecureEqWcompat]
eqit_secure_shalt_refl [lemma, in ITree.Extra.Secure.SecureEqWcompat]
eqit_secureC_wcompat_id [lemma, in ITree.Extra.Secure.SecureEqWcompat]
eqit_trans_clo_intro [constructor, in ITree.Eq.Rutt]
eqit_secure_silent_diverge [lemma, in ITree.Extra.Secure.SecureStateHandler]
eqit_secure_anything [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_eq_trans [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_itree_eqit_secure [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_trans [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_RR_imp [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_trans_aux2 [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_trans_aux1 [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_public_Vis [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_private_VisR [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_private_VisL [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_private_VisLR [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_VisLR [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_TauRVisL [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_TauLVisR [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_TauLR [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_inv_bind_tau [lemma, in ITree.Eq.Eqit]
eqit_inv_bind_vis [lemma, in ITree.Eq.Eqit]
eqit_inv_bind_ret [lemma, in ITree.Eq.Eqit]
eqit_eq_map [instance, in ITree.Eq.Eqit]
eqit_map [lemma, in ITree.Eq.Eqit]
eqit_bind [instance, in ITree.Eq.Eqit]
eqit_subst [instance, in ITree.Eq.Eqit]
eqit_bind' [lemma, in ITree.Eq.Eqit]
eqit_clo_bind [lemma, in ITree.Eq.Eqit]
eqit_bind_clo [inductive, in ITree.Eq.Eqit]
eqit_Ret [lemma, in ITree.Eq.Eqit]
eqit_Vis [lemma, in ITree.Eq.Eqit]
eqit_Vis_gen [lemma, in ITree.Eq.Eqit]
eqit_Tau [lemma, in ITree.Eq.Eqit]
eqit_h [section, in ITree.Eq.Eqit]
eqit_trans [lemma, in ITree.Eq.Eqit]
eqit_Tau_r [lemma, in ITree.Eq.Eqit]
eqit_Tau_l [lemma, in ITree.Eq.Eqit]
eqit_inv [lemma, in ITree.Eq.Eqit]
eqit__ [abbreviation, in ITree.Eq.Eqit]
eqit_inv [section, in ITree.Eq.Eqit]
eqit_inv_Tau [lemma, in ITree.Eq.Eqit]
eqit_inv_Tau_r [lemma, in ITree.Eq.Eqit]
eqit_inv_Tau_l [lemma, in ITree.Eq.Eqit]
eqit_inv_Vis [lemma, in ITree.Eq.Eqit]
eqit_inv_Vis_weak [lemma, in ITree.Eq.Eqit]
eqit_inv_Ret [lemma, in ITree.Eq.Eqit]
eqit_VisF [instance, in ITree.Eq.Eqit]
eqit_tauF [instance, in ITree.Eq.Eqit]
eqit_observe [instance, in ITree.Eq.Eqit]
eqit_eq [section, in ITree.Eq.Eqit]
eqit_gen [section, in ITree.Eq.Eqit]
eqit_clo_trans [lemma, in ITree.Eq.Eqit]
eqit_idclo_compat [lemma, in ITree.Eq.Eqit]
eqit_trans_clo_intro [constructor, in ITree.Eq.Eqit]
eqit_trans_clo [inductive, in ITree.Eq.Eqit]
eqit_closure [section, in ITree.Eq.Eqit]
eqit_mon [lemma, in ITree.Eq.Eqit]
eqit_flip [lemma, in ITree.Eq.Eqit]
eqit_Proper_R [instance, in ITree.Eq.Eqit]
eqit_idclo_mono [lemma, in ITree.Eq.Eqit]
eqit__mono [lemma, in ITree.Eq.Eqit]
eqit_ [definition, in ITree.Eq.Eqit]
EQK:694 [binder, in ITree.Eq.Eqit]
EQK:732 [binder, in ITree.Eq.Eqit]
EQL:80 [binder, in ITree.Eq.UpToTaus]
EqMDelay [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
EqMTS_equiv [instance, in ITree.Extra.Dijkstra.TracesIT]
EqM_TraceSpec [instance, in ITree.Extra.Dijkstra.TracesIT]
EQM:3 [binder, in ITree.Basics.MonadState]
EqRet [constructor, in ITree.Eq.Rutt]
EqRet [constructor, in ITree.Eq.Eqit]
EQR:81 [binder, in ITree.Eq.UpToTaus]
EqTau [constructor, in ITree.Eq.Rutt]
EqTau [constructor, in ITree.Eq.Eqit]
EqTauL [constructor, in ITree.Eq.Rutt]
EqTauL [constructor, in ITree.Eq.Eqit]
EqTauR [constructor, in ITree.Eq.Rutt]
EqTauR [constructor, in ITree.Eq.Eqit]
EQTAUS:18 [binder, in ITree.Eq.SimUpToTaus]
EQTAUS:21 [binder, in ITree.Eq.SimUpToTaus]
EQT:691 [binder, in ITree.Eq.Eqit]
EQT:729 [binder, in ITree.Eq.Eqit]
EquivalenceH [record, in ITree.Basics.HeterogeneousRelations]
Equivalence_failT_eq1 [instance, in ITree.Events.FailFacts]
Equivalence_Kleisli_eq2 [instance, in ITree.Basics.CategoryKleisliFacts]
Equivalence_R:43 [binder, in ITree.Indexed.Relation]
Equivalence_i_pointwise [instance, in ITree.Indexed.Relation]
Equivalence_eeq [instance, in ITree.Basics.FunctionFacts]
Equivalence_Eq2_C:10 [binder, in ITree.Basics.CategoryFacts]
Equivalence_going [instance, in ITree.Eq.Shallow]
Equivalence_observing [instance, in ITree.Eq.Shallow]
Equivalence_eq2_Handler [definition, in ITree.Interp.InterpFacts]
Equivalence_eutt_Handler [instance, in ITree.Interp.InterpFacts]
Equivalence_eq_Handler [instance, in ITree.Interp.InterpFacts]
Equivalence_eutt [instance, in ITree.Eq.Eqit]
Equivalence_eqit_eq [instance, in ITree.Eq.Eqit]
Equivalence_eqit [instance, in ITree.Eq.Eqit]
Equivalence_C:53 [binder, in ITree.Basics.CategorySub]
Equivalence_sub [instance, in ITree.Basics.CategorySub]
Equivalence_C:43 [binder, in ITree.Basics.CategorySub]
equivE [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
equivE_sym [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
EquivRel:8 [binder, in ITree.Extra.Dijkstra.StateSpecT]
equiv_pred_equiv [instance, in ITree.Basics.Basics]
equiv_pred_trans [instance, in ITree.Basics.Basics]
equiv_pred_symm [instance, in ITree.Basics.Basics]
equiv_pred_refl [instance, in ITree.Basics.Basics]
equiv_pred [definition, in ITree.Basics.Basics]
equiv_trans [projection, in ITree.Basics.HeterogeneousRelations]
equiv_symm [projection, in ITree.Basics.HeterogeneousRelations]
equiv_refl [projection, in ITree.Basics.HeterogeneousRelations]
EqVis [constructor, in ITree.Eq.Rutt]
EqVis [constructor, in ITree.Eq.Eqit]
EqVisPriv [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisPriv [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltLTauR [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltLTauR [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltLVisR [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltLVisR [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltRTauL [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltRTauL [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltRVisL [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltRVisL [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivLInd [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivLInd [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivRInd [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivRInd [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivTauLCo [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivTauLCo [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivTauRCo [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivTauRCo [constructor, in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivVisCo [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivVisCo [constructor, in ITree.Extra.Secure.SecureEqHalt]
EQVl:156 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EQVl:156 [binder, in ITree.Extra.Secure.SecureEqHalt]
EQVl:207 [binder, in ITree.Eq.Eqit]
EQVl:93 [binder, in ITree.Eq.Rutt]
EQVr:157 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
EQVr:157 [binder, in ITree.Extra.Secure.SecureEqHalt]
EQVr:208 [binder, in ITree.Eq.Eqit]
EQVr:94 [binder, in ITree.Eq.Rutt]
EQV:108 [binder, in ITree.Props.Leaf]
EQV:358 [binder, in ITree.Extra.IForest]
EQV:674 [binder, in ITree.Eq.Eqit]
EqW:43 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
EqW:6 [binder, in ITree.Extra.Dijkstra.StateSpecT]
EqW:62 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
eq_itree_Proper_R [instance, in ITree.Eq.UpToTaus]
eq_relation [definition, in ITree.Extra.IForest]
EQ_REL_Proper [instance, in ITree.Extra.IForest]
EQ_REL [definition, in ITree.Extra.IForest]
eq_rect_eq [definition, in ITree.Axioms]
EQ_t:165 [binder, in ITree.Events.StateFacts]
eq_itree_interp_state [instance, in ITree.Events.StateFacts]
eq_itree_iter [instance, in ITree.Core.KTreeFacts]
eq_itree_iter' [lemma, in ITree.Core.KTreeFacts]
eq_Handler [definition, in ITree.Interp.Handler]
eq_map [definition, in ITree.Events.MapDefault]
eq_trace_inv [lemma, in ITree.Interp.Traces]
eq_':114 [binder, in ITree.Eq.Shallow]
eq_:108 [binder, in ITree.Eq.Shallow]
eq_':57 [binder, in ITree.Eq.Shallow]
eq_:49 [binder, in ITree.Eq.Shallow]
eq_inv_VisF_weak [lemma, in ITree.Eq.Shallow]
EQ_t:115 [binder, in ITree.Interp.InterpFacts]
eq_itree_interp' [instance, in ITree.Interp.InterpFacts]
eq_itree_interp [instance, in ITree.Interp.InterpFacts]
eq_id_l [lemma, in ITree.Basics.HeterogeneousRelations]
eq_id_r [lemma, in ITree.Basics.HeterogeneousRelations]
eq_rel_Proper [instance, in ITree.Basics.HeterogeneousRelations]
eq_rel_Equiv [instance, in ITree.Basics.HeterogeneousRelations]
eq_rel_Transitive [instance, in ITree.Basics.HeterogeneousRelations]
eq_rel_Symmetric [instance, in ITree.Basics.HeterogeneousRelations]
eq_rel_Reflexive [instance, in ITree.Basics.HeterogeneousRelations]
eq_rel [definition, in ITree.Basics.HeterogeneousRelations]
eq_itree_translate [instance, in ITree.Interp.TranslateFacts]
eq_itree_apply_IFun [instance, in ITree.Interp.TranslateFacts]
eq_itree_translateF [instance, in ITree.Interp.TranslateFacts]
eq_itree_translate' [instance, in ITree.Interp.TranslateFacts]
eq_map_remove [lemma, in ITree.Events.MapDefaultFacts]
eq_map_add [lemma, in ITree.Events.MapDefaultFacts]
eq_map_trans [instance, in ITree.Events.MapDefaultFacts]
eq_map_sym [instance, in ITree.Events.MapDefaultFacts]
eq_map_refl [instance, in ITree.Events.MapDefaultFacts]
eq_itree_mrec [instance, in ITree.Interp.RecursionFacts]
eq_itree_clo_bind [lemma, in ITree.Eq.Eqit]
eq_sub_eutt [instance, in ITree.Eq.Eqit]
eq_sub_euttge [instance, in ITree.Eq.Eqit]
eq_itree [definition, in ITree.Eq.Eqit]
eq1 [projection, in ITree.Basics.Monad]
Eq1 [record, in ITree.Basics.Monad]
eq1 [constructor, in ITree.Basics.Monad]
Eq1 [inductive, in ITree.Basics.Monad]
Eq1Equivalence [record, in ITree.Basics.Monad]
Eq1Equivalence [inductive, in ITree.Basics.Monad]
Eq1Equivalence_stateTM [instance, in ITree.Basics.MonadState]
Eq1Equivalence_ITree [instance, in ITree.Core.ITreeMonad]
Eq1Equivalence_Prop [instance, in ITree.Basics.MonadProp]
Eq1P:4 [binder, in ITree.Basics.CategoryKleisliFacts]
Eq1_iforest'_Eq1_iforest [lemma, in ITree.Extra.IForest]
Eq1_iforest' [definition, in ITree.Extra.IForest]
Eq1_iforest [instance, in ITree.Extra.IForest]
eq1_equiv [projection, in ITree.Basics.Monad]
eq1_equiv [constructor, in ITree.Basics.Monad]
Eq1_stateTM [instance, in ITree.Basics.MonadState]
Eq1_ITree [instance, in ITree.Core.ITreeMonad]
Eq1_Prop [instance, in ITree.Basics.MonadProp]
Eq1:12 [binder, in ITree.Basics.Monad]
Eq1:2 [binder, in ITree.Basics.CategoryKleisliFacts]
eq2 [projection, in ITree.Basics.CategoryOps]
Eq2 [record, in ITree.Basics.CategoryOps]
eq2 [constructor, in ITree.Basics.CategoryOps]
Eq2 [inductive, in ITree.Basics.CategoryOps]
Eq2C:3 [binder, in ITree.Basics.CategoryFacts]
Eq2C:3 [binder, in ITree.Basics.CategoryTheory]
Eq2C:47 [binder, in ITree.Basics.CategoryTheory]
Eq2C:65 [binder, in ITree.Basics.CategoryTheory]
Eq2C:77 [binder, in ITree.Basics.CategoryTheory]
eq2_ktree_iter [instance, in ITree.Core.KTreeFacts]
Eq2_Kleisli [instance, in ITree.Basics.CategoryKleisli]
Eq2_Handler [instance, in ITree.Interp.Handler]
Eq2_IFun [instance, in ITree.Indexed.Function]
eq2_to_eq1 [lemma, in ITree.Basics.MonadState]
Eq2_C:344 [binder, in ITree.Basics.CategoryFacts]
Eq2_C:217 [binder, in ITree.Basics.CategoryFacts]
Eq2_C:90 [binder, in ITree.Basics.CategoryFacts]
Eq2_C:66 [binder, in ITree.Basics.CategoryFacts]
Eq2_C:46 [binder, in ITree.Basics.CategoryFacts]
Eq2_rel [instance, in ITree.Basics.CategoryRelations]
Eq2_C:343 [binder, in ITree.Basics.CategoryTheory]
Eq2_C:305 [binder, in ITree.Basics.CategoryTheory]
Eq2_C:231 [binder, in ITree.Basics.CategoryTheory]
Eq2_C:203 [binder, in ITree.Basics.CategoryTheory]
Eq2_C:164 [binder, in ITree.Basics.CategoryTheory]
Eq2_C:125 [binder, in ITree.Basics.CategoryTheory]
Eq2_C:94 [binder, in ITree.Basics.CategoryTheory]
Eq2_Op [instance, in ITree.Basics.CategoryTheory]
Eq2_sub [instance, in ITree.Basics.CategorySub]
Eq2_C:13 [binder, in ITree.Basics.CategorySub]
eq2:101 [binder, in ITree.Extra.IForest]
eq2:112 [binder, in ITree.Extra.IForest]
EQ:410 [binder, in ITree.Eq.Eqit]
Eq:6 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
Err:1 [binder, in ITree.Events.Exception]
Err:11 [binder, in ITree.Events.Exception]
Err:12 [binder, in ITree.Events.ExceptionFacts]
Err:19 [binder, in ITree.Events.ExceptionFacts]
Err:2 [binder, in ITree.Events.ExceptionFacts]
Err:21 [binder, in ITree.Events.Exception]
Err:26 [binder, in ITree.Events.ExceptionFacts]
Err:29 [binder, in ITree.Events.ExceptionFacts]
Err:32 [binder, in ITree.Events.ExceptionFacts]
Err:36 [binder, in ITree.Events.ExceptionFacts]
Err:4 [binder, in ITree.Events.Exception]
Err:40 [binder, in ITree.Events.ExceptionFacts]
Err:44 [binder, in ITree.Events.ExceptionFacts]
Err:50 [binder, in ITree.Events.ExceptionFacts]
Err:56 [binder, in ITree.Events.ExceptionFacts]
Err:61 [binder, in ITree.Events.ExceptionFacts]
Err:68 [binder, in ITree.Events.ExceptionFacts]
Err:7 [binder, in ITree.Events.ExceptionFacts]
Err:75 [binder, in ITree.Events.ExceptionFacts]
Err:82 [binder, in ITree.Events.ExceptionFacts]
Err:90 [binder, in ITree.Events.ExceptionFacts]
eses_aux4 [lemma, in ITree.Extra.Secure.SecureEqEuttTrans]
eses_aux3 [lemma, in ITree.Extra.Secure.SecureEqEuttTrans]
eses_aux2 [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eses_aux1 [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eutt [definition, in ITree.Eq.Eqit]
EuttExtras [library]
euttG [abbreviation, in ITree.Eq.UpToTaus]
euttG [abbreviation, in ITree.Eq.UpToTaus]
euttG [abbreviation, in ITree.Eq.UpToTaus]
euttG [inductive, in ITree.Eq.UpToTaus]
EUTTG [section, in ITree.Eq.UpToTaus]
euttge [definition, in ITree.Eq.Eqit]
euttge_trans_clo_wcompat [lemma, in ITree.Eq.Rutt]
euttge_trans_clo_mon [lemma, in ITree.Eq.Rutt]
euttge_trans_clo [inductive, in ITree.Eq.Rutt]
euttge_trans_clo [section, in ITree.Eq.Rutt]
euttge_interp' [instance, in ITree.Interp.InterpFacts]
euttge_interp [instance, in ITree.Interp.InterpFacts]
euttge_interp_mrec' [instance, in ITree.Interp.RecursionFacts]
euttge_interp_mrec [instance, in ITree.Interp.RecursionFacts]
euttge_cong_euttge_eq [instance, in ITree.Eq.Eqit]
euttge_cong_euttge [instance, in ITree.Eq.Eqit]
euttge_sub_eutt [instance, in ITree.Eq.Eqit]
euttG_cong_eq [instance, in ITree.Eq.UpToTaus]
euttG_cong_euttge [instance, in ITree.Eq.UpToTaus]
euttG_cong_eutt [instance, in ITree.Eq.UpToTaus]
euttG_reflexive [instance, in ITree.Eq.UpToTaus]
euttG_le_eutt [lemma, in ITree.Eq.UpToTaus]
euttG_base [lemma, in ITree.Eq.UpToTaus]
euttG_vis_gen [lemma, in ITree.Eq.UpToTaus]
euttG_vis [lemma, in ITree.Eq.UpToTaus]
euttG_tau [lemma, in ITree.Eq.UpToTaus]
euttG_drop [lemma, in ITree.Eq.UpToTaus]
euttG_transU [lemma, in ITree.Eq.UpToTaus]
euttG_transD [lemma, in ITree.Eq.UpToTaus]
euttG_bind [lemma, in ITree.Eq.UpToTaus]
euttG_ret [lemma, in ITree.Eq.UpToTaus]
euttG_accF [lemma, in ITree.Eq.UpToTaus]
euttG_cofix [lemma, in ITree.Eq.UpToTaus]
EUTTG_principles [section, in ITree.Eq.UpToTaus]
euttG_cofix_aux [lemma, in ITree.Eq.UpToTaus]
euttG_gen [lemma, in ITree.Eq.UpToTaus]
euttG_transU_aux [lemma, in ITree.Eq.UpToTaus]
EUTTG_Properties2 [section, in ITree.Eq.UpToTaus]
euttG_flip [lemma, in ITree.Eq.UpToTaus]
EUTTG_Properties1 [section, in ITree.Eq.UpToTaus]
euttG_intro [constructor, in ITree.Eq.UpToTaus]
euttNoRet [definition, in ITree.Props.EuttNoRet]
EuttNoRet [library]
euttNoRet_trans [lemma, in ITree.Props.EuttNoRet]
euttNoRet_sym [lemma, in ITree.Props.EuttNoRet]
euttNoRet_all_infinite [lemma, in ITree.Props.EuttNoRet]
euttNoRet_subrel [lemma, in ITree.Props.EuttNoRet]
euttNoRet_spin [lemma, in ITree.Props.EuttNoRet]
euttVC [definition, in ITree.Eq.UpToTaus]
euttVC_gen [lemma, in ITree.Eq.UpToTaus]
euttVC_transU [lemma, in ITree.Eq.UpToTaus]
euttVC_transL [lemma, in ITree.Eq.UpToTaus]
euttVC_flip [lemma, in ITree.Eq.UpToTaus]
euttVC_id [lemma, in ITree.Eq.UpToTaus]
euttVC_compat [lemma, in ITree.Eq.UpToTaus]
euttVC_mon [lemma, in ITree.Eq.UpToTaus]
eutt_Proper_R [instance, in ITree.Eq.UpToTaus]
eutt_equiv [lemma, in ITree.Eq.UpToTaus]
eutt_disj_r [lemma, in ITree.Eq.UpToTaus]
eutt_disj_l [lemma, in ITree.Eq.UpToTaus]
eutt_conj [lemma, in ITree.Eq.UpToTaus]
eutt_Ret [lemma, in ITree.Eq.UpToTaus]
eutt_eq_bind [lemma, in ITree.Eq.UpToTaus]
eutt_cong_eutt' [instance, in ITree.Eq.UpToTaus]
eutt_cong_eq [instance, in ITree.Eq.UpToTaus]
eutt_cong_euttge [instance, in ITree.Eq.UpToTaus]
eutt_cong_eutt [instance, in ITree.Eq.UpToTaus]
eutt_le_euttG [lemma, in ITree.Eq.UpToTaus]
eutt_eq_itree [lemma, in ITree.Props.HasPost]
eutt_post_bind_eq [lemma, in ITree.Props.HasPost]
eutt_post_bind [lemma, in ITree.Props.HasPost]
eutt_EQ_REL_Reflexive [lemma, in ITree.Extra.IForest]
eutt_EQ_REL_Reflexive_ [lemma, in ITree.Extra.IForest]
eutt_EQ_REL_Proper [instance, in ITree.Extra.IForest]
eutt_ret_vis_abs [lemma, in ITree.Extra.IForest]
eutt_Returns [lemma, in ITree.Extra.IForest]
eutt_Returns_ [lemma, in ITree.Extra.IForest]
eutt_closed [definition, in ITree.Extra.IForest]
eutt_flip [lemma, in ITree.Eq.EuttExtras]
eutt_subrel [lemma, in ITree.Eq.EuttExtras]
eutt_secure_eqit_secure [lemma, in ITree.Extra.Secure.SecureEqEuttTrans]
eutt_interp_state_loop [lemma, in ITree.Events.StateFacts]
eutt_interp_state_iter [lemma, in ITree.Events.StateFacts]
eutt_interp_state_aloop [lemma, in ITree.Events.StateFacts]
eutt_interp_state_eq [instance, in ITree.Events.StateFacts]
eutt_interp_state [instance, in ITree.Events.StateFacts]
eutt_iter_gen [definition, in ITree.Core.KTreeFacts]
eutt_iter [instance, in ITree.Core.KTreeFacts]
eutt_iter_gen' [definition, in ITree.Core.KTreeFacts]
eutt_body:53 [binder, in ITree.Core.KTreeFacts]
eutt_iter'' [lemma, in ITree.Core.KTreeFacts]
eutt_body:36 [binder, in ITree.Core.KTreeFacts]
eutt_iter' [lemma, in ITree.Core.KTreeFacts]
eutt_body:21 [binder, in ITree.Core.KTreeFacts]
eutt_sutt [lemma, in ITree.Eq.SimUpToTaus]
eutt_proper_all_infinite [instance, in ITree.Props.Infinite]
eutt_proper_con_converge [instance, in ITree.Props.Infinite]
eutt_eq_bind_gen [lemma, in ITree.Props.Leaf]
eutt_clo_bind_gen [lemma, in ITree.Props.Leaf]
eutt_Handler [definition, in ITree.Interp.Handler]
eutt_eventless [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eutt_trace_eq [lemma, in ITree.Interp.Traces]
eutt_interp' [instance, in ITree.Interp.InterpFacts]
eutt_interp [instance, in ITree.Interp.InterpFacts]
eutt_secure_eqit_secure [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
eutt_translate_gen [lemma, in ITree.Interp.TranslateFacts]
eutt_translate' [instance, in ITree.Interp.TranslateFacts]
eutt_translate [instance, in ITree.Interp.TranslateFacts]
eutt_apply_IFun [instance, in ITree.Interp.TranslateFacts]
eutt_ret_euttge [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
eutt_reta_or_div [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
eutt_reta_or_div_aux [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
eutt_spin_Vis_abs [lemma, in ITree.Eq.Eqit]
eutt_Vis_spin_abs [lemma, in ITree.Eq.Eqit]
eutt_spin_Ret_abs [lemma, in ITree.Eq.Eqit]
eutt_Ret_spin_abs [lemma, in ITree.Eq.Eqit]
eutt_inv_bind_tau [lemma, in ITree.Eq.Eqit]
eutt_inv_bind_vis [lemma, in ITree.Eq.Eqit]
eutt_inv_bind_ret [lemma, in ITree.Eq.Eqit]
eutt_Tau [lemma, in ITree.Eq.Eqit]
eutt_clo_bind [lemma, in ITree.Eq.Eqit]
eutt_inv_Ret [lemma, in ITree.Eq.Eqit]
eutt_Proper_R [instance, in ITree.Eq.Eqit]
ev [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
Ev [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
eval [projection, in ITree.Events.State]
eval_reader [definition, in ITree.Events.Reader]
evans [constructor, in ITree.Extra.ITrace.ITraceDefinition]
EvAns [inductive, in ITree.Extra.ITrace.ITraceDefinition]
evempty [constructor, in ITree.Extra.ITrace.ITraceDefinition]
Event [constructor, in ITree.Interp.Traces]
event [inductive, in ITree.Interp.Traces]
eventless [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventlessF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventlessRet [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventlessTau [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_spin [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_ret [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_div [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_monot [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_ [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
Events [library]
event_ans_constr [lemma, in ITree.Extra.ITrace.ITraceFacts]
EvTrans:100 [binder, in ITree.Extra.ITrace.ITracePreds]
ev_list_to_stream [definition, in ITree.Extra.ITrace.ITraceDefinition]
ev_list [definition, in ITree.Extra.ITrace.ITraceDefinition]
ev_stream [definition, in ITree.Extra.ITrace.ITraceDefinition]
ev:104 [binder, in ITree.Interp.Traces]
ev:113 [binder, in ITree.Interp.Traces]
ev:119 [binder, in ITree.Extra.ITrace.ITraceBind]
ev:182 [binder, in ITree.Extra.ITrace.ITraceBind]
ev:21 [binder, in ITree.Events.ExceptionFacts]
ev:216 [binder, in ITree.Extra.ITrace.ITraceBind]
ev:245 [binder, in ITree.Extra.ITrace.ITraceBind]
ev:262 [binder, in ITree.Extra.ITrace.ITraceBind]
ev:273 [binder, in ITree.Extra.ITrace.ITraceBind]
ev:284 [binder, in ITree.Extra.ITrace.ITraceBind]
ev:5 [binder, in ITree.Extra.ITrace.ITraceDefinition]
ev:53 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
ev:9 [binder, in ITree.Extra.ITrace.ITraceDefinition]
ev:93 [binder, in ITree.Interp.Traces]
exceptE [inductive, in ITree.Events.Exception]
Exception [library]
ExceptionFacts [library]
exc:14 [binder, in ITree.Events.ExceptionFacts]
EXP:158 [binder, in ITree.Basics.CategoryOps]
EXP:212 [binder, in ITree.Basics.CategoryTheory]
E_Eq2_C:347 [binder, in ITree.Basics.CategoryFacts]
E_Eq2_C:220 [binder, in ITree.Basics.CategoryFacts]
E_Eq2_C:93 [binder, in ITree.Basics.CategoryFacts]
E_Eq2_C:69 [binder, in ITree.Basics.CategoryFacts]
E_Eq2_C:49 [binder, in ITree.Basics.CategoryFacts]
e':111 [binder, in ITree.Extra.ITrace.ITraceFacts]
e':147 [binder, in ITree.Extra.Secure.SecureStateHandler]
e':159 [binder, in ITree.Extra.Secure.SecureStateHandler]
e':164 [binder, in ITree.Extra.Secure.SecureStateHandler]
e':47 [binder, in ITree.Events.State]
e':8 [binder, in ITree.Extra.ITrace.ITraceFacts]
e0:121 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e0:139 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e0:145 [binder, in ITree.Extra.ITrace.ITraceFacts]
e0:163 [binder, in ITree.Extra.ITrace.ITraceFacts]
e0:166 [binder, in ITree.Extra.ITrace.ITraceFacts]
e0:169 [binder, in ITree.Extra.ITrace.ITraceFacts]
e0:178 [binder, in ITree.Extra.ITrace.ITraceFacts]
e0:214 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e0:265 [binder, in ITree.Extra.ITrace.ITraceBind]
e0:34 [binder, in ITree.Extra.ITrace.ITraceBind]
e0:8 [binder, in ITree.Extra.ITrace.ITraceBind]
E1:1 [binder, in ITree.Eq.Rutt]
E1:1 [binder, in ITree.Indexed.Sum]
e1:11 [binder, in ITree.Extra.ITrace.ITraceBind]
E1:110 [binder, in ITree.Eq.Rutt]
E1:120 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:123 [binder, in ITree.Eq.Rutt]
E1:125 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e1:131 [binder, in ITree.Eq.Eqit]
E1:141 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:146 [binder, in ITree.Eq.Rutt]
E1:149 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:154 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:159 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:175 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:177 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:179 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:181 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:198 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:205 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e1:209 [binder, in ITree.Eq.UpToTaus]
e1:21 [binder, in ITree.Eq.Rutt]
E1:212 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:214 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:220 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:224 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:228 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:234 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:241 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:246 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:255 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:262 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:267 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:270 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:290 [binder, in ITree.Extra.IForest]
e1:296 [binder, in ITree.Extra.ITrace.ITraceBind]
e1:300 [binder, in ITree.Extra.ITrace.ITraceBind]
e1:32 [binder, in ITree.Eq.Shallow]
e1:329 [binder, in ITree.Eq.Eqit]
E1:34 [binder, in ITree.Eq.Rutt]
e1:37 [binder, in ITree.Extra.ITrace.ITraceBind]
E1:4 [binder, in ITree.Extra.Secure.SecureStateHandler]
E1:4 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E1:43 [binder, in ITree.Eq.Rutt]
e1:45 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e1:47 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e1:47 [binder, in ITree.Extra.Secure.SecureEqHalt]
E1:52 [binder, in ITree.Eq.Rutt]
E1:61 [binder, in ITree.Eq.Rutt]
e1:647 [binder, in ITree.Eq.Eqit]
e1:66 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
E1:70 [binder, in ITree.Eq.Rutt]
E1:79 [binder, in ITree.Eq.Rutt]
e1:81 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
e1:87 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e1:87 [binder, in ITree.Extra.Secure.SecureEqHalt]
e1:89 [binder, in ITree.Eq.Eqit]
e1:94 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
e1:97 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e1:97 [binder, in ITree.Extra.Secure.SecureEqHalt]
E2:111 [binder, in ITree.Eq.Rutt]
E2:121 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:124 [binder, in ITree.Eq.Rutt]
E2:126 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e2:133 [binder, in ITree.Eq.Eqit]
E2:142 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:147 [binder, in ITree.Eq.Rutt]
E2:150 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:155 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:160 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:199 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:2 [binder, in ITree.Eq.Rutt]
E2:2 [binder, in ITree.Indexed.Sum]
E2:206 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e2:211 [binder, in ITree.Eq.UpToTaus]
E2:215 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e2:22 [binder, in ITree.Eq.Rutt]
E2:221 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:225 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:229 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:235 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:242 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:247 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:256 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:263 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:268 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:271 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:291 [binder, in ITree.Extra.IForest]
e2:33 [binder, in ITree.Eq.Shallow]
e2:330 [binder, in ITree.Eq.Eqit]
E2:35 [binder, in ITree.Eq.Rutt]
E2:44 [binder, in ITree.Eq.Rutt]
e2:46 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e2:48 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e2:48 [binder, in ITree.Extra.Secure.SecureEqHalt]
E2:5 [binder, in ITree.Extra.Secure.SecureStateHandler]
E2:5 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E2:53 [binder, in ITree.Eq.Rutt]
E2:62 [binder, in ITree.Eq.Rutt]
e2:648 [binder, in ITree.Eq.Eqit]
e2:67 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
e2:67 [binder, in ITree.Eq.Eqit]
E2:71 [binder, in ITree.Eq.Rutt]
E2:80 [binder, in ITree.Eq.Rutt]
e2:88 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e2:88 [binder, in ITree.Extra.Secure.SecureEqHalt]
e2:92 [binder, in ITree.Eq.Eqit]
e2:98 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e2:98 [binder, in ITree.Extra.Secure.SecureEqHalt]
E3:248 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E3:257 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E4:249 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E:1 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:1 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:1 [binder, in ITree.Extra.Dijkstra.TracesIT]
E:1 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:1 [binder, in ITree.Eq.UpToTaus]
E:1 [binder, in ITree.Props.HasPost]
E:1 [binder, in ITree.Eq.EqAxiom]
E:1 [binder, in ITree.Extra.IForest]
E:1 [binder, in ITree.Events.ExceptionFacts]
E:1 [binder, in ITree.Eq.EuttExtras]
E:1 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
E:1 [binder, in ITree.Events.StateFacts]
E:1 [binder, in ITree.Core.KTree]
E:1 [binder, in ITree.Core.KTreeFacts]
E:1 [binder, in ITree.Props.Finite]
E:1 [binder, in ITree.Eq.SimUpToTaus]
E:1 [binder, in ITree.Props.Infinite]
E:1 [binder, in ITree.Props.Leaf]
E:1 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:1 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E:1 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:1 [binder, in ITree.Extra.Secure.StrongBisimProper]
E:1 [binder, in ITree.Props.EuttNoRet]
E:1 [binder, in ITree.Indexed.Function]
E:1 [binder, in ITree.Core.ITreeMonad]
E:1 [binder, in ITree.Interp.Traces]
E:1 [binder, in ITree.Extra.Secure.SecureEqBind]
E:1 [binder, in ITree.Props.Cofinite]
E:1 [binder, in ITree.Events.Concurrency]
E:1 [binder, in ITree.Interp.InterpFacts]
E:1 [binder, in ITree.Core.Subevent]
E:1 [binder, in ITree.Interp.Interp]
E:1 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:1 [binder, in ITree.Interp.TranslateFacts]
E:1 [binder, in ITree.Indexed.FunctionFacts]
E:1 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
E:1 [binder, in ITree.Extra.ITrace.ITracePreds]
E:1 [binder, in ITree.Events.State]
E:1 [binder, in ITree.Core.ITreeDefinition]
E:1 [binder, in ITree.Simple]
E:10 [binder, in ITree.Events.StateFacts]
E:10 [binder, in ITree.Core.KTreeFacts]
e:10 [binder, in ITree.Props.Finite]
e:10 [binder, in ITree.Props.Leaf]
E:10 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:10 [binder, in ITree.Events.Reader]
e:10 [binder, in ITree.Interp.HandlerFacts]
E:10 [binder, in ITree.Indexed.Function]
e:10 [binder, in ITree.Events.Writer]
E:10 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:10 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:10 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:100 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:100 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:100 [binder, in ITree.Interp.InterpFacts]
E:101 [binder, in ITree.Props.HasPost]
E:101 [binder, in ITree.Events.FailFacts]
E:101 [binder, in ITree.Interp.InterpFacts]
E:102 [binder, in ITree.Extra.ITrace.ITraceBind]
E:102 [binder, in ITree.Core.KTreeFacts]
E:102 [binder, in ITree.Props.Finite]
E:102 [binder, in ITree.Interp.Traces]
E:102 [binder, in ITree.Simple]
E:103 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:103 [binder, in ITree.Extra.Secure.SecureEqBind]
e:103 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:104 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:104 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:105 [binder, in ITree.Eq.Shallow]
E:106 [binder, in ITree.Extra.ITrace.ITraceBind]
e:106 [binder, in ITree.Extra.IForest]
E:106 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:107 [binder, in ITree.Events.StateFacts]
E:107 [binder, in ITree.Interp.Traces]
e:107 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:107 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:107 [binder, in ITree.Interp.InterpFacts]
E:107 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:107 [binder, in ITree.Eq.Eqit]
E:108 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:108 [binder, in ITree.Eq.SimUpToTaus]
E:108 [binder, in ITree.Simple]
E:109 [binder, in ITree.Core.KTreeFacts]
e:109 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:11 [binder, in ITree.Events.Map]
E:11 [binder, in ITree.Events.ExceptionFacts]
e:11 [binder, in ITree.Eq.SimUpToTaus]
E:11 [binder, in ITree.Props.Infinite]
E:11 [binder, in ITree.Props.EuttNoRet]
E:11 [binder, in ITree.Interp.InterpFacts]
E:11 [binder, in ITree.Events.State]
E:110 [binder, in ITree.Extra.ITrace.ITraceBind]
E:110 [binder, in ITree.Events.FailFacts]
E:111 [binder, in ITree.Eq.Shallow]
e:112 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:113 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:113 [binder, in ITree.Extra.ITrace.ITracePreds]
E:114 [binder, in ITree.Props.Finite]
E:114 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:115 [binder, in ITree.Extra.ITrace.ITraceBind]
E:115 [binder, in ITree.Props.HasPost]
E:115 [binder, in ITree.Extra.IForest]
e:115 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:115 [binder, in ITree.Simple]
E:116 [binder, in ITree.Interp.Traces]
E:116 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:116 [binder, in ITree.Eq.Eqit]
E:117 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:117 [binder, in ITree.Core.KTreeFacts]
E:117 [binder, in ITree.Interp.InterpFacts]
E:118 [binder, in ITree.Core.KTreeFacts]
e:118 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:118 [binder, in ITree.Simple]
E:119 [binder, in ITree.Eq.UpToTaus]
E:119 [binder, in ITree.Core.KTreeFacts]
E:12 [binder, in ITree.Extra.IForest]
E:12 [binder, in ITree.Extra.ITrace.ITraceDefinition]
e:12 [binder, in ITree.Interp.Handler]
E:12 [binder, in ITree.Events.MapDefault]
e:12 [binder, in ITree.Interp.HandlerFacts]
E:12 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
e:12 [binder, in ITree.Interp.TranslateFacts]
e:12 [binder, in ITree.Extra.ITrace.ITracePreds]
e:12 [binder, in ITree.Simple]
E:120 [binder, in ITree.Props.Finite]
E:120 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:120 [binder, in ITree.Interp.Traces]
e:120 [binder, in ITree.Extra.Secure.SecureEqBind]
E:120 [binder, in ITree.Eq.Eqit]
E:122 [binder, in ITree.Interp.Traces]
E:123 [binder, in ITree.Props.HasPost]
E:123 [binder, in ITree.Props.Finite]
e:124 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:124 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:124 [binder, in ITree.Simple]
E:125 [binder, in ITree.Props.Leaf]
e:125 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:125 [binder, in ITree.Interp.InterpFacts]
E:125 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:126 [binder, in ITree.Extra.IForest]
e:126 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:127 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:127 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:127 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:128 [binder, in ITree.Extra.Secure.SecureEqBind]
e:128 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:129 [binder, in ITree.Extra.ITrace.ITraceBind]
E:129 [binder, in ITree.Props.HasPost]
E:129 [binder, in ITree.Props.Finite]
e:129 [binder, in ITree.Interp.Traces]
e:129 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:129 [binder, in ITree.Simple]
E:13 [binder, in ITree.Interp.Recursion]
E:13 [binder, in ITree.Events.Exception]
E:13 [binder, in ITree.Interp.Handler]
E:13 [binder, in ITree.Indexed.Function]
e:13 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:13 [binder, in ITree.Events.State]
E:13 [binder, in ITree.Core.ITreeDefinition]
E:130 [binder, in ITree.Events.StateFacts]
E:131 [binder, in ITree.Extra.ITrace.ITraceBind]
E:131 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:131 [binder, in ITree.Simple]
E:132 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:133 [binder, in ITree.Interp.Traces]
E:133 [binder, in ITree.Simple]
E:134 [binder, in ITree.Extra.IForest]
e:134 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:135 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:135 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:135 [binder, in ITree.Props.Finite]
E:135 [binder, in ITree.Eq.Eqit]
E:135 [binder, in ITree.Simple]
e:136 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:136 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:138 [binder, in ITree.Extra.ITrace.ITraceBind]
e:138 [binder, in ITree.Simple]
E:139 [binder, in ITree.Extra.IForest]
e:139 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:139 [binder, in ITree.Simple]
E:14 [binder, in ITree.Extra.ITrace.ITraceBind]
E:14 [binder, in ITree.Props.HasPost]
E:14 [binder, in ITree.Eq.EuttExtras]
E:14 [binder, in ITree.Props.Finite]
E:14 [binder, in ITree.Props.Leaf]
E:14 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:14 [binder, in ITree.Interp.Traces]
E:14 [binder, in ITree.Events.Writer]
E:141 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:142 [binder, in ITree.Props.Leaf]
E:142 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:142 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:142 [binder, in ITree.Simple]
E:143 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:144 [binder, in ITree.Extra.ITrace.ITraceBind]
e:144 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:145 [binder, in ITree.Eq.Eqit]
E:145 [binder, in ITree.Simple]
E:147 [binder, in ITree.Extra.IForest]
E:148 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:148 [binder, in ITree.Eq.Eqit]
e:149 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:149 [binder, in ITree.Props.Finite]
E:149 [binder, in ITree.Simple]
E:15 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
E:15 [binder, in ITree.Props.Infinite]
E:15 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:15 [binder, in ITree.Interp.Handler]
E:15 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:15 [binder, in ITree.Interp.Interp]
E:15 [binder, in ITree.Interp.TranslateFacts]
E:15 [binder, in ITree.Extra.ITrace.ITracePreds]
E:15 [binder, in ITree.Events.State]
E:150 [binder, in ITree.Events.StateFacts]
E:151 [binder, in ITree.Extra.ITrace.ITraceBind]
E:151 [binder, in ITree.Extra.IForest]
E:151 [binder, in ITree.Eq.Eqit]
E:152 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:152 [binder, in ITree.Extra.Secure.SecureEqBind]
e:152 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:153 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:154 [binder, in ITree.Extra.ITrace.ITraceBind]
E:154 [binder, in ITree.Props.Finite]
E:154 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:154 [binder, in ITree.Eq.Eqit]
E:156 [binder, in ITree.Events.StateFacts]
E:156 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:156 [binder, in ITree.Simple]
E:157 [binder, in ITree.Props.Leaf]
E:157 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e:158 [binder, in ITree.Extra.ITrace.ITraceBind]
E:16 [binder, in ITree.Interp.Recursion]
E:16 [binder, in ITree.Extra.ITrace.ITraceDefinition]
e:16 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:16 [binder, in ITree.Props.EuttNoRet]
E:16 [binder, in ITree.Indexed.Function]
E:16 [binder, in ITree.Events.Writer]
e:16 [binder, in ITree.Events.State]
E:16 [binder, in ITree.Core.ITreeDefinition]
E:160 [binder, in ITree.Extra.IForest]
E:160 [binder, in ITree.Props.Finite]
E:160 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:160 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:162 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E:162 [binder, in ITree.Eq.Eqit]
E:163 [binder, in ITree.Extra.ITrace.ITraceBind]
e:163 [binder, in ITree.Simple]
E:165 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:165 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:166 [binder, in ITree.Extra.IForest]
e:167 [binder, in ITree.Extra.ITrace.ITraceBind]
E:167 [binder, in ITree.Events.StateFacts]
e:167 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:167 [binder, in ITree.Simple]
E:169 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e:169 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:17 [binder, in ITree.Events.ExceptionFacts]
E:17 [binder, in ITree.Events.StateFacts]
E:17 [binder, in ITree.Props.Leaf]
E:17 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:17 [binder, in ITree.Interp.Handler]
e:17 [binder, in ITree.Indexed.Function]
e:17 [binder, in ITree.Extra.Secure.SecureEqBind]
E:17 [binder, in ITree.Core.Subevent]
E:170 [binder, in ITree.Extra.Secure.SecureEqBind]
E:170 [binder, in ITree.Eq.Eqit]
E:171 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:171 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:172 [binder, in ITree.Extra.ITrace.ITraceBind]
E:172 [binder, in ITree.Props.Finite]
E:172 [binder, in ITree.Simple]
E:173 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e:173 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:175 [binder, in ITree.Extra.ITrace.ITraceBind]
e:175 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:175 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:177 [binder, in ITree.Simple]
E:178 [binder, in ITree.Extra.ITrace.ITraceBind]
E:178 [binder, in ITree.Props.Finite]
E:178 [binder, in ITree.Eq.Eqit]
E:179 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:179 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:179 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:18 [binder, in ITree.Props.HasPost]
E:18 [binder, in ITree.Indexed.Function]
E:18 [binder, in ITree.Interp.InterpFacts]
e:18 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:180 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:181 [binder, in ITree.Extra.IForest]
e:181 [binder, in ITree.Simple]
e:182 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:183 [binder, in ITree.Props.Finite]
E:185 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:185 [binder, in ITree.Simple]
E:186 [binder, in ITree.Extra.IForest]
E:186 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e:187 [binder, in ITree.Extra.ITrace.ITraceBind]
E:187 [binder, in ITree.Props.Finite]
E:188 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:188 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:189 [binder, in ITree.Extra.ITrace.ITraceBind]
E:189 [binder, in ITree.Simple]
E:19 [binder, in ITree.Events.Map]
E:19 [binder, in ITree.Extra.IForest]
E:19 [binder, in ITree.Interp.Traces]
E:19 [binder, in ITree.Events.Concurrency]
E:190 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:190 [binder, in ITree.Eq.Eqit]
E:192 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E:193 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e:193 [binder, in ITree.Extra.ITrace.ITraceBind]
E:194 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:197 [binder, in ITree.Simple]
E:199 [binder, in ITree.Extra.IForest]
E:2 [binder, in ITree.Interp.Recursion]
E:2 [binder, in ITree.Basics.Basics]
e:2 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:2 [binder, in ITree.Interp.RecursionFacts]
e:20 [binder, in ITree.Events.Map]
E:20 [binder, in ITree.Props.HasPost]
e:20 [binder, in ITree.Interp.HandlerFacts]
E:20 [binder, in ITree.Events.Writer]
e:20 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:20 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:20 [binder, in ITree.Events.State]
e:20 [binder, in ITree.Eq.Eqit]
E:200 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:200 [binder, in ITree.Extra.ITrace.ITraceBind]
e:200 [binder, in ITree.Eq.UpToTaus]
E:200 [binder, in ITree.Props.Finite]
E:201 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:202 [binder, in ITree.Extra.IForest]
E:202 [binder, in ITree.Props.Finite]
E:202 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:204 [binder, in ITree.Extra.ITrace.ITraceBind]
E:204 [binder, in ITree.Props.Finite]
E:204 [binder, in ITree.Simple]
E:205 [binder, in ITree.Extra.IForest]
e:208 [binder, in ITree.Extra.IForest]
E:208 [binder, in ITree.Props.Finite]
E:209 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:209 [binder, in ITree.Simple]
E:21 [binder, in ITree.Props.Leaf]
E:21 [binder, in ITree.Extra.ITrace.ITraceDefinition]
e:21 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:21 [binder, in ITree.Extra.Secure.SecureEqBind]
E:21 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:21 [binder, in ITree.Core.Subevent]
E:21 [binder, in ITree.Extra.ITrace.ITracePreds]
e:21 [binder, in ITree.Events.State]
e:21 [binder, in ITree.Simple]
E:212 [binder, in ITree.Extra.IForest]
E:213 [binder, in ITree.Extra.ITrace.ITraceBind]
E:214 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:214 [binder, in ITree.Simple]
E:219 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:219 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:219 [binder, in ITree.Simple]
E:22 [binder, in ITree.Props.HasPost]
E:22 [binder, in ITree.Events.StateFacts]
E:22 [binder, in ITree.Props.Infinite]
e:22 [binder, in ITree.Events.Writer]
E:22 [binder, in ITree.Events.Concurrency]
E:22 [binder, in ITree.Core.Subevent]
E:22 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:220 [binder, in ITree.Extra.ITrace.ITraceBind]
E:220 [binder, in ITree.Extra.IForest]
E:221 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:222 [binder, in ITree.Simple]
E:225 [binder, in ITree.Eq.UpToTaus]
E:225 [binder, in ITree.Extra.IForest]
e:226 [binder, in ITree.Simple]
E:227 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:227 [binder, in ITree.Simple]
E:229 [binder, in ITree.Extra.ITrace.ITraceBind]
e:229 [binder, in ITree.Extra.IForest]
E:23 [binder, in ITree.Events.Map]
e:23 [binder, in ITree.Props.Finite]
E:23 [binder, in ITree.Events.Exception]
e:23 [binder, in ITree.Interp.HandlerFacts]
E:23 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:23 [binder, in ITree.Interp.InterpFacts]
E:23 [binder, in ITree.Core.ITreeDefinition]
E:230 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:231 [binder, in ITree.Eq.UpToTaus]
E:234 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:234 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:235 [binder, in ITree.Simple]
E:237 [binder, in ITree.Eq.UpToTaus]
E:237 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:238 [binder, in ITree.Basics.HeterogeneousRelations]
E:239 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:239 [binder, in ITree.Simple]
E:24 [binder, in ITree.Extra.ITrace.ITraceBind]
E:24 [binder, in ITree.Events.FailFacts]
E:24 [binder, in ITree.Eq.SimUpToTaus]
E:24 [binder, in ITree.Props.Infinite]
e:24 [binder, in ITree.Props.Leaf]
E:24 [binder, in ITree.Interp.Handler]
E:24 [binder, in ITree.Events.MapDefault]
E:24 [binder, in ITree.Events.Nondeterminism]
e:24 [binder, in ITree.Indexed.Function]
E:24 [binder, in ITree.Interp.TranslateFacts]
E:24 [binder, in ITree.Events.State]
E:240 [binder, in ITree.Extra.ITrace.ITraceBind]
E:240 [binder, in ITree.Extra.IForest]
E:244 [binder, in ITree.Eq.Eqit]
E:244 [binder, in ITree.Simple]
E:245 [binder, in ITree.Eq.UpToTaus]
E:246 [binder, in ITree.Extra.IForest]
E:248 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e:249 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:25 [binder, in ITree.Events.FailFacts]
E:25 [binder, in ITree.Events.ExceptionFacts]
E:25 [binder, in ITree.Core.KTreeFacts]
E:25 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:25 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:25 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
E:25 [binder, in ITree.Extra.ITrace.ITracePreds]
E:25 [binder, in ITree.Events.State]
E:250 [binder, in ITree.Simple]
E:252 [binder, in ITree.Extra.IForest]
E:253 [binder, in ITree.Eq.UpToTaus]
E:253 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:253 [binder, in ITree.Simple]
E:256 [binder, in ITree.Extra.ITrace.ITraceBind]
E:257 [binder, in ITree.Eq.UpToTaus]
E:258 [binder, in ITree.Simple]
E:259 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e:26 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e:26 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:26 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:26 [binder, in ITree.Props.Infinite]
e:26 [binder, in ITree.Events.MapDefault]
E:26 [binder, in ITree.Props.EuttNoRet]
E:26 [binder, in ITree.Events.Writer]
E:26 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:26 [binder, in ITree.Core.Subevent]
E:26 [binder, in ITree.Simple]
E:261 [binder, in ITree.Eq.UpToTaus]
E:261 [binder, in ITree.Extra.IForest]
E:262 [binder, in ITree.Simple]
E:264 [binder, in ITree.Eq.Eqit]
E:264 [binder, in ITree.Simple]
E:265 [binder, in ITree.Eq.UpToTaus]
E:265 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:266 [binder, in ITree.Simple]
e:267 [binder, in ITree.Extra.IForest]
E:268 [binder, in ITree.Extra.ITrace.ITraceBind]
E:268 [binder, in ITree.Simple]
E:269 [binder, in ITree.Eq.UpToTaus]
E:27 [binder, in ITree.Props.HasPost]
E:27 [binder, in ITree.Events.FailFacts]
E:27 [binder, in ITree.Props.Finite]
E:27 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:27 [binder, in ITree.Core.Subevent]
E:27 [binder, in ITree.Interp.TranslateFacts]
E:27 [binder, in ITree.Events.MapDefaultFacts]
e:271 [binder, in ITree.Simple]
E:272 [binder, in ITree.Simple]
E:273 [binder, in ITree.Extra.IForest]
E:275 [binder, in ITree.Simple]
E:277 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:278 [binder, in ITree.Extra.ITrace.ITraceBind]
E:278 [binder, in ITree.Eq.UpToTaus]
E:278 [binder, in ITree.Simple]
e:279 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e:279 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e:28 [binder, in ITree.Extra.IForest]
E:28 [binder, in ITree.Events.ExceptionFacts]
E:28 [binder, in ITree.Props.Leaf]
e:28 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
e:28 [binder, in ITree.Interp.Traces]
e:28 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:28 [binder, in ITree.Eq.Shallow]
E:28 [binder, in ITree.Interp.InterpFacts]
E:28 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
E:28 [binder, in ITree.Core.ITreeDefinition]
E:281 [binder, in ITree.Extra.IForest]
E:281 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:282 [binder, in ITree.Basics.HeterogeneousRelations]
E:284 [binder, in ITree.Eq.UpToTaus]
E:286 [binder, in ITree.Extra.IForest]
E:288 [binder, in ITree.Extra.ITrace.ITraceBind]
E:29 [binder, in ITree.Extra.ITrace.ITraceBind]
E:29 [binder, in ITree.Events.FailFacts]
E:29 [binder, in ITree.Props.Infinite]
E:29 [binder, in ITree.Events.MapDefault]
E:29 [binder, in ITree.Extra.ITrace.ITracePreds]
e:290 [binder, in ITree.Eq.Eqit]
E:291 [binder, in ITree.Eq.UpToTaus]
e:292 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
E:296 [binder, in ITree.Eq.Eqit]
E:298 [binder, in ITree.Eq.UpToTaus]
E:3 [binder, in ITree.Extra.ITrace.ITraceBind]
E:3 [binder, in ITree.Extra.IForest]
e:3 [binder, in ITree.Basics.Basics]
E:3 [binder, in ITree.Events.Nondeterminism]
E:3 [binder, in ITree.Indexed.Function]
E:3 [binder, in ITree.Core.ITreeMonad]
E:3 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:3 [binder, in ITree.Eq.Eqit]
E:30 [binder, in ITree.Events.StateFacts]
e:30 [binder, in ITree.Interp.Recursion]
E:30 [binder, in ITree.Props.Finite]
E:30 [binder, in ITree.Eq.SimUpToTaus]
E:30 [binder, in ITree.Interp.Handler]
E:30 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
E:300 [binder, in ITree.Eq.Eqit]
E:301 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:302 [binder, in ITree.Extra.ITrace.ITraceBind]
E:303 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e:304 [binder, in ITree.Eq.Eqit]
E:305 [binder, in ITree.Eq.UpToTaus]
E:307 [binder, in ITree.Extra.IForest]
E:308 [binder, in ITree.Eq.Eqit]
E:309 [binder, in ITree.Extra.ITrace.ITraceBind]
E:31 [binder, in ITree.Eq.UpToTaus]
E:31 [binder, in ITree.Events.FailFacts]
E:31 [binder, in ITree.Events.ExceptionFacts]
E:31 [binder, in ITree.Props.Infinite]
e:31 [binder, in ITree.Extra.ITrace.ITraceDefinition]
e:31 [binder, in ITree.Interp.Handler]
E:31 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:31 [binder, in ITree.Interp.Traces]
e:31 [binder, in ITree.Core.Subevent]
E:31 [binder, in ITree.Interp.RecursionFacts]
E:312 [binder, in ITree.Eq.UpToTaus]
E:313 [binder, in ITree.Eq.Eqit]
E:315 [binder, in ITree.Extra.ITrace.ITraceBind]
E:315 [binder, in ITree.Eq.UpToTaus]
e:316 [binder, in ITree.Extra.IForest]
E:317 [binder, in ITree.Extra.IForest]
E:317 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e:32 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e:32 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:32 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:32 [binder, in ITree.Props.HasPost]
E:32 [binder, in ITree.Extra.IForest]
e:32 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
E:32 [binder, in ITree.Props.Leaf]
E:32 [binder, in ITree.Interp.Handler]
E:32 [binder, in ITree.Props.EuttNoRet]
E:32 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:32 [binder, in ITree.Core.Subevent]
E:32 [binder, in ITree.Interp.RecursionFacts]
E:32 [binder, in ITree.Simple]
E:32 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E:321 [binder, in ITree.Eq.Eqit]
E:322 [binder, in ITree.Extra.ITrace.ITraceBind]
E:322 [binder, in ITree.Extra.IForest]
E:327 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:328 [binder, in ITree.Extra.IForest]
E:33 [binder, in ITree.Events.FailFacts]
E:33 [binder, in ITree.Props.Finite]
E:33 [binder, in ITree.Interp.InterpFacts]
e:33 [binder, in ITree.Events.State]
E:330 [binder, in ITree.Extra.ITrace.ITraceBind]
e:334 [binder, in ITree.Extra.ITrace.ITraceBind]
E:334 [binder, in ITree.Eq.Eqit]
E:335 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:336 [binder, in ITree.Extra.IForest]
E:34 [binder, in ITree.Events.FailFacts]
E:34 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
E:34 [binder, in ITree.Eq.SimUpToTaus]
e:34 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:34 [binder, in ITree.Interp.Handler]
E:34 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:34 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:34 [binder, in ITree.Interp.TranslateFacts]
E:34 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
e:341 [binder, in ITree.Eq.Eqit]
E:343 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:345 [binder, in ITree.Extra.IForest]
E:345 [binder, in ITree.Eq.Eqit]
E:35 [binder, in ITree.Events.ExceptionFacts]
e:35 [binder, in ITree.Events.StateFacts]
E:35 [binder, in ITree.Interp.Traces]
E:35 [binder, in ITree.Core.ITreeDefinition]
E:352 [binder, in ITree.Eq.Eqit]
E:359 [binder, in ITree.Eq.Eqit]
e:36 [binder, in ITree.Interp.Recursion]
e:36 [binder, in ITree.Props.Finite]
E:36 [binder, in ITree.Props.Leaf]
E:36 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:36 [binder, in ITree.Interp.TranslateFacts]
E:36 [binder, in ITree.Interp.RecursionFacts]
E:36 [binder, in ITree.Extra.ITrace.ITracePreds]
e:36 [binder, in ITree.Simple]
E:367 [binder, in ITree.Eq.Eqit]
E:37 [binder, in ITree.Props.HasPost]
E:37 [binder, in ITree.Interp.Handler]
E:37 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:37 [binder, in ITree.Props.EuttNoRet]
e:37 [binder, in ITree.Extra.Secure.SecureEqBind]
e:37 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:37 [binder, in ITree.Events.State]
E:374 [binder, in ITree.Extra.IForest]
E:378 [binder, in ITree.Eq.Eqit]
e:38 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:38 [binder, in ITree.Eq.UpToTaus]
E:38 [binder, in ITree.Extra.IForest]
E:38 [binder, in ITree.Interp.Traces]
E:38 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:38 [binder, in ITree.Interp.InterpFacts]
e:38 [binder, in ITree.Core.Subevent]
E:38 [binder, in ITree.Interp.TranslateFacts]
E:382 [binder, in ITree.Eq.Eqit]
E:384 [binder, in ITree.Extra.IForest]
E:386 [binder, in ITree.Eq.Eqit]
e:39 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:39 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:39 [binder, in ITree.Events.ExceptionFacts]
E:39 [binder, in ITree.Props.Finite]
e:39 [binder, in ITree.Props.Infinite]
e:39 [binder, in ITree.Props.Leaf]
E:39 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:393 [binder, in ITree.Eq.Eqit]
e:394 [binder, in ITree.Basics.CategoryFacts]
E:398 [binder, in ITree.Extra.IForest]
e:4 [binder, in ITree.Interp.Handler]
E:4 [binder, in ITree.Events.Reader]
E:4 [binder, in ITree.Core.ITreeMonad]
E:4 [binder, in ITree.Props.Cofinite]
E:40 [binder, in ITree.Extra.ITrace.ITraceBind]
E:40 [binder, in ITree.Events.FailFacts]
E:40 [binder, in ITree.Events.StateFacts]
E:40 [binder, in ITree.Core.KTreeFacts]
e:40 [binder, in ITree.Eq.SimUpToTaus]
E:40 [binder, in ITree.Interp.Handler]
E:40 [binder, in ITree.Extra.ITrace.ITracePreds]
e:40 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
e:400 [binder, in ITree.Extra.IForest]
E:400 [binder, in ITree.Eq.Eqit]
E:402 [binder, in ITree.Extra.IForest]
E:403 [binder, in ITree.Eq.Eqit]
E:406 [binder, in ITree.Eq.Eqit]
E:407 [binder, in ITree.Extra.IForest]
E:41 [binder, in ITree.Props.Infinite]
e:41 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:41 [binder, in ITree.Interp.HandlerFacts]
E:41 [binder, in ITree.Extra.Secure.SecureEqBind]
E:41 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:41 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:41 [binder, in ITree.Interp.InterpFacts]
E:41 [binder, in ITree.Interp.TranslateFacts]
E:41 [binder, in ITree.Interp.RecursionFacts]
E:41 [binder, in ITree.Simple]
E:411 [binder, in ITree.Extra.IForest]
E:42 [binder, in ITree.Props.HasPost]
e:42 [binder, in ITree.Interp.Recursion]
E:42 [binder, in ITree.Props.Finite]
e:42 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:42 [binder, in ITree.Props.EuttNoRet]
E:42 [binder, in ITree.Events.MapDefaultFacts]
E:420 [binder, in ITree.Extra.IForest]
E:428 [binder, in ITree.Extra.IForest]
E:428 [binder, in ITree.Eq.Eqit]
E:43 [binder, in ITree.Events.ExceptionFacts]
E:43 [binder, in ITree.Interp.Handler]
e:43 [binder, in ITree.Interp.HandlerFacts]
E:43 [binder, in ITree.Interp.Traces]
E:43 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:435 [binder, in ITree.Extra.IForest]
e:437 [binder, in ITree.Basics.CategoryFacts]
e:439 [binder, in ITree.Extra.IForest]
E:44 [binder, in ITree.Interp.Recursion]
E:44 [binder, in ITree.Eq.SimUpToTaus]
E:44 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:44 [binder, in ITree.Interp.TranslateFacts]
E:44 [binder, in ITree.Extra.ITrace.ITracePreds]
E:44 [binder, in ITree.Core.ITreeDefinition]
E:443 [binder, in ITree.Extra.IForest]
E:445 [binder, in ITree.Eq.Eqit]
e:446 [binder, in ITree.Extra.IForest]
E:45 [binder, in ITree.Eq.UpToTaus]
E:45 [binder, in ITree.Props.HasPost]
E:45 [binder, in ITree.Props.Finite]
E:45 [binder, in ITree.Props.Infinite]
e:45 [binder, in ITree.Interp.HandlerFacts]
e:45 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:45 [binder, in ITree.Interp.InterpFacts]
E:450 [binder, in ITree.Extra.IForest]
E:450 [binder, in ITree.Eq.Eqit]
E:454 [binder, in ITree.Extra.IForest]
E:454 [binder, in ITree.Eq.Eqit]
E:458 [binder, in ITree.Extra.IForest]
E:458 [binder, in ITree.Eq.Eqit]
E:46 [binder, in ITree.Eq.Shallow]
E:46 [binder, in ITree.Interp.InterpFacts]
E:46 [binder, in ITree.Interp.TranslateFacts]
e:46 [binder, in ITree.Events.State]
E:46 [binder, in ITree.Simple]
e:46 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E:461 [binder, in ITree.Eq.Eqit]
E:464 [binder, in ITree.Eq.Eqit]
E:466 [binder, in ITree.Extra.IForest]
E:467 [binder, in ITree.Eq.Eqit]
E:47 [binder, in ITree.Events.FailFacts]
e:47 [binder, in ITree.Events.ExceptionFacts]
E:47 [binder, in ITree.Events.StateFacts]
E:47 [binder, in ITree.Props.EuttNoRet]
e:47 [binder, in ITree.Interp.HandlerFacts]
E:47 [binder, in ITree.Interp.Traces]
E:47 [binder, in ITree.Events.MapDefaultFacts]
E:47 [binder, in ITree.Interp.RecursionFacts]
E:476 [binder, in ITree.Extra.IForest]
e:48 [binder, in ITree.Props.Finite]
E:48 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:48 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:48 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:48 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:48 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:48 [binder, in ITree.Interp.InterpFacts]
E:48 [binder, in ITree.Interp.TranslateFacts]
E:48 [binder, in ITree.Interp.RecursionFacts]
E:482 [binder, in ITree.Extra.IForest]
E:485 [binder, in ITree.Eq.Eqit]
E:487 [binder, in ITree.Extra.IForest]
E:49 [binder, in ITree.Extra.ITrace.ITraceBind]
E:49 [binder, in ITree.Extra.IForest]
E:49 [binder, in ITree.Events.ExceptionFacts]
E:49 [binder, in ITree.Interp.Recursion]
e:49 [binder, in ITree.Eq.SimUpToTaus]
E:49 [binder, in ITree.Props.Leaf]
e:49 [binder, in ITree.Interp.HandlerFacts]
E:493 [binder, in ITree.Eq.Eqit]
E:5 [binder, in ITree.Events.Map]
E:5 [binder, in ITree.Eq.EuttExtras]
E:5 [binder, in ITree.Events.Exception]
E:5 [binder, in ITree.Interp.Handler]
E:5 [binder, in ITree.Events.Writer]
E:5 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:5 [binder, in ITree.Interp.InterpFacts]
E:5 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
E:50 [binder, in ITree.Extra.ITrace.ITraceDefinition]
E:50 [binder, in ITree.Core.ITreeDefinition]
E:500 [binder, in ITree.Extra.IForest]
E:508 [binder, in ITree.Extra.IForest]
E:509 [binder, in ITree.Eq.Eqit]
e:51 [binder, in ITree.Events.StateFacts]
E:51 [binder, in ITree.Props.Finite]
e:51 [binder, in ITree.Interp.HandlerFacts]
E:51 [binder, in ITree.Interp.Traces]
E:51 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:51 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:51 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:51 [binder, in ITree.Events.MapDefaultFacts]
e:51 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E:512 [binder, in ITree.Extra.IForest]
E:515 [binder, in ITree.Eq.Eqit]
E:517 [binder, in ITree.Extra.IForest]
E:52 [binder, in ITree.Eq.UpToTaus]
E:52 [binder, in ITree.Props.HasPost]
E:52 [binder, in ITree.Props.Infinite]
E:52 [binder, in ITree.Interp.InterpFacts]
E:52 [binder, in ITree.Interp.TranslateFacts]
e:52 [binder, in ITree.Extra.ITrace.ITracePreds]
e:52 [binder, in ITree.Core.ITreeDefinition]
E:520 [binder, in ITree.Extra.IForest]
E:525 [binder, in ITree.Extra.IForest]
E:53 [binder, in ITree.Events.FailFacts]
e:53 [binder, in ITree.Events.ExceptionFacts]
E:53 [binder, in ITree.Interp.Recursion]
E:53 [binder, in ITree.Eq.SimUpToTaus]
E:53 [binder, in ITree.Events.State]
E:531 [binder, in ITree.Extra.IForest]
E:531 [binder, in ITree.Eq.Eqit]
E:537 [binder, in ITree.Eq.Eqit]
E:539 [binder, in ITree.Extra.IForest]
e:54 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:54 [binder, in ITree.Props.Finite]
E:54 [binder, in ITree.Props.Infinite]
E:54 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:54 [binder, in ITree.Eq.Shallow]
E:54 [binder, in ITree.Interp.InterpFacts]
e:54 [binder, in ITree.Extra.ITrace.ITracePreds]
E:54 [binder, in ITree.Core.ITreeDefinition]
e:54 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E:546 [binder, in ITree.Extra.IForest]
E:55 [binder, in ITree.Extra.ITrace.ITraceBind]
E:55 [binder, in ITree.Events.ExceptionFacts]
E:55 [binder, in ITree.Events.StateFacts]
e:55 [binder, in ITree.Interp.HandlerFacts]
E:55 [binder, in ITree.Interp.Traces]
E:55 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:55 [binder, in ITree.Simple]
E:553 [binder, in ITree.Eq.Eqit]
E:555 [binder, in ITree.Extra.IForest]
E:559 [binder, in ITree.Eq.Eqit]
E:56 [binder, in ITree.Props.Infinite]
E:56 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:56 [binder, in ITree.Interp.InterpFacts]
E:56 [binder, in ITree.Extra.ITrace.ITracePreds]
E:56 [binder, in ITree.Core.ITreeDefinition]
E:562 [binder, in ITree.Extra.IForest]
E:563 [binder, in ITree.Eq.Eqit]
E:565 [binder, in ITree.Eq.Eqit]
E:568 [binder, in ITree.Extra.IForest]
e:57 [binder, in ITree.Props.Finite]
e:57 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:57 [binder, in ITree.Eq.Eqit]
E:572 [binder, in ITree.Eq.Eqit]
E:573 [binder, in ITree.Extra.IForest]
E:576 [binder, in ITree.Extra.IForest]
E:579 [binder, in ITree.Extra.IForest]
E:579 [binder, in ITree.Eq.Eqit]
e:58 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:58 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:58 [binder, in ITree.Events.FailFacts]
E:58 [binder, in ITree.Eq.Shallow]
E:58 [binder, in ITree.Events.MapDefaultFacts]
E:584 [binder, in ITree.Extra.IForest]
E:586 [binder, in ITree.Extra.IForest]
E:587 [binder, in ITree.Eq.Eqit]
e:59 [binder, in ITree.Extra.ITrace.ITraceBind]
e:59 [binder, in ITree.Events.StateFacts]
E:59 [binder, in ITree.Eq.SimUpToTaus]
E:59 [binder, in ITree.Interp.Traces]
E:59 [binder, in ITree.Core.ITreeDefinition]
E:590 [binder, in ITree.Extra.IForest]
E:593 [binder, in ITree.Extra.IForest]
E:598 [binder, in ITree.Extra.IForest]
E:598 [binder, in ITree.Eq.Eqit]
E:6 [binder, in ITree.Eq.EqAxiom]
E:6 [binder, in ITree.Extra.IForest]
E:6 [binder, in ITree.Events.ExceptionFacts]
E:6 [binder, in ITree.Interp.Handler]
E:6 [binder, in ITree.Events.MapDefault]
E:6 [binder, in ITree.Events.Reader]
E:6 [binder, in ITree.Events.Concurrency]
E:60 [binder, in ITree.Extra.IForest]
E:60 [binder, in ITree.Events.ExceptionFacts]
E:60 [binder, in ITree.Extra.Secure.SecureEqBind]
E:60 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:60 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:60 [binder, in ITree.Interp.TranslateFacts]
E:603 [binder, in ITree.Eq.Eqit]
E:608 [binder, in ITree.Eq.Eqit]
e:61 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
E:61 [binder, in ITree.Extra.ITrace.ITraceBind]
e:61 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:61 [binder, in ITree.Interp.HandlerFacts]
E:61 [binder, in ITree.Interp.InterpFacts]
E:61 [binder, in ITree.Extra.ITrace.ITracePreds]
e:612 [binder, in ITree.Eq.Eqit]
E:616 [binder, in ITree.Eq.Eqit]
e:619 [binder, in ITree.Eq.Eqit]
E:62 [binder, in ITree.Events.FailFacts]
E:62 [binder, in ITree.Events.StateFacts]
E:62 [binder, in ITree.Props.EuttNoRet]
E:62 [binder, in ITree.Simple]
e:62 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E:622 [binder, in ITree.Eq.Eqit]
E:63 [binder, in ITree.Props.Leaf]
E:630 [binder, in ITree.Eq.Eqit]
E:634 [binder, in ITree.Eq.Eqit]
E:64 [binder, in ITree.Props.HasPost]
E:64 [binder, in ITree.Core.KTreeFacts]
e:64 [binder, in ITree.Props.Infinite]
E:64 [binder, in ITree.Eq.Shallow]
E:64 [binder, in ITree.Extra.ITrace.ITracePreds]
E:64 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
E:65 [binder, in ITree.Eq.SimUpToTaus]
E:65 [binder, in ITree.Interp.InterpFacts]
E:65 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e:65 [binder, in ITree.Interp.TranslateFacts]
e:654 [binder, in ITree.Eq.Eqit]
e:66 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:66 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:66 [binder, in ITree.Props.Finite]
E:66 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:66 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:66 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:67 [binder, in ITree.Extra.ITrace.ITraceBind]
E:67 [binder, in ITree.Events.FailFacts]
E:67 [binder, in ITree.Events.ExceptionFacts]
E:67 [binder, in ITree.Core.KTreeFacts]
E:67 [binder, in ITree.Props.EuttNoRet]
E:67 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:67 [binder, in ITree.Eq.Shallow]
E:67 [binder, in ITree.Extra.ITrace.ITracePreds]
E:67 [binder, in ITree.Core.ITreeDefinition]
E:68 [binder, in ITree.Props.Infinite]
E:68 [binder, in ITree.Core.ITreeDefinition]
E:68 [binder, in ITree.Simple]
E:69 [binder, in ITree.Props.Finite]
E:69 [binder, in ITree.Interp.Traces]
E:695 [binder, in ITree.Eq.Eqit]
E:699 [binder, in ITree.Eq.Eqit]
E:7 [binder, in ITree.Events.Map]
E:7 [binder, in ITree.Props.HasPost]
E:7 [binder, in ITree.Indexed.Function]
E:7 [binder, in ITree.Interp.Traces]
e:7 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:70 [binder, in ITree.Events.FailFacts]
E:70 [binder, in ITree.Props.Infinite]
E:70 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:703 [binder, in ITree.Eq.Eqit]
E:71 [binder, in ITree.Eq.SimUpToTaus]
E:71 [binder, in ITree.Props.Leaf]
E:71 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:71 [binder, in ITree.Props.EuttNoRet]
E:718 [binder, in ITree.Eq.Eqit]
e:72 [binder, in ITree.Props.Finite]
E:72 [binder, in ITree.Eq.Shallow]
E:72 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:73 [binder, in ITree.Extra.IForest]
E:73 [binder, in ITree.Events.StateFacts]
E:73 [binder, in ITree.Props.Infinite]
E:73 [binder, in ITree.Props.Leaf]
E:73 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:733 [binder, in ITree.Eq.Eqit]
E:738 [binder, in ITree.Eq.Eqit]
e:74 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:74 [binder, in ITree.Extra.ITrace.ITraceBind]
e:74 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:74 [binder, in ITree.Events.ExceptionFacts]
E:74 [binder, in ITree.Props.EuttNoRet]
E:74 [binder, in ITree.Core.ITreeDefinition]
E:74 [binder, in ITree.Simple]
E:743 [binder, in ITree.Eq.Eqit]
E:75 [binder, in ITree.Events.FailFacts]
E:75 [binder, in ITree.Core.KTreeFacts]
E:75 [binder, in ITree.Interp.Traces]
E:75 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:758 [binder, in ITree.Eq.Eqit]
E:76 [binder, in ITree.Props.HasPost]
E:76 [binder, in ITree.Interp.InterpFacts]
e:76 [binder, in ITree.Extra.ITrace.ITracePreds]
E:76 [binder, in ITree.Core.ITreeDefinition]
E:763 [binder, in ITree.Eq.Eqit]
E:767 [binder, in ITree.Eq.Eqit]
E:77 [binder, in ITree.Extra.ITrace.ITraceBind]
E:77 [binder, in ITree.Eq.SimUpToTaus]
E:77 [binder, in ITree.Props.Infinite]
E:77 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:77 [binder, in ITree.Props.EuttNoRet]
E:77 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:77 [binder, in ITree.Eq.Shallow]
E:77 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:773 [binder, in ITree.Eq.Eqit]
E:78 [binder, in ITree.Core.KTreeFacts]
E:78 [binder, in ITree.Extra.Secure.SecureEqBind]
E:781 [binder, in ITree.Eq.Eqit]
E:789 [binder, in ITree.Eq.Eqit]
e:79 [binder, in ITree.Events.FailFacts]
E:79 [binder, in ITree.Extra.IForest]
e:79 [binder, in ITree.Events.ExceptionFacts]
E:79 [binder, in ITree.Events.StateFacts]
E:79 [binder, in ITree.Interp.Traces]
E:79 [binder, in ITree.Interp.InterpFacts]
e:79 [binder, in ITree.Simple]
E:797 [binder, in ITree.Eq.Eqit]
E:8 [binder, in ITree.Interp.Recursion]
e:8 [binder, in ITree.Events.Exception]
e:8 [binder, in ITree.Events.Reader]
E:8 [binder, in ITree.Props.EuttNoRet]
E:8 [binder, in ITree.Events.Dependent]
E:8 [binder, in ITree.Indexed.FunctionFacts]
E:8 [binder, in ITree.Indexed.Sum]
e:80 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:80 [binder, in ITree.Extra.Secure.SecureEqHalt]
E:80 [binder, in ITree.Props.Leaf]
E:80 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:80 [binder, in ITree.Extra.ITrace.ITracePreds]
E:80 [binder, in ITree.Core.ITreeDefinition]
E:80 [binder, in ITree.Eq.Eqit]
E:805 [binder, in ITree.Eq.Eqit]
E:81 [binder, in ITree.Events.ExceptionFacts]
E:81 [binder, in ITree.Props.Finite]
e:81 [binder, in ITree.Eq.Shallow]
E:810 [binder, in ITree.Eq.Eqit]
E:815 [binder, in ITree.Eq.Eqit]
E:82 [binder, in ITree.Props.HasPost]
E:82 [binder, in ITree.Extra.IForest]
E:82 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:82 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:826 [binder, in ITree.Eq.Eqit]
E:83 [binder, in ITree.Extra.ITrace.ITraceBind]
E:83 [binder, in ITree.Eq.SimUpToTaus]
E:83 [binder, in ITree.Props.Infinite]
E:83 [binder, in ITree.Interp.Traces]
E:83 [binder, in ITree.Extra.ITrace.ITracePreds]
E:83 [binder, in ITree.Simple]
E:833 [binder, in ITree.Eq.Eqit]
E:84 [binder, in ITree.Events.StateFacts]
E:846 [binder, in ITree.Eq.Eqit]
E:85 [binder, in ITree.Events.FailFacts]
E:85 [binder, in ITree.Core.KTreeFacts]
E:85 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:85 [binder, in ITree.Eq.Shallow]
E:85 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
e:853 [binder, in ITree.Eq.Eqit]
E:86 [binder, in ITree.Core.KTreeFacts]
E:86 [binder, in ITree.Extra.Secure.SecureEqWcompat]
E:86 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:86 [binder, in ITree.Interp.InterpFacts]
E:860 [binder, in ITree.Eq.Eqit]
e:864 [binder, in ITree.Eq.Eqit]
e:87 [binder, in ITree.Extra.IForest]
E:87 [binder, in ITree.Core.KTreeFacts]
E:87 [binder, in ITree.Props.Infinite]
E:87 [binder, in ITree.Basics.Basics]
E:87 [binder, in ITree.Interp.Traces]
E:87 [binder, in ITree.Interp.InterpFacts]
e:87 [binder, in ITree.Simple]
E:871 [binder, in ITree.Eq.Eqit]
e:875 [binder, in ITree.Eq.Eqit]
E:88 [binder, in ITree.Extra.IForest]
E:880 [binder, in ITree.Eq.Eqit]
E:89 [binder, in ITree.Extra.ITrace.ITraceBind]
E:89 [binder, in ITree.Events.ExceptionFacts]
E:89 [binder, in ITree.Eq.SimUpToTaus]
e:89 [binder, in ITree.Extra.ITrace.ITracePrefix]
E:89 [binder, in ITree.Extra.ITrace.ITraceFacts]
e:89 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
E:89 [binder, in ITree.Simple]
E:892 [binder, in ITree.Eq.Eqit]
E:9 [binder, in ITree.Events.Map]
e:9 [binder, in ITree.Props.Infinite]
E:9 [binder, in ITree.Events.MapDefault]
E:9 [binder, in ITree.Events.Nondeterminism]
E:9 [binder, in ITree.Events.Writer]
E:9 [binder, in ITree.Events.Concurrency]
E:9 [binder, in ITree.Interp.InterpFacts]
E:9 [binder, in ITree.Interp.Interp]
E:9 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
e:9 [binder, in ITree.Core.ITreeDefinition]
E:90 [binder, in ITree.Events.FailFacts]
E:900 [binder, in ITree.Eq.Eqit]
E:908 [binder, in ITree.Eq.Eqit]
E:91 [binder, in ITree.Props.Infinite]
E:91 [binder, in ITree.Interp.Traces]
E:91 [binder, in ITree.Extra.ITrace.ITracePreds]
E:913 [binder, in ITree.Eq.Eqit]
E:918 [binder, in ITree.Eq.Eqit]
E:92 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
e:923 [binder, in ITree.Eq.Eqit]
E:925 [binder, in ITree.Eq.Eqit]
E:93 [binder, in ITree.Extra.ITrace.ITraceBind]
E:93 [binder, in ITree.Props.Finite]
E:93 [binder, in ITree.Props.Leaf]
E:93 [binder, in ITree.Extra.Secure.SecureStateHandler]
E:93 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:93 [binder, in ITree.Eq.Shallow]
e:930 [binder, in ITree.Eq.Eqit]
E:94 [binder, in ITree.Events.FailFacts]
E:94 [binder, in ITree.Extra.ITrace.ITracePrefix]
e:94 [binder, in ITree.Interp.InterpFacts]
E:95 [binder, in ITree.Eq.SimUpToTaus]
e:95 [binder, in ITree.Extra.Secure.SecureEqBind]
E:95 [binder, in ITree.Interp.InterpFacts]
e:96 [binder, in ITree.Extra.ITrace.ITraceBind]
e:96 [binder, in ITree.Extra.Secure.SecureStateHandler]
e:96 [binder, in ITree.Extra.ITrace.ITraceFacts]
E:96 [binder, in ITree.Extra.ITrace.ITracePreds]
E:97 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
e:97 [binder, in ITree.Events.FailFacts]
E:97 [binder, in ITree.Eq.Shallow]
E:98 [binder, in ITree.Eq.UpToTaus]
E:98 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:98 [binder, in ITree.Simple]
E:99 [binder, in ITree.Props.Finite]
e:99 [binder, in ITree.Interp.Traces]

F

f [definition, in ITree.Extra.IForest]
Facts [section, in ITree.Basics.CategoryRelations]
Facts [section, in ITree.Interp.RecursionFacts]
Facts.BifunctorProd [section, in ITree.Basics.CategoryRelations]
Facts.BifunctorSum [section, in ITree.Basics.CategoryRelations]
Facts.CategoryRel [section, in ITree.Basics.CategoryRelations]
Facts.CoproductRel [section, in ITree.Basics.CategoryRelations]
Facts.DaggerRel [section, in ITree.Basics.CategoryRelations]
Facts.ProductRel [section, in ITree.Basics.CategoryRelations]
FailFacts [library]
failT [definition, in ITree.Events.FailFacts]
FailT [section, in ITree.Events.FailFacts]
FailTLaws [section, in ITree.Events.FailFacts]
failT_Eq1 [instance, in ITree.Events.FailFacts]
failT_iter [instance, in ITree.Events.FailFacts]
failT_monad [instance, in ITree.Events.FailFacts]
failT_fun [instance, in ITree.Events.FailFacts]
fal_decide_ex [definition, in ITree.Extra.Dijkstra.TracesIT]
fal_proper_aux [lemma, in ITree.Extra.ITrace.ITracePreds]
fa:166 [binder, in ITree.Basics.CategoryFacts]
fa:18 [binder, in ITree.Basics.Basics]
fb:167 [binder, in ITree.Basics.CategoryFacts]
fb:293 [binder, in ITree.Basics.CategoryFacts]
fc:294 [binder, in ITree.Basics.CategoryFacts]
fg:152 [binder, in ITree.Basics.CategoryTheory]
fg:191 [binder, in ITree.Basics.CategoryTheory]
FINCHECK:148 [binder, in ITree.Extra.Secure.SecureStateHandler]
FINCHECK:160 [binder, in ITree.Extra.Secure.SecureStateHandler]
finite [definition, in ITree.Extra.ITrace.ITraceDefinition]
Finite [library]
finite_leaf_non_interactive [lemma, in ITree.Props.Finite]
finite_non_interactive [lemma, in ITree.Props.Finite]
finite_Leaf [lemma, in ITree.Props.Finite]
finite_stream_list [lemma, in ITree.Extra.ITrace.ITraceFacts]
finite_list_to_stream [lemma, in ITree.Extra.ITrace.ITraceFacts]
finite_nil [lemma, in ITree.Extra.ITrace.ITraceFacts]
flip_clo [definition, in ITree.Eq.Eqit]
fmap_cat0 [lemma, in ITree.Basics.CategoryFunctor]
fmap_id0 [lemma, in ITree.Basics.CategoryFunctor]
fmap_proper [projection, in ITree.Basics.CategoryFunctor]
fmap_cat [projection, in ITree.Basics.CategoryFunctor]
fmap_id [projection, in ITree.Basics.CategoryFunctor]
fmap:32 [binder, in ITree.Basics.CategoryFunctor]
fmap:8 [binder, in ITree.Basics.CategoryFunctor]
FM:17 [binder, in ITree.Interp.Interp]
Fm:2 [binder, in ITree.Events.FailFacts]
Fm:30 [binder, in ITree.Basics.Basics]
FM:36 [binder, in ITree.Events.FailFacts]
Fm:37 [binder, in ITree.Basics.Basics]
FM:4 [binder, in ITree.Events.State]
fold_Kleisli [lemma, in ITree.Basics.CategoryKleisliFacts]
fold_apply_IFun [lemma, in ITree.Indexed.FunctionFacts]
fold_eqitF [lemma, in ITree.Eq.Eqit]
forall_stream [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_stream_monot [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_stream_ [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_cons [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_nil [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_streamF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_spin [lemma, in ITree.Extra.ITrace.ITracePreds]
FromBifunctor [record, in ITree.Basics.CategorySub]
FromBifunctor [inductive, in ITree.Basics.CategorySub]
FromBif:27 [binder, in ITree.Basics.CategorySub]
from_bif [projection, in ITree.Basics.CategorySub]
from_bif [constructor, in ITree.Basics.CategorySub]
front_and_last_proper_eutt [instance, in ITree.Extra.ITrace.ITracePreds]
front_and_last_cons [constructor, in ITree.Extra.ITrace.ITracePreds]
front_and_last_base [constructor, in ITree.Extra.ITrace.ITracePreds]
front_and_last [inductive, in ITree.Extra.ITrace.ITracePreds]
Fst [record, in ITree.Basics.CategoryOps]
Fst [inductive, in ITree.Basics.CategoryOps]
Fst_Fun [instance, in ITree.Basics.Function]
fst_ [projection, in ITree.Basics.CategoryOps]
fst_ [constructor, in ITree.Basics.CategoryOps]
Fst_C:226 [binder, in ITree.Basics.CategoryFacts]
Fst_rel [instance, in ITree.Basics.CategoryRelations]
fst_rel [projection, in ITree.Basics.HeterogeneousRelations]
Fst_C:210 [binder, in ITree.Basics.CategoryTheory]
Fst_C:169 [binder, in ITree.Basics.CategoryTheory]
Fun [definition, in ITree.Basics.Function]
Function [library]
Function [library]
functional_extensionality [definition, in ITree.Axioms]
FunctionFacts [library]
FunctionFacts [library]
Functor [record, in ITree.Basics.CategoryFunctor]
Functor [section, in ITree.Basics.CategoryFunctor]
FunctorId [section, in ITree.Basics.CategoryFunctor]
Functor_iforest [instance, in ITree.Extra.IForest]
Functor_pure [instance, in ITree.Basics.CategoryKleisliFacts]
Functor_id:40 [binder, in ITree.Basics.CategoryFunctor]
Functor_itree [instance, in ITree.Core.ITreeDefinition]
Functor_unsubm [instance, in ITree.Basics.CategorySub]
fun_rel [definition, in ITree.Basics.HeterogeneousRelations]
fwd_eqn [lemma, in ITree.Basics.CategoryFacts]
f':20 [binder, in ITree.Basics.CategoryFacts]
f':40 [binder, in ITree.Basics.CategoryFacts]
f':53 [binder, in ITree.Basics.CategoryTheory]
f':59 [binder, in ITree.Basics.CategoryTheory]
f':81 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f0:16 [binder, in ITree.Interp.HandlerFacts]
f0:30 [binder, in ITree.Eq.Paco2]
f0:7 [binder, in ITree.Eq.Paco2]
f1:102 [binder, in ITree.Basics.CategoryKleisliFacts]
f1:110 [binder, in ITree.Basics.CategoryTheory]
f1:16 [binder, in ITree.Indexed.Relation]
f1:21 [binder, in ITree.Indexed.Function]
f1:23 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
f1:32 [binder, in ITree.Eq.Paco2]
f1:7 [binder, in ITree.Indexed.Relation]
f1:752 [binder, in ITree.Eq.Eqit]
f1:9 [binder, in ITree.Eq.Paco2]
f2:110 [binder, in ITree.Basics.CategoryKleisliFacts]
f2:112 [binder, in ITree.Basics.CategoryTheory]
f2:17 [binder, in ITree.Indexed.Relation]
f2:22 [binder, in ITree.Indexed.Function]
f2:24 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
f2:753 [binder, in ITree.Eq.Eqit]
f2:8 [binder, in ITree.Indexed.Relation]
f:1 [binder, in ITree.Basics.CategoryRelations]
f:10 [binder, in ITree.Basics.CategoryKleisliFacts]
F:10 [binder, in ITree.Interp.InterpFacts]
F:10 [binder, in ITree.Interp.Interp]
f:101 [binder, in ITree.Simple]
F:102 [binder, in ITree.Events.FailFacts]
F:102 [binder, in ITree.Interp.InterpFacts]
f:103 [binder, in ITree.Interp.InterpFacts]
f:104 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
f:105 [binder, in ITree.Simple]
F:106 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:107 [binder, in ITree.Extra.ITrace.ITracePreds]
F:108 [binder, in ITree.Events.StateFacts]
F:108 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
F:108 [binder, in ITree.Interp.InterpFacts]
f:109 [binder, in ITree.Interp.InterpFacts]
F:11 [binder, in ITree.Events.StateFacts]
f:11 [binder, in ITree.Basics.CategoryKleisli]
F:11 [binder, in ITree.Indexed.Function]
f:11 [binder, in ITree.Indexed.FunctionFacts]
f:11 [binder, in ITree.Interp.RecursionFacts]
f:110 [binder, in ITree.Basics.CategoryOps]
F:111 [binder, in ITree.Events.FailFacts]
f:111 [binder, in ITree.Simple]
f:112 [binder, in ITree.Core.KTreeFacts]
f:114 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
F:114 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:116 [binder, in ITree.Extra.IForest]
F:116 [binder, in ITree.Extra.ITrace.ITracePreds]
f:116 [binder, in ITree.Simple]
F:118 [binder, in ITree.Interp.InterpFacts]
f:119 [binder, in ITree.Interp.InterpFacts]
f:12 [binder, in ITree.Indexed.Function]
F:12 [binder, in ITree.Interp.InterpFacts]
F:12 [binder, in ITree.Events.Dependent]
f:12 [binder, in ITree.Basics.CategorySub]
f:123 [binder, in ITree.Core.KTreeFacts]
F:126 [binder, in ITree.Interp.InterpFacts]
F:127 [binder, in ITree.Extra.IForest]
f:127 [binder, in ITree.Interp.InterpFacts]
f:128 [binder, in ITree.Basics.CategoryFacts]
F:130 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:131 [binder, in ITree.Events.StateFacts]
f:132 [binder, in ITree.Basics.CategoryFacts]
F:135 [binder, in ITree.Extra.IForest]
F:136 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:136 [binder, in ITree.Basics.CategoryTheory]
f:137 [binder, in ITree.Basics.CategoryFacts]
f:138 [binder, in ITree.Basics.CategoryOps]
F:14 [binder, in ITree.Interp.Handler]
F:14 [binder, in ITree.Indexed.Function]
f:14 [binder, in ITree.Interp.InterpFacts]
f:14 [binder, in ITree.Events.Dependent]
f:14 [binder, in ITree.Basics.CategoryTheory]
f:140 [binder, in ITree.Eq.UpToTaus]
F:140 [binder, in ITree.Extra.IForest]
F:141 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:143 [binder, in ITree.Basics.CategoryTheory]
F:146 [binder, in ITree.Simple]
f:147 [binder, in ITree.Basics.CategoryFacts]
f:147 [binder, in ITree.Simple]
F:148 [binder, in ITree.Extra.IForest]
F:148 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:15 [binder, in ITree.Extra.IForest]
f:15 [binder, in ITree.Props.EuttNoRet]
f:150 [binder, in ITree.Basics.CategoryTheory]
F:152 [binder, in ITree.Extra.IForest]
f:153 [binder, in ITree.Basics.CategoryFacts]
F:157 [binder, in ITree.Events.StateFacts]
f:159 [binder, in ITree.Events.StateFacts]
f:159 [binder, in ITree.Basics.CategoryFacts]
f:16 [binder, in ITree.Basics.Function]
f:16 [binder, in ITree.Basics.CategoryKleisli]
f:16 [binder, in ITree.Basics.Basics]
F:16 [binder, in ITree.Interp.Handler]
F:16 [binder, in ITree.Interp.TranslateFacts]
F:161 [binder, in ITree.Extra.IForest]
F:164 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
F:167 [binder, in ITree.Extra.IForest]
F:168 [binder, in ITree.Events.StateFacts]
f:17 [binder, in ITree.Basics.Monad]
f:170 [binder, in ITree.Events.StateFacts]
F:171 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
f:175 [binder, in ITree.Basics.CategoryTheory]
f:177 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:18 [binder, in ITree.Events.StateFacts]
F:18 [binder, in ITree.Interp.Handler]
F:18 [binder, in ITree.Core.Subevent]
F:181 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:182 [binder, in ITree.Extra.IForest]
f:182 [binder, in ITree.Basics.CategoryTheory]
f:185 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:187 [binder, in ITree.Extra.IForest]
f:189 [binder, in ITree.Basics.CategoryTheory]
F:19 [binder, in ITree.Indexed.Function]
f:19 [binder, in ITree.Basics.CategoryFacts]
F:19 [binder, in ITree.Interp.InterpFacts]
F:19 [binder, in ITree.Extra.ITrace.ITracePreds]
f:190 [binder, in ITree.Basics.CategoryOps]
f:197 [binder, in ITree.Extra.ITrace.ITraceBind]
f:198 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:198 [binder, in ITree.Simple]
f:199 [binder, in ITree.Extra.ITrace.ITraceFacts]
F:2 [binder, in ITree.Events.StateFacts]
F:2 [binder, in ITree.Indexed.Function]
F:2 [binder, in ITree.Interp.InterpFacts]
F:2 [binder, in ITree.Core.Subevent]
F:2 [binder, in ITree.Interp.Interp]
F:2 [binder, in ITree.Events.Dependent]
F:2 [binder, in ITree.Interp.TranslateFacts]
F:2 [binder, in ITree.Indexed.FunctionFacts]
f:20 [binder, in ITree.Interp.Recursion]
f:20 [binder, in ITree.Interp.Handler]
F:200 [binder, in ITree.Extra.IForest]
f:200 [binder, in ITree.Simple]
F:205 [binder, in ITree.Simple]
f:207 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:207 [binder, in ITree.Extra.ITrace.ITraceFacts]
f:207 [binder, in ITree.Simple]
f:208 [binder, in ITree.Extra.ITrace.ITraceBind]
f:21 [binder, in ITree.Basics.CategoryFunctor]
f:21 [binder, in ITree.Interp.HandlerFacts]
f:21 [binder, in ITree.Interp.InterpFacts]
f:21 [binder, in ITree.Basics.CategoryTheory]
F:210 [binder, in ITree.Simple]
f:212 [binder, in ITree.Simple]
F:215 [binder, in ITree.Simple]
f:217 [binder, in ITree.Simple]
f:219 [binder, in ITree.Basics.CategoryTheory]
F:223 [binder, in ITree.Simple]
f:225 [binder, in ITree.Extra.ITrace.ITraceBind]
f:225 [binder, in ITree.Extra.ITrace.ITraceFacts]
f:225 [binder, in ITree.Simple]
F:226 [binder, in ITree.Extra.IForest]
f:227 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:228 [binder, in ITree.Simple]
F:23 [binder, in ITree.Events.StateFacts]
F:23 [binder, in ITree.Core.Subevent]
f:231 [binder, in ITree.Simple]
f:235 [binder, in ITree.Extra.ITrace.ITraceBind]
f:238 [binder, in ITree.Simple]
F:239 [binder, in ITree.Basics.HeterogeneousRelations]
f:24 [binder, in ITree.Basics.Function]
F:24 [binder, in ITree.Interp.InterpFacts]
f:24 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
F:241 [binder, in ITree.Extra.IForest]
f:242 [binder, in ITree.Simple]
F:247 [binder, in ITree.Extra.IForest]
f:247 [binder, in ITree.Simple]
F:25 [binder, in ITree.Interp.Handler]
f:25 [binder, in ITree.Basics.MonadState]
f:250 [binder, in ITree.Extra.ITrace.ITraceBind]
f:251 [binder, in ITree.Simple]
F:253 [binder, in ITree.Extra.IForest]
f:255 [binder, in ITree.Extra.ITrace.ITraceBind]
f:255 [binder, in ITree.Basics.CategoryFacts]
f:257 [binder, in ITree.Basics.CategoryTheory]
f:259 [binder, in ITree.Basics.CategoryFacts]
f:26 [binder, in ITree.Interp.InterpFacts]
F:262 [binder, in ITree.Extra.IForest]
f:262 [binder, in ITree.Basics.CategoryTheory]
f:264 [binder, in ITree.Basics.CategoryFacts]
f:27 [binder, in ITree.Events.StateFacts]
F:274 [binder, in ITree.Extra.IForest]
f:274 [binder, in ITree.Basics.CategoryFacts]
F:279 [binder, in ITree.Simple]
f:28 [binder, in ITree.Basics.Monad]
f:28 [binder, in ITree.Interp.Handler]
F:28 [binder, in ITree.Extra.ITrace.ITracePrefix]
f:28 [binder, in ITree.Indexed.Function]
F:28 [binder, in ITree.Core.Subevent]
f:28 [binder, in ITree.Basics.HeterogeneousRelations]
F:28 [binder, in ITree.Interp.TranslateFacts]
f:280 [binder, in ITree.Basics.CategoryFacts]
f:280 [binder, in ITree.Simple]
F:283 [binder, in ITree.Basics.HeterogeneousRelations]
F:286 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
f:286 [binder, in ITree.Basics.CategoryFacts]
f:29 [binder, in ITree.Extra.Dijkstra.IterRel]
f:29 [binder, in ITree.Basics.MonadState]
F:29 [binder, in ITree.Interp.InterpFacts]
F:292 [binder, in ITree.Extra.IForest]
f:293 [binder, in ITree.Extra.ITrace.ITraceBind]
F:299 [binder, in ITree.Extra.IForest]
F:3 [binder, in ITree.Extra.Dijkstra.IterRel]
F:3 [binder, in ITree.Extra.ITrace.ITracePreds]
f:306 [binder, in ITree.Extra.IForest]
f:307 [binder, in ITree.Extra.ITrace.ITraceBind]
F:308 [binder, in ITree.Extra.IForest]
F:31 [binder, in ITree.Events.StateFacts]
f:31 [binder, in ITree.Basics.Basics]
F:31 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
f:31 [binder, in ITree.Interp.InterpFacts]
f:31 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
f:314 [binder, in ITree.Extra.ITrace.ITraceBind]
f:318 [binder, in ITree.Extra.ITrace.ITraceBind]
f:32 [binder, in ITree.Interp.TranslateFacts]
f:32 [binder, in ITree.Basics.CategorySub]
f:327 [binder, in ITree.Extra.ITrace.ITraceBind]
F:33 [binder, in ITree.Props.Infinite]
F:33 [binder, in ITree.Interp.Handler]
F:33 [binder, in ITree.Core.Subevent]
F:34 [binder, in ITree.Interp.Recursion]
f:34 [binder, in ITree.Basics.MonadState]
F:34 [binder, in ITree.Interp.InterpFacts]
f:35 [binder, in ITree.Interp.Recursion]
F:35 [binder, in ITree.Interp.Handler]
F:35 [binder, in ITree.Interp.TranslateFacts]
f:35 [binder, in ITree.Interp.RecursionFacts]
f:354 [binder, in ITree.Basics.CategoryTheory]
f:36 [binder, in ITree.Interp.Handler]
f:36 [binder, in ITree.Extra.Dijkstra.StateSpecT]
f:36 [binder, in ITree.Interp.InterpFacts]
f:360 [binder, in ITree.Basics.CategoryTheory]
f:365 [binder, in ITree.Basics.CategoryFacts]
f:367 [binder, in ITree.Basics.CategoryTheory]
f:37 [binder, in ITree.Basics.Function]
F:37 [binder, in ITree.Interp.TranslateFacts]
f:37 [binder, in ITree.Basics.CategoryTheory]
f:37 [binder, in ITree.Basics.CategorySub]
f:371 [binder, in ITree.Basics.CategoryFacts]
f:373 [binder, in ITree.Basics.CategoryTheory]
f:377 [binder, in ITree.Basics.CategoryFacts]
F:38 [binder, in ITree.Interp.Handler]
f:38 [binder, in ITree.Basics.CategoryFacts]
F:38 [binder, in ITree.Events.State]
f:384 [binder, in ITree.Basics.CategoryFacts]
f:386 [binder, in ITree.Basics.CategoryTheory]
f:389 [binder, in ITree.Basics.CategoryFacts]
f:39 [binder, in ITree.Basics.CategoryKleisliFacts]
f:39 [binder, in ITree.Interp.Handler]
f:39 [binder, in ITree.Basics.MonadState]
F:39 [binder, in ITree.Interp.TranslateFacts]
f:39 [binder, in ITree.Interp.RecursionFacts]
F:4 [binder, in ITree.Extra.ITrace.ITracePrefix]
F:4 [binder, in ITree.Extra.Secure.StrongBisimProper]
F:4 [binder, in ITree.Indexed.Function]
f:4 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
F:40 [binder, in ITree.Interp.Recursion]
f:40 [binder, in ITree.Core.Subevent]
f:40 [binder, in ITree.Events.State]
f:40 [binder, in ITree.Basics.CategorySub]
F:41 [binder, in ITree.Events.FailFacts]
F:41 [binder, in ITree.Events.StateFacts]
f:41 [binder, in ITree.Interp.Recursion]
F:41 [binder, in ITree.Interp.Handler]
f:412 [binder, in ITree.Basics.CategoryFacts]
f:419 [binder, in ITree.Basics.CategoryFacts]
f:42 [binder, in ITree.Basics.Function]
F:42 [binder, in ITree.Interp.InterpFacts]
F:42 [binder, in ITree.Interp.TranslateFacts]
f:425 [binder, in ITree.Basics.CategoryFacts]
f:43 [binder, in ITree.Events.FailFacts]
f:43 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:43 [binder, in ITree.Extra.Dijkstra.StateSpecT]
f:43 [binder, in ITree.Basics.CategoryTheory]
F:44 [binder, in ITree.Interp.Handler]
f:44 [binder, in ITree.Interp.InterpFacts]
f:44 [binder, in ITree.Interp.RecursionFacts]
f:45 [binder, in ITree.Basics.CategoryFunctor]
F:45 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
f:45 [binder, in ITree.Basics.MonadState]
F:45 [binder, in ITree.Interp.TranslateFacts]
f:46 [binder, in ITree.Basics.CategoryKleisliFacts]
f:46 [binder, in ITree.Props.EuttNoRet]
F:47 [binder, in ITree.Interp.InterpFacts]
F:47 [binder, in ITree.Interp.TranslateFacts]
f:47 [binder, in ITree.Core.ITreeDefinition]
F:48 [binder, in ITree.Events.FailFacts]
F:48 [binder, in ITree.Events.StateFacts]
F:48 [binder, in ITree.Extra.ITrace.ITracePreds]
f:49 [binder, in ITree.Extra.Dijkstra.StateSpecT]
F:49 [binder, in ITree.Interp.InterpFacts]
F:49 [binder, in ITree.Interp.TranslateFacts]
f:5 [binder, in ITree.Basics.Function]
f:5 [binder, in ITree.Events.StateFacts]
f:5 [binder, in ITree.Core.KTreeFacts]
F:5 [binder, in ITree.Basics.CategoryFunctor]
F:5 [binder, in ITree.Events.Concurrency]
f:50 [binder, in ITree.Events.FailFacts]
f:50 [binder, in ITree.Basics.MonadState]
f:51 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:51 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
F:51 [binder, in ITree.Extra.ITrace.ITracePrefix]
f:51 [binder, in ITree.Interp.InterpFacts]
f:51 [binder, in ITree.Interp.TranslateFacts]
f:515 [binder, in ITree.Extra.IForest]
f:52 [binder, in ITree.Events.StateFacts]
f:52 [binder, in ITree.Basics.CategoryKleisliFacts]
F:52 [binder, in ITree.Extra.Secure.SecureStateHandler]
f:52 [binder, in ITree.Basics.CategoryTheory]
F:53 [binder, in ITree.Interp.InterpFacts]
F:53 [binder, in ITree.Interp.TranslateFacts]
F:54 [binder, in ITree.Events.FailFacts]
F:54 [binder, in ITree.Events.State]
f:55 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
F:55 [binder, in ITree.Interp.InterpFacts]
F:56 [binder, in ITree.Events.StateFacts]
f:56 [binder, in ITree.Basics.CategoryFacts]
f:56 [binder, in ITree.Interp.TranslateFacts]
F:56 [binder, in ITree.Simple]
f:57 [binder, in ITree.Interp.Recursion]
F:57 [binder, in ITree.Core.KTreeFacts]
F:57 [binder, in ITree.Interp.InterpFacts]
f:58 [binder, in ITree.Basics.MonadState]
f:58 [binder, in ITree.Basics.CategoryTheory]
f:58 [binder, in ITree.Simple]
F:59 [binder, in ITree.Events.FailFacts]
f:59 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:59 [binder, in ITree.Extra.ITrace.ITracePreds]
f:6 [binder, in ITree.Basics.CategoryOps]
f:6 [binder, in ITree.Indexed.Function]
F:6 [binder, in ITree.Interp.InterpFacts]
f:6 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
f:60 [binder, in ITree.Events.StateFacts]
f:60 [binder, in ITree.Interp.InterpFacts]
f:60 [binder, in ITree.Basics.CategorySub]
F:61 [binder, in ITree.Interp.TranslateFacts]
f:62 [binder, in ITree.Basics.CategoryFacts]
F:62 [binder, in ITree.Interp.InterpFacts]
f:625 [binder, in ITree.Eq.Eqit]
F:63 [binder, in ITree.Events.FailFacts]
F:63 [binder, in ITree.Events.StateFacts]
F:63 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
f:63 [binder, in ITree.Basics.MonadState]
F:63 [binder, in ITree.Simple]
F:64 [binder, in ITree.Extra.Secure.SecureStateHandler]
f:64 [binder, in ITree.Interp.InterpFacts]
f:65 [binder, in ITree.Simple]
F:66 [binder, in ITree.Interp.InterpFacts]
f:67 [binder, in ITree.Extra.Dijkstra.IterRel]
F:68 [binder, in ITree.Events.FailFacts]
f:68 [binder, in ITree.Events.StateFacts]
f:69 [binder, in ITree.Interp.InterpFacts]
F:69 [binder, in ITree.Simple]
f:7 [binder, in ITree.Axioms]
f:7 [binder, in ITree.Basics.CategoryKleisli]
F:7 [binder, in ITree.Interp.Handler]
F:7 [binder, in ITree.Events.Dependent]
F:70 [binder, in ITree.Core.KTreeFacts]
F:70 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
f:70 [binder, in ITree.Basics.MonadState]
f:70 [binder, in ITree.Core.ITreeDefinition]
F:71 [binder, in ITree.Events.FailFacts]
f:71 [binder, in ITree.Simple]
f:72 [binder, in ITree.Extra.ITrace.ITraceBind]
f:72 [binder, in ITree.Core.ITreeDefinition]
f:73 [binder, in ITree.Events.FailFacts]
f:73 [binder, in ITree.Basics.CategoryTheory]
F:74 [binder, in ITree.Events.StateFacts]
F:75 [binder, in ITree.Simple]
F:76 [binder, in ITree.Events.FailFacts]
F:77 [binder, in ITree.Props.HasPost]
f:77 [binder, in ITree.Simple]
f:770 [binder, in ITree.Eq.Eqit]
f:78 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:785 [binder, in ITree.Eq.Eqit]
f:793 [binder, in ITree.Eq.Eqit]
f:8 [binder, in ITree.Basics.Function]
F:8 [binder, in ITree.Indexed.Function]
F:80 [binder, in ITree.Events.StateFacts]
f:80 [binder, in ITree.Basics.CategoryKleisliFacts]
F:80 [binder, in ITree.Interp.InterpFacts]
f:803 [binder, in ITree.Eq.Eqit]
f:808 [binder, in ITree.Eq.Eqit]
f:81 [binder, in ITree.Core.KTreeFacts]
f:813 [binder, in ITree.Eq.Eqit]
F:83 [binder, in ITree.Extra.IForest]
f:83 [binder, in ITree.Interp.InterpFacts]
f:83 [binder, in ITree.Basics.CategoryTheory]
F:84 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
F:84 [binder, in ITree.Simple]
F:85 [binder, in ITree.Events.StateFacts]
F:86 [binder, in ITree.Events.FailFacts]
f:86 [binder, in ITree.Simple]
f:87 [binder, in ITree.Basics.CategoryKleisliFacts]
f:87 [binder, in ITree.Basics.CategoryTheory]
f:88 [binder, in ITree.Eq.Shallow]
F:88 [binder, in ITree.Interp.InterpFacts]
F:89 [binder, in ITree.Extra.IForest]
f:9 [binder, in ITree.Events.FailFacts]
f:9 [binder, in ITree.Interp.Handler]
f:9 [binder, in ITree.Indexed.Function]
f:9 [binder, in ITree.Basics.CategoryTheory]
F:9 [binder, in ITree.Indexed.FunctionFacts]
f:9 [binder, in ITree.Basics.CategorySub]
f:90 [binder, in ITree.Interp.InterpFacts]
F:90 [binder, in ITree.Simple]
F:91 [binder, in ITree.Events.FailFacts]
f:91 [binder, in ITree.Core.KTreeFacts]
F:91 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
f:92 [binder, in ITree.Basics.CategoryKleisliFacts]
f:93 [binder, in ITree.Simple]
F:95 [binder, in ITree.Events.FailFacts]
F:95 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:96 [binder, in ITree.Basics.CategoryKleisliFacts]
F:96 [binder, in ITree.Interp.InterpFacts]
f:98 [binder, in ITree.Events.FailFacts]
f:98 [binder, in ITree.Interp.InterpFacts]
F:99 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]

G

g [definition, in ITree.Extra.IForest]
ga:168 [binder, in ITree.Basics.CategoryFacts]
gb:169 [binder, in ITree.Basics.CategoryFacts]
gb:295 [binder, in ITree.Basics.CategoryFacts]
gc:296 [binder, in ITree.Basics.CategoryFacts]
GeneralStateHandler [section, in ITree.Extra.Secure.SecureStateHandler]
GeneralStateHandler [section, in ITree.Extra.Secure.SecureStateHandlerPi]
get [definition, in ITree.Events.State]
Get [constructor, in ITree.Events.State]
GetE [constructor, in ITree.Extra.Dijkstra.StateIOTrace]
geuttgen_cong_eq_secure_eqit [instance, in ITree.Extra.Secure.SecureEqProgInsens]
geuttgen_cong_secure_eqit [instance, in ITree.Extra.Secure.SecureEqProgInsens]
geuttgen_cong_secure_eqit' [instance, in ITree.Extra.Secure.SecureEqWcompat]
geuttgen_cong_secure_eqit [instance, in ITree.Extra.Secure.SecureEqWcompat]
geuttgen_cong_eqit_eq [instance, in ITree.Eq.Eqit]
geuttgen_cong_eqit [instance, in ITree.Eq.Eqit]
geuttge_cong_euttge_eq [instance, in ITree.Eq.Eqit]
geuttge_cong_euttge [instance, in ITree.Eq.Eqit]
geuttG_cong_eq [instance, in ITree.Eq.UpToTaus]
geuttG_cong_euttge [instance, in ITree.Eq.UpToTaus]
geutt_eq_cong_euttge [instance, in ITree.Extra.Secure.SecureEqWcompat]
geutt_cong_euttge [instance, in ITree.Extra.Secure.SecureEqWcompat]
geutt_cong_euttge_eq [instance, in ITree.Eq.Eqit]
geutt_cong_euttge [instance, in ITree.Eq.Eqit]
gf:25 [binder, in ITree.Eq.Paco2]
gf:4 [binder, in ITree.Eq.Paco2]
gH':131 [binder, in ITree.Eq.UpToTaus]
gH':146 [binder, in ITree.Eq.UpToTaus]
gH:10 [binder, in ITree.Eq.UpToTaus]
gH:102 [binder, in ITree.Eq.UpToTaus]
gH:105 [binder, in ITree.Eq.UpToTaus]
gH:108 [binder, in ITree.Eq.UpToTaus]
gH:113 [binder, in ITree.Eq.UpToTaus]
gH:117 [binder, in ITree.Eq.UpToTaus]
gH:126 [binder, in ITree.Eq.UpToTaus]
gH:138 [binder, in ITree.Eq.UpToTaus]
gH:162 [binder, in ITree.Eq.UpToTaus]
gH:168 [binder, in ITree.Eq.UpToTaus]
gH:174 [binder, in ITree.Eq.UpToTaus]
gH:180 [binder, in ITree.Eq.UpToTaus]
gH:186 [binder, in ITree.Eq.UpToTaus]
gH:192 [binder, in ITree.Eq.UpToTaus]
gH:198 [binder, in ITree.Eq.UpToTaus]
gH:207 [binder, in ITree.Eq.UpToTaus]
gH:218 [binder, in ITree.Eq.UpToTaus]
gH:224 [binder, in ITree.Eq.UpToTaus]
gH:230 [binder, in ITree.Eq.UpToTaus]
gH:236 [binder, in ITree.Eq.UpToTaus]
gH:244 [binder, in ITree.Eq.UpToTaus]
gH:252 [binder, in ITree.Eq.UpToTaus]
gH:28 [binder, in ITree.Eq.UpToTaus]
gH:29 [binder, in ITree.Eq.UpToTaus]
gH:30 [binder, in ITree.Eq.UpToTaus]
gH:35 [binder, in ITree.Eq.UpToTaus]
gH:42 [binder, in ITree.Eq.UpToTaus]
gH:5 [binder, in ITree.Eq.UpToTaus]
gH:63 [binder, in ITree.Eq.UpToTaus]
gH:65 [binder, in ITree.Eq.UpToTaus]
gH:96 [binder, in ITree.Eq.UpToTaus]
gL':128 [binder, in ITree.Eq.UpToTaus]
gL':142 [binder, in ITree.Eq.UpToTaus]
gL:112 [binder, in ITree.Eq.UpToTaus]
gL:116 [binder, in ITree.Eq.UpToTaus]
gL:125 [binder, in ITree.Eq.UpToTaus]
gL:137 [binder, in ITree.Eq.UpToTaus]
gL:161 [binder, in ITree.Eq.UpToTaus]
gL:167 [binder, in ITree.Eq.UpToTaus]
gL:173 [binder, in ITree.Eq.UpToTaus]
gL:179 [binder, in ITree.Eq.UpToTaus]
gL:185 [binder, in ITree.Eq.UpToTaus]
gL:191 [binder, in ITree.Eq.UpToTaus]
gL:197 [binder, in ITree.Eq.UpToTaus]
gL:206 [binder, in ITree.Eq.UpToTaus]
gL:217 [binder, in ITree.Eq.UpToTaus]
gL:223 [binder, in ITree.Eq.UpToTaus]
gL:229 [binder, in ITree.Eq.UpToTaus]
gL:243 [binder, in ITree.Eq.UpToTaus]
gL:251 [binder, in ITree.Eq.UpToTaus]
gL:9 [binder, in ITree.Eq.UpToTaus]
go [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
go [constructor, in ITree.Core.ITreeDefinition]
going [inductive, in ITree.Eq.Shallow]
going_go [instance, in ITree.Eq.Shallow]
going_relations.eq_ [variable, in ITree.Eq.Shallow]
going_relations [section, in ITree.Eq.Shallow]
going_intros [constructor, in ITree.Eq.Shallow]
gpaco2_accF [lemma, in ITree.Eq.Paco2]
grutt_cong_euttge [instance, in ITree.Eq.Rutt]
grutt_cong_eqit [instance, in ITree.Eq.Rutt]
GuardedFunctionalChoice_on [definition, in ITree.Axioms]
guarded_choice [axiom, in ITree.Axioms]
g_spec:312 [binder, in ITree.Extra.IForest]
g_spec:303 [binder, in ITree.Extra.IForest]
g':23 [binder, in ITree.Basics.CategoryFacts]
g':329 [binder, in ITree.Extra.ITrace.ITraceBind]
g':42 [binder, in ITree.Basics.CategoryFacts]
g':67 [binder, in ITree.Extra.Dijkstra.TracesIT]
g0:17 [binder, in ITree.Interp.HandlerFacts]
g1:103 [binder, in ITree.Basics.CategoryKleisliFacts]
g1:111 [binder, in ITree.Basics.CategoryKleisliFacts]
g1:111 [binder, in ITree.Basics.CategoryTheory]
g2:104 [binder, in ITree.Basics.CategoryKleisliFacts]
g2:112 [binder, in ITree.Basics.CategoryKleisliFacts]
g2:113 [binder, in ITree.Basics.CategoryTheory]
g:10 [binder, in ITree.Interp.Handler]
g:111 [binder, in ITree.Basics.CategoryOps]
g:124 [binder, in ITree.Core.KTreeFacts]
g:133 [binder, in ITree.Basics.CategoryFacts]
g:137 [binder, in ITree.Basics.CategoryTheory]
g:138 [binder, in ITree.Basics.CategoryFacts]
g:139 [binder, in ITree.Basics.CategoryOps]
g:141 [binder, in ITree.Eq.UpToTaus]
g:144 [binder, in ITree.Basics.CategoryTheory]
g:148 [binder, in ITree.Basics.CategoryFacts]
g:151 [binder, in ITree.Basics.CategoryTheory]
g:153 [binder, in ITree.Extra.ITrace.ITracePrefix]
g:154 [binder, in ITree.Basics.CategoryFacts]
g:160 [binder, in ITree.Basics.CategoryFacts]
g:17 [binder, in ITree.Basics.Function]
g:17 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
g:170 [binder, in ITree.Extra.ITrace.ITracePrefix]
g:176 [binder, in ITree.Basics.CategoryTheory]
g:183 [binder, in ITree.Basics.CategoryTheory]
G:19 [binder, in ITree.Interp.Handler]
g:190 [binder, in ITree.Basics.CategoryTheory]
g:2 [binder, in ITree.Basics.CategoryRelations]
G:20 [binder, in ITree.Indexed.Function]
g:200 [binder, in ITree.Extra.ITrace.ITraceFacts]
g:208 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
g:208 [binder, in ITree.Extra.ITrace.ITraceFacts]
g:21 [binder, in ITree.Interp.Handler]
g:22 [binder, in ITree.Basics.CategoryFunctor]
g:22 [binder, in ITree.Basics.CategoryFacts]
g:22 [binder, in ITree.Basics.CategoryTheory]
g:224 [binder, in ITree.Extra.ITrace.ITraceFacts]
g:24 [binder, in ITree.Interp.HandlerFacts]
g:25 [binder, in ITree.Basics.Function]
G:26 [binder, in ITree.Interp.Handler]
g:260 [binder, in ITree.Basics.CategoryFacts]
g:265 [binder, in ITree.Basics.CategoryFacts]
g:27 [binder, in ITree.Extra.Dijkstra.TracesIT]
g:275 [binder, in ITree.Basics.CategoryFacts]
g:28 [binder, in ITree.Basics.CategoryKleisli]
g:281 [binder, in ITree.Basics.CategoryFacts]
g:287 [binder, in ITree.Basics.CategoryFacts]
g:29 [binder, in ITree.Basics.Monad]
g:29 [binder, in ITree.Interp.Handler]
g:29 [binder, in ITree.Indexed.Function]
G:29 [binder, in ITree.Interp.TranslateFacts]
g:30 [binder, in ITree.Basics.MonadState]
G:300 [binder, in ITree.Extra.IForest]
g:305 [binder, in ITree.Extra.IForest]
g:308 [binder, in ITree.Extra.ITrace.ITraceBind]
G:309 [binder, in ITree.Extra.IForest]
g:31 [binder, in ITree.Interp.TranslateFacts]
g:313 [binder, in ITree.Extra.IForest]
g:33 [binder, in ITree.Basics.CategorySub]
G:34 [binder, in ITree.Core.Subevent]
g:35 [binder, in ITree.Basics.MonadState]
g:36 [binder, in ITree.Extra.Dijkstra.TracesIT]
g:361 [binder, in ITree.Basics.CategoryTheory]
g:366 [binder, in ITree.Basics.CategoryFacts]
g:368 [binder, in ITree.Basics.CategoryTheory]
g:37 [binder, in ITree.Eq.UpToTaus]
g:37 [binder, in ITree.Extra.Dijkstra.StateSpecT]
g:372 [binder, in ITree.Basics.CategoryFacts]
g:378 [binder, in ITree.Basics.CategoryFacts]
g:38 [binder, in ITree.Basics.CategorySub]
g:387 [binder, in ITree.Basics.CategoryTheory]
g:39 [binder, in ITree.Basics.CategoryFacts]
g:40 [binder, in ITree.Basics.CategoryKleisliFacts]
g:40 [binder, in ITree.Basics.MonadState]
g:413 [binder, in ITree.Basics.CategoryFacts]
g:420 [binder, in ITree.Basics.CategoryFacts]
g:426 [binder, in ITree.Basics.CategoryFacts]
g:44 [binder, in ITree.Eq.UpToTaus]
g:44 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
g:46 [binder, in ITree.Basics.CategoryFunctor]
g:47 [binder, in ITree.Basics.CategoryKleisliFacts]
g:49 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
g:53 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
g:55 [binder, in ITree.Extra.Dijkstra.StateSpecT]
g:57 [binder, in ITree.Basics.CategoryFacts]
g:59 [binder, in ITree.Basics.CategoryKleisliFacts]
g:6 [binder, in ITree.Core.KTreeFacts]
g:61 [binder, in ITree.Basics.CategorySub]
G:62 [binder, in ITree.Interp.TranslateFacts]
g:63 [binder, in ITree.Basics.CategoryFacts]
g:64 [binder, in ITree.Basics.MonadState]
g:66 [binder, in ITree.Extra.Dijkstra.StateSpecT]
g:66 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
g:7 [binder, in ITree.Basics.CategoryOps]
g:71 [binder, in ITree.Basics.MonadState]
g:71 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
g:74 [binder, in ITree.Basics.CategoryTheory]
g:76 [binder, in ITree.Extra.Dijkstra.StateSpecT]
g:786 [binder, in ITree.Eq.Eqit]
G:8 [binder, in ITree.Interp.Handler]
G:81 [binder, in ITree.Interp.InterpFacts]
g:82 [binder, in ITree.Extra.Dijkstra.StateSpecT]
g:84 [binder, in ITree.Interp.InterpFacts]
G:89 [binder, in ITree.Interp.InterpFacts]
g:9 [binder, in ITree.Basics.Function]
g:91 [binder, in ITree.Interp.InterpFacts]
g:92 [binder, in ITree.Core.KTreeFacts]

H

handle [definition, in ITree.Interp.Handler]
handleIOStateE [definition, in ITree.Extra.Dijkstra.StateIOTrace]
Handler [definition, in ITree.Interp.Handler]
Handler [module, in ITree.Interp.Handler]
Handler [library]
HandlerCategory [section, in ITree.Interp.HandlerFacts]
HandlerCategory.DinatSimulation [section, in ITree.Interp.HandlerFacts]
HandlerCategory.DinatSimulation.hf [variable, in ITree.Interp.HandlerFacts]
HandlerCategory.DinatSimulation.hg [variable, in ITree.Interp.HandlerFacts]
HandlerFacts [library]
handler_correct_iforest [definition, in ITree.Extra.IForest]
handler_correct [definition, in ITree.Extra.IForest]
handler_respects_priv' [inductive, in ITree.Extra.Secure.SecureStateHandler]
handler_respects_priv [inductive, in ITree.Extra.Secure.SecureStateHandler]
handler_respects_priv [inductive, in ITree.Extra.Secure.SecureStateHandlerPi]
Handler.bimap [definition, in ITree.Interp.Handler]
Handler.case_ [definition, in ITree.Interp.Handler]
Handler.cat [definition, in ITree.Interp.Handler]
Handler.empty [definition, in ITree.Interp.Handler]
Handler.htrigger [definition, in ITree.Interp.Handler]
Handler.id_ [definition, in ITree.Interp.Handler]
Handler.inl_ [definition, in ITree.Interp.Handler]
Handler.inr_ [definition, in ITree.Interp.Handler]
handler:6 [binder, in ITree.Extra.Secure.SecureStateHandler]
handler:6 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
handle_map [definition, in ITree.Events.Map]
handle_map [definition, in ITree.Events.MapDefault]
handle_writer [definition, in ITree.Events.Writer]
handle_writer_list [definition, in ITree.Events.Writer]
handle_map_eq [lemma, in ITree.Events.MapDefaultFacts]
handling [definition, in ITree.Interp.Handler]
HasPost [library]
HasPostNotations [module, in ITree.Props.HasPost]
_ ⤳ _ [notation, in ITree.Props.HasPost]
has_post_to_eq_itree [lemma, in ITree.Props.HasPost]
has_post_strong_to_eq_itree [lemma, in ITree.Props.HasPost]
has_post_translate [lemma, in ITree.Props.HasPost]
has_post_iter_strong [lemma, in ITree.Props.HasPost]
has_post_bind [lemma, in ITree.Props.HasPost]
has_post_bind_weak [lemma, in ITree.Props.HasPost]
has_post_True [lemma, in ITree.Props.HasPost]
has_post_weaken [lemma, in ITree.Props.HasPost]
has_post_disj_r [lemma, in ITree.Props.HasPost]
has_post_disj_l [lemma, in ITree.Props.HasPost]
has_post_conj [lemma, in ITree.Props.HasPost]
has_post_eutt [instance, in ITree.Props.HasPost]
has_post_eq_itree [instance, in ITree.Props.HasPost]
has_post_post_strong [lemma, in ITree.Props.HasPost]
has_post_strong [definition, in ITree.Props.HasPost]
has_post [definition, in ITree.Props.HasPost]
Hb:122 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hcorec:125 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hcorec:9 [binder, in ITree.Extra.Dijkstra.IterRel]
Hempty:181 [binder, in ITree.Extra.ITrace.ITraceBind]
Hempty:261 [binder, in ITree.Extra.ITrace.ITraceBind]
Hempty:283 [binder, in ITree.Extra.ITrace.ITraceBind]
Hempty:35 [binder, in ITree.Extra.ITrace.ITraceDefinition]
Hempty:8 [binder, in ITree.Extra.ITrace.ITraceDefinition]
HEQP:5 [binder, in ITree.Basics.MonadState]
HeterogeneousRelations [library]
hexploit_mp [lemma, in ITree.Core.ITreeDefinition]
Hf':83 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hhandler:170 [binder, in ITree.Extra.Secure.SecureStateHandler]
Hhandler:63 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
HK:114 [binder, in ITree.Extra.IForest]
HK:419 [binder, in ITree.Extra.IForest]
HM:4 [binder, in ITree.Basics.MonadState]
HM:418 [binder, in ITree.Extra.IForest]
Hp':16 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp':25 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp':9 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp0:63 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp0:67 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:105 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:113 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:129 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:135 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:140 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:147 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:15 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:158 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:167 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:172 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:180 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:195 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:214 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
HP:231 [binder, in ITree.Extra.IForest]
Hp:24 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:45 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:53 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:60 [binder, in ITree.Extra.Dijkstra.StateSpecT]
Hp:74 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
Hp:8 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hq:61 [binder, in ITree.Extra.Dijkstra.StateSpecT]
Hq:76 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
Hrel:8 [binder, in ITree.Extra.Dijkstra.IterRel]
Hreta:124 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hretb:121 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
HRET:553 [binder, in ITree.Extra.IForest]
HRinv:25 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
HRR:568 [binder, in ITree.Eq.Eqit]
HRR:575 [binder, in ITree.Eq.Eqit]
HRR:582 [binder, in ITree.Eq.Eqit]
HRT:569 [binder, in ITree.Eq.Eqit]
HRT:576 [binder, in ITree.Eq.Eqit]
HRT:583 [binder, in ITree.Eq.Eqit]
Hrutt:227 [binder, in ITree.Extra.ITrace.ITraceBind]
Hrutt:73 [binder, in ITree.Extra.ITrace.ITraceBind]
HR:197 [binder, in ITree.Extra.IForest]
Hspin:119 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
HSUB:47 [binder, in ITree.Core.KTreeFacts]
HS:104 [binder, in ITree.Extra.IForest]
HS:159 [binder, in ITree.Extra.IForest]
HS:63 [binder, in ITree.Core.KTreeFacts]
HTA:111 [binder, in ITree.Extra.IForest]
Ht1:148 [binder, in ITree.Extra.ITrace.ITraceFacts]
Ht2:149 [binder, in ITree.Extra.ITrace.ITraceFacts]
Ht:118 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
HT:198 [binder, in ITree.Extra.IForest]
HXY:18 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
h_spec:310 [binder, in ITree.Extra.IForest]
h_spec:275 [binder, in ITree.Extra.IForest]
h_spec:263 [binder, in ITree.Extra.IForest]
h_spec:254 [binder, in ITree.Extra.IForest]
h_spec:248 [binder, in ITree.Extra.IForest]
h_spec:242 [binder, in ITree.Extra.IForest]
h_spec:227 [binder, in ITree.Extra.IForest]
h_spec:201 [binder, in ITree.Extra.IForest]
h_spec:188 [binder, in ITree.Extra.IForest]
h_spec:183 [binder, in ITree.Extra.IForest]
h_spec:168 [binder, in ITree.Extra.IForest]
h_spec:162 [binder, in ITree.Extra.IForest]
h_spec:153 [binder, in ITree.Extra.IForest]
h_spec:149 [binder, in ITree.Extra.IForest]
h_spec:141 [binder, in ITree.Extra.IForest]
h_spec:136 [binder, in ITree.Extra.IForest]
h_spec:128 [binder, in ITree.Extra.IForest]
h_spec:117 [binder, in ITree.Extra.IForest]
h_spec:91 [binder, in ITree.Extra.IForest]
h_spec:84 [binder, in ITree.Extra.IForest]
h_state [definition, in ITree.Events.State]
H0:10 [binder, in ITree.Basics.CategoryFunctor]
H0:113 [binder, in ITree.Basics.HeterogeneousRelations]
H0:120 [binder, in ITree.Basics.HeterogeneousRelations]
H0:141 [binder, in ITree.Extra.ITrace.ITraceFacts]
H0:192 [binder, in ITree.Basics.HeterogeneousRelations]
H0:194 [binder, in ITree.Basics.HeterogeneousRelations]
H0:195 [binder, in ITree.Basics.CategoryOps]
H0:196 [binder, in ITree.Basics.HeterogeneousRelations]
H0:198 [binder, in ITree.Basics.HeterogeneousRelations]
H0:20 [binder, in ITree.Basics.CategoryKleisli]
H0:200 [binder, in ITree.Basics.HeterogeneousRelations]
H0:210 [binder, in ITree.Basics.HeterogeneousRelations]
H0:26 [binder, in ITree.Events.Nondeterminism]
H0:275 [binder, in ITree.Basics.HeterogeneousRelations]
H0:34 [binder, in ITree.Basics.CategoryFunctor]
H0:7 [binder, in ITree.Basics.Monad]
h1_spec:293 [binder, in ITree.Extra.IForest]
H1:11 [binder, in ITree.Basics.CategoryFunctor]
H1:196 [binder, in ITree.Basics.CategoryOps]
h1:295 [binder, in ITree.Extra.IForest]
H1:33 [binder, in ITree.Basics.CategoryKleisli]
H1:35 [binder, in ITree.Basics.CategoryFunctor]
h2_spec:294 [binder, in ITree.Extra.IForest]
H2:12 [binder, in ITree.Basics.CategoryFunctor]
H2:197 [binder, in ITree.Basics.CategoryOps]
h2:296 [binder, in ITree.Extra.IForest]
H2:36 [binder, in ITree.Basics.CategoryFunctor]
H3:13 [binder, in ITree.Basics.CategoryFunctor]
H3:198 [binder, in ITree.Basics.CategoryOps]
H3:37 [binder, in ITree.Basics.CategoryFunctor]
H4:14 [binder, in ITree.Basics.CategoryFunctor]
H4:203 [binder, in ITree.Basics.CategoryOps]
H4:208 [binder, in ITree.Basics.CategoryOps]
H4:213 [binder, in ITree.Basics.CategoryOps]
H4:217 [binder, in ITree.Basics.CategoryOps]
H4:219 [binder, in ITree.Basics.CategoryOps]
H4:38 [binder, in ITree.Basics.CategoryFunctor]
H5:209 [binder, in ITree.Basics.CategoryOps]
H:10 [binder, in ITree.Events.Map]
H:10 [binder, in ITree.Events.Nondeterminism]
H:101 [binder, in ITree.Eq.Eqit]
h:102 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
h:104 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
h:105 [binder, in ITree.Events.FailFacts]
H:11 [binder, in ITree.Events.MapDefault]
h:11 [binder, in ITree.Interp.Interp]
H:112 [binder, in ITree.Basics.HeterogeneousRelations]
h:114 [binder, in ITree.Events.FailFacts]
h:117 [binder, in ITree.Events.StateFacts]
H:119 [binder, in ITree.Basics.HeterogeneousRelations]
H:12 [binder, in ITree.Events.Map]
H:12 [binder, in ITree.Core.Subevent]
H:12 [binder, in ITree.Events.State]
H:123 [binder, in ITree.Basics.HeterogeneousRelations]
H:13 [binder, in ITree.Basics.CategoryKleisli]
h:137 [binder, in ITree.Events.StateFacts]
h:14 [binder, in ITree.Events.StateFacts]
H:14 [binder, in ITree.Events.MapDefault]
H:14 [binder, in ITree.Events.State]
H:17 [binder, in ITree.Basics.Basics]
H:17 [binder, in ITree.Extra.ITrace.ITracePrefix]
H:186 [binder, in ITree.Basics.HeterogeneousRelations]
h:189 [binder, in ITree.Extra.IForest]
H:19 [binder, in ITree.Basics.CategoryKleisli]
h:19 [binder, in ITree.Interp.TranslateFacts]
H:191 [binder, in ITree.Basics.HeterogeneousRelations]
H:192 [binder, in ITree.Extra.IForest]
H:193 [binder, in ITree.Basics.HeterogeneousRelations]
H:194 [binder, in ITree.Basics.CategoryOps]
H:195 [binder, in ITree.Basics.HeterogeneousRelations]
h:195 [binder, in ITree.Simple]
H:197 [binder, in ITree.Basics.HeterogeneousRelations]
H:199 [binder, in ITree.Basics.HeterogeneousRelations]
H:20 [binder, in ITree.Events.MapDefault]
H:20 [binder, in ITree.Core.Subevent]
h:20 [binder, in ITree.Interp.Interp]
H:209 [binder, in ITree.Basics.HeterogeneousRelations]
h:21 [binder, in ITree.Events.StateFacts]
h:23 [binder, in ITree.Basics.CategoryTheory]
H:24 [binder, in ITree.Core.Subevent]
H:25 [binder, in ITree.Events.Nondeterminism]
H:259 [binder, in ITree.Extra.IForest]
H:27 [binder, in ITree.Eq.SimUpToTaus]
H:27 [binder, in ITree.Interp.Handler]
H:270 [binder, in ITree.Extra.IForest]
H:274 [binder, in ITree.Basics.HeterogeneousRelations]
H:280 [binder, in ITree.Extra.IForest]
H:29 [binder, in ITree.Core.Subevent]
H:3 [binder, in ITree.Core.Subevent]
h:311 [binder, in ITree.Extra.IForest]
H:33 [binder, in ITree.Basics.CategoryFunctor]
h:33 [binder, in ITree.Core.ITreeDefinition]
h:34 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
h:37 [binder, in ITree.Events.StateFacts]
H:38 [binder, in ITree.Eq.Shallow]
h:388 [binder, in ITree.Basics.CategoryTheory]
h:39 [binder, in ITree.Events.FailFacts]
H:4 [binder, in ITree.Events.Nondeterminism]
h:4 [binder, in ITree.Interp.Interp]
h:4 [binder, in ITree.Interp.TranslateFacts]
h:41 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
h:414 [binder, in ITree.Basics.CategoryFacts]
h:418 [binder, in ITree.Basics.CategoryFacts]
H:42 [binder, in ITree.Eq.Shallow]
h:424 [binder, in ITree.Basics.CategoryFacts]
h:45 [binder, in ITree.Events.StateFacts]
h:48 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
H:5 [binder, in ITree.Events.Reader]
h:52 [binder, in ITree.Simple]
H:54 [binder, in ITree.Eq.Paco2]
h:56 [binder, in ITree.Events.FailFacts]
H:57 [binder, in ITree.Eq.Paco2]
h:58 [binder, in ITree.Events.State]
H:6 [binder, in ITree.Events.Map]
H:6 [binder, in ITree.Basics.Monad]
H:6 [binder, in ITree.Events.Exception]
H:6 [binder, in ITree.Events.Writer]
h:60 [binder, in ITree.Events.FailFacts]
H:60 [binder, in ITree.Eq.Paco2]
H:61 [binder, in ITree.Eq.Paco2]
H:63 [binder, in ITree.Interp.Traces]
H:63 [binder, in ITree.Interp.TranslateFacts]
h:65 [binder, in ITree.Events.FailFacts]
h:66 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
h:66 [binder, in ITree.Interp.TranslateFacts]
h:69 [binder, in ITree.Events.FailFacts]
H:7 [binder, in ITree.Events.Concurrency]
h:7 [binder, in ITree.Events.State]
H:72 [binder, in ITree.Eq.Eqit]
h:76 [binder, in ITree.Events.StateFacts]
H:76 [binder, in ITree.Eq.Eqit]
h:779 [binder, in ITree.Eq.Eqit]
H:8 [binder, in ITree.Events.Map]
H:8 [binder, in ITree.Events.MapDefault]
h:81 [binder, in ITree.Props.HasPost]
h:81 [binder, in ITree.Events.FailFacts]
h:82 [binder, in ITree.Events.StateFacts]
h:85 [binder, in ITree.Extra.IForest]
h:87 [binder, in ITree.Events.FailFacts]
h:87 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
H:9 [binder, in ITree.Basics.CategoryFunctor]
H:9 [binder, in ITree.Events.Dependent]
h:92 [binder, in ITree.Events.FailFacts]
h:94 [binder, in ITree.Events.StateFacts]
H:95 [binder, in ITree.Eq.Eqit]

I

IdC:4 [binder, in ITree.Basics.CategoryFacts]
IdC:4 [binder, in ITree.Basics.CategoryTheory]
IdC:48 [binder, in ITree.Basics.CategoryTheory]
IdC:66 [binder, in ITree.Basics.CategoryTheory]
IdC:78 [binder, in ITree.Basics.CategoryTheory]
idM [definition, in ITree.Basics.Basics]
Id_Fun [instance, in ITree.Basics.Function]
Id_C:181 [binder, in ITree.Basics.CategoryOps]
Id_C:95 [binder, in ITree.Basics.CategoryOps]
id_ [projection, in ITree.Basics.CategoryOps]
Id_ [record, in ITree.Basics.CategoryOps]
id_ [constructor, in ITree.Basics.CategoryOps]
Id_ [inductive, in ITree.Basics.CategoryOps]
Id_Kleisli [instance, in ITree.Basics.CategoryKleisli]
Id_Handler [instance, in ITree.Interp.Handler]
Id_IFun [instance, in ITree.Indexed.Function]
Id_C:348 [binder, in ITree.Basics.CategoryFacts]
Id_C:221 [binder, in ITree.Basics.CategoryFacts]
Id_C:94 [binder, in ITree.Basics.CategoryFacts]
Id_C:70 [binder, in ITree.Basics.CategoryFacts]
Id_C:50 [binder, in ITree.Basics.CategoryFacts]
Id_rel [instance, in ITree.Basics.CategoryRelations]
Id_C:344 [binder, in ITree.Basics.CategoryTheory]
Id_C:306 [binder, in ITree.Basics.CategoryTheory]
Id_C:232 [binder, in ITree.Basics.CategoryTheory]
Id_C:204 [binder, in ITree.Basics.CategoryTheory]
Id_C:165 [binder, in ITree.Basics.CategoryTheory]
Id_C:126 [binder, in ITree.Basics.CategoryTheory]
Id_C:95 [binder, in ITree.Basics.CategoryTheory]
Id_Op [instance, in ITree.Basics.CategoryTheory]
Id_sub [instance, in ITree.Basics.CategorySub]
Id_C:14 [binder, in ITree.Basics.CategorySub]
ID:118 [binder, in ITree.Props.Leaf]
ID:367 [binder, in ITree.Extra.IForest]
ID:683 [binder, in ITree.Eq.Eqit]
iforest [definition, in ITree.Extra.IForest]
IForest [library]
iforest_compose [definition, in ITree.Extra.IForest]
IFun [definition, in ITree.Indexed.Function]
IM:13 [binder, in ITree.Basics.MonadState]
IM:19 [binder, in ITree.Interp.Interp]
IM:38 [binder, in ITree.Events.FailFacts]
IM:6 [binder, in ITree.Events.State]
In [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
INCH:132 [binder, in ITree.Eq.UpToTaus]
INCH:147 [binder, in ITree.Eq.UpToTaus]
includes_baseF [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
includes_base [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
INCL:129 [binder, in ITree.Eq.UpToTaus]
INCL:143 [binder, in ITree.Eq.UpToTaus]
ind_comb_bind [lemma, in ITree.Extra.ITrace.ITracePrefix]
ind_comb [inductive, in ITree.Extra.ITrace.ITracePrefix]
Infinite [library]
inf_tau [constructor, in ITree.Extra.Dijkstra.PureITreeDijkstra]
inf_tree_pred_resp_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
inf_and_forall [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_many_inf [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_many [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_many_monot [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_many_ [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_manyF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
Initial [record, in ITree.Basics.CategoryOps]
Initial [inductive, in ITree.Basics.CategoryOps]
InitialObject [record, in ITree.Basics.CategoryTheory]
InitialObject [inductive, in ITree.Basics.CategoryTheory]
InitialObject_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
InitialObject_Handler [instance, in ITree.Interp.HandlerFacts]
InitialObject_void [instance, in ITree.Basics.FunctionFacts]
InitialObject_i:381 [binder, in ITree.Basics.CategoryFacts]
InitialObject_i:196 [binder, in ITree.Basics.CategoryFacts]
InitialObject_i:54 [binder, in ITree.Basics.CategoryFacts]
InitialObject_rel [instance, in ITree.Basics.CategoryRelations]
Initial_void [instance, in ITree.Basics.Function]
Initial_Kleisli [instance, in ITree.Basics.CategoryKleisli]
Initial_void1_Handler [instance, in ITree.Interp.Handler]
Initial_void1 [instance, in ITree.Indexed.Function]
Initial_i:380 [binder, in ITree.Basics.CategoryFacts]
Initial_i:195 [binder, in ITree.Basics.CategoryFacts]
initial_unique [lemma, in ITree.Basics.CategoryFacts]
Initial_i:53 [binder, in ITree.Basics.CategoryFacts]
Initial_rel [instance, in ITree.Basics.CategoryRelations]
Initial_i:34 [binder, in ITree.Basics.CategoryTheory]
initial_object [projection, in ITree.Basics.CategoryTheory]
initial_object [constructor, in ITree.Basics.CategoryTheory]
init:190 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
init:94 [binder, in ITree.Events.ExceptionFacts]
inj_pair2 [lemma, in ITree.Extra.IForest]
Inl [record, in ITree.Basics.CategoryOps]
Inl [inductive, in ITree.Basics.CategoryOps]
Inl_bif:184 [binder, in ITree.Basics.CategoryOps]
inl_ [projection, in ITree.Basics.CategoryOps]
inl_ [constructor, in ITree.Basics.CategoryOps]
Inl_Kleisli [instance, in ITree.Basics.CategoryKleisli]
Inl_sum1_Handler [instance, in ITree.Interp.Handler]
Inl_sum1 [instance, in ITree.Indexed.Function]
Inl_C:353 [binder, in ITree.Basics.CategoryFacts]
inl_unit_r [lemma, in ITree.Basics.CategoryFacts]
inl_assoc_l [lemma, in ITree.Basics.CategoryFacts]
inl_assoc_r [lemma, in ITree.Basics.CategoryFacts]
inl_bimap [lemma, in ITree.Basics.CategoryFacts]
inl_swap [lemma, in ITree.Basics.CategoryFacts]
Inl_C:99 [binder, in ITree.Basics.CategoryFacts]
Inl_rel [instance, in ITree.Basics.CategoryRelations]
inl_morphism [constructor, in ITree.Basics.HeterogeneousRelations]
Inl_C:348 [binder, in ITree.Basics.CategoryTheory]
inl_case [abbreviation, in ITree.Basics.CategoryTheory]
Inl_C:130 [binder, in ITree.Basics.CategoryTheory]
Inl_sub [instance, in ITree.Basics.CategorySub]
Inl_C:35 [binder, in ITree.Basics.CategorySub]
inl1 [constructor, in ITree.Indexed.Sum]
INL:439 [binder, in ITree.Eq.Eqit]
Input [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
Inr [record, in ITree.Basics.CategoryOps]
Inr [inductive, in ITree.Basics.CategoryOps]
Inr_bif:185 [binder, in ITree.Basics.CategoryOps]
inr_ [projection, in ITree.Basics.CategoryOps]
inr_ [constructor, in ITree.Basics.CategoryOps]
Inr_Kleisli [instance, in ITree.Basics.CategoryKleisli]
Inr_sum1_Handler [instance, in ITree.Interp.Handler]
Inr_sum1 [instance, in ITree.Indexed.Function]
Inr_C:354 [binder, in ITree.Basics.CategoryFacts]
inr_unit_l [lemma, in ITree.Basics.CategoryFacts]
inr_assoc_r [lemma, in ITree.Basics.CategoryFacts]
inr_assoc_l [lemma, in ITree.Basics.CategoryFacts]
inr_bimap [lemma, in ITree.Basics.CategoryFacts]
inr_swap [lemma, in ITree.Basics.CategoryFacts]
Inr_C:100 [binder, in ITree.Basics.CategoryFacts]
Inr_rel [instance, in ITree.Basics.CategoryRelations]
inr_morphism [constructor, in ITree.Basics.HeterogeneousRelations]
Inr_C:349 [binder, in ITree.Basics.CategoryTheory]
inr_case [abbreviation, in ITree.Basics.CategoryTheory]
Inr_C:131 [binder, in ITree.Basics.CategoryTheory]
Inr_sub [instance, in ITree.Basics.CategorySub]
Inr_C:36 [binder, in ITree.Basics.CategorySub]
inr1 [constructor, in ITree.Indexed.Sum]
INR:440 [binder, in ITree.Eq.Eqit]
insert [definition, in ITree.Events.Map]
Insert [constructor, in ITree.Events.Map]
insert [definition, in ITree.Events.MapDefault]
Insert [constructor, in ITree.Events.MapDefault]
Instances [section, in ITree.Basics.CategoryKleisli]
interleaved [inductive, in ITree.Interp.HandlerFacts]
interleaved_mrec [lemma, in ITree.Interp.HandlerFacts]
interleaved_Right [constructor, in ITree.Interp.HandlerFacts]
interleaved_Left [constructor, in ITree.Interp.HandlerFacts]
interleaved_Ret [constructor, in ITree.Interp.HandlerFacts]
internalize [definition, in ITree.Basics.MonadState]
internalize_pure_iso [lemma, in ITree.Basics.MonadState]
internalize_pure [lemma, in ITree.Basics.MonadState]
internalize_cat [lemma, in ITree.Basics.MonadState]
internalize_eq [lemma, in ITree.Basics.MonadState]
interp [definition, in ITree.Interp.Interp]
Interp [library]
InterpFacts [library]
interp_failure_bind' [lemma, in ITree.Events.FailFacts]
interp_fail_bind [lemma, in ITree.Events.FailFacts]
interp_fail_trigger [lemma, in ITree.Events.FailFacts]
interp_fail_ret [lemma, in ITree.Events.FailFacts]
interp_fail_Ret [lemma, in ITree.Events.FailFacts]
interp_fail_vis [lemma, in ITree.Events.FailFacts]
interp_fail_tau [lemma, in ITree.Events.FailFacts]
interp_fail_eutt_eq [instance, in ITree.Events.FailFacts]
interp_fail_eutt [instance, in ITree.Events.FailFacts]
interp_fail_eq_itree_eq [instance, in ITree.Events.FailFacts]
interp_fail_eq_itree [instance, in ITree.Events.FailFacts]
interp_fail [definition, in ITree.Events.FailFacts]
interp_iforest_tau_inv [lemma, in ITree.Extra.IForest]
interp_iforest_vis_inv [lemma, in ITree.Extra.IForest]
interp_iforest_ret_inv [lemma, in ITree.Extra.IForest]
interp_iforest_tau [lemma, in ITree.Extra.IForest]
interp_iforest_spin_accepts_anything [lemma, in ITree.Extra.IForest]
interp_iforest_trigger [lemma, in ITree.Extra.IForest]
interp_iforest_Proper_eq [instance, in ITree.Extra.IForest]
interp_iforest_correct_exec [lemma, in ITree.Extra.IForest]
interp_iforest_Proper3 [instance, in ITree.Extra.IForest]
interp_iforest_Proper2 [instance, in ITree.Extra.IForest]
interp_iforest_Proper [instance, in ITree.Extra.IForest]
interp_iforestF_Proper [instance, in ITree.Extra.IForest]
interp_iforest_ret [lemma, in ITree.Extra.IForest]
interp_iforest [definition, in ITree.Extra.IForest]
interp_iforest__mono [lemma, in ITree.Extra.IForest]
interp_iforest_ [definition, in ITree.Extra.IForest]
interp_iforestF_mono [lemma, in ITree.Extra.IForest]
Interp_iforest_Vis [constructor, in ITree.Extra.IForest]
Interp_iforest_Tau [constructor, in ITree.Extra.IForest]
Interp_iforest_Ret [constructor, in ITree.Extra.IForest]
interp_iforestF [inductive, in ITree.Extra.IForest]
interp_state_iter' [lemma, in ITree.Events.StateFacts]
interp_state_iter [lemma, in ITree.Events.StateFacts]
interp_state_bind [lemma, in ITree.Events.StateFacts]
interp_state_trigger [lemma, in ITree.Events.StateFacts]
interp_state_trigger_eqit [lemma, in ITree.Events.StateFacts]
interp_state_tau [lemma, in ITree.Events.StateFacts]
interp_state_vis [lemma, in ITree.Events.StateFacts]
interp_state_ret [lemma, in ITree.Events.StateFacts]
interp_mrec [definition, in ITree.Interp.Recursion]
interp_map [definition, in ITree.Events.MapDefault]
interp_eqit_secure_state [lemma, in ITree.Extra.Secure.SecureStateHandler]
interp_loop [lemma, in ITree.Interp.InterpFacts]
interp_iter [lemma, in ITree.Interp.InterpFacts]
interp_iter' [lemma, in ITree.Interp.InterpFacts]
interp_forever [lemma, in ITree.Interp.InterpFacts]
interp_translate [lemma, in ITree.Interp.InterpFacts]
interp_interp [lemma, in ITree.Interp.InterpFacts]
interp_trigger_h [lemma, in ITree.Interp.InterpFacts]
interp_id_h [lemma, in ITree.Interp.InterpFacts]
interp_bind [lemma, in ITree.Interp.InterpFacts]
interp_trigger [lemma, in ITree.Interp.InterpFacts]
interp_vis [lemma, in ITree.Interp.InterpFacts]
interp_tau [lemma, in ITree.Interp.InterpFacts]
interp_ret [lemma, in ITree.Interp.InterpFacts]
interp_map_proper [instance, in ITree.Events.MapDefaultFacts]
interp_map_id [lemma, in ITree.Events.MapDefaultFacts]
interp_recursive_call [lemma, in ITree.Interp.RecursionFacts]
interp_mrecursive [lemma, in ITree.Interp.RecursionFacts]
interp_mrec_as_interp [lemma, in ITree.Interp.RecursionFacts]
interp_mrec_trigger [lemma, in ITree.Interp.RecursionFacts]
interp_mrec_bind [lemma, in ITree.Interp.RecursionFacts]
interp_e [definition, in ITree.Events.State]
interp_prop [inductive, in ITree.Events.State]
interp_prop [section, in ITree.Events.State]
interp_state [definition, in ITree.Events.State]
interp_pi_eqit_secure_state [lemma, in ITree.Extra.Secure.SecureStateHandlerPi]
intro_wf [lemma, in ITree.Extra.Dijkstra.IterRel]
intro_not_wf [lemma, in ITree.Extra.Dijkstra.IterRel]
inv_remove_events [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
inv_append_eutt [lemma, in ITree.Extra.ITrace.ITraceFacts]
Inv:69 [binder, in ITree.Props.HasPost]
IN:108 [binder, in ITree.Eq.Rutt]
IN:121 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
IN:121 [binder, in ITree.Extra.Secure.SecureEqHalt]
IN:124 [binder, in ITree.Extra.IForest]
IN:13 [binder, in ITree.Extra.Dijkstra.IterRel]
IN:15 [binder, in ITree.Eq.UpToTaus]
IN:159 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
IN:175 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
IN:175 [binder, in ITree.Extra.Secure.SecureEqHalt]
IN:20 [binder, in ITree.Eq.UpToTaus]
IN:20 [binder, in ITree.Props.Infinite]
IN:217 [binder, in ITree.Extra.IForest]
IN:226 [binder, in ITree.Eq.Eqit]
IN:26 [binder, in ITree.Eq.UpToTaus]
IN:47 [binder, in ITree.Eq.Eqit]
IN:50 [binder, in ITree.Props.Infinite]
IN:51 [binder, in ITree.Eq.UpToTaus]
IN:83 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
IO [inductive, in ITree.Extra.Dijkstra.StateIOTrace]
io:25 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
ipDelay [constructor, in ITree.Events.State]
ipRet [constructor, in ITree.Events.State]
ipVis [constructor, in ITree.Events.State]
ir:472 [binder, in ITree.Extra.IForest]
ir:493 [binder, in ITree.Extra.IForest]
ir:498 [binder, in ITree.Extra.IForest]
iso [definition, in ITree.Basics.MonadState]
Iso [record, in ITree.Basics.CategoryTheory]
IsoBif:30 [binder, in ITree.Basics.CategorySub]
IsoFacts [section, in ITree.Basics.CategoryFacts]
IsoFacts.IsoBimap [section, in ITree.Basics.CategoryFacts]
IsoFacts.IsoCat [section, in ITree.Basics.CategoryFacts]
iso_inv [definition, in ITree.Basics.MonadState]
iso_destatify_arrow [definition, in ITree.Extra.Dijkstra.StateSpecT]
iso_arrow [definition, in ITree.Extra.Dijkstra.StateSpecT]
Iso_UnitR_sum_rel [instance, in ITree.Basics.CategoryRelations]
Iso_UnitL_sum_rel [instance, in ITree.Basics.CategoryRelations]
Iso_Assoc_sum_rel [instance, in ITree.Basics.CategoryRelations]
Iso_UnitR_prod_rel [instance, in ITree.Basics.CategoryRelations]
Iso_UnitL_prod_rel [instance, in ITree.Basics.CategoryRelations]
Iso_Assoc_prod_rel [instance, in ITree.Basics.CategoryRelations]
iso_epi [projection, in ITree.Basics.CategoryTheory]
iso_mono [projection, in ITree.Basics.CategoryTheory]
is_bool_matches [constructor, in ITree.Extra.Dijkstra.TracesIT]
is_bool [inductive, in ITree.Extra.Dijkstra.TracesIT]
is_inf_monot [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
is_inf [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
is_inf_ [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
is_inf_cons [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
is_infF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
is_traceF_tau [lemma, in ITree.Interp.Traces]
is_trace [definition, in ITree.Interp.Traces]
is_traceF [inductive, in ITree.Interp.Traces]
is':59 [binder, in ITree.Basics.Basics]
is:56 [binder, in ITree.Basics.Basics]
ITDInput [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
iter [projection, in ITree.Basics.CategoryOps]
Iter [record, in ITree.Basics.CategoryOps]
iter [constructor, in ITree.Basics.CategoryOps]
Iter [inductive, in ITree.Basics.CategoryOps]
iter [projection, in ITree.Basics.Basics]
iter [constructor, in ITree.Basics.Basics]
Iteration [section, in ITree.Basics.CategoryOps]
IterationLaws [section, in ITree.Basics.CategoryTheory]
Iteration.bif [variable, in ITree.Basics.CategoryOps]
Iterative [record, in ITree.Basics.CategoryTheory]
Iterative_ktree [instance, in ITree.Core.KTreeFacts]
Iterative_Handler [instance, in ITree.Interp.HandlerFacts]
Iterative_stateTM [instance, in ITree.Basics.MonadState]
Iterative_C:357 [binder, in ITree.Basics.CategoryFacts]
iterative_proper_iter [projection, in ITree.Basics.CategoryTheory]
iterative_codiagonal [projection, in ITree.Basics.CategoryTheory]
iterative_dinatural [projection, in ITree.Basics.CategoryTheory]
iterative_natural [projection, in ITree.Basics.CategoryTheory]
iterative_unfold [projection, in ITree.Basics.CategoryTheory]
Iterative_Prop [instance, in ITree.Basics.MonadProp]
Iterative_sub [instance, in ITree.Basics.CategorySub]
Iterative_C:62 [binder, in ITree.Basics.CategorySub]
IterCodiagonal [record, in ITree.Basics.CategoryTheory]
IterCodiagonal [inductive, in ITree.Basics.CategoryTheory]
IterCodiagonal_ktree [instance, in ITree.Core.KTreeFacts]
IterCodiagonal_Handler [instance, in ITree.Interp.HandlerFacts]
IterCodiagonal_stateTM [instance, in ITree.Basics.MonadState]
IterCodiagonal_stateTM [instance, in ITree.Basics.MonadProp]
IterDinatural [record, in ITree.Basics.CategoryTheory]
IterDinatural [inductive, in ITree.Basics.CategoryTheory]
IterDinatural_ktree [instance, in ITree.Core.KTreeFacts]
IterDinatural_Handler [instance, in ITree.Interp.HandlerFacts]
IterDinatural_stateTM [instance, in ITree.Basics.MonadState]
IterDinatural_Prop [instance, in ITree.Basics.MonadProp]
iterF [inductive, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_monotone' [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_monotone [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_con [constructor, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body_resp_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body'_resp_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body_equiv [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body [inductive, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body' [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
IterNatural [record, in ITree.Basics.CategoryTheory]
IterNatural [inductive, in ITree.Basics.CategoryTheory]
IterNatural_ktree [instance, in ITree.Core.KTreeFacts]
IterNatural_Handler [instance, in ITree.Interp.HandlerFacts]
IterNatural_stateTM [instance, in ITree.Basics.MonadState]
IterNatural_Prop [instance, in ITree.Basics.MonadProp]
iterp [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
IterPairing [definition, in ITree.Basics.CategoryTheory]
IterRel [section, in ITree.Extra.Dijkstra.IterRel]
IterRel [library]
IterUnfold [record, in ITree.Basics.CategoryTheory]
IterUnfold [inductive, in ITree.Basics.CategoryTheory]
IterUnfold_ktree [instance, in ITree.Core.KTreeFacts]
IterUnfold_Handler [instance, in ITree.Interp.HandlerFacts]
IterUnfold_stateTM [instance, in ITree.Basics.MonadState]
IterUnfold_Prop [instance, in ITree.Basics.MonadProp]
iter_eq_start_index [lemma, in ITree.Extra.IForest]
iter_succ_dinatural [lemma, in ITree.Extra.IForest]
iter_cont [definition, in ITree.Extra.IForest]
Iter_bif:186 [binder, in ITree.Basics.CategoryOps]
iter_codiagonal_ktree [lemma, in ITree.Core.KTreeFacts]
iter_dinatural_ktree [lemma, in ITree.Core.KTreeFacts]
Iter_Kleisli [instance, in ITree.Basics.CategoryKleisli]
iter_monot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iter_ [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
iter_step [constructor, in ITree.Basics.Basics]
iter_done [constructor, in ITree.Basics.Basics]
iter_Prop [inductive, in ITree.Basics.Basics]
Iter_Handler [instance, in ITree.Interp.Handler]
iter_dinatural_helper [lemma, in ITree.Basics.MonadState]
Iter_stateTM [instance, in ITree.Basics.MonadState]
iter_wf_converge_state [lemma, in ITree.Extra.Dijkstra.StateSpecT]
iter_inl_spin_state [lemma, in ITree.Extra.Dijkstra.StateSpecT]
iter_bind_aux [lemma, in ITree.Extra.Secure.SecureEqBind]
iter_bind_shalt_aux2 [lemma, in ITree.Extra.Secure.SecureEqBind]
iter_bind_shalt_aux1 [lemma, in ITree.Extra.Secure.SecureEqBind]
Iter_bif:356 [binder, in ITree.Basics.CategoryFacts]
iter_codiagonal [projection, in ITree.Basics.CategoryTheory]
iter_codiagonal [constructor, in ITree.Basics.CategoryTheory]
iter_dinatural [projection, in ITree.Basics.CategoryTheory]
iter_dinatural [constructor, in ITree.Basics.CategoryTheory]
iter_natural [projection, in ITree.Basics.CategoryTheory]
iter_natural [constructor, in ITree.Basics.CategoryTheory]
iter_unfold [projection, in ITree.Basics.CategoryTheory]
iter_unfold [constructor, in ITree.Basics.CategoryTheory]
Iter_C:350 [binder, in ITree.Basics.CategoryTheory]
iter_lift [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
iter_wf_converge [lemma, in ITree.Extra.Dijkstra.DelaySpecMonad]
iter_inl_spin [lemma, in ITree.Extra.Dijkstra.DelaySpecMonad]
iter_arrow_rel [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
Iter_sub [instance, in ITree.Basics.CategorySub]
Iter_C:39 [binder, in ITree.Basics.CategorySub]
itrace [definition, in ITree.Extra.ITrace.ITraceDefinition]
ITraceBind [library]
ITraceDefinition [library]
ITraceFacts [library]
ITracePreds [library]
ITracePrefix [library]
itrace_eq [instance, in ITree.Extra.ITrace.ITraceDefinition]
itrace' [definition, in ITree.Extra.ITrace.ITraceDefinition]
ITree [module, in ITree.Core.ITreeDefinition]
itree [record, in ITree.Core.ITreeDefinition]
itree [section, in ITree.Core.ITreeDefinition]
ITree [library]
ITreeDefinition [library]
ITreeDijkstra [section, in ITree.Extra.Dijkstra.ITreeDijkstra]
ITreeDijkstra [library]
itreeF [inductive, in ITree.Core.ITreeDefinition]
ITreeFacts [library]
ITreeMonad [library]
ITreeNotations [module, in ITree.Core.ITreeDefinition]
_ >=> _ (itree_scope) [notation, in ITree.Core.ITreeDefinition]
' _ <- _ ;; _ (itree_scope) [notation, in ITree.Core.ITreeDefinition]
_ ;; _ (itree_scope) [notation, in ITree.Core.ITreeDefinition]
_ <- _ ;; _ (itree_scope) [notation, in ITree.Core.ITreeDefinition]
_ >>= _ (itree_scope) [notation, in ITree.Core.ITreeDefinition]
ITreeSpec [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
ItreeSpecEq [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
ItreeSpecEquiv [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
ItreeSpecMonad [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
itree_eta_ [lemma, in ITree.Eq.EqAxiom]
itree_includes [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
itree_includesF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
itree_includes' [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
itree_refine_nonempty [lemma, in ITree.Extra.ITrace.ITraceFacts]
itree_eta' [lemma, in ITree.Eq.Eqit]
itree_eta [lemma, in ITree.Eq.Eqit]
itree_eta_ [lemma, in ITree.Eq.Eqit]
itree' [abbreviation, in ITree.Core.ITreeDefinition]
ITree.bind [definition, in ITree.Core.ITreeDefinition]
ITree.cat [definition, in ITree.Core.ITreeDefinition]
ITree.forever [definition, in ITree.Core.ITreeDefinition]
ITree.ignore [definition, in ITree.Core.ITreeDefinition]
ITree.iter [definition, in ITree.Core.ITreeDefinition]
ITree.map [definition, in ITree.Core.ITreeDefinition]
ITree.on_left [abbreviation, in ITree.Core.ITreeDefinition]
ITree.spin [definition, in ITree.Core.ITreeDefinition]
ITree.subst [definition, in ITree.Core.ITreeDefinition]
ITree.trigger [definition, in ITree.Core.ITreeDefinition]
itree:3 [binder, in ITree.Core.ITreeDefinition]
i_pointwise [definition, in ITree.Indexed.Relation]
i_respectful [definition, in ITree.Indexed.Relation]
i':10 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
i':102 [binder, in ITree.Events.StateFacts]
i':102 [binder, in ITree.Basics.Basics]
I':88 [binder, in ITree.Events.StateFacts]
i':98 [binder, in ITree.Events.StateFacts]
I1:11 [binder, in ITree.Core.KTreeFacts]
i1:22 [binder, in ITree.Core.KTreeFacts]
I1:26 [binder, in ITree.Core.KTreeFacts]
i1:37 [binder, in ITree.Core.KTreeFacts]
I1:41 [binder, in ITree.Core.KTreeFacts]
i1:54 [binder, in ITree.Core.KTreeFacts]
I2:12 [binder, in ITree.Core.KTreeFacts]
i2:23 [binder, in ITree.Core.KTreeFacts]
I2:27 [binder, in ITree.Core.KTreeFacts]
i2:38 [binder, in ITree.Core.KTreeFacts]
I2:42 [binder, in ITree.Core.KTreeFacts]
i2:55 [binder, in ITree.Core.KTreeFacts]
I:1 [binder, in ITree.Events.Dependent]
i:10 [binder, in ITree.Events.Dependent]
i:101 [binder, in ITree.Events.StateFacts]
I:11 [binder, in ITree.Events.Dependent]
I:110 [binder, in ITree.Interp.InterpFacts]
i:114 [binder, in ITree.Interp.InterpFacts]
i:116 [binder, in ITree.Interp.InterpFacts]
i:13 [binder, in ITree.Events.Dependent]
I:160 [binder, in ITree.Events.StateFacts]
i:164 [binder, in ITree.Events.StateFacts]
i:166 [binder, in ITree.Events.StateFacts]
i:17 [binder, in ITree.Basics.CategoryOps]
I:171 [binder, in ITree.Events.StateFacts]
i:174 [binder, in ITree.Events.StateFacts]
i:175 [binder, in ITree.Events.StateFacts]
I:18 [binder, in ITree.Events.FailFacts]
i:194 [binder, in ITree.Basics.CategoryFacts]
i:20 [binder, in ITree.Events.FailFacts]
i:21 [binder, in ITree.Events.FailFacts]
i:218 [binder, in ITree.Basics.CategoryOps]
i:249 [binder, in ITree.Basics.CategoryTheory]
i:316 [binder, in ITree.Basics.CategoryTheory]
I:321 [binder, in ITree.Extra.IForest]
i:33 [binder, in ITree.Basics.CategoryTheory]
I:330 [binder, in ITree.Extra.IForest]
i:332 [binder, in ITree.Extra.IForest]
I:37 [binder, in ITree.Core.ITreeDefinition]
i:379 [binder, in ITree.Basics.CategoryFacts]
i:39 [binder, in ITree.Core.ITreeDefinition]
I:47 [binder, in ITree.Basics.Basics]
i:5 [binder, in ITree.Events.Dependent]
I:5 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
i:52 [binder, in ITree.Basics.CategoryFacts]
i:54 [binder, in ITree.Basics.Basics]
i:57 [binder, in ITree.Basics.Basics]
i:59 [binder, in ITree.Basics.CategoryOps]
I:6 [binder, in ITree.Events.Dependent]
i:63 [binder, in ITree.Basics.CategoryOps]
i:65 [binder, in ITree.Basics.Basics]
I:66 [binder, in ITree.Props.HasPost]
i:67 [binder, in ITree.Basics.CategoryOps]
i:69 [binder, in ITree.Basics.Basics]
i:71 [binder, in ITree.Props.HasPost]
i:71 [binder, in ITree.Basics.CategoryOps]
i:75 [binder, in ITree.Basics.Basics]
i:77 [binder, in ITree.Basics.Basics]
i:82 [binder, in ITree.Basics.Basics]
i:83 [binder, in ITree.Basics.Basics]
I:87 [binder, in ITree.Events.StateFacts]
i:91 [binder, in ITree.Basics.Basics]
i:92 [binder, in ITree.Basics.Basics]
I:96 [binder, in ITree.Basics.Basics]
i:97 [binder, in ITree.Events.StateFacts]
i:98 [binder, in ITree.Basics.Basics]

J

j1:19 [binder, in ITree.Core.KTreeFacts]
j1:34 [binder, in ITree.Core.KTreeFacts]
j1:51 [binder, in ITree.Core.KTreeFacts]
j2:20 [binder, in ITree.Core.KTreeFacts]
j2:35 [binder, in ITree.Core.KTreeFacts]
j2:52 [binder, in ITree.Core.KTreeFacts]
j:335 [binder, in ITree.Extra.IForest]

K

kab:852 [binder, in ITree.Eq.Eqit]
kab:863 [binder, in ITree.Eq.Eqit]
kab:874 [binder, in ITree.Eq.Eqit]
kab:888 [binder, in ITree.Eq.Eqit]
kab:896 [binder, in ITree.Eq.Eqit]
kab:904 [binder, in ITree.Eq.Eqit]
KBP:606 [binder, in ITree.Extra.IForest]
kb:218 [binder, in ITree.Extra.ITrace.ITraceBind]
KB:603 [binder, in ITree.Extra.IForest]
kb:823 [binder, in ITree.Eq.Eqit]
kb:830 [binder, in ITree.Eq.Eqit]
kb:837 [binder, in ITree.Eq.Eqit]
kcatch:10 [binder, in ITree.Events.ExceptionFacts]
kcatch:15 [binder, in ITree.Events.Exception]
kcatch:16 [binder, in ITree.Events.ExceptionFacts]
kcatch:23 [binder, in ITree.Events.ExceptionFacts]
kcatch:5 [binder, in ITree.Events.ExceptionFacts]
kcatch:58 [binder, in ITree.Events.ExceptionFacts]
kcatch:71 [binder, in ITree.Events.ExceptionFacts]
kcatch:78 [binder, in ITree.Events.ExceptionFacts]
kca:866 [binder, in ITree.Eq.Eqit]
kca:877 [binder, in ITree.Eq.Eqit]
KCP:607 [binder, in ITree.Extra.IForest]
KC:604 [binder, in ITree.Extra.IForest]
KdecOk:7 [binder, in ITree.Events.MapDefaultFacts]
Kdec:6 [binder, in ITree.Events.MapDefaultFacts]
Kleisli [definition, in ITree.Basics.CategoryKleisli]
Kleisli_apply [definition, in ITree.Basics.CategoryKleisli]
Kleisli_arrow [definition, in ITree.Basics.CategoryKleisli]
kr:18 [binder, in ITree.Extra.ITrace.ITracePrefix]
kr:23 [binder, in ITree.Extra.ITrace.ITracePrefix]
ks:19 [binder, in ITree.Extra.ITrace.ITracePrefix]
ks:24 [binder, in ITree.Extra.ITrace.ITracePrefix]
ks:272 [binder, in ITree.Extra.IForest]
ktree [abbreviation, in ITree.Core.KTree]
ktree [abbreviation, in ITree.Core.KTree]
KTree [library]
KTreeFacts [library]
KTreeIterative [section, in ITree.Core.KTreeFacts]
ktree_apply [abbreviation, in ITree.Core.KTree]
kts:126 [binder, in ITree.Interp.Traces]
kt:219 [binder, in ITree.Extra.ITrace.ITraceBind]
kxa:855 [binder, in ITree.Eq.Eqit]
kxb:865 [binder, in ITree.Eq.Eqit]
kxb:876 [binder, in ITree.Eq.Eqit]
kxc:854 [binder, in ITree.Eq.Eqit]
k':12 [binder, in ITree.Events.MapDefaultFacts]
k':18 [binder, in ITree.Events.MapDefaultFacts]
k':199 [binder, in ITree.Extra.ITrace.ITraceBind]
k':210 [binder, in ITree.Extra.ITrace.ITraceBind]
k':248 [binder, in ITree.Extra.ITrace.ITraceBind]
k':267 [binder, in ITree.Extra.ITrace.ITraceBind]
k':295 [binder, in ITree.Extra.ITrace.ITraceBind]
k':299 [binder, in ITree.Extra.ITrace.ITraceBind]
k':306 [binder, in ITree.Eq.Eqit]
k':338 [binder, in ITree.Extra.ITrace.ITraceBind]
k':45 [binder, in ITree.Extra.ITrace.ITracePrefix]
k':46 [binder, in ITree.Extra.ITrace.ITracePrefix]
k':47 [binder, in ITree.Extra.ITrace.ITracePrefix]
k':49 [binder, in ITree.Events.State]
k0:10 [binder, in ITree.Extra.ITrace.ITraceBind]
k0:147 [binder, in ITree.Extra.ITrace.ITraceFacts]
k0:164 [binder, in ITree.Extra.ITrace.ITraceFacts]
k0:167 [binder, in ITree.Extra.ITrace.ITraceFacts]
k0:170 [binder, in ITree.Extra.ITrace.ITraceFacts]
k0:179 [binder, in ITree.Extra.ITrace.ITraceFacts]
k0:18 [binder, in ITree.Extra.Secure.SecureEqBind]
k0:183 [binder, in ITree.Extra.ITrace.ITraceBind]
k0:36 [binder, in ITree.Extra.ITrace.ITraceBind]
k0:38 [binder, in ITree.Extra.Secure.SecureEqBind]
k1:106 [binder, in ITree.Props.Leaf]
k1:107 [binder, in ITree.Extra.IForest]
k1:108 [binder, in ITree.Props.HasPost]
k1:114 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:115 [binder, in ITree.Extra.ITrace.ITracePrefix]
k1:117 [binder, in ITree.Eq.Eqit]
k1:12 [binder, in ITree.Extra.ITrace.ITraceBind]
k1:12 [binder, in ITree.Eq.SimUpToTaus]
k1:121 [binder, in ITree.Extra.ITrace.ITraceBind]
k1:13 [binder, in ITree.Simple]
k1:132 [binder, in ITree.Eq.Eqit]
k1:136 [binder, in ITree.Props.Leaf]
k1:138 [binder, in ITree.Extra.ITrace.ITracePrefix]
k1:14 [binder, in ITree.Extra.Secure.SecureEqBind]
k1:14 [binder, in ITree.Eq.Shallow]
k1:151 [binder, in ITree.Props.Leaf]
k1:157 [binder, in ITree.Simple]
k1:160 [binder, in ITree.Extra.ITrace.ITraceBind]
k1:163 [binder, in ITree.Props.Leaf]
k1:164 [binder, in ITree.Simple]
k1:169 [binder, in ITree.Extra.ITrace.ITraceBind]
k1:183 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k1:201 [binder, in ITree.Eq.UpToTaus]
k1:21 [binder, in ITree.Extra.Secure.SecureEqWcompat]
k1:21 [binder, in ITree.Eq.Eqit]
k1:212 [binder, in ITree.Eq.UpToTaus]
k1:22 [binder, in ITree.Simple]
k1:23 [binder, in ITree.Eq.Rutt]
k1:24 [binder, in ITree.Eq.Shallow]
k1:27 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k1:27 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:27 [binder, in ITree.Extra.Secure.SecureEqHalt]
k1:271 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k1:275 [binder, in ITree.Eq.UpToTaus]
k1:30 [binder, in ITree.Interp.HandlerFacts]
k1:33 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k1:33 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:33 [binder, in ITree.Extra.Secure.SecureEqHalt]
k1:331 [binder, in ITree.Eq.Eqit]
k1:34 [binder, in ITree.Extra.Secure.SecureEqBind]
k1:34 [binder, in ITree.Eq.Shallow]
k1:342 [binder, in ITree.Extra.IForest]
k1:342 [binder, in ITree.Eq.Eqit]
k1:35 [binder, in ITree.Interp.HandlerFacts]
k1:356 [binder, in ITree.Extra.IForest]
k1:38 [binder, in ITree.Extra.ITrace.ITraceBind]
k1:381 [binder, in ITree.Extra.IForest]
k1:393 [binder, in ITree.Extra.IForest]
k1:41 [binder, in ITree.Eq.SimUpToTaus]
k1:462 [binder, in ITree.Extra.IForest]
k1:47 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k1:49 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:49 [binder, in ITree.Extra.Secure.SecureEqHalt]
k1:50 [binder, in ITree.Eq.SimUpToTaus]
k1:52 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:55 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k1:551 [binder, in ITree.Extra.IForest]
k1:56 [binder, in ITree.Extra.Secure.SecureEqBind]
k1:59 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:59 [binder, in ITree.Extra.Secure.SecureEqHalt]
k1:649 [binder, in ITree.Eq.Eqit]
k1:655 [binder, in ITree.Eq.Eqit]
k1:672 [binder, in ITree.Eq.Eqit]
k1:68 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:689 [binder, in ITree.Eq.Eqit]
k1:69 [binder, in ITree.Eq.Eqit]
k1:714 [binder, in ITree.Eq.Eqit]
k1:727 [binder, in ITree.Eq.Eqit]
k1:74 [binder, in ITree.Extra.Secure.SecureEqBind]
k1:75 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:75 [binder, in ITree.Extra.Secure.SecureEqHalt]
k1:82 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:89 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:89 [binder, in ITree.Extra.Secure.SecureEqHalt]
k1:90 [binder, in ITree.Eq.Eqit]
k1:92 [binder, in ITree.Props.HasPost]
k1:96 [binder, in ITree.Extra.Secure.SecureEqBind]
k1:99 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:99 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:100 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:100 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:107 [binder, in ITree.Props.Leaf]
k2:109 [binder, in ITree.Props.HasPost]
k2:110 [binder, in ITree.Extra.IForest]
k2:115 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k2:116 [binder, in ITree.Extra.ITrace.ITracePrefix]
k2:118 [binder, in ITree.Eq.Eqit]
k2:119 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k2:122 [binder, in ITree.Extra.ITrace.ITraceBind]
k2:122 [binder, in ITree.Extra.Secure.SecureEqBind]
k2:13 [binder, in ITree.Eq.SimUpToTaus]
k2:134 [binder, in ITree.Eq.Eqit]
k2:137 [binder, in ITree.Props.Leaf]
k2:137 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k2:139 [binder, in ITree.Extra.ITrace.ITracePrefix]
k2:14 [binder, in ITree.Simple]
k2:15 [binder, in ITree.Extra.Secure.SecureEqBind]
k2:15 [binder, in ITree.Eq.Shallow]
k2:152 [binder, in ITree.Props.Leaf]
k2:154 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k2:158 [binder, in ITree.Simple]
k2:161 [binder, in ITree.Extra.ITrace.ITraceBind]
k2:164 [binder, in ITree.Props.Leaf]
k2:165 [binder, in ITree.Simple]
k2:168 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k2:170 [binder, in ITree.Extra.ITrace.ITraceBind]
k2:184 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k2:202 [binder, in ITree.Eq.UpToTaus]
k2:213 [binder, in ITree.Eq.UpToTaus]
k2:22 [binder, in ITree.Extra.Secure.SecureEqWcompat]
k2:22 [binder, in ITree.Eq.Eqit]
k2:23 [binder, in ITree.Simple]
k2:24 [binder, in ITree.Eq.Rutt]
k2:25 [binder, in ITree.Eq.Shallow]
k2:272 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k2:276 [binder, in ITree.Eq.UpToTaus]
k2:28 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k2:28 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:28 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:31 [binder, in ITree.Interp.HandlerFacts]
k2:332 [binder, in ITree.Eq.Eqit]
k2:343 [binder, in ITree.Extra.IForest]
k2:343 [binder, in ITree.Eq.Eqit]
k2:35 [binder, in ITree.Extra.Secure.SecureEqBind]
k2:35 [binder, in ITree.Eq.Shallow]
k2:357 [binder, in ITree.Extra.IForest]
k2:36 [binder, in ITree.Interp.HandlerFacts]
k2:382 [binder, in ITree.Extra.IForest]
k2:394 [binder, in ITree.Extra.IForest]
k2:40 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k2:41 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:41 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:42 [binder, in ITree.Eq.SimUpToTaus]
k2:463 [binder, in ITree.Extra.IForest]
k2:48 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k2:50 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:50 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:51 [binder, in ITree.Eq.SimUpToTaus]
k2:53 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k2:552 [binder, in ITree.Extra.IForest]
k2:57 [binder, in ITree.Extra.Secure.SecureEqBind]
k2:63 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k2:650 [binder, in ITree.Eq.Eqit]
k2:656 [binder, in ITree.Eq.Eqit]
k2:673 [binder, in ITree.Eq.Eqit]
k2:68 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:68 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:68 [binder, in ITree.Eq.Eqit]
k2:69 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k2:690 [binder, in ITree.Eq.Eqit]
k2:715 [binder, in ITree.Eq.Eqit]
k2:728 [binder, in ITree.Eq.Eqit]
k2:75 [binder, in ITree.Extra.Secure.SecureEqBind]
k2:82 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:82 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:90 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:90 [binder, in ITree.Extra.Secure.SecureEqHalt]
k2:93 [binder, in ITree.Eq.Eqit]
k2:94 [binder, in ITree.Props.HasPost]
k2:96 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
k3:162 [binder, in ITree.Extra.ITrace.ITraceBind]
k:10 [binder, in ITree.Core.ITreeDefinition]
k:101 [binder, in ITree.Interp.Traces]
k:104 [binder, in ITree.Events.FailFacts]
k:105 [binder, in ITree.Extra.Secure.SecureStateHandler]
k:105 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:106 [binder, in ITree.Extra.ITrace.ITraceFacts]
k:11 [binder, in ITree.Events.MapDefaultFacts]
k:113 [binder, in ITree.Events.FailFacts]
k:113 [binder, in ITree.Extra.Secure.SecureStateHandler]
k:115 [binder, in ITree.Extra.ITrace.ITracePreds]
k:12 [binder, in ITree.Props.Finite]
k:12 [binder, in ITree.Props.Leaf]
k:122 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:127 [binder, in ITree.Props.Finite]
k:13 [binder, in ITree.Events.Map]
k:13 [binder, in ITree.Interp.TranslateFacts]
k:13 [binder, in ITree.Extra.ITrace.ITracePreds]
k:130 [binder, in ITree.Extra.ITrace.ITraceBind]
k:133 [binder, in ITree.Props.Finite]
k:139 [binder, in ITree.Props.Finite]
k:14 [binder, in ITree.Events.FailFacts]
k:140 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:143 [binder, in ITree.Props.Finite]
k:146 [binder, in ITree.Extra.ITrace.ITraceFacts]
k:147 [binder, in ITree.Props.Finite]
k:15 [binder, in ITree.Events.ExceptionFacts]
k:15 [binder, in ITree.Events.MapDefaultFacts]
k:150 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
k:153 [binder, in ITree.Props.Finite]
k:158 [binder, in ITree.Props.Finite]
k:161 [binder, in ITree.Extra.ITrace.ITraceFacts]
k:164 [binder, in ITree.Props.Finite]
K:17 [binder, in ITree.Events.MapDefault]
k:17 [binder, in ITree.Events.MapDefaultFacts]
k:171 [binder, in ITree.Simple]
k:176 [binder, in ITree.Extra.ITrace.ITraceBind]
k:176 [binder, in ITree.Props.Finite]
k:176 [binder, in ITree.Extra.ITrace.ITraceFacts]
k:176 [binder, in ITree.Simple]
k:18 [binder, in ITree.Interp.RecursionFacts]
k:182 [binder, in ITree.Props.Finite]
k:183 [binder, in ITree.Simple]
k:188 [binder, in ITree.Extra.ITrace.ITraceBind]
k:19 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:19 [binder, in ITree.Core.ITreeDefinition]
k:194 [binder, in ITree.Simple]
k:198 [binder, in ITree.Extra.ITrace.ITraceBind]
k:209 [binder, in ITree.Extra.ITrace.ITraceBind]
k:209 [binder, in ITree.Extra.IForest]
k:21 [binder, in ITree.Events.MapDefault]
k:21 [binder, in ITree.Interp.TranslateFacts]
k:215 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:22 [binder, in ITree.Events.ExceptionFacts]
k:220 [binder, in ITree.Simple]
k:233 [binder, in ITree.Simple]
k:235 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:247 [binder, in ITree.Extra.ITrace.ITraceBind]
k:25 [binder, in ITree.Props.Finite]
k:25 [binder, in ITree.Props.Leaf]
k:250 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:263 [binder, in ITree.Extra.ITrace.ITraceBind]
k:268 [binder, in ITree.Extra.IForest]
k:27 [binder, in ITree.Core.ITreeDefinition]
k:275 [binder, in ITree.Extra.ITrace.ITraceBind]
k:280 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:281 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
k:285 [binder, in ITree.Extra.ITrace.ITraceBind]
k:29 [binder, in ITree.Interp.Traces]
k:29 [binder, in ITree.Extra.ITrace.ITraceFacts]
k:294 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
k:30 [binder, in ITree.Simple]
k:305 [binder, in ITree.Eq.Eqit]
k:31 [binder, in ITree.Extra.IForest]
k:32 [binder, in ITree.Core.ITreeDefinition]
k:33 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
k:33 [binder, in ITree.Interp.Traces]
k:335 [binder, in ITree.Extra.ITrace.ITraceBind]
k:34 [binder, in ITree.Events.MapDefault]
k:34 [binder, in ITree.Events.State]
k:35 [binder, in ITree.Events.MapDefaultFacts]
k:36 [binder, in ITree.Events.StateFacts]
k:37 [binder, in ITree.Extra.IForest]
k:37 [binder, in ITree.Props.Finite]
k:38 [binder, in ITree.Props.Infinite]
k:38 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:38 [binder, in ITree.Simple]
k:39 [binder, in ITree.Interp.InterpFacts]
K:4 [binder, in ITree.Basics.MonadProp]
k:40 [binder, in ITree.Props.Leaf]
k:40 [binder, in ITree.Events.MapDefaultFacts]
k:401 [binder, in ITree.Extra.IForest]
k:41 [binder, in ITree.Basics.CategoryKleisliFacts]
k:41 [binder, in ITree.Basics.Basics]
k:417 [binder, in ITree.Extra.IForest]
k:425 [binder, in ITree.Extra.IForest]
k:43 [binder, in ITree.Extra.ITrace.ITracePrefix]
k:432 [binder, in ITree.Extra.IForest]
K:44 [binder, in ITree.Extra.IForest]
k:440 [binder, in ITree.Extra.IForest]
k:447 [binder, in ITree.Extra.IForest]
k:45 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
k:453 [binder, in ITree.Extra.IForest]
k:46 [binder, in ITree.Events.ExceptionFacts]
k:46 [binder, in ITree.Extra.Secure.SecureStateHandler]
k:469 [binder, in ITree.Extra.IForest]
k:47 [binder, in ITree.Extra.IForest]
k:477 [binder, in ITree.Extra.IForest]
k:48 [binder, in ITree.Basics.CategoryKleisliFacts]
k:48 [binder, in ITree.Events.State]
k:49 [binder, in ITree.Props.HasPost]
k:49 [binder, in ITree.Props.Finite]
k:490 [binder, in ITree.Extra.IForest]
k:495 [binder, in ITree.Extra.IForest]
k:51 [binder, in ITree.Simple]
k:52 [binder, in ITree.Events.ExceptionFacts]
K:524 [binder, in ITree.Extra.IForest]
k:53 [binder, in ITree.Extra.ITrace.ITracePreds]
K:535 [binder, in ITree.Extra.IForest]
k:538 [binder, in ITree.Extra.IForest]
K:543 [binder, in ITree.Extra.IForest]
k:544 [binder, in ITree.Extra.IForest]
K:55 [binder, in ITree.Extra.IForest]
k:55 [binder, in ITree.Extra.ITrace.ITracePreds]
k:56 [binder, in ITree.Props.HasPost]
k:560 [binder, in ITree.Extra.IForest]
k:58 [binder, in ITree.Extra.IForest]
k:58 [binder, in ITree.Props.Finite]
k:58 [binder, in ITree.Extra.Secure.SecureStateHandler]
k:591 [binder, in ITree.Eq.Eqit]
k:60 [binder, in ITree.Extra.ITrace.ITraceBind]
k:602 [binder, in ITree.Eq.Eqit]
k:607 [binder, in ITree.Eq.Eqit]
k:614 [binder, in ITree.Eq.Eqit]
k:62 [binder, in ITree.Extra.ITrace.ITracePrefix]
k:62 [binder, in ITree.Eq.Shallow]
k:620 [binder, in ITree.Eq.Eqit]
k:65 [binder, in ITree.Props.Infinite]
K:66 [binder, in ITree.Extra.IForest]
k:69 [binder, in ITree.Extra.IForest]
k:69 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
k:70 [binder, in ITree.Events.StateFacts]
k:71 [binder, in ITree.Extra.IForest]
k:71 [binder, in ITree.Eq.Shallow]
k:71 [binder, in ITree.Interp.InterpFacts]
k:73 [binder, in ITree.Props.Finite]
k:76 [binder, in ITree.Eq.Shallow]
K:77 [binder, in ITree.Extra.IForest]
k:77 [binder, in ITree.Props.Leaf]
k:778 [binder, in ITree.Eq.Eqit]
k:794 [binder, in ITree.Eq.Eqit]
k:8 [binder, in ITree.Props.Infinite]
k:8 [binder, in ITree.Events.MapDefaultFacts]
k:80 [binder, in ITree.Events.FailFacts]
k:80 [binder, in ITree.Simple]
k:802 [binder, in ITree.Eq.Eqit]
k:81 [binder, in ITree.Extra.ITrace.ITracePreds]
k:83 [binder, in ITree.Eq.Shallow]
k:84 [binder, in ITree.Props.Leaf]
k:86 [binder, in ITree.Events.ExceptionFacts]
k:90 [binder, in ITree.Extra.ITrace.ITracePrefix]
k:90 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
k:91 [binder, in ITree.Extra.Secure.SecureStateHandler]
k:924 [binder, in ITree.Eq.Eqit]
k:931 [binder, in ITree.Eq.Eqit]
k:95 [binder, in ITree.Simple]
k:97 [binder, in ITree.Extra.ITrace.ITraceBind]
k:97 [binder, in ITree.Extra.Secure.SecureStateHandler]
k:99 [binder, in ITree.Extra.ITrace.ITraceFacts]

L

L [projection, in ITree.Extra.Secure.Labels]
Labels [library]
Label:10 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:101 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:107 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Label:107 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:109 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:112 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:112 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:126 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:127 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:136 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:137 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:139 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:139 [binder, in ITree.Extra.Secure.SecureEqHalt]
Label:14 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:145 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:145 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:157 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:159 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:16 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Label:16 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:161 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:171 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:171 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:174 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:18 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
Label:183 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:183 [binder, in ITree.Extra.Secure.SecureEqHalt]
Label:184 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:189 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:197 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:197 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:197 [binder, in ITree.Extra.Secure.SecureEqHalt]
Label:201 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:204 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:220 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:222 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:231 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:238 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:240 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:249 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:25 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:260 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:260 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:266 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:282 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:286 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:30 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:304 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:31 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:310 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:321 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:330 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:340 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:348 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:35 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
Label:4 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
Label:4 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:4 [binder, in ITree.Extra.Secure.SecureEqHalt]
Label:4 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
Label:4 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:42 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:45 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Label:45 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:49 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Label:50 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:52 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:59 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:67 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:68 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Label:69 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:7 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Label:7 [binder, in ITree.Extra.Secure.SecureStateHandler]
Label:7 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
Label:76 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:79 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Label:87 [binder, in ITree.Extra.Secure.SecureEqBind]
Label:87 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Label:89 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:94 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
Laws [section, in ITree.Basics.Monad]
Leaf [inductive, in ITree.Props.Leaf]
Leaf [library]
LeafBind [section, in ITree.Props.Leaf]
LeafNotations [module, in ITree.Props.Leaf]
_ ∈ _ [notation, in ITree.Props.Leaf]
LeafRet [constructor, in ITree.Props.Leaf]
LeafTau [constructor, in ITree.Props.Leaf]
LeafVis [constructor, in ITree.Props.Leaf]
Leaf_non_interactive_singleton [lemma, in ITree.Props.Finite]
Leaf_finite [lemma, in ITree.Props.Finite]
Leaf_bind_inv [lemma, in ITree.Props.Leaf]
Leaf_bind [lemma, in ITree.Props.Leaf]
Leaf_eutt [instance, in ITree.Props.Leaf]
Leaf_eutt_r [lemma, in ITree.Props.Leaf]
Leaf_eutt_l [lemma, in ITree.Props.Leaf]
Leaf_Vis_inv [lemma, in ITree.Props.Leaf]
Leaf_Tau_inv [lemma, in ITree.Props.Leaf]
Leaf_Ret_inv [lemma, in ITree.Props.Leaf]
Leaf_Vis [lemma, in ITree.Props.Leaf]
Leaf_Tau [lemma, in ITree.Props.Leaf]
Leaf_Ret [lemma, in ITree.Props.Leaf]
LEb1:187 [binder, in ITree.Eq.Eqit]
LEb2:188 [binder, in ITree.Eq.Eqit]
LEc:123 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
LEc:123 [binder, in ITree.Extra.Secure.SecureEqHalt]
LEc:49 [binder, in ITree.Eq.Eqit]
LEc:85 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
left_vis_bp [constructor, in ITree.Extra.ITrace.ITracePrefix]
left_ret_bp [constructor, in ITree.Extra.ITrace.ITracePrefix]
left_vis_comb [constructor, in ITree.Extra.ITrace.ITracePrefix]
left_ret_comb [constructor, in ITree.Extra.ITrace.ITracePrefix]
lem [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
lem [constructor, in ITree.Extra.Dijkstra.DijkstraMonad]
leq [projection, in ITree.Extra.Secure.Labels]
LERR1:139 [binder, in ITree.Eq.Rutt]
LERR1:162 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
LERR1:162 [binder, in ITree.Extra.Secure.SecureEqHalt]
LERR1:162 [binder, in ITree.Eq.Rutt]
LERR1:213 [binder, in ITree.Eq.Eqit]
LERR1:480 [binder, in ITree.Eq.Eqit]
LERR1:504 [binder, in ITree.Eq.Eqit]
LERR1:526 [binder, in ITree.Eq.Eqit]
LERR1:548 [binder, in ITree.Eq.Eqit]
LERR1:99 [binder, in ITree.Eq.Rutt]
LERR2:103 [binder, in ITree.Eq.Rutt]
LERR2:143 [binder, in ITree.Eq.Rutt]
LERR2:166 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
LERR2:166 [binder, in ITree.Extra.Secure.SecureEqHalt]
LERR2:166 [binder, in ITree.Eq.Rutt]
LERR2:217 [binder, in ITree.Eq.Eqit]
LERR2:484 [binder, in ITree.Eq.Eqit]
LERR2:508 [binder, in ITree.Eq.Eqit]
LERR2:530 [binder, in ITree.Eq.Eqit]
LERR2:552 [binder, in ITree.Eq.Eqit]
LERR:189 [binder, in ITree.Eq.Eqit]
LERR:85 [binder, in ITree.Eq.UpToTaus]
LE:109 [binder, in ITree.Eq.Rutt]
LE:124 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
LE:124 [binder, in ITree.Extra.Secure.SecureEqHalt]
LE:125 [binder, in ITree.Extra.IForest]
LE:14 [binder, in ITree.Extra.Dijkstra.IterRel]
LE:160 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
LE:176 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
LE:176 [binder, in ITree.Extra.Secure.SecureEqHalt]
LE:21 [binder, in ITree.Eq.UpToTaus]
LE:21 [binder, in ITree.Props.Infinite]
LE:227 [binder, in ITree.Eq.Eqit]
LE:27 [binder, in ITree.Eq.UpToTaus]
LE:50 [binder, in ITree.Eq.Eqit]
LE:51 [binder, in ITree.Props.Infinite]
LE:86 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
lift_ktree_ [abbreviation, in ITree.Core.KTree]
lift_ktree [abbreviation, in ITree.Core.KTree]
local_rewrite2 [lemma, in ITree.Basics.CategoryFacts]
local_rewrite1 [lemma, in ITree.Basics.CategoryFacts]
log':233 [binder, in ITree.Extra.ITrace.ITraceFacts]
log':32 [binder, in ITree.Extra.Dijkstra.TracesIT]
log':41 [binder, in ITree.Extra.Dijkstra.TracesIT]
log':55 [binder, in ITree.Extra.ITrace.ITraceFacts]
log1:64 [binder, in ITree.Extra.ITrace.ITraceFacts]
log2:65 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:13 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:13 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
log:18 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:22 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:230 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:236 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:28 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:36 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:37 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:42 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:42 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
log:44 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:47 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:54 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:58 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:59 [binder, in ITree.Extra.ITrace.ITraceFacts]
log:63 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:72 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:78 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:84 [binder, in ITree.Extra.Dijkstra.TracesIT]
log:90 [binder, in ITree.Extra.Dijkstra.TracesIT]
lookup [definition, in ITree.Events.Map]
Lookup [constructor, in ITree.Events.Map]
LookupDef [constructor, in ITree.Events.MapDefault]
lookup_def [definition, in ITree.Events.Map]
lookup_default [definition, in ITree.Events.MapDefault]
lookup_def [definition, in ITree.Events.MapDefault]
lookup_neq [lemma, in ITree.Extra.Dijkstra.StateIOTrace]
lookup_nin [lemma, in ITree.Extra.Dijkstra.StateIOTrace]
lookup_eq [lemma, in ITree.Extra.Dijkstra.StateIOTrace]
lookup_remove_neq [lemma, in ITree.Events.MapDefaultFacts]
lookup_remove_eq [lemma, in ITree.Events.MapDefaultFacts]
lookup_add_neq [lemma, in ITree.Events.MapDefaultFacts]
lookup_add_eq [lemma, in ITree.Events.MapDefaultFacts]
loop [definition, in ITree.Basics.CategoryOps]
LoopInvarSpecific [section, in ITree.Extra.Dijkstra.StateSpecT]
loop_invar_state [lemma, in ITree.Extra.Dijkstra.StateSpecT]
loop_superposing_2 [lemma, in ITree.Basics.CategoryFacts]
loop_dinatural' [lemma, in ITree.Basics.CategoryFacts]
loop_yanking [lemma, in ITree.Basics.CategoryFacts]
loop_superposing [lemma, in ITree.Basics.CategoryFacts]
loop_vanishing_2 [lemma, in ITree.Basics.CategoryFacts]
loop_vanishing_1 [lemma, in ITree.Basics.CategoryFacts]
loop_dinatural [lemma, in ITree.Basics.CategoryFacts]
loop_natural_right [lemma, in ITree.Basics.CategoryFacts]
loop_natural_left [lemma, in ITree.Basics.CategoryFacts]
loop_invar [lemma, in ITree.Extra.Dijkstra.DelaySpecMonad]
loop_invar_imp [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
lr:101 [binder, in ITree.Extra.Secure.SecureEqBind]
lr:124 [binder, in ITree.Extra.Secure.SecureEqBind]
lr:126 [binder, in ITree.Extra.Secure.SecureEqBind]
lr:148 [binder, in ITree.Extra.Secure.SecureEqBind]
lr:150 [binder, in ITree.Extra.Secure.SecureEqBind]
lr:297 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
lr:299 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
lr:325 [binder, in ITree.Extra.IForest]
lr:41 [binder, in ITree.Core.ITreeDefinition]
lr:627 [binder, in ITree.Eq.Eqit]
lr:90 [binder, in ITree.Eq.Shallow]
lr:98 [binder, in ITree.Extra.Secure.SecureEqBind]
l:10 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:10 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:10 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:103 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:107 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:107 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:109 [binder, in ITree.Extra.Secure.SecureEqWcompat]
l:11 [binder, in ITree.Basics.CategoryRelations]
l:110 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:112 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:114 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:114 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:114 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:115 [binder, in ITree.Extra.Secure.SecureEqBind]
l:12 [binder, in ITree.Extra.Secure.SecureStateHandler]
l:12 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
l:127 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:127 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:128 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:13 [binder, in ITree.Extra.Secure.SecureEqBind]
l:130 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:132 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:132 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:138 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:140 [binder, in ITree.Extra.Secure.SecureEqBind]
l:142 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:142 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:147 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:148 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:16 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:160 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:162 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:163 [binder, in ITree.Extra.Secure.SecureEqBind]
l:173 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:173 [binder, in ITree.Extra.Secure.SecureEqBind]
l:177 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:18 [binder, in ITree.Extra.ITrace.ITraceDefinition]
l:18 [binder, in ITree.Extra.Secure.SecureEqWcompat]
l:18 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:185 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:185 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:186 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:192 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:199 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:199 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:199 [binder, in ITree.Extra.Secure.SecureEqHalt]
l:203 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:207 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:21 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
l:22 [binder, in ITree.Extra.ITrace.ITraceFacts]
l:222 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:224 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:233 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:240 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:242 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:25 [binder, in ITree.Extra.ITrace.ITraceFacts]
l:251 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:262 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:262 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:268 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:28 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:284 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:289 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:291 [binder, in ITree.Eq.Eqit]
l:306 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:31 [binder, in ITree.Basics.Function]
l:31 [binder, in ITree.Basics.CategoryKleisli]
l:312 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:323 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:326 [binder, in ITree.Extra.IForest]
l:327 [binder, in ITree.Extra.IForest]
l:33 [binder, in ITree.Extra.Secure.SecureEqBind]
l:33 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:332 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:342 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:350 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:37 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
l:4 [binder, in ITree.Basics.CategoryRelations]
l:42 [binder, in ITree.Core.ITreeDefinition]
l:43 [binder, in ITree.Core.ITreeDefinition]
l:45 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:47 [binder, in ITree.Extra.Secure.SecureEqWcompat]
l:47 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:51 [binder, in ITree.Extra.Secure.SecureEqWcompat]
l:52 [binder, in ITree.Extra.Secure.SecureEqBind]
l:54 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:6 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:61 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:628 [binder, in ITree.Eq.Eqit]
l:629 [binder, in ITree.Eq.Eqit]
l:69 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:7 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
l:70 [binder, in ITree.Extra.Secure.SecureEqWcompat]
l:70 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:71 [binder, in ITree.Extra.Secure.SecureEqBind]
l:76 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:78 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:82 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
l:89 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:89 [binder, in ITree.Extra.Secure.SecureEqWcompat]
l:9 [binder, in ITree.Extra.Secure.SecureEqWcompat]
l:90 [binder, in ITree.Extra.Secure.SecureEqBind]
l:91 [binder, in ITree.Eq.Shallow]
l:91 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:92 [binder, in ITree.Eq.Shallow]
l:94 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
l:97 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]

M

Map [section, in ITree.Events.Map]
map [definition, in ITree.Basics.CategoryKleisli]
Map [section, in ITree.Events.MapDefault]
Map [library]
MapDefault [library]
MapDefaultFacts [library]
mapE [inductive, in ITree.Events.Map]
mapE [inductive, in ITree.Events.MapDefault]
MapFacts [section, in ITree.Events.MapDefaultFacts]
MapFacts.K [variable, in ITree.Events.MapDefaultFacts]
MapFacts.Relations [section, in ITree.Events.MapDefaultFacts]
MapFacts.Relations.RR [variable, in ITree.Events.MapDefaultFacts]
MapFacts.V [variable, in ITree.Events.MapDefaultFacts]
map_inr_case_kleisli [lemma, in ITree.Basics.CategoryKleisliFacts]
map_inl_case_kleisli [lemma, in ITree.Basics.CategoryKleisliFacts]
map_default_eq [definition, in ITree.Events.MapDefaultFacts]
map_tau [lemma, in ITree.Eq.Eqit]
map_ret [lemma, in ITree.Eq.Eqit]
map_bind [lemma, in ITree.Eq.Eqit]
map_map [lemma, in ITree.Eq.Eqit]
Map.K [variable, in ITree.Events.Map]
Map.K [variable, in ITree.Events.MapDefault]
Map.V [variable, in ITree.Events.Map]
Map.V [variable, in ITree.Events.MapDefault]
map:15 [binder, in ITree.Events.MapDefault]
map:17 [binder, in ITree.Events.Map]
map:3 [binder, in ITree.Events.MapDefaultFacts]
may_converge_Ret_inv [lemma, in ITree.Props.Infinite]
may_converge [inductive, in ITree.Props.Infinite]
may_converge_two_list [lemma, in ITree.Extra.ITrace.ITraceFacts]
may_converge_append [lemma, in ITree.Extra.ITrace.ITraceFacts]
may_converge_trace [lemma, in ITree.Extra.ITrace.ITraceFacts]
ma':47 [binder, in ITree.Basics.CategoryRelations]
ma':51 [binder, in ITree.Basics.CategoryRelations]
ma':890 [binder, in ITree.Eq.Eqit]
ma':898 [binder, in ITree.Eq.Eqit]
ma':906 [binder, in ITree.Eq.Eqit]
ma:38 [binder, in ITree.Basics.CategoryRelations]
ma:416 [binder, in ITree.Extra.IForest]
ma:42 [binder, in ITree.Basics.CategoryRelations]
ma:550 [binder, in ITree.Extra.IForest]
ma:822 [binder, in ITree.Eq.Eqit]
ma:829 [binder, in ITree.Eq.Eqit]
ma:836 [binder, in ITree.Eq.Eqit]
ma:851 [binder, in ITree.Eq.Eqit]
ma:862 [binder, in ITree.Eq.Eqit]
ma:873 [binder, in ITree.Eq.Eqit]
ma:887 [binder, in ITree.Eq.Eqit]
ma:895 [binder, in ITree.Eq.Eqit]
ma:903 [binder, in ITree.Eq.Eqit]
MDivTau [constructor, in ITree.Props.Infinite]
MDivVis [constructor, in ITree.Props.Infinite]
merge [definition, in ITree.Basics.CategoryOps]
MIm:4 [binder, in ITree.Events.FailFacts]
ML:5 [binder, in ITree.Basics.CategoryKleisliFacts]
ML:6 [binder, in ITree.Basics.MonadState]
MMonad:41 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
MMonad:60 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
MM:18 [binder, in ITree.Interp.Interp]
Mm:3 [binder, in ITree.Events.FailFacts]
Mm:3 [binder, in ITree.Basics.CategoryKleisliFacts]
MM:37 [binder, in ITree.Events.FailFacts]
MM:5 [binder, in ITree.Events.State]
MM:51 [binder, in ITree.Basics.Basics]
MM:62 [binder, in ITree.Basics.Basics]
MM:79 [binder, in ITree.Basics.Basics]
MM:88 [binder, in ITree.Basics.Basics]
MOk:5 [binder, in ITree.Events.MapDefaultFacts]
Monad [library]
MonadDelay [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
MonadIter [record, in ITree.Basics.Basics]
MonadIter [inductive, in ITree.Basics.Basics]
MonadIterDelay [instance, in ITree.Extra.Dijkstra.DelaySpecMonad]
MonadIter_iforest [instance, in ITree.Extra.IForest]
MonadIter_Prop [instance, in ITree.Basics.Basics]
MonadIter_eitherT [instance, in ITree.Basics.Basics]
MonadIter_optionT [instance, in ITree.Basics.Basics]
MonadIter_readerT [instance, in ITree.Basics.Basics]
MonadIter_stateT0 [instance, in ITree.Basics.Basics]
MonadIter_stateT [instance, in ITree.Basics.Basics]
MonadIter_itree [instance, in ITree.Core.ITreeDefinition]
MonadLawsE [record, in ITree.Basics.Monad]
MonadLawsE_stateTM [instance, in ITree.Basics.MonadState]
MonadLawsE_ITree [instance, in ITree.Core.ITreeMonad]
MonadLawsE_Prop [instance, in ITree.Basics.MonadProp]
MonadLawsW:44 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
MonadLawsW:63 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
MonadLawsW:8 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
MonadLawsW:9 [binder, in ITree.Extra.Dijkstra.StateSpecT]
MonadLaws_failE [instance, in ITree.Events.FailFacts]
MonadMorphimStateT [instance, in ITree.Extra.Dijkstra.StateSpecT]
MonadMorphism [record, in ITree.Extra.Dijkstra.DijkstraMonad]
MonadMorphismMW:21 [binder, in ITree.Extra.Dijkstra.StateSpecT]
MonadM:19 [binder, in ITree.Extra.Dijkstra.StateSpecT]
MonadProp [library]
Monads [module, in ITree.Basics.Basics]
MonadState [library]
Monads.Functor_stateT [instance, in ITree.Basics.Basics]
Monads.identity [definition, in ITree.Basics.Basics]
Monads.liftState [definition, in ITree.Basics.Basics]
Monads.Monad_stateT [instance, in ITree.Basics.Basics]
Monads.reader [definition, in ITree.Basics.Basics]
Monads.readerT [definition, in ITree.Basics.Basics]
Monads.run_stateT [definition, in ITree.Basics.Basics]
Monads.state [definition, in ITree.Basics.Basics]
Monads.stateT [definition, in ITree.Basics.Basics]
Monads.writer [definition, in ITree.Basics.Basics]
Monads.writerT [definition, in ITree.Basics.Basics]
MonadW:28 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
MonadW:3 [binder, in ITree.Extra.Dijkstra.StateSpecT]
MonadW:7 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
Monad_iforest [instance, in ITree.Extra.IForest]
Monad_Prop [instance, in ITree.Basics.MonadProp]
Monad_itree [instance, in ITree.Core.ITreeDefinition]
Monad:13 [binder, in ITree.Basics.Monad]
Monoidal [record, in ITree.Basics.CategoryTheory]
MonoidalLaws [section, in ITree.Basics.CategoryTheory]
Monoidal_Product [instance, in ITree.Basics.CategoryFacts]
Monoidal_Coproduct [instance, in ITree.Basics.CategoryFacts]
Monoidal_sum_rel [instance, in ITree.Basics.CategoryRelations]
Monoidal_prod_rel [instance, in ITree.Basics.CategoryRelations]
monoidal_assoc_r_assoc_r [projection, in ITree.Basics.CategoryTheory]
monoidal_assoc_r_unit [projection, in ITree.Basics.CategoryTheory]
monoidal_unit_l'_natural [projection, in ITree.Basics.CategoryTheory]
monoidal_unit_l_natural [projection, in ITree.Basics.CategoryTheory]
monoidal_unit_r_iso [projection, in ITree.Basics.CategoryTheory]
monoidal_unit_l_iso [projection, in ITree.Basics.CategoryTheory]
monoidal_assoc_iso [projection, in ITree.Basics.CategoryTheory]
monoidal_bifunctor [projection, in ITree.Basics.CategoryTheory]
Monoid_W:27 [binder, in ITree.Events.Writer]
Monoid_W:21 [binder, in ITree.Events.Writer]
monot [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
monotone_suttF [lemma, in ITree.Eq.SimUpToTaus]
monotone_state_machine [lemma, in ITree.Extra.ITrace.ITracePreds]
monotonici [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
monotonic_going [instance, in ITree.Eq.Shallow]
monotonic_observing [instance, in ITree.Eq.Shallow]
monot_imp_dmonot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
mono_diverges_with [lemma, in ITree.Extra.Secure.SecureStateHandler]
MON:116 [binder, in ITree.Props.Leaf]
MON:122 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
MON:122 [binder, in ITree.Extra.Secure.SecureEqHalt]
MON:129 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
MON:129 [binder, in ITree.Extra.Secure.SecureEqHalt]
MON:231 [binder, in ITree.Eq.Eqit]
MON:242 [binder, in ITree.Eq.Eqit]
MON:365 [binder, in ITree.Extra.IForest]
MON:48 [binder, in ITree.Eq.Eqit]
MON:54 [binder, in ITree.Eq.Eqit]
MON:59 [binder, in ITree.Eq.UpToTaus]
MON:681 [binder, in ITree.Eq.Eqit]
MON:84 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
MON:89 [binder, in ITree.Eq.UpToTaus]
MON:91 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
mrec [definition, in ITree.Interp.Recursion]
mrecursive [definition, in ITree.Interp.RecursionFacts]
mrec_fix [definition, in ITree.Interp.Recursion]
mrec_as_interp [lemma, in ITree.Interp.RecursionFacts]
ms:271 [binder, in ITree.Extra.IForest]
mults_of_n [definition, in ITree.Extra.Dijkstra.StateIOTrace]
mults_of_n_from_m [definition, in ITree.Extra.Dijkstra.StateIOTrace]
mults_n [definition, in ITree.Extra.Dijkstra.StateIOTrace]
mwitness [inductive, in ITree.Axioms]
mx:106 [binder, in ITree.Events.FailFacts]
mx:322 [binder, in ITree.Basics.HeterogeneousRelations]
mx:82 [binder, in ITree.Events.FailFacts]
my:323 [binder, in ITree.Basics.HeterogeneousRelations]
m1:12 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m1:16 [binder, in ITree.Eq.Eqit]
m1:17 [binder, in ITree.Eq.Rutt]
m1:18 [binder, in ITree.Extra.Secure.SecureStateHandler]
m1:18 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
m1:26 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m1:31 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m1:32 [binder, in ITree.Events.MapDefault]
m1:48 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m1:69 [binder, in ITree.Extra.ITrace.ITracePrefix]
m1:85 [binder, in ITree.Extra.ITrace.ITracePrefix]
m2:13 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m2:17 [binder, in ITree.Eq.Eqit]
m2:18 [binder, in ITree.Eq.Rutt]
m2:19 [binder, in ITree.Extra.Secure.SecureStateHandler]
m2:19 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
m2:27 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m2:32 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m2:33 [binder, in ITree.Events.MapDefault]
m2:49 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m2:86 [binder, in ITree.Extra.ITrace.ITracePrefix]
m3:441 [binder, in ITree.Eq.Eqit]
m3:442 [binder, in ITree.Eq.Eqit]
m3:443 [binder, in ITree.Eq.Eqit]
m3:444 [binder, in ITree.Eq.Eqit]
m3:46 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m3:47 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m3:48 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m3:49 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
m3:61 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m3:62 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m3:63 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m3:64 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
m3:71 [binder, in ITree.Extra.ITrace.ITraceFacts]
m3:72 [binder, in ITree.Extra.ITrace.ITraceFacts]
m3:73 [binder, in ITree.Extra.ITrace.ITraceFacts]
m3:74 [binder, in ITree.Extra.ITrace.ITraceFacts]
m:1 [binder, in ITree.Events.FailFacts]
M:1 [binder, in ITree.Basics.Monad]
m:1 [binder, in ITree.Basics.CategoryKleisliFacts]
m:1 [binder, in ITree.Basics.CategoryKleisli]
M:1 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
m:103 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
M:11 [binder, in ITree.Basics.Monad]
m:11 [binder, in ITree.Basics.Basics]
m:113 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
m:12 [binder, in ITree.Basics.CategoryKleisli]
m:12 [binder, in ITree.Interp.RecursionFacts]
m:134 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
m:134 [binder, in ITree.Extra.Secure.SecureEqHalt]
m:136 [binder, in ITree.Extra.Secure.SecureStateHandler]
M:16 [binder, in ITree.Events.MapDefault]
M:16 [binder, in ITree.Interp.Interp]
M:18 [binder, in ITree.Events.Map]
m:18 [binder, in ITree.Basics.CategoryKleisli]
m:18 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
M:18 [binder, in ITree.Extra.Dijkstra.StateSpecT]
M:2 [binder, in ITree.Events.State]
m:21 [binder, in ITree.Basics.Basics]
m:22 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
m:22 [binder, in ITree.Extra.Dijkstra.StateSpecT]
m:223 [binder, in ITree.Extra.ITrace.ITraceFacts]
m:23 [binder, in ITree.Events.MapDefault]
m:26 [binder, in ITree.Basics.Basics]
m:27 [binder, in ITree.Extra.Secure.SecureStateHandler]
m:27 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
m:28 [binder, in ITree.Basics.Basics]
m:3 [binder, in ITree.Interp.Handler]
m:30 [binder, in ITree.Extra.Secure.SecureStateHandler]
m:30 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
M:35 [binder, in ITree.Events.FailFacts]
m:35 [binder, in ITree.Basics.Basics]
m:35 [binder, in ITree.Extra.Dijkstra.IterRel]
M:35 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
m:37 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
m:37 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
M:39 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
m:4 [binder, in ITree.Basics.CategoryKleisli]
m:4 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
M:4 [binder, in ITree.Events.MapDefaultFacts]
m:42 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
M:44 [binder, in ITree.Basics.Basics]
m:46 [binder, in ITree.Events.MapDefaultFacts]
m:48 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
M:49 [binder, in ITree.Basics.Basics]
m:5 [binder, in ITree.Events.FailFacts]
M:5 [binder, in ITree.Basics.Monad]
m:54 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
m:57 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
M:58 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
m:6 [binder, in ITree.Basics.Basics]
M:60 [binder, in ITree.Basics.Basics]
m:62 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
m:69 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
M:71 [binder, in ITree.Basics.Basics]
m:72 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
m:76 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
M:78 [binder, in ITree.Basics.Basics]
m:8 [binder, in ITree.Basics.CategoryKleisli]
m:80 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
M:86 [binder, in ITree.Basics.Basics]
m:92 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]

N

NatPreorder [definition, in ITree.Extra.Secure.SecureEqHaltProgInsens]
NatPreorder [definition, in ITree.Extra.Secure.SecureEqHalt]
natural_unit_l' [projection, in ITree.Basics.CategoryTheory]
natural_unit_l' [constructor, in ITree.Basics.CategoryTheory]
natural_unit_l [projection, in ITree.Basics.CategoryTheory]
natural_unit_l [constructor, in ITree.Basics.CategoryTheory]
ne [constructor, in ITree.Extra.Secure.Labels]
neg_wf_from_not_wf_from [lemma, in ITree.Extra.Dijkstra.IterRel]
neg_wf_from_not_wf_from_r [lemma, in ITree.Extra.Dijkstra.IterRel]
neg_wf_from_not_wf_from_l [lemma, in ITree.Extra.Dijkstra.IterRel]
NEQ:554 [binder, in ITree.Extra.IForest]
next:23 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
Nil [definition, in ITree.Extra.ITrace.ITraceDefinition]
Nil [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
NilF [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
NoChoice [constructor, in ITree.Events.Nondeterminism]
NonDet [inductive, in ITree.Extra.Dijkstra.TracesIT]
nondetE [inductive, in ITree.Events.Nondeterminism]
Nondeterminism [library]
NonDetExample [section, in ITree.Extra.Dijkstra.TracesIT]
nonempty [inductive, in ITree.Extra.Secure.Labels]
noret_cast_cast [lemma, in ITree.Props.EuttNoRet]
noret_cast_nop [lemma, in ITree.Props.EuttNoRet]
noret_cast [definition, in ITree.Props.EuttNoRet]
noret_bind_nop [lemma, in ITree.Props.EuttNoRet]
not_peel_vis_ret [lemma, in ITree.Extra.ITrace.ITraceBind]
not_spin_eutt_ret [lemma, in ITree.Extra.ITrace.ITraceBind]
not_Returns [lemma, in ITree.Extra.IForest]
not_converge_to_all_infinite [lemma, in ITree.Props.Infinite]
not_wf_from [definition, in ITree.Extra.Dijkstra.IterRel]
not_wf_F_mono' [lemma, in ITree.Extra.Dijkstra.IterRel]
not_wf_F_mono [lemma, in ITree.Extra.Dijkstra.IterRel]
not_wf [constructor, in ITree.Extra.Dijkstra.IterRel]
not_wf_F [inductive, in ITree.Extra.Dijkstra.IterRel]
not_any_infinite_all_finite [lemma, in ITree.Props.Cofinite]
not_all_infinite_any_finite [lemma, in ITree.Props.Cofinite]
not_ret_eutt_spin [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
NoWitness [constructor, in ITree.Axioms]
no_infinite_ret [lemma, in ITree.Props.Infinite]
no_inf_dec_seq_aux [lemma, in ITree.Extra.Dijkstra.IterRel]
no_choice [inductive, in ITree.Events.Nondeterminism]
n':55 [binder, in ITree.Extra.Dijkstra.IterRel]
n':58 [binder, in ITree.Extra.Dijkstra.IterRel]
n0:53 [binder, in ITree.Extra.Dijkstra.IterRel]
n0:56 [binder, in ITree.Extra.Dijkstra.IterRel]
n0:59 [binder, in ITree.Extra.Dijkstra.IterRel]
n1:54 [binder, in ITree.Extra.Dijkstra.IterRel]
n1:57 [binder, in ITree.Extra.Dijkstra.IterRel]
n1:60 [binder, in ITree.Extra.Dijkstra.IterRel]
n1:63 [binder, in ITree.Extra.Dijkstra.IterRel]
n2:64 [binder, in ITree.Extra.Dijkstra.IterRel]
n:133 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
n:133 [binder, in ITree.Extra.Secure.SecureEqHalt]
n:19 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
n:28 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
n:33 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
n:36 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
n:39 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
n:40 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
n:44 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
n:52 [binder, in ITree.Extra.Dijkstra.IterRel]
n:62 [binder, in ITree.Extra.Dijkstra.IterRel]
n:79 [binder, in ITree.Core.ITreeDefinition]

O

OBG:134 [binder, in ITree.Eq.UpToTaus]
OBG:38 [binder, in ITree.Eq.Paco2]
obj1:1 [binder, in ITree.Basics.CategoryFunctor]
obj2:2 [binder, in ITree.Basics.CategoryFunctor]
obj:1 [binder, in ITree.Basics.CategoryOps]
obj:1 [binder, in ITree.Basics.CategoryFacts]
obj:1 [binder, in ITree.Basics.CategoryTheory]
obj:1 [binder, in ITree.Basics.CategorySub]
obj:123 [binder, in ITree.Basics.CategoryTheory]
obj:127 [binder, in ITree.Basics.CategoryOps]
OBJ:151 [binder, in ITree.Eq.UpToTaus]
obj:155 [binder, in ITree.Basics.CategoryOps]
obj:162 [binder, in ITree.Basics.CategoryTheory]
obj:168 [binder, in ITree.Basics.CategoryOps]
obj:174 [binder, in ITree.Basics.CategoryOps]
obj:191 [binder, in ITree.Basics.CategoryOps]
obj:201 [binder, in ITree.Basics.CategoryTheory]
obj:215 [binder, in ITree.Basics.CategoryFacts]
obj:229 [binder, in ITree.Basics.CategoryTheory]
obj:27 [binder, in ITree.Basics.CategoryOps]
obj:27 [binder, in ITree.Basics.CategoryFunctor]
obj:303 [binder, in ITree.Basics.CategoryTheory]
obj:341 [binder, in ITree.Basics.CategoryTheory]
obj:342 [binder, in ITree.Basics.CategoryFacts]
obj:44 [binder, in ITree.Basics.CategoryFacts]
obj:45 [binder, in ITree.Basics.CategoryTheory]
obj:63 [binder, in ITree.Basics.CategoryTheory]
obj:64 [binder, in ITree.Basics.CategoryFacts]
obj:75 [binder, in ITree.Basics.CategoryTheory]
obj:88 [binder, in ITree.Basics.CategoryFacts]
obj:92 [binder, in ITree.Basics.CategoryOps]
obj:92 [binder, in ITree.Basics.CategoryTheory]
obj:99 [binder, in ITree.Basics.CategoryOps]
obr:13 [binder, in ITree.Extra.ITrace.ITracePrefix]
obs [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
obs [constructor, in ITree.Extra.Dijkstra.DijkstraMonad]
observe [definition, in ITree.Core.ITreeDefinition]
observe_stream [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
observe_bind [lemma, in ITree.Eq.Shallow]
observing [record, in ITree.Eq.Shallow]
observing_going [lemma, in ITree.Eq.Shallow]
observing_bind [instance, in ITree.Eq.Shallow]
observing_go [instance, in ITree.Eq.Shallow]
observing_observe_ [instance, in ITree.Eq.Shallow]
observing_relations.eq_ [variable, in ITree.Eq.Shallow]
observing_relations [section, in ITree.Eq.Shallow]
observing_observe [projection, in ITree.Eq.Shallow]
observing_intros [constructor, in ITree.Eq.Shallow]
observing_sub_eqit [instance, in ITree.Eq.Eqit]
obsip [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
obsip_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
obsip_pres_bind [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
obsip_pres_ret [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
obsip_monot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
obs_trace [definition, in ITree.Extra.Dijkstra.TracesIT]
obs_del [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
obs:12 [binder, in ITree.Extra.ITrace.ITracePrefix]
Obs:47 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
Obs:66 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
ob:17 [binder, in ITree.Extra.ITrace.ITraceBind]
ob:43 [binder, in ITree.Extra.ITrace.ITraceBind]
ob:52 [binder, in ITree.Extra.ITrace.ITracePrefix]
oi:84 [binder, in ITree.Basics.Basics]
one [projection, in ITree.Basics.CategoryOps]
one [constructor, in ITree.Basics.CategoryOps]
ONE:206 [binder, in ITree.Basics.CategoryTheory]
op [definition, in ITree.Basics.CategoryOps]
Operations [section, in ITree.Core.KTree]
Operations [section, in ITree.Basics.CategoryRelations]
OppositeCat [section, in ITree.Basics.CategoryTheory]
option_rel_eq [lemma, in ITree.Basics.HeterogeneousRelations]
option_rel [definition, in ITree.Basics.HeterogeneousRelations]
or [definition, in ITree.Events.Nondeterminism]
Or [constructor, in ITree.Events.Nondeterminism]
OrderedMonad [record, in ITree.Extra.Dijkstra.DijkstraMonad]
OrderedMonad [section, in ITree.Extra.Dijkstra.DijkstraMonad]
OrderedMonadW:30 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
OrderedMonadW:5 [binder, in ITree.Extra.Dijkstra.StateSpecT]
OrderM [record, in ITree.Extra.Dijkstra.DijkstraMonad]
OrderM [inductive, in ITree.Extra.Dijkstra.DijkstraMonad]
OrderW:29 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
OrderW:4 [binder, in ITree.Extra.Dijkstra.StateSpecT]
OrderW:9 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
osl:56 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
ot1:101 [binder, in ITree.Eq.Shallow]
ot1:109 [binder, in ITree.Eq.Shallow]
ot1:139 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
ot1:143 [binder, in ITree.Eq.Eqit]
ot1:16 [binder, in ITree.Eq.SimUpToTaus]
ot1:22 [binder, in ITree.Extra.Secure.SecureEqHalt]
ot1:29 [binder, in ITree.Eq.Rutt]
ot1:29 [binder, in ITree.Eq.Eqit]
ot2:102 [binder, in ITree.Eq.Shallow]
ot2:110 [binder, in ITree.Eq.Shallow]
ot2:138 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
ot2:144 [binder, in ITree.Eq.Eqit]
ot2:20 [binder, in ITree.Extra.Secure.SecureEqHalt]
ot2:20 [binder, in ITree.Eq.SimUpToTaus]
ot2:26 [binder, in ITree.Eq.Eqit]
ot2:28 [binder, in ITree.Eq.Rutt]
ot2:76 [binder, in ITree.Eq.SimUpToTaus]
ot:109 [binder, in ITree.Extra.ITrace.ITraceBind]
ot:116 [binder, in ITree.Extra.ITrace.ITraceFacts]
ot:15 [binder, in ITree.Interp.InterpFacts]
ot:18 [binder, in ITree.Extra.ITrace.ITraceBind]
ot:201 [binder, in ITree.Simple]
ot:295 [binder, in ITree.Eq.Eqit]
ot:408 [binder, in ITree.Eq.Eqit]
ot:44 [binder, in ITree.Extra.ITrace.ITraceBind]
ot:44 [binder, in ITree.Events.FailFacts]
ot:5 [binder, in ITree.Interp.RecursionFacts]
ot:59 [binder, in ITree.Simple]
ot:6 [binder, in ITree.Events.StateFacts]
ov:15 [binder, in ITree.Events.Map]

P

p [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
Paco2 [library]
paco2_eqit_refl [lemma, in ITree.Eq.EuttExtras]
paco2_accF [lemma, in ITree.Eq.Paco2]
Pair [record, in ITree.Basics.CategoryOps]
Pair [inductive, in ITree.Basics.CategoryOps]
PairFst [record, in ITree.Basics.CategoryTheory]
PairFst [inductive, in ITree.Basics.CategoryTheory]
PairFst_Fun [instance, in ITree.Basics.FunctionFacts]
PairFst_rel [instance, in ITree.Basics.CategoryRelations]
PairSnd [record, in ITree.Basics.CategoryTheory]
PairSnd [inductive, in ITree.Basics.CategoryTheory]
PairSnd_Fun [instance, in ITree.Basics.FunctionFacts]
PairSnd_rel [instance, in ITree.Basics.CategoryRelations]
PairUniversal [record, in ITree.Basics.CategoryTheory]
PairUniversal [inductive, in ITree.Basics.CategoryTheory]
PairUniversal_Fun [instance, in ITree.Basics.FunctionFacts]
PairUniversal_rel [instance, in ITree.Basics.CategoryRelations]
Pair_Fun [instance, in ITree.Basics.Function]
pair__ [abbreviation, in ITree.Basics.CategoryOps]
pair_ [projection, in ITree.Basics.CategoryOps]
pair_ [constructor, in ITree.Basics.CategoryOps]
pair_bimap [lemma, in ITree.Basics.CategoryFacts]
pair_split [lemma, in ITree.Basics.CategoryFacts]
pair_eta' [lemma, in ITree.Basics.CategoryFacts]
pair_eta [lemma, in ITree.Basics.CategoryFacts]
pair_cat [lemma, in ITree.Basics.CategoryFacts]
pair_snd' [lemma, in ITree.Basics.CategoryFacts]
pair_fst' [lemma, in ITree.Basics.CategoryFacts]
Pair_rel [instance, in ITree.Basics.CategoryRelations]
Pair_C:209 [binder, in ITree.Basics.CategoryTheory]
pair_universal [projection, in ITree.Basics.CategoryTheory]
pair_universal [constructor, in ITree.Basics.CategoryTheory]
pair_snd [projection, in ITree.Basics.CategoryTheory]
pair_snd [constructor, in ITree.Basics.CategoryTheory]
pair_fst [projection, in ITree.Basics.CategoryTheory]
pair_fst [constructor, in ITree.Basics.CategoryTheory]
Pair_C:168 [binder, in ITree.Basics.CategoryTheory]
pat:119 [binder, in ITree.Basics.Basics]
pat:32 [binder, in ITree.Extra.Dijkstra.StateSpecT]
pat:38 [binder, in ITree.Basics.Function]
pat:46 [binder, in ITree.Extra.Dijkstra.StateSpecT]
pat:471 [binder, in ITree.Extra.IForest]
pat:479 [binder, in ITree.Extra.IForest]
pat:492 [binder, in ITree.Extra.IForest]
pat:497 [binder, in ITree.Extra.IForest]
pat:52 [binder, in ITree.Extra.Dijkstra.StateSpecT]
pat:63 [binder, in ITree.Events.State]
pat:66 [binder, in ITree.Basics.CategoryRelations]
pat:66 [binder, in ITree.Events.State]
pat:69 [binder, in ITree.Extra.Dijkstra.StateSpecT]
pat:70 [binder, in ITree.Basics.CategoryRelations]
pat:72 [binder, in ITree.Extra.Dijkstra.StateSpecT]
pat:77 [binder, in ITree.Basics.CategoryRelations]
pat:81 [binder, in ITree.Basics.CategoryRelations]
pat:83 [binder, in ITree.Basics.CategoryRelations]
pat:86 [binder, in ITree.Basics.CategoryRelations]
pat:90 [binder, in ITree.Basics.CategoryRelations]
pat:93 [binder, in ITree.Basics.CategoryRelations]
PA':503 [binder, in ITree.Extra.IForest]
PA':511 [binder, in ITree.Extra.IForest]
PA':9 [binder, in ITree.Extra.IForest]
PA:109 [binder, in ITree.Basics.Basics]
PA:115 [binder, in ITree.Basics.Basics]
PA:16 [binder, in ITree.Extra.IForest]
Pa:3 [binder, in ITree.Basics.MonadProp]
PA:502 [binder, in ITree.Extra.IForest]
PA:510 [binder, in ITree.Extra.IForest]
PA:523 [binder, in ITree.Extra.IForest]
PA:534 [binder, in ITree.Extra.IForest]
PA:54 [binder, in ITree.Extra.IForest]
PA:564 [binder, in ITree.Extra.IForest]
PA:602 [binder, in ITree.Extra.IForest]
PA:65 [binder, in ITree.Extra.IForest]
PA:76 [binder, in ITree.Extra.IForest]
PA:8 [binder, in ITree.Extra.IForest]
pbc_intro_h [constructor, in ITree.Extra.IForest]
pbc_intro_h [constructor, in ITree.Props.Leaf]
pbc_intro_h [constructor, in ITree.Eq.Eqit]
PB:110 [binder, in ITree.Basics.Basics]
PB:116 [binder, in ITree.Basics.Basics]
peel [definition, in ITree.Extra.ITrace.ITraceBind]
Peel [section, in ITree.Extra.ITrace.ITraceBind]
peel_lemma [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_bind [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_cont_refine_t [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_cont_vis_eutt [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_vis_empty_contra [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_cont_ret_inv [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_ret_inv [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_refine_t [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_t_ret [lemma, in ITree.Extra.ITrace.ITraceBind]
peel_cont [definition, in ITree.Extra.ITrace.ITraceBind]
peel_cont_ [definition, in ITree.Extra.ITrace.ITraceBind]
peel_cont_vis [definition, in ITree.Extra.ITrace.ITraceBind]
peel_ [definition, in ITree.Extra.ITrace.ITraceBind]
peel_vis [definition, in ITree.Extra.ITrace.ITraceBind]
peel:13 [binder, in ITree.Extra.ITrace.ITraceBind]
peel:39 [binder, in ITree.Extra.ITrace.ITraceBind]
PEF:70 [binder, in ITree.Extra.ITrace.ITracePreds]
PEF:86 [binder, in ITree.Extra.ITrace.ITracePreds]
PEF:93 [binder, in ITree.Extra.ITrace.ITracePreds]
PEL:72 [binder, in ITree.Extra.ITrace.ITracePreds]
PEL:87 [binder, in ITree.Extra.ITrace.ITracePreds]
PEL:94 [binder, in ITree.Extra.ITrace.ITracePreds]
PER [record, in ITree.Basics.HeterogeneousRelations]
PER_reflexivityH2 [lemma, in ITree.Basics.HeterogeneousRelations]
PER_reflexivityH1 [lemma, in ITree.Basics.HeterogeneousRelations]
per_trans [projection, in ITree.Basics.HeterogeneousRelations]
per_symm [projection, in ITree.Basics.HeterogeneousRelations]
PEv:104 [binder, in ITree.Extra.ITrace.ITracePreds]
PEv:117 [binder, in ITree.Extra.ITrace.ITracePreds]
PEv:120 [binder, in ITree.Extra.ITrace.ITracePreds]
PEv:123 [binder, in ITree.Extra.ITrace.ITracePreds]
PEv:127 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:17 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:23 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:27 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:32 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:38 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:42 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:47 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:5 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:58 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:63 [binder, in ITree.Extra.ITrace.ITracePreds]
PE:66 [binder, in ITree.Extra.ITrace.ITracePreds]
pf:16 [binder, in ITree.Events.Concurrency]
PF:304 [binder, in ITree.Extra.IForest]
piEqVisPriv [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivLInd [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivRInd [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivTauLCo [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivTauRCo [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivVisCo [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqRet [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqTau [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqTauL [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqTauR [constructor, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_iter_bind_aux [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_bind [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_ret [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_eutt_proper [instance, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_eq_itree_proper [instance, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secureC_wcompat_id [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_RR_imp [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_mixed_trans [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_mixed_trans_aux1 [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_private_halt [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_spin [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_mon [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_sym [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure [definition, in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_mono [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqitF_mono [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_ [definition, in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqitF [inductive, in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_bind' [lemma, in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_priv_visr [lemma, in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_priv_visl [lemma, in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_priv_vislr [lemma, in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_pub_vis [lemma, in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_trans_ret [lemma, in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_iter_ret [lemma, in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_silent_diverger [lemma, in ITree.Extra.Secure.SecureStateHandlerPi]
pi_eqit_secure_silent_divergel [lemma, in ITree.Extra.Secure.SecureStateHandlerPi]
post0:35 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post1:101 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post1:111 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post1:36 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post2:102 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post2:112 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post:11 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
post:17 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post:45 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post:52 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post:64 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post:69 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post:75 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
post:76 [binder, in ITree.Extra.Dijkstra.TracesIT]
post:82 [binder, in ITree.Extra.Dijkstra.TracesIT]
post:88 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:41 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:48 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:56 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:79 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:83 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:91 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pppp:21 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pppp:26 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:38 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:44 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:5 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:51 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:58 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:61 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:67 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:81 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:86 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:9 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pp:93 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
PQOK:605 [binder, in ITree.Extra.IForest]
prefix_body:29 [binder, in ITree.Events.Exception]
prefix_vis [lemma, in ITree.Extra.ITrace.ITracePrefix]
Preorder [record, in ITree.Basics.HeterogeneousRelations]
Preorder [record, in ITree.Extra.Secure.Labels]
PrePost [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostList [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostListRef [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostPair [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostPairRef [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostRef [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
PRet:105 [binder, in ITree.Extra.ITrace.ITracePreds]
PRet:118 [binder, in ITree.Extra.ITrace.ITracePreds]
PRet:121 [binder, in ITree.Extra.ITrace.ITracePreds]
PRet:124 [binder, in ITree.Extra.ITrace.ITracePreds]
PRet:128 [binder, in ITree.Extra.ITrace.ITracePreds]
pre_trans [projection, in ITree.Basics.HeterogeneousRelations]
pre_refl [projection, in ITree.Basics.HeterogeneousRelations]
pre0:33 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre1:109 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre1:34 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre1:99 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre2:100 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre2:110 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre:10 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
pre:16 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre:17 [binder, in ITree.Events.Nondeterminism]
pre:46 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre:53 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre:63 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre:68 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre:74 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
pre:77 [binder, in ITree.Extra.Dijkstra.TracesIT]
pre:83 [binder, in ITree.Extra.Dijkstra.TracesIT]
pre:87 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
PrintMults [section, in ITree.Extra.Dijkstra.StateIOTrace]
PrintMults.X [variable, in ITree.Extra.Dijkstra.StateIOTrace]
PrintMults.Y [variable, in ITree.Extra.Dijkstra.StateIOTrace]
print_mults_sats_spec [lemma, in ITree.Extra.Dijkstra.StateIOTrace]
print_mults [definition, in ITree.Extra.Dijkstra.StateIOTrace]
print_mults_post [definition, in ITree.Extra.Dijkstra.StateIOTrace]
print_mults_pre [definition, in ITree.Extra.Dijkstra.StateIOTrace]
priv1:9 [binder, in ITree.Extra.Secure.SecureStateHandler]
priv1:9 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
priv2:11 [binder, in ITree.Extra.Secure.SecureStateHandler]
priv2:11 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
priv:102 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:108 [binder, in ITree.Extra.Secure.SecureEqWcompat]
priv:109 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:111 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:113 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:114 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:12 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:127 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:129 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:137 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:139 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:141 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:141 [binder, in ITree.Extra.Secure.SecureEqHalt]
priv:146 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:147 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:15 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:159 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:161 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:162 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:17 [binder, in ITree.Extra.Secure.SecureEqWcompat]
priv:17 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:172 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:172 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:176 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:184 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:184 [binder, in ITree.Extra.Secure.SecureEqHalt]
priv:185 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:191 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:198 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:198 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:198 [binder, in ITree.Extra.Secure.SecureEqHalt]
priv:20 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
priv:202 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:206 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:221 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:223 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:232 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:239 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:241 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:250 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:261 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:261 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:267 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:27 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:283 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:288 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:305 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:311 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:32 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:32 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:322 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:331 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:341 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:349 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:36 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
priv:44 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:46 [binder, in ITree.Extra.Secure.SecureEqWcompat]
priv:46 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:5 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:50 [binder, in ITree.Extra.Secure.SecureEqWcompat]
priv:51 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:53 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:6 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
priv:6 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:6 [binder, in ITree.Extra.Secure.SecureEqHalt]
priv:6 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
priv:60 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:69 [binder, in ITree.Extra.Secure.SecureEqWcompat]
priv:69 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:70 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:77 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:8 [binder, in ITree.Extra.Secure.SecureEqWcompat]
priv:81 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
priv:88 [binder, in ITree.Extra.Secure.SecureEqWcompat]
priv:89 [binder, in ITree.Extra.Secure.SecureEqBind]
priv:90 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:96 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
ProdRelFacts [section, in ITree.Basics.HeterogeneousRelations]
ProdRelFacts.Equivalence [section, in ITree.Basics.HeterogeneousRelations]
Product [record, in ITree.Basics.CategoryTheory]
ProductFacts [section, in ITree.Basics.CategoryFacts]
ProductLaws [section, in ITree.Basics.CategoryTheory]
Products [section, in ITree.Basics.FunctionFacts]
Product_Fun [instance, in ITree.Basics.FunctionFacts]
Product_C:228 [binder, in ITree.Basics.CategoryFacts]
Product_rel [instance, in ITree.Basics.CategoryRelations]
product_proper_pair [projection, in ITree.Basics.CategoryTheory]
product_pair_universal [projection, in ITree.Basics.CategoryTheory]
product_pair_snd [projection, in ITree.Basics.CategoryTheory]
product_pair_fst [projection, in ITree.Basics.CategoryTheory]
prod_pred [definition, in ITree.Basics.Basics]
Prod_C:225 [binder, in ITree.Basics.CategoryFacts]
prod_compose [lemma, in ITree.Basics.HeterogeneousRelations]
prod_inv [lemma, in ITree.Basics.HeterogeneousRelations]
prod_snd_rel [definition, in ITree.Basics.HeterogeneousRelations]
prod_fst_rel [definition, in ITree.Basics.HeterogeneousRelations]
prod_rel_eq [lemma, in ITree.Basics.HeterogeneousRelations]
prod_rel_monotone [lemma, in ITree.Basics.HeterogeneousRelations]
prod_rel_PER [instance, in ITree.Basics.HeterogeneousRelations]
prod_rel_eqv [instance, in ITree.Basics.HeterogeneousRelations]
prod_rel_trans [instance, in ITree.Basics.HeterogeneousRelations]
prod_rel_sym [instance, in ITree.Basics.HeterogeneousRelations]
prod_rel_refl [instance, in ITree.Basics.HeterogeneousRelations]
prod_rel [record, in ITree.Basics.HeterogeneousRelations]
prod_morphism [constructor, in ITree.Basics.HeterogeneousRelations]
PROD:157 [binder, in ITree.Basics.CategoryOps]
PROD:208 [binder, in ITree.Basics.CategoryTheory]
prop [section, in ITree.Basics.MonadProp]
ProperCat_rel [instance, in ITree.Basics.CategoryRelations]
proper_eutt_spec_in [instance, in ITree.Extra.Dijkstra.TracesIT]
proper_eutt_peel_cont [instance, in ITree.Extra.ITrace.ITraceBind]
proper_peel_cont_eutt_r [lemma, in ITree.Extra.ITrace.ITraceBind]
proper_peel_cont_eutt_l [lemma, in ITree.Extra.ITrace.ITraceBind]
proper_eutt_peel [instance, in ITree.Extra.ITrace.ITraceBind]
proper_peel_eutt_r [lemma, in ITree.Extra.ITrace.ITraceBind]
proper_peel_eutt_l [lemma, in ITree.Extra.ITrace.ITraceBind]
proper_eqitree_throw_prefix [instance, in ITree.Events.ExceptionFacts]
proper_eutt_try_catch [instance, in ITree.Events.ExceptionFacts]
proper_eqitree_try_catch [instance, in ITree.Events.ExceptionFacts]
Proper_bind [projection, in ITree.Basics.Monad]
Proper_iter [abbreviation, in ITree.Basics.CategoryKleisliFacts]
proper_bimap_kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
Proper_pure [instance, in ITree.Basics.CategoryKleisliFacts]
Proper_case_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
Proper_cat_Kleisli [instance, in ITree.Basics.CategoryKleisliFacts]
Proper_Kleisli_apply [instance, in ITree.Basics.CategoryKleisliFacts]
Proper_sutt [instance, in ITree.Eq.SimUpToTaus]
proper_eutt_equivE [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_eutt_equivE_imp [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_eventless [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_eventless_imp [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_bisim_inf [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_bisim_inf_imp [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_bisim_app [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_itree_spec [instance, in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_noret_cast [instance, in ITree.Props.EuttNoRet]
proper_euttNoRet [instance, in ITree.Props.EuttNoRet]
Proper_Iter_Handler [instance, in ITree.Interp.HandlerFacts]
Proper_Case_Handler [instance, in ITree.Interp.HandlerFacts]
Proper_Cat_Handler [instance, in ITree.Interp.HandlerFacts]
Proper_Iter_stateTM [instance, in ITree.Basics.MonadState]
Proper_pair_Fun [instance, in ITree.Basics.FunctionFacts]
Proper_cat [instance, in ITree.Basics.FunctionFacts]
proper_terminate [instance, in ITree.Extra.Secure.SecureStateHandler]
proper_diverges_with_r [instance, in ITree.Extra.Secure.SecureStateHandler]
proper_diverges_with [instance, in ITree.Extra.Secure.SecureStateHandler]
proper_append [instance, in ITree.Extra.ITrace.ITraceFacts]
Proper_loop [instance, in ITree.Basics.CategoryFacts]
Proper_Bimap_Product [instance, in ITree.Basics.CategoryFacts]
Proper_Bimap_Coproduct [instance, in ITree.Basics.CategoryFacts]
Proper_Bimap_bif:33 [binder, in ITree.Basics.CategoryFacts]
Proper_Cat_C:15 [binder, in ITree.Basics.CategoryFacts]
Proper_pair_rel [instance, in ITree.Basics.CategoryRelations]
Proper_Case_rel [instance, in ITree.Basics.CategoryRelations]
Proper_sum_rel [instance, in ITree.Basics.HeterogeneousRelations]
Proper_prod_rel [instance, in ITree.Basics.HeterogeneousRelations]
Proper_transpose [instance, in ITree.Basics.HeterogeneousRelations]
Proper_compose [instance, in ITree.Basics.HeterogeneousRelations]
Proper_relation [instance, in ITree.Basics.HeterogeneousRelations]
proper_eqit_secure_eqit_secure [instance, in ITree.Extra.Secure.SecureEqEuttHalt]
proper_eqit_secure_eqit [instance, in ITree.Extra.Secure.SecureEqEuttHalt]
Proper_handle_map [instance, in ITree.Events.MapDefaultFacts]
Proper_apply_IFun [instance, in ITree.Indexed.FunctionFacts]
Proper_Iter_stateTM [instance, in ITree.Basics.MonadProp]
Proper_interp_mrec [instance, in ITree.Interp.RecursionFacts]
Proper_unsubm [instance, in ITree.Basics.CategorySub]
Proper_subm [instance, in ITree.Basics.CategorySub]
PR:18 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:24 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:28 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:33 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:39 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:43 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:6 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:73 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:88 [binder, in ITree.Extra.ITrace.ITracePreds]
PR:95 [binder, in ITree.Extra.ITrace.ITracePreds]
pure [definition, in ITree.Basics.CategoryKleisli]
PureITree [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITree [section, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeBasics [library]
PureITreeDijkstra [library]
PureITreeEffectObs [instance, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeMorph [instance, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureItreeOrder [instance, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeOrderM [instance, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeSpec [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeSpecEq [instance, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureItreeSpecLaws [instance, in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureItreeSpecMonad [instance, in ITree.Extra.Dijkstra.PureITreeDijkstra]
pure_inr [lemma, in ITree.Basics.CategoryKleisliFacts]
pure_inl [lemma, in ITree.Basics.CategoryKleisliFacts]
pure_swap [lemma, in ITree.Basics.CategoryKleisliFacts]
pure_cat [lemma, in ITree.Basics.CategoryKleisliFacts]
pure_id [lemma, in ITree.Basics.CategoryKleisliFacts]
pure_assoc_r [lemma, in ITree.Basics.CategoryKleisliFacts]
pure_assoc_l [lemma, in ITree.Basics.CategoryKleisliFacts]
pure_state [definition, in ITree.Events.State]
put [definition, in ITree.Events.State]
Put [constructor, in ITree.Events.State]
PutE [constructor, in ITree.Extra.Dijkstra.StateIOTrace]
pweqeq [definition, in ITree.Eq.Shallow]
pweqeq_mon [lemma, in ITree.Eq.Shallow]
p':100 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':14 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':16 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
p':23 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':46 [binder, in ITree.Extra.Dijkstra.TracesIT]
p':7 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':7 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p':9 [binder, in ITree.Extra.Dijkstra.TracesIT]
p0:62 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p0:66 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p1:49 [binder, in ITree.Basics.HeterogeneousRelations]
p2:50 [binder, in ITree.Basics.HeterogeneousRelations]
P:1 [binder, in ITree.Extra.ITrace.ITraceBind]
p:104 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:107 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:11 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:11 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
P:111 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:112 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:112 [binder, in ITree.Extra.ITrace.ITraceFacts]
P:113 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:115 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:118 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:118 [binder, in ITree.Extra.Secure.SecureStateHandler]
p:12 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
p:12 [binder, in ITree.Eq.Shallow]
p:12 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
p:128 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:13 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:13 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:130 [binder, in ITree.Eq.Eqit]
p:134 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:139 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:14 [binder, in ITree.Extra.Dijkstra.TracesIT]
P:14 [binder, in ITree.Axioms]
p:14 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
p:146 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:15 [binder, in ITree.Axioms]
p:15 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
p:157 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:16 [binder, in ITree.Axioms]
p:166 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:171 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:173 [binder, in ITree.Extra.IForest]
p:174 [binder, in ITree.Extra.IForest]
p:179 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:18 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:19 [binder, in ITree.Extra.Dijkstra.TracesIT]
P:19 [binder, in ITree.Axioms]
p:194 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:2 [binder, in ITree.Eq.Shallow]
p:20 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
p:213 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:214 [binder, in ITree.Eq.UpToTaus]
p:217 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:22 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:23 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:23 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:23 [binder, in ITree.Eq.Shallow]
P:25 [binder, in ITree.Props.HasPost]
p:25 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
P:28 [binder, in ITree.Extra.Dijkstra.IterRel]
p:29 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:29 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
p:3 [binder, in ITree.Extra.Dijkstra.TracesIT]
P:3 [binder, in ITree.Axioms]
p:3 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:3 [binder, in ITree.Props.Infinite]
p:3 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:30 [binder, in ITree.Props.HasPost]
p:30 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:302 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:303 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:311 [binder, in ITree.Basics.HeterogeneousRelations]
P:315 [binder, in ITree.Basics.HeterogeneousRelations]
P:317 [binder, in ITree.Basics.HeterogeneousRelations]
P:319 [binder, in ITree.Basics.HeterogeneousRelations]
p:333 [binder, in ITree.Eq.Eqit]
P:34 [binder, in ITree.Extra.Dijkstra.IterRel]
P:34 [binder, in ITree.Extra.Secure.SecureStateHandler]
p:34 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
P:34 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
P:35 [binder, in ITree.Props.HasPost]
p:36 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:36 [binder, in ITree.Eq.Shallow]
p:375 [binder, in ITree.Eq.Eqit]
p:38 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:38 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
P:40 [binder, in ITree.Props.HasPost]
p:41 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
p:44 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:45 [binder, in ITree.Extra.Dijkstra.TracesIT]
P:47 [binder, in ITree.Eq.Paco2]
p:5 [binder, in ITree.Extra.Dijkstra.TracesIT]
P:5 [binder, in ITree.Extra.IForest]
p:5 [binder, in ITree.Eq.Shallow]
p:50 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
P:50 [binder, in ITree.Extra.Secure.SecureStateHandler]
p:52 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:53 [binder, in ITree.Eq.Paco2]
p:530 [binder, in ITree.Extra.IForest]
p:56 [binder, in ITree.Eq.Paco2]
p:58 [binder, in ITree.Extra.Dijkstra.StateSpecT]
p:59 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:59 [binder, in ITree.Eq.Paco2]
p:6 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:6 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:61 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
P:62 [binder, in ITree.Extra.Secure.SecureStateHandler]
p:64 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:646 [binder, in ITree.Eq.Eqit]
p:66 [binder, in ITree.Interp.Traces]
p:67 [binder, in ITree.Interp.Traces]
P:67 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
P:68 [binder, in ITree.Extra.Dijkstra.IterRel]
P:68 [binder, in ITree.Extra.Secure.SecureStateHandler]
P:7 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
p:71 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
P:71 [binder, in ITree.Extra.Secure.SecureStateHandler]
p:73 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:73 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
P:76 [binder, in ITree.Extra.Secure.SecureStateHandler]
P:77 [binder, in ITree.Core.ITreeDefinition]
p:79 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:8 [binder, in ITree.Extra.Dijkstra.TracesIT]
P:81 [binder, in ITree.Extra.Secure.SecureStateHandler]
P:83 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:85 [binder, in ITree.Extra.Dijkstra.TracesIT]
p:85 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
P:85 [binder, in ITree.Extra.Secure.SecureStateHandler]
p:86 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:88 [binder, in ITree.Extra.Dijkstra.StateSpecT]
P:88 [binder, in ITree.Extra.Secure.SecureStateHandler]
p:9 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
p:90 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:90 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:94 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:94 [binder, in ITree.Eq.Eqit]
P:96 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
P:98 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
p:99 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:99 [binder, in ITree.Extra.Secure.SecureStateHandler]

Q

Q1:89 [binder, in ITree.Props.HasPost]
Q2:90 [binder, in ITree.Props.HasPost]
Q:10 [binder, in ITree.Props.HasPost]
Q:106 [binder, in ITree.Props.HasPost]
q:11 [binder, in ITree.Events.Concurrency]
Q:126 [binder, in ITree.Props.HasPost]
Q:132 [binder, in ITree.Props.HasPost]
Q:17 [binder, in ITree.Props.HasPost]
q:20 [binder, in ITree.Events.Concurrency]
Q:26 [binder, in ITree.Props.HasPost]
Q:31 [binder, in ITree.Props.HasPost]
Q:36 [binder, in ITree.Props.HasPost]
Q:4 [binder, in ITree.Props.HasPost]
Q:41 [binder, in ITree.Props.HasPost]
Q:50 [binder, in ITree.Props.HasPost]
Q:50 [binder, in ITree.Eq.Paco2]
Q:58 [binder, in ITree.Props.HasPost]
q:59 [binder, in ITree.Extra.Dijkstra.StateSpecT]
q:60 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
Q:70 [binder, in ITree.Props.HasPost]
q:75 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
Q:78 [binder, in ITree.Core.ITreeDefinition]
Q:80 [binder, in ITree.Props.HasPost]

R

RAnsRef [inductive, in ITree.Extra.ITrace.ITraceDefinition]
RAns:10 [binder, in ITree.Eq.Rutt]
RAns:119 [binder, in ITree.Eq.Rutt]
RAns:130 [binder, in ITree.Eq.Rutt]
RAns:153 [binder, in ITree.Eq.Rutt]
RAns:39 [binder, in ITree.Eq.Rutt]
RAns:48 [binder, in ITree.Eq.Rutt]
RAns:57 [binder, in ITree.Eq.Rutt]
RAns:66 [binder, in ITree.Eq.Rutt]
RAns:75 [binder, in ITree.Eq.Rutt]
rar [constructor, in ITree.Extra.ITrace.ITraceDefinition]
RA:108 [binder, in ITree.Extra.Secure.SecureEqBind]
RA:114 [binder, in ITree.Events.StateFacts]
RA:133 [binder, in ITree.Extra.Secure.SecureEqBind]
RA:157 [binder, in ITree.Extra.Secure.SecureEqBind]
RA:282 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RA:306 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RA:35 [binder, in ITree.Basics.HeterogeneousRelations]
RA:4 [binder, in ITree.Indexed.Relation]
RA:47 [binder, in ITree.Basics.HeterogeneousRelations]
RA:83 [binder, in ITree.Extra.Secure.SecureEqBind]
RA:91 [binder, in ITree.Events.StateFacts]
RB:109 [binder, in ITree.Extra.Secure.SecureEqBind]
RB:115 [binder, in ITree.Events.StateFacts]
RB:134 [binder, in ITree.Extra.Secure.SecureEqBind]
RB:15 [binder, in ITree.Indexed.Relation]
RB:158 [binder, in ITree.Extra.Secure.SecureEqBind]
RB:23 [binder, in ITree.Indexed.Relation]
RB:283 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RB:29 [binder, in ITree.Indexed.Relation]
RB:307 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RB:35 [binder, in ITree.Indexed.Relation]
RB:36 [binder, in ITree.Basics.HeterogeneousRelations]
RB:41 [binder, in ITree.Indexed.Relation]
RB:47 [binder, in ITree.Indexed.Relation]
RB:48 [binder, in ITree.Basics.HeterogeneousRelations]
RB:52 [binder, in ITree.Indexed.Relation]
RB:6 [binder, in ITree.Indexed.Relation]
RB:84 [binder, in ITree.Extra.Secure.SecureEqBind]
rclo_flip [lemma, in ITree.Eq.UpToTaus]
rclo_transD [lemma, in ITree.Eq.UpToTaus]
rcompose [inductive, in ITree.Eq.Eqit]
rcompose_intro [constructor, in ITree.Eq.Eqit]
Read [constructor, in ITree.Extra.Dijkstra.StateIOTrace]
Reader [section, in ITree.Events.Reader]
Reader [library]
readerE [inductive, in ITree.Events.Reader]
Reader.Env [variable, in ITree.Events.Reader]
reassoc [definition, in ITree.Extra.Dijkstra.StateSpecT]
rec [definition, in ITree.Interp.Recursion]
Recursion [library]
RecursionFacts [library]
recursive [definition, in ITree.Interp.RecursionFacts]
rec_fix [definition, in ITree.Interp.Recursion]
rec_as_interp [lemma, in ITree.Interp.RecursionFacts]
rec:5 [binder, in ITree.Interp.Interp]
ree [constructor, in ITree.Extra.ITrace.ITraceDefinition]
refine_ret_vis_contra [lemma, in ITree.Extra.ITrace.ITraceBind]
refine_set_eq_to_eutt [lemma, in ITree.Extra.ITrace.ITraceFacts]
refine_set_eq_to_eutt_vis_aux [lemma, in ITree.Extra.ITrace.ITraceFacts]
reflex [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
reflexive [projection, in ITree.Basics.HeterogeneousRelations]
reflexive [constructor, in ITree.Basics.HeterogeneousRelations]
ReflexiveH [record, in ITree.Basics.HeterogeneousRelations]
ReflexiveH [inductive, in ITree.Basics.HeterogeneousRelations]
ReflexiveH_Reflexive [lemma, in ITree.Basics.HeterogeneousRelations]
Reflexive_failT_eq1 [instance, in ITree.Events.FailFacts]
reflexive_suttF [lemma, in ITree.Eq.SimUpToTaus]
Reflexive_R:25 [binder, in ITree.Indexed.Relation]
Reflexive_i_pointwise [instance, in ITree.Indexed.Relation]
Reflexive_eqit_eq [instance, in ITree.Eq.Eqit]
Reflexive_eqit_gen_eq [instance, in ITree.Eq.Eqit]
Reflexive_eqit__eq [instance, in ITree.Eq.Eqit]
Reflexive_eqitF_eq [instance, in ITree.Eq.Eqit]
Reflexive_eqit [instance, in ITree.Eq.Eqit]
Reflexive_eqit_gen [instance, in ITree.Eq.Eqit]
Reflexive_eqit_ [instance, in ITree.Eq.Eqit]
Reflexive_eqitF [instance, in ITree.Eq.Eqit]
Relation [library]
RelationCompose [section, in ITree.Basics.HeterogeneousRelations]
RelationEqRel [section, in ITree.Basics.HeterogeneousRelations]
relationH [definition, in ITree.Basics.HeterogeneousRelations]
relationH_Equiv [instance, in ITree.Basics.HeterogeneousRelations]
relationH_Preorder [instance, in ITree.Basics.HeterogeneousRelations]
relationH_PER [instance, in ITree.Basics.HeterogeneousRelations]
relationH_transitive [instance, in ITree.Basics.HeterogeneousRelations]
relationH_symmetric [instance, in ITree.Basics.HeterogeneousRelations]
relationH_reflexive [instance, in ITree.Basics.HeterogeneousRelations]
relationH_of_Type [definition, in ITree.Basics.HeterogeneousRelations]
RelationH_Operations [section, in ITree.Basics.HeterogeneousRelations]
RelDec_string_Correct [instance, in ITree.Extra.Dijkstra.StateIOTrace]
RelDec_string [instance, in ITree.Extra.Dijkstra.StateIOTrace]
RelNotations [module, in ITree.Basics.HeterogeneousRelations]
_ ≡ _ (relationH_scope) [notation, in ITree.Basics.HeterogeneousRelations]
† _ (relationH_scope) [notation, in ITree.Basics.HeterogeneousRelations]
_ ⊑ _ (relationH_scope) [notation, in ITree.Basics.HeterogeneousRelations]
_ ⊗ _ (relationH_scope) [notation, in ITree.Basics.HeterogeneousRelations]
_ ⊕ _ (relationH_scope) [notation, in ITree.Basics.HeterogeneousRelations]
_ ∘ _ (relationH_scope) [notation, in ITree.Basics.HeterogeneousRelations]
rel_eventless [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
rel_rev [definition, in ITree.Extra.Dijkstra.IterRel]
rel_compose [definition, in ITree.Basics.HeterogeneousRelations]
REL1:421 [binder, in ITree.Eq.Eqit]
REL2:422 [binder, in ITree.Eq.Eqit]
REL:111 [binder, in ITree.Props.Leaf]
REL:15 [binder, in ITree.Eq.Eqit]
REL:158 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
REL:158 [binder, in ITree.Extra.Secure.SecureEqHalt]
REL:18 [binder, in ITree.Eq.Eqit]
REL:209 [binder, in ITree.Eq.Eqit]
REL:24 [binder, in ITree.Eq.Eqit]
REL:28 [binder, in ITree.Eq.Eqit]
REL:32 [binder, in ITree.Eq.Eqit]
REL:360 [binder, in ITree.Extra.IForest]
REL:677 [binder, in ITree.Eq.Eqit]
REL:95 [binder, in ITree.Eq.Rutt]
REL:99 [binder, in ITree.Extra.IForest]
remove [definition, in ITree.Events.Map]
Remove [constructor, in ITree.Events.Map]
remove [definition, in ITree.Events.MapDefault]
Remove [constructor, in ITree.Events.MapDefault]
remove_events_eqitE [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_events_eventless [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_events_eventless_equivE [lemma, in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_events [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_events' [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_from_:21 [binder, in ITree.Events.Nondeterminism]
remove_from [definition, in ITree.Events.Nondeterminism]
rer [constructor, in ITree.Extra.ITrace.ITraceDefinition]
rer_inv [lemma, in ITree.Extra.ITrace.ITraceFacts]
RESCHECK:150 [binder, in ITree.Extra.Secure.SecureStateHandler]
RESCHECK:167 [binder, in ITree.Extra.Secure.SecureStateHandler]
RESCHECK:58 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
RESCHECK:60 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
respectful_eutt [definition, in ITree.Interp.TranslateFacts]
respectful_eq_itree [definition, in ITree.Interp.TranslateFacts]
respect_public' [constructor, in ITree.Extra.Secure.SecureStateHandler]
respect_private_e [constructor, in ITree.Extra.Secure.SecureStateHandler]
respect_private_ne [constructor, in ITree.Extra.Secure.SecureStateHandler]
respect_public [constructor, in ITree.Extra.Secure.SecureStateHandler]
respect_private [constructor, in ITree.Extra.Secure.SecureStateHandler]
respect_public'' [constructor, in ITree.Extra.Secure.SecureStateHandlerPi]
respect_private' [constructor, in ITree.Extra.Secure.SecureStateHandlerPi]
resp_eutt_or [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
resp_eutt [abbreviation, in ITree.Extra.Dijkstra.PureITreeBasics]
resum [projection, in ITree.Basics.CategoryOps]
ReSum [record, in ITree.Basics.CategoryOps]
resum [constructor, in ITree.Basics.CategoryOps]
ReSum [inductive, in ITree.Basics.CategoryOps]
RESUM [section, in ITree.Basics.CategoryOps]
ReSum_empty [instance, in ITree.Basics.CategoryOps]
ReSum_inr [instance, in ITree.Basics.CategoryOps]
ReSum_inl [instance, in ITree.Basics.CategoryOps]
ReSum_sum [instance, in ITree.Basics.CategoryOps]
ReSum_id [instance, in ITree.Basics.CategoryOps]
resum_to_subevent [lemma, in ITree.Core.Subevent]
res:36 [binder, in ITree.Events.State]
Ret [abbreviation, in ITree.Core.ITreeDefinition]
RetBindCounter [section, in ITree.Extra.Dijkstra.ITreeDijkstra]
RetF [constructor, in ITree.Core.ITreeDefinition]
retpi [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
retpi_bindpi [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
retpi_amonot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
retpi_monot [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
RetTrans:102 [binder, in ITree.Extra.ITrace.ITracePreds]
Returns [inductive, in ITree.Extra.IForest]
ReturnsBind [section, in ITree.Extra.IForest]
ReturnsRet [constructor, in ITree.Extra.IForest]
ReturnsTau [constructor, in ITree.Extra.IForest]
ReturnsVis [constructor, in ITree.Extra.IForest]
Returns_divergent [lemma, in ITree.Extra.IForest]
Returns_vis_inversion [lemma, in ITree.Extra.IForest]
Returns_vis_inversion_ [lemma, in ITree.Extra.IForest]
Returns_bind_inversion [lemma, in ITree.Extra.IForest]
Returns_bind_inversion_ [lemma, in ITree.Extra.IForest]
Returns_bind [lemma, in ITree.Extra.IForest]
Returns_Ret [lemma, in ITree.Extra.IForest]
Returns_Ret_ [lemma, in ITree.Extra.IForest]
Returns_ret_inv [lemma, in ITree.Extra.IForest]
Returns_ret_inv_ [lemma, in ITree.Extra.IForest]
Returns_Vis_sub [lemma, in ITree.Extra.IForest]
Returns_eutt [instance, in ITree.Extra.IForest]
ret_ts2 [definition, in ITree.Extra.Dijkstra.TracesIT]
ret_ts1 [definition, in ITree.Extra.Dijkstra.TracesIT]
RET_EQ [definition, in ITree.Extra.IForest]
ret_bind [lemma, in ITree.Extra.IForest]
ret_itree [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
ret_prefix [constructor, in ITree.Extra.ITrace.ITracePrefix]
ret_pres [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
ret_traces [definition, in ITree.Interp.Traces]
ret_del [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
ret_not_div [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
REvRef [inductive, in ITree.Extra.ITrace.ITraceDefinition]
REvRef_inv [lemma, in ITree.Extra.ITrace.ITraceFacts]
REv:116 [binder, in ITree.Eq.Rutt]
REv:127 [binder, in ITree.Eq.Rutt]
REv:150 [binder, in ITree.Eq.Rutt]
REv:38 [binder, in ITree.Eq.Rutt]
REv:47 [binder, in ITree.Eq.Rutt]
REv:56 [binder, in ITree.Eq.Rutt]
REv:65 [binder, in ITree.Eq.Rutt]
REv:7 [binder, in ITree.Eq.Rutt]
REv:74 [binder, in ITree.Eq.Rutt]
RE:264 [binder, in ITree.Basics.HeterogeneousRelations]
RE:5 [binder, in ITree.Indexed.FunctionFacts]
RF:7 [binder, in ITree.Indexed.FunctionFacts]
rg:115 [binder, in ITree.Extra.Secure.SecureEqWcompat]
rg:135 [binder, in ITree.Eq.Rutt]
rg:158 [binder, in ITree.Eq.Rutt]
rg:212 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
rg:229 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
rg:260 [binder, in ITree.Eq.Eqit]
rg:279 [binder, in ITree.Eq.Eqit]
rg:28 [binder, in ITree.Eq.Paco2]
rg:476 [binder, in ITree.Eq.Eqit]
rg:492 [binder, in ITree.Eq.Eqit]
rg:500 [binder, in ITree.Eq.Eqit]
rg:514 [binder, in ITree.Eq.Eqit]
rg:522 [binder, in ITree.Eq.Eqit]
rg:536 [binder, in ITree.Eq.Eqit]
rg:60 [binder, in ITree.Extra.Secure.SecureEqWcompat]
rg:79 [binder, in ITree.Extra.Secure.SecureEqWcompat]
rg:99 [binder, in ITree.Extra.Secure.SecureEqWcompat]
rH:110 [binder, in ITree.Eq.UpToTaus]
rH:114 [binder, in ITree.Eq.UpToTaus]
rH:123 [binder, in ITree.Eq.UpToTaus]
rH:135 [binder, in ITree.Eq.UpToTaus]
rH:159 [binder, in ITree.Eq.UpToTaus]
rH:165 [binder, in ITree.Eq.UpToTaus]
rH:171 [binder, in ITree.Eq.UpToTaus]
rH:177 [binder, in ITree.Eq.UpToTaus]
rH:183 [binder, in ITree.Eq.UpToTaus]
rH:189 [binder, in ITree.Eq.UpToTaus]
rH:195 [binder, in ITree.Eq.UpToTaus]
rH:204 [binder, in ITree.Eq.UpToTaus]
rH:215 [binder, in ITree.Eq.UpToTaus]
rH:221 [binder, in ITree.Eq.UpToTaus]
rH:227 [binder, in ITree.Eq.UpToTaus]
rH:235 [binder, in ITree.Eq.UpToTaus]
rH:241 [binder, in ITree.Eq.UpToTaus]
rH:249 [binder, in ITree.Eq.UpToTaus]
rH:7 [binder, in ITree.Eq.UpToTaus]
Ring [constructor, in ITree.Extra.Dijkstra.ITreeDijkstra]
Rinv:22 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RI_i:56 [binder, in ITree.Core.KTreeFacts]
RI_i:39 [binder, in ITree.Core.KTreeFacts]
RI_i:24 [binder, in ITree.Core.KTreeFacts]
RI1:45 [binder, in ITree.Core.KTreeFacts]
RI2:46 [binder, in ITree.Core.KTreeFacts]
RI:15 [binder, in ITree.Core.KTreeFacts]
RI:30 [binder, in ITree.Core.KTreeFacts]
RI:92 [binder, in ITree.Events.StateFacts]
rL:111 [binder, in ITree.Eq.UpToTaus]
rL:115 [binder, in ITree.Eq.UpToTaus]
rL:124 [binder, in ITree.Eq.UpToTaus]
rL:136 [binder, in ITree.Eq.UpToTaus]
rL:160 [binder, in ITree.Eq.UpToTaus]
rL:166 [binder, in ITree.Eq.UpToTaus]
rL:172 [binder, in ITree.Eq.UpToTaus]
rL:178 [binder, in ITree.Eq.UpToTaus]
rL:184 [binder, in ITree.Eq.UpToTaus]
rL:190 [binder, in ITree.Eq.UpToTaus]
rL:196 [binder, in ITree.Eq.UpToTaus]
rL:205 [binder, in ITree.Eq.UpToTaus]
rL:216 [binder, in ITree.Eq.UpToTaus]
rL:222 [binder, in ITree.Eq.UpToTaus]
rL:228 [binder, in ITree.Eq.UpToTaus]
rL:242 [binder, in ITree.Eq.UpToTaus]
rL:250 [binder, in ITree.Eq.UpToTaus]
rL:8 [binder, in ITree.Eq.UpToTaus]
round_robin [definition, in ITree.Events.Concurrency]
rr_match [definition, in ITree.Events.Concurrency]
RR':182 [binder, in ITree.Eq.Eqit]
RR1:124 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR1:131 [binder, in ITree.Eq.Rutt]
RR1:154 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR1:154 [binder, in ITree.Extra.Secure.SecureEqHalt]
RR1:154 [binder, in ITree.Eq.Rutt]
RR1:156 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR1:169 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR1:182 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR1:19 [binder, in ITree.Eq.Shallow]
RR1:195 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR1:195 [binder, in ITree.Extra.Secure.SecureEqHalt]
RR1:195 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:205 [binder, in ITree.Eq.Eqit]
RR1:206 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR1:210 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:23 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
RR1:231 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:247 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:258 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:275 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:290 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:36 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR1:41 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
RR1:414 [binder, in ITree.Eq.Eqit]
RR1:432 [binder, in ITree.Eq.Eqit]
RR1:470 [binder, in ITree.Eq.Eqit]
RR1:496 [binder, in ITree.Eq.Eqit]
RR1:518 [binder, in ITree.Eq.Eqit]
RR1:54 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR1:540 [binder, in ITree.Eq.Eqit]
RR1:73 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR1:79 [binder, in ITree.Eq.UpToTaus]
RR1:9 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
RR1:91 [binder, in ITree.Eq.Rutt]
RR1:94 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR2:10 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
RR2:101 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:116 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:125 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR2:132 [binder, in ITree.Eq.Rutt]
RR2:134 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:151 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:155 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR2:155 [binder, in ITree.Extra.Secure.SecureEqHalt]
RR2:155 [binder, in ITree.Eq.Rutt]
RR2:165 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:170 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR2:183 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR2:196 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR2:196 [binder, in ITree.Extra.Secure.SecureEqHalt]
RR2:196 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:20 [binder, in ITree.Eq.Shallow]
RR2:206 [binder, in ITree.Eq.Eqit]
RR2:207 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR2:211 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:232 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:24 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
RR2:248 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:259 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:276 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:291 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:37 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR2:415 [binder, in ITree.Eq.Eqit]
RR2:42 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
RR2:433 [binder, in ITree.Eq.Eqit]
RR2:471 [binder, in ITree.Eq.Eqit]
RR2:497 [binder, in ITree.Eq.Eqit]
RR2:519 [binder, in ITree.Eq.Eqit]
RR2:541 [binder, in ITree.Eq.Eqit]
RR2:55 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR2:74 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR2:74 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:86 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:92 [binder, in ITree.Eq.Rutt]
RR2:95 [binder, in ITree.Extra.Secure.SecureEqWcompat]
rr:10 [binder, in ITree.Events.Concurrency]
rr:10 [binder, in ITree.Eq.Paco2]
RR:100 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:100 [binder, in ITree.Eq.SimUpToTaus]
RR:101 [binder, in ITree.Eq.UpToTaus]
RR:103 [binder, in ITree.Extra.Secure.SecureStateHandler]
RR:103 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:104 [binder, in ITree.Props.HasPost]
RR:11 [binder, in ITree.Eq.Rutt]
RR:110 [binder, in ITree.Eq.Eqit]
RR:111 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:111 [binder, in ITree.Extra.Secure.SecureStateHandler]
RR:119 [binder, in ITree.Extra.IForest]
RR:120 [binder, in ITree.Eq.Rutt]
RR:121 [binder, in ITree.Extra.Secure.SecureStateHandler]
RR:122 [binder, in ITree.Eq.UpToTaus]
RR:123 [binder, in ITree.Eq.Eqit]
RR:128 [binder, in ITree.Props.Leaf]
RR:129 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:130 [binder, in ITree.Extra.IForest]
RR:132 [binder, in ITree.Extra.Secure.SecureStateHandler]
RR:135 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:138 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR:138 [binder, in ITree.Extra.Secure.SecureEqHalt]
RR:138 [binder, in ITree.Extra.IForest]
RR:138 [binder, in ITree.Eq.Eqit]
RR:143 [binder, in ITree.Extra.IForest]
RR:144 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:145 [binder, in ITree.Extra.IForest]
RR:145 [binder, in ITree.Props.Leaf]
RR:145 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:15 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR:152 [binder, in ITree.Basics.HeterogeneousRelations]
RR:153 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:155 [binder, in ITree.Extra.IForest]
RR:158 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:16 [binder, in ITree.Core.KTreeFacts]
RR:164 [binder, in ITree.Extra.IForest]
RR:165 [binder, in ITree.Eq.Eqit]
RR:17 [binder, in ITree.Extra.Secure.SecureStateHandler]
RR:17 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:17 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
RR:170 [binder, in ITree.Extra.IForest]
RR:173 [binder, in ITree.Eq.Eqit]
RR:178 [binder, in ITree.Extra.Secure.SecureEqBind]
RR:178 [binder, in ITree.Extra.Secure.SecureStateHandler]
RR:180 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:181 [binder, in ITree.Eq.Eqit]
RR:182 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR:182 [binder, in ITree.Extra.Secure.SecureEqHalt]
RR:184 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:185 [binder, in ITree.Extra.IForest]
RR:189 [binder, in ITree.Basics.HeterogeneousRelations]
RR:191 [binder, in ITree.Extra.IForest]
RR:193 [binder, in ITree.Eq.Eqit]
RR:195 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:196 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:196 [binder, in ITree.Extra.IForest]
RR:202 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:209 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:214 [binder, in ITree.Extra.IForest]
RR:234 [binder, in ITree.Eq.UpToTaus]
RR:238 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:240 [binder, in ITree.Eq.UpToTaus]
RR:244 [binder, in ITree.Extra.IForest]
RR:246 [binder, in ITree.Eq.Eqit]
RR:248 [binder, in ITree.Eq.UpToTaus]
RR:250 [binder, in ITree.Extra.IForest]
RR:252 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:256 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:256 [binder, in ITree.Eq.UpToTaus]
RR:256 [binder, in ITree.Extra.IForest]
RR:258 [binder, in ITree.Basics.HeterogeneousRelations]
RR:26 [binder, in ITree.Eq.SimUpToTaus]
RR:26 [binder, in ITree.Extra.Secure.SecureEqBind]
RR:260 [binder, in ITree.Eq.UpToTaus]
RR:264 [binder, in ITree.Eq.UpToTaus]
RR:265 [binder, in ITree.Extra.IForest]
RR:268 [binder, in ITree.Eq.UpToTaus]
RR:269 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:272 [binder, in ITree.Eq.UpToTaus]
RR:277 [binder, in ITree.Extra.IForest]
RR:281 [binder, in ITree.Eq.UpToTaus]
RR:29 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:309 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:31 [binder, in ITree.Core.KTreeFacts]
RR:316 [binder, in ITree.Eq.Eqit]
RR:324 [binder, in ITree.Eq.Eqit]
RR:33 [binder, in ITree.Eq.SimUpToTaus]
rr:33 [binder, in ITree.Eq.Paco2]
RR:337 [binder, in ITree.Eq.Eqit]
RR:339 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:34 [binder, in ITree.Eq.UpToTaus]
RR:347 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:348 [binder, in ITree.Eq.Eqit]
RR:355 [binder, in ITree.Eq.Eqit]
RR:362 [binder, in ITree.Eq.Eqit]
RR:37 [binder, in ITree.Eq.SimUpToTaus]
RR:37 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
RR:370 [binder, in ITree.Eq.Eqit]
RR:389 [binder, in ITree.Eq.Eqit]
RR:396 [binder, in ITree.Eq.Eqit]
RR:4 [binder, in ITree.Eq.UpToTaus]
RR:4 [binder, in ITree.Eq.SimUpToTaus]
RR:40 [binder, in ITree.Eq.Rutt]
RR:41 [binder, in ITree.Eq.UpToTaus]
RR:424 [binder, in ITree.Eq.Eqit]
RR:43 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
RR:44 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR:44 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:447 [binder, in ITree.Eq.Eqit]
RR:456 [binder, in ITree.Eq.Eqit]
RR:46 [binder, in ITree.Extra.Secure.SecureEqBind]
RR:46 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:463 [binder, in ITree.Eq.Eqit]
RR:466 [binder, in ITree.Eq.Eqit]
RR:47 [binder, in ITree.Eq.SimUpToTaus]
RR:48 [binder, in ITree.Eq.UpToTaus]
RR:48 [binder, in ITree.Core.KTreeFacts]
RR:49 [binder, in ITree.Eq.Rutt]
RR:55 [binder, in ITree.Eq.UpToTaus]
RR:56 [binder, in ITree.Eq.SimUpToTaus]
RR:567 [binder, in ITree.Eq.Eqit]
RR:57 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:57 [binder, in ITree.Interp.TranslateFacts]
RR:574 [binder, in ITree.Eq.Eqit]
RR:58 [binder, in ITree.Eq.Rutt]
RR:58 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:581 [binder, in ITree.Eq.Eqit]
RR:59 [binder, in ITree.Interp.InterpFacts]
RR:6 [binder, in ITree.Extra.Secure.SecureEqBind]
RR:6 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RR:6 [binder, in ITree.Eq.Eqit]
RR:60 [binder, in ITree.Events.MapDefaultFacts]
RR:60 [binder, in ITree.Eq.Eqit]
RR:62 [binder, in ITree.Eq.SimUpToTaus]
RR:637 [binder, in ITree.Eq.Eqit]
RR:65 [binder, in ITree.Extra.Secure.SecureEqBind]
RR:67 [binder, in ITree.Eq.Rutt]
RR:68 [binder, in ITree.Eq.SimUpToTaus]
RR:7 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RR:7 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR:7 [binder, in ITree.Extra.Secure.SecureEqHalt]
RR:7 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
RR:708 [binder, in ITree.Eq.Eqit]
RR:72 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
RR:721 [binder, in ITree.Eq.Eqit]
RR:74 [binder, in ITree.Eq.SimUpToTaus]
RR:748 [binder, in ITree.Eq.Eqit]
RR:75 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:76 [binder, in ITree.Eq.Rutt]
RR:78 [binder, in ITree.Events.StateFacts]
RR:80 [binder, in ITree.Eq.SimUpToTaus]
RR:819 [binder, in ITree.Eq.Eqit]
RR:83 [binder, in ITree.Eq.Rutt]
RR:83 [binder, in ITree.Eq.Eqit]
RR:848 [binder, in ITree.Eq.Eqit]
RR:85 [binder, in ITree.Props.HasPost]
RR:86 [binder, in ITree.Eq.SimUpToTaus]
RR:88 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:884 [binder, in ITree.Eq.Eqit]
RR:9 [binder, in ITree.Eq.Shallow]
RR:911 [binder, in ITree.Eq.Eqit]
RR:916 [binder, in ITree.Eq.Eqit]
RR:92 [binder, in ITree.Eq.SimUpToTaus]
RR:921 [binder, in ITree.Eq.Eqit]
RR:928 [binder, in ITree.Eq.Eqit]
RR:93 [binder, in ITree.Extra.IForest]
RS_Eq:3 [binder, in ITree.Extra.Secure.SecureStateHandler]
RS_Eq:3 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
RS':288 [binder, in ITree.Eq.UpToTaus]
RS':295 [binder, in ITree.Eq.UpToTaus]
RS':302 [binder, in ITree.Eq.UpToTaus]
RS':309 [binder, in ITree.Eq.UpToTaus]
RS:104 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RS:112 [binder, in ITree.Props.Leaf]
RS:116 [binder, in ITree.Events.StateFacts]
RS:116 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RS:133 [binder, in ITree.Eq.Rutt]
RS:136 [binder, in ITree.Events.StateFacts]
RS:155 [binder, in ITree.Basics.HeterogeneousRelations]
RS:156 [binder, in ITree.Eq.Rutt]
RS:161 [binder, in ITree.Props.Leaf]
RS:162 [binder, in ITree.Basics.HeterogeneousRelations]
RS:181 [binder, in ITree.Basics.HeterogeneousRelations]
RS:2 [binder, in ITree.Extra.Secure.SecureStateHandler]
RS:2 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
RS:208 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RS:225 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RS:23 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
RS:236 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RS:245 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RS:260 [binder, in ITree.Basics.HeterogeneousRelations]
RS:27 [binder, in ITree.Extra.Secure.SecureEqBind]
RS:270 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
RS:287 [binder, in ITree.Eq.UpToTaus]
RS:294 [binder, in ITree.Eq.UpToTaus]
RS:300 [binder, in ITree.Basics.HeterogeneousRelations]
RS:301 [binder, in ITree.Eq.UpToTaus]
RS:306 [binder, in ITree.Basics.HeterogeneousRelations]
RS:308 [binder, in ITree.Eq.UpToTaus]
RS:340 [binder, in ITree.Extra.IForest]
RS:361 [binder, in ITree.Extra.IForest]
RS:388 [binder, in ITree.Extra.IForest]
RS:47 [binder, in ITree.Extra.Secure.SecureEqBind]
RS:472 [binder, in ITree.Eq.Eqit]
RS:488 [binder, in ITree.Eq.Eqit]
RS:498 [binder, in ITree.Eq.Eqit]
RS:512 [binder, in ITree.Eq.Eqit]
RS:520 [binder, in ITree.Eq.Eqit]
RS:534 [binder, in ITree.Eq.Eqit]
RS:542 [binder, in ITree.Eq.Eqit]
RS:556 [binder, in ITree.Eq.Eqit]
RS:56 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RS:561 [binder, in ITree.Eq.Eqit]
RS:66 [binder, in ITree.Extra.Secure.SecureEqBind]
RS:7 [binder, in ITree.Extra.Secure.SecureEqBind]
RS:711 [binder, in ITree.Eq.Eqit]
RS:75 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RS:751 [binder, in ITree.Eq.Eqit]
RS:93 [binder, in ITree.Events.StateFacts]
RS:96 [binder, in ITree.Extra.Secure.SecureEqWcompat]
RT:158 [binder, in ITree.Basics.HeterogeneousRelations]
RT:262 [binder, in ITree.Basics.HeterogeneousRelations]
RT:301 [binder, in ITree.Basics.HeterogeneousRelations]
RT:307 [binder, in ITree.Basics.HeterogeneousRelations]
run_map [definition, in ITree.Events.Map]
run_reader [definition, in ITree.Events.Reader]
run_writer [definition, in ITree.Events.Writer]
run_writer_list [definition, in ITree.Events.Writer]
run_writer_list_state [definition, in ITree.Events.Writer]
run_spawn [definition, in ITree.Events.Concurrency]
run_state [definition, in ITree.Events.State]
run:32 [binder, in ITree.Basics.Basics]
rutt [definition, in ITree.Eq.Rutt]
Rutt [library]
ruttF [inductive, in ITree.Eq.Rutt]
RuttF [section, in ITree.Eq.Rutt]
rutt_inv_Tau [lemma, in ITree.Eq.Rutt]
rutt_add_Tau_r [lemma, in ITree.Eq.Rutt]
rutt_inv_Tau_r [lemma, in ITree.Eq.Rutt]
rutt_add_Tau_l [lemma, in ITree.Eq.Rutt]
rutt_inv_Tau_l [lemma, in ITree.Eq.Rutt]
rutt_monot [lemma, in ITree.Eq.Rutt]
rutt_ [definition, in ITree.Eq.Rutt]
RU:103 [binder, in ITree.Props.Leaf]
RU:669 [binder, in ITree.Eq.Eqit]
r':140 [binder, in ITree.Extra.Secure.SecureStateHandler]
R':206 [binder, in ITree.Basics.HeterogeneousRelations]
r':24 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R':271 [binder, in ITree.Basics.HeterogeneousRelations]
r':28 [binder, in ITree.Extra.Secure.SecureStateHandler]
r':28 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
r':52 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R':66 [binder, in ITree.Props.EuttNoRet]
R':83 [binder, in ITree.Props.EuttNoRet]
r0:14 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
r0:198 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r0:236 [binder, in ITree.Extra.ITrace.ITraceBind]
r0:319 [binder, in ITree.Extra.ITrace.ITraceBind]
r0:49 [binder, in ITree.Extra.Dijkstra.IterRel]
r0:50 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:101 [binder, in ITree.Extra.Secure.SecureStateHandler]
R1:102 [binder, in ITree.Props.HasPost]
r1:104 [binder, in ITree.Eq.Rutt]
r1:106 [binder, in ITree.Eq.SimUpToTaus]
R1:106 [binder, in ITree.Eq.Shallow]
R1:108 [binder, in ITree.Eq.Eqit]
R1:109 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:109 [binder, in ITree.Eq.SimUpToTaus]
R1:109 [binder, in ITree.Extra.Secure.SecureStateHandler]
R1:11 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R1:112 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R1:112 [binder, in ITree.Eq.Rutt]
r1:116 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:12 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:120 [binder, in ITree.Eq.UpToTaus]
R1:121 [binder, in ITree.Eq.Rutt]
R1:121 [binder, in ITree.Eq.Eqit]
R1:122 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:126 [binder, in ITree.Props.Leaf]
R1:127 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:13 [binder, in ITree.Core.KTreeFacts]
R1:13 [binder, in ITree.Extra.Secure.SecureStateHandler]
r1:13 [binder, in ITree.Eq.Eqit]
R1:13 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R1:133 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r1:133 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:136 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:136 [binder, in ITree.Extra.Secure.SecureEqHalt]
R1:136 [binder, in ITree.Eq.Eqit]
R1:142 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:143 [binder, in ITree.Props.Leaf]
R1:143 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:144 [binder, in ITree.Eq.Rutt]
R1:146 [binder, in ITree.Eq.Eqit]
R1:149 [binder, in ITree.Eq.Eqit]
r1:15 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r1:15 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
r1:15 [binder, in ITree.Extra.Secure.SecureEqHalt]
r1:15 [binder, in ITree.Eq.Rutt]
R1:151 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:152 [binder, in ITree.Eq.Eqit]
R1:153 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r1:153 [binder, in ITree.Simple]
R1:155 [binder, in ITree.Eq.Eqit]
R1:156 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:16 [binder, in ITree.Eq.UpToTaus]
r1:160 [binder, in ITree.Simple]
R1:163 [binder, in ITree.Eq.Eqit]
R1:166 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:17 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R1:17 [binder, in ITree.Eq.Shallow]
r1:17 [binder, in ITree.Simple]
r1:171 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
r1:171 [binder, in ITree.Extra.Secure.SecureEqHalt]
R1:171 [binder, in ITree.Eq.Eqit]
R1:172 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:175 [binder, in ITree.Basics.HeterogeneousRelations]
R1:176 [binder, in ITree.Extra.Secure.SecureEqBind]
R1:176 [binder, in ITree.Extra.Secure.SecureStateHandler]
r1:179 [binder, in ITree.Extra.Secure.SecureEqBind]
R1:179 [binder, in ITree.Eq.Eqit]
r1:18 [binder, in ITree.Extra.ITrace.ITraceFacts]
R1:180 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:180 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:180 [binder, in ITree.Extra.Secure.SecureEqHalt]
R1:182 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:187 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:188 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:191 [binder, in ITree.Eq.Eqit]
R1:193 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:193 [binder, in ITree.Extra.Secure.SecureEqHalt]
R1:193 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:194 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:2 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:2 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:2 [binder, in ITree.Extra.Secure.SecureEqHalt]
R1:2 [binder, in ITree.Eq.UpToTaus]
R1:2 [binder, in ITree.Eq.SimUpToTaus]
R1:2 [binder, in ITree.Extra.Secure.StrongBisimProper]
R1:2 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:200 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:203 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:204 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:207 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:22 [binder, in ITree.Eq.UpToTaus]
R1:22 [binder, in ITree.Extra.Secure.SecureStateHandler]
R1:22 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
r1:222 [binder, in ITree.Eq.Eqit]
R1:223 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:227 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:23 [binder, in ITree.Events.MapDefaultFacts]
R1:232 [binder, in ITree.Eq.UpToTaus]
R1:234 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:236 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:237 [binder, in ITree.Eq.Eqit]
R1:238 [binder, in ITree.Eq.UpToTaus]
R1:24 [binder, in ITree.Extra.Secure.SecureEqBind]
r1:24 [binder, in ITree.Extra.Secure.SecureStateHandler]
R1:24 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r1:24 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R1:243 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:243 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:246 [binder, in ITree.Eq.UpToTaus]
R1:250 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:254 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:254 [binder, in ITree.Eq.UpToTaus]
R1:256 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r1:257 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r1:257 [binder, in ITree.Extra.IForest]
R1:258 [binder, in ITree.Eq.UpToTaus]
r1:26 [binder, in ITree.Eq.Shallow]
R1:262 [binder, in ITree.Eq.UpToTaus]
R1:265 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:266 [binder, in ITree.Eq.UpToTaus]
R1:270 [binder, in ITree.Eq.UpToTaus]
R1:271 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r1:275 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:279 [binder, in ITree.Eq.UpToTaus]
R1:28 [binder, in ITree.Core.KTreeFacts]
R1:28 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
r1:282 [binder, in ITree.Eq.UpToTaus]
R1:287 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r1:29 [binder, in ITree.Eq.SimUpToTaus]
R1:3 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R1:3 [binder, in ITree.Eq.Rutt]
R1:307 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:31 [binder, in ITree.Eq.SimUpToTaus]
R1:313 [binder, in ITree.Eq.UpToTaus]
R1:314 [binder, in ITree.Eq.Eqit]
R1:316 [binder, in ITree.Eq.UpToTaus]
r1:319 [binder, in ITree.Eq.Eqit]
R1:32 [binder, in ITree.Eq.UpToTaus]
R1:322 [binder, in ITree.Eq.Eqit]
R1:328 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:335 [binder, in ITree.Eq.Eqit]
R1:336 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:345 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:346 [binder, in ITree.Eq.Eqit]
R1:35 [binder, in ITree.Eq.SimUpToTaus]
R1:353 [binder, in ITree.Eq.Eqit]
R1:36 [binder, in ITree.Eq.Rutt]
R1:360 [binder, in ITree.Eq.Eqit]
R1:368 [binder, in ITree.Eq.Eqit]
R1:38 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
r1:380 [binder, in ITree.Eq.Eqit]
r1:384 [binder, in ITree.Eq.Eqit]
R1:387 [binder, in ITree.Eq.Eqit]
R1:39 [binder, in ITree.Eq.UpToTaus]
R1:394 [binder, in ITree.Eq.Eqit]
R1:4 [binder, in ITree.Extra.Secure.SecureEqBind]
R1:4 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R1:4 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:4 [binder, in ITree.Eq.Eqit]
R1:41 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:411 [binder, in ITree.Eq.Eqit]
r1:416 [binder, in ITree.Eq.Eqit]
R1:42 [binder, in ITree.Extra.Secure.SecureEqBind]
R1:42 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R1:42 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:429 [binder, in ITree.Eq.Eqit]
R1:43 [binder, in ITree.Core.KTreeFacts]
R1:45 [binder, in ITree.Eq.SimUpToTaus]
R1:45 [binder, in ITree.Eq.Rutt]
R1:46 [binder, in ITree.Eq.UpToTaus]
R1:468 [binder, in ITree.Eq.Eqit]
R1:47 [binder, in ITree.Eq.Shallow]
R1:486 [binder, in ITree.Eq.Eqit]
R1:494 [binder, in ITree.Eq.Eqit]
r1:50 [binder, in ITree.Extra.Dijkstra.IterRel]
R1:510 [binder, in ITree.Eq.Eqit]
R1:516 [binder, in ITree.Eq.Eqit]
R1:52 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R1:53 [binder, in ITree.Eq.UpToTaus]
R1:532 [binder, in ITree.Eq.Eqit]
R1:538 [binder, in ITree.Eq.Eqit]
R1:54 [binder, in ITree.Eq.SimUpToTaus]
R1:54 [binder, in ITree.Eq.Rutt]
R1:55 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R1:554 [binder, in ITree.Eq.Eqit]
R1:56 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
r1:58 [binder, in ITree.Extra.Secure.SecureEqBind]
R1:58 [binder, in ITree.Eq.Eqit]
R1:60 [binder, in ITree.Core.KTreeFacts]
R1:60 [binder, in ITree.Eq.SimUpToTaus]
R1:61 [binder, in ITree.Extra.Secure.SecureEqBind]
r1:62 [binder, in ITree.Extra.ITrace.ITraceFacts]
R1:63 [binder, in ITree.Eq.Rutt]
R1:635 [binder, in ITree.Eq.Eqit]
R1:66 [binder, in ITree.Eq.SimUpToTaus]
r1:660 [binder, in ITree.Eq.Eqit]
r1:67 [binder, in ITree.Eq.UpToTaus]
r1:69 [binder, in ITree.Eq.UpToTaus]
R1:7 [binder, in ITree.Eq.Shallow]
R1:70 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R1:704 [binder, in ITree.Eq.Eqit]
r1:71 [binder, in ITree.Eq.UpToTaus]
R1:71 [binder, in ITree.Extra.Secure.SecureEqWcompat]
r1:716 [binder, in ITree.Eq.Eqit]
R1:719 [binder, in ITree.Eq.Eqit]
R1:72 [binder, in ITree.Eq.SimUpToTaus]
R1:72 [binder, in ITree.Eq.Rutt]
R1:73 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:744 [binder, in ITree.Eq.Eqit]
R1:75 [binder, in ITree.Props.EuttNoRet]
r1:756 [binder, in ITree.Eq.Eqit]
r1:76 [binder, in ITree.Extra.Secure.SecureEqBind]
R1:78 [binder, in ITree.Eq.SimUpToTaus]
R1:8 [binder, in ITree.Eq.EuttExtras]
r1:8 [binder, in ITree.Eq.SimUpToTaus]
r1:8 [binder, in ITree.Simple]
R1:81 [binder, in ITree.Eq.Rutt]
R1:81 [binder, in ITree.Eq.Eqit]
R1:817 [binder, in ITree.Eq.Eqit]
R1:83 [binder, in ITree.Props.HasPost]
R1:84 [binder, in ITree.Eq.SimUpToTaus]
R1:86 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:90 [binder, in ITree.Eq.SimUpToTaus]
R1:909 [binder, in ITree.Eq.Eqit]
R1:914 [binder, in ITree.Eq.Eqit]
R1:919 [binder, in ITree.Eq.Eqit]
R1:92 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R1:926 [binder, in ITree.Eq.Eqit]
R1:96 [binder, in ITree.Eq.SimUpToTaus]
r1:97 [binder, in ITree.Extra.IForest]
R1:98 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R1:98 [binder, in ITree.Eq.Shallow]
R1:99 [binder, in ITree.Eq.UpToTaus]
R1:99 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:100 [binder, in ITree.Eq.UpToTaus]
R2:100 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:100 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:102 [binder, in ITree.Extra.Secure.SecureStateHandler]
R2:103 [binder, in ITree.Props.HasPost]
r2:105 [binder, in ITree.Eq.Rutt]
r2:107 [binder, in ITree.Eq.SimUpToTaus]
R2:107 [binder, in ITree.Eq.Shallow]
R2:109 [binder, in ITree.Eq.Eqit]
R2:110 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:110 [binder, in ITree.Eq.SimUpToTaus]
R2:110 [binder, in ITree.Extra.Secure.SecureStateHandler]
R2:113 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R2:113 [binder, in ITree.Eq.Rutt]
R2:115 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r2:117 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:12 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R2:121 [binder, in ITree.Eq.UpToTaus]
R2:122 [binder, in ITree.Eq.Rutt]
R2:122 [binder, in ITree.Eq.Eqit]
R2:123 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:127 [binder, in ITree.Props.Leaf]
R2:128 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:13 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:133 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:134 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r2:134 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:137 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:137 [binder, in ITree.Extra.Secure.SecureEqHalt]
R2:137 [binder, in ITree.Eq.Eqit]
R2:14 [binder, in ITree.Core.KTreeFacts]
R2:14 [binder, in ITree.Extra.Secure.SecureStateHandler]
r2:14 [binder, in ITree.Eq.Eqit]
R2:14 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R2:143 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:144 [binder, in ITree.Props.Leaf]
R2:144 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:145 [binder, in ITree.Eq.Rutt]
R2:147 [binder, in ITree.Eq.Eqit]
R2:150 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:150 [binder, in ITree.Eq.Eqit]
R2:152 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:153 [binder, in ITree.Eq.Eqit]
r2:154 [binder, in ITree.Simple]
R2:155 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:156 [binder, in ITree.Eq.Eqit]
R2:157 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r2:16 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r2:16 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
r2:16 [binder, in ITree.Extra.Secure.SecureEqHalt]
r2:16 [binder, in ITree.Eq.Rutt]
r2:161 [binder, in ITree.Simple]
R2:164 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:164 [binder, in ITree.Eq.Eqit]
R2:167 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r2:17 [binder, in ITree.Eq.UpToTaus]
r2:172 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
r2:172 [binder, in ITree.Extra.Secure.SecureEqHalt]
R2:172 [binder, in ITree.Eq.Eqit]
R2:173 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:176 [binder, in ITree.Basics.HeterogeneousRelations]
R2:177 [binder, in ITree.Extra.Secure.SecureEqBind]
R2:177 [binder, in ITree.Extra.Secure.SecureStateHandler]
R2:18 [binder, in ITree.Eq.Shallow]
r2:18 [binder, in ITree.Simple]
r2:180 [binder, in ITree.Extra.Secure.SecureEqBind]
R2:180 [binder, in ITree.Eq.Eqit]
R2:181 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:181 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:181 [binder, in ITree.Extra.Secure.SecureEqHalt]
R2:183 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r2:188 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r2:19 [binder, in ITree.Extra.ITrace.ITraceFacts]
R2:192 [binder, in ITree.Eq.Eqit]
R2:194 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:194 [binder, in ITree.Extra.Secure.SecureEqHalt]
R2:194 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:194 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:195 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:201 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:205 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:208 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:209 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:22 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
r2:223 [binder, in ITree.Eq.Eqit]
R2:224 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:228 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r2:23 [binder, in ITree.Eq.UpToTaus]
R2:23 [binder, in ITree.Extra.Secure.SecureStateHandler]
R2:23 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:23 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R2:233 [binder, in ITree.Eq.UpToTaus]
R2:235 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:237 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r2:238 [binder, in ITree.Eq.Eqit]
R2:239 [binder, in ITree.Eq.UpToTaus]
R2:24 [binder, in ITree.Events.MapDefaultFacts]
R2:244 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:244 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:247 [binder, in ITree.Eq.UpToTaus]
R2:25 [binder, in ITree.Extra.Secure.SecureEqBind]
r2:25 [binder, in ITree.Extra.Secure.SecureStateHandler]
r2:25 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R2:251 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:255 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:255 [binder, in ITree.Eq.UpToTaus]
R2:257 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r2:258 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:259 [binder, in ITree.Eq.UpToTaus]
r2:260 [binder, in ITree.Extra.IForest]
R2:263 [binder, in ITree.Eq.UpToTaus]
R2:266 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:267 [binder, in ITree.Eq.UpToTaus]
r2:27 [binder, in ITree.Eq.Shallow]
R2:271 [binder, in ITree.Eq.UpToTaus]
R2:272 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r2:276 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:280 [binder, in ITree.Eq.UpToTaus]
r2:283 [binder, in ITree.Eq.UpToTaus]
R2:288 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:29 [binder, in ITree.Core.KTreeFacts]
R2:29 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:3 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:3 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:3 [binder, in ITree.Extra.Secure.SecureEqHalt]
R2:3 [binder, in ITree.Eq.UpToTaus]
R2:3 [binder, in ITree.Eq.SimUpToTaus]
R2:3 [binder, in ITree.Extra.Secure.StrongBisimProper]
R2:3 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:308 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:314 [binder, in ITree.Eq.UpToTaus]
R2:315 [binder, in ITree.Eq.Eqit]
R2:317 [binder, in ITree.Eq.UpToTaus]
R2:32 [binder, in ITree.Eq.SimUpToTaus]
r2:320 [binder, in ITree.Eq.Eqit]
R2:323 [binder, in ITree.Eq.Eqit]
R2:33 [binder, in ITree.Eq.UpToTaus]
R2:336 [binder, in ITree.Eq.Eqit]
R2:337 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:346 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:347 [binder, in ITree.Eq.Eqit]
R2:354 [binder, in ITree.Eq.Eqit]
R2:36 [binder, in ITree.Eq.SimUpToTaus]
R2:361 [binder, in ITree.Eq.Eqit]
R2:369 [binder, in ITree.Eq.Eqit]
R2:37 [binder, in ITree.Eq.Rutt]
r2:381 [binder, in ITree.Eq.Eqit]
r2:385 [binder, in ITree.Eq.Eqit]
R2:388 [binder, in ITree.Eq.Eqit]
R2:39 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R2:395 [binder, in ITree.Eq.Eqit]
R2:4 [binder, in ITree.Eq.Rutt]
R2:40 [binder, in ITree.Eq.UpToTaus]
R2:40 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:412 [binder, in ITree.Eq.Eqit]
r2:420 [binder, in ITree.Eq.Eqit]
R2:43 [binder, in ITree.Extra.Secure.SecureEqBind]
R2:43 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R2:43 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:430 [binder, in ITree.Eq.Eqit]
R2:44 [binder, in ITree.Core.KTreeFacts]
R2:46 [binder, in ITree.Eq.SimUpToTaus]
R2:46 [binder, in ITree.Eq.Rutt]
R2:469 [binder, in ITree.Eq.Eqit]
R2:47 [binder, in ITree.Eq.UpToTaus]
R2:48 [binder, in ITree.Eq.Shallow]
R2:487 [binder, in ITree.Eq.Eqit]
R2:495 [binder, in ITree.Eq.Eqit]
R2:5 [binder, in ITree.Extra.Secure.SecureEqBind]
R2:5 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R2:5 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:5 [binder, in ITree.Eq.Eqit]
R2:511 [binder, in ITree.Eq.Eqit]
R2:517 [binder, in ITree.Eq.Eqit]
R2:53 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R2:533 [binder, in ITree.Eq.Eqit]
R2:539 [binder, in ITree.Eq.Eqit]
R2:54 [binder, in ITree.Eq.UpToTaus]
R2:55 [binder, in ITree.Eq.SimUpToTaus]
R2:55 [binder, in ITree.Eq.Rutt]
R2:555 [binder, in ITree.Eq.Eqit]
R2:56 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:57 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
r2:59 [binder, in ITree.Extra.Secure.SecureEqBind]
R2:59 [binder, in ITree.Eq.Eqit]
R2:61 [binder, in ITree.Core.KTreeFacts]
R2:61 [binder, in ITree.Eq.SimUpToTaus]
R2:62 [binder, in ITree.Extra.Secure.SecureEqBind]
r2:63 [binder, in ITree.Extra.ITrace.ITraceFacts]
R2:636 [binder, in ITree.Eq.Eqit]
R2:64 [binder, in ITree.Eq.Rutt]
r2:661 [binder, in ITree.Eq.Eqit]
R2:67 [binder, in ITree.Eq.SimUpToTaus]
r2:68 [binder, in ITree.Eq.UpToTaus]
r2:70 [binder, in ITree.Eq.UpToTaus]
R2:705 [binder, in ITree.Eq.Eqit]
R2:71 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
r2:717 [binder, in ITree.Eq.Eqit]
r2:72 [binder, in ITree.Eq.UpToTaus]
R2:72 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R2:720 [binder, in ITree.Eq.Eqit]
R2:73 [binder, in ITree.Eq.SimUpToTaus]
R2:73 [binder, in ITree.Eq.Rutt]
R2:73 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:74 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:745 [binder, in ITree.Eq.Eqit]
r2:757 [binder, in ITree.Eq.Eqit]
R2:76 [binder, in ITree.Props.EuttNoRet]
r2:77 [binder, in ITree.Extra.Secure.SecureEqBind]
R2:79 [binder, in ITree.Eq.SimUpToTaus]
R2:8 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R2:8 [binder, in ITree.Eq.Shallow]
R2:818 [binder, in ITree.Eq.Eqit]
R2:82 [binder, in ITree.Eq.Rutt]
R2:82 [binder, in ITree.Eq.Eqit]
R2:84 [binder, in ITree.Props.HasPost]
R2:85 [binder, in ITree.Eq.SimUpToTaus]
R2:85 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R2:87 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:9 [binder, in ITree.Eq.EuttExtras]
r2:9 [binder, in ITree.Eq.SimUpToTaus]
r2:9 [binder, in ITree.Simple]
R2:91 [binder, in ITree.Eq.SimUpToTaus]
R2:910 [binder, in ITree.Eq.Eqit]
R2:915 [binder, in ITree.Eq.Eqit]
R2:920 [binder, in ITree.Eq.Eqit]
R2:927 [binder, in ITree.Eq.Eqit]
R2:93 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R2:97 [binder, in ITree.Eq.SimUpToTaus]
r2:98 [binder, in ITree.Extra.IForest]
R2:99 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R2:99 [binder, in ITree.Eq.Shallow]
R3:108 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:126 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:144 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:158 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:16 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R3:168 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R3:187 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:2 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R3:202 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:229 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:245 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:273 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:289 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:30 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R3:40 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R3:413 [binder, in ITree.Eq.Eqit]
r3:417 [binder, in ITree.Eq.Eqit]
R3:431 [binder, in ITree.Eq.Eqit]
R3:66 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:78 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R3:93 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R:10 [binder, in ITree.Interp.Recursion]
R:100 [binder, in ITree.Extra.ITrace.ITraceBind]
r:100 [binder, in ITree.Eq.Shallow]
R:100 [binder, in ITree.Basics.HeterogeneousRelations]
r:101 [binder, in ITree.Extra.ITrace.ITraceBind]
R:101 [binder, in ITree.Props.Finite]
R:101 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:101 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:102 [binder, in ITree.Basics.HeterogeneousRelations]
r:103 [binder, in ITree.Eq.UpToTaus]
R:103 [binder, in ITree.Interp.Traces]
R:104 [binder, in ITree.Basics.Basics]
R:104 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:104 [binder, in ITree.Interp.InterpFacts]
R:104 [binder, in ITree.Basics.HeterogeneousRelations]
R:105 [binder, in ITree.Props.Finite]
r:106 [binder, in ITree.Eq.UpToTaus]
R:107 [binder, in ITree.Extra.ITrace.ITraceBind]
R:107 [binder, in ITree.Basics.HeterogeneousRelations]
r:108 [binder, in ITree.Extra.ITrace.ITraceBind]
r:108 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:108 [binder, in ITree.Interp.Traces]
R:108 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:109 [binder, in ITree.Eq.UpToTaus]
r:11 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R:11 [binder, in ITree.Extra.ITrace.ITraceDefinition]
R:11 [binder, in ITree.Interp.Handler]
r:11 [binder, in ITree.Events.Reader]
R:110 [binder, in ITree.Basics.HeterogeneousRelations]
r:110 [binder, in ITree.Extra.ITrace.ITracePreds]
R:111 [binder, in ITree.Extra.ITrace.ITraceBind]
r:111 [binder, in ITree.Eq.SimUpToTaus]
r:111 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
r:112 [binder, in ITree.Extra.ITrace.ITraceBind]
R:112 [binder, in ITree.Eq.Shallow]
r:114 [binder, in ITree.Extra.Secure.SecureEqWcompat]
r:115 [binder, in ITree.Core.KTreeFacts]
R:115 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:116 [binder, in ITree.Extra.ITrace.ITraceBind]
R:116 [binder, in ITree.Basics.HeterogeneousRelations]
R:117 [binder, in ITree.Props.HasPost]
R:117 [binder, in ITree.Props.Finite]
R:117 [binder, in ITree.Interp.Traces]
R:118 [binder, in ITree.Extra.IForest]
r:118 [binder, in ITree.Extra.Secure.SecureEqBind]
R:12 [binder, in ITree.Events.Exception]
R:12 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r:12 [binder, in ITree.Basics.CategoryRelations]
R:12 [binder, in ITree.Interp.Interp]
R:121 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:121 [binder, in ITree.Interp.Traces]
R:122 [binder, in ITree.Props.Finite]
R:122 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:122 [binder, in ITree.Basics.HeterogeneousRelations]
R:123 [binder, in ITree.Interp.Traces]
r:124 [binder, in ITree.Extra.ITrace.ITraceBind]
R:124 [binder, in ITree.Props.Finite]
R:125 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:128 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:128 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:129 [binder, in ITree.Extra.IForest]
R:13 [binder, in ITree.Events.ExceptionFacts]
R:13 [binder, in ITree.Events.StateFacts]
r:13 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
R:13 [binder, in ITree.Extra.ITrace.ITraceDefinition]
R:13 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R:13 [binder, in ITree.Interp.InterpFacts]
R:13 [binder, in ITree.Basics.HeterogeneousRelations]
R:130 [binder, in ITree.Props.Finite]
r:130 [binder, in ITree.Interp.Traces]
R:130 [binder, in ITree.Simple]
R:132 [binder, in ITree.Extra.ITrace.ITraceBind]
r:132 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:132 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:132 [binder, in ITree.Simple]
r:133 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:134 [binder, in ITree.Interp.Traces]
r:134 [binder, in ITree.Eq.Rutt]
R:134 [binder, in ITree.Simple]
r:135 [binder, in ITree.Interp.Traces]
R:135 [binder, in ITree.Extra.Secure.SecureStateHandler]
R:136 [binder, in ITree.Props.Finite]
R:136 [binder, in ITree.Basics.HeterogeneousRelations]
R:136 [binder, in ITree.Simple]
R:137 [binder, in ITree.Extra.IForest]
R:139 [binder, in ITree.Extra.ITrace.ITraceBind]
R:139 [binder, in ITree.Basics.HeterogeneousRelations]
R:14 [binder, in ITree.Interp.RecursionFacts]
R:14 [binder, in ITree.Core.ITreeDefinition]
R:140 [binder, in ITree.Simple]
R:142 [binder, in ITree.Extra.IForest]
R:143 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:143 [binder, in ITree.Extra.Secure.SecureEqBind]
R:143 [binder, in ITree.Simple]
R:144 [binder, in ITree.Extra.IForest]
R:144 [binder, in ITree.Basics.HeterogeneousRelations]
R:145 [binder, in ITree.Extra.ITrace.ITraceBind]
R:146 [binder, in ITree.Extra.IForest]
r:147 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
r:147 [binder, in ITree.Extra.Secure.SecureEqHalt]
R:148 [binder, in ITree.Simple]
R:149 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:15 [binder, in ITree.Extra.Dijkstra.TracesIT]
R:15 [binder, in ITree.Extra.ITrace.ITraceBind]
R:15 [binder, in ITree.Props.Leaf]
R:15 [binder, in ITree.Interp.Traces]
r:150 [binder, in ITree.Extra.IForest]
R:150 [binder, in ITree.Props.Finite]
R:150 [binder, in ITree.Simple]
R:151 [binder, in ITree.Basics.HeterogeneousRelations]
R:152 [binder, in ITree.Extra.ITrace.ITraceBind]
R:154 [binder, in ITree.Extra.IForest]
R:154 [binder, in ITree.Basics.HeterogeneousRelations]
R:155 [binder, in ITree.Extra.ITrace.ITraceBind]
R:155 [binder, in ITree.Props.Finite]
R:155 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:157 [binder, in ITree.Eq.Rutt]
R:157 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:157 [binder, in ITree.Basics.HeterogeneousRelations]
R:158 [binder, in ITree.Props.Leaf]
r:159 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:16 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:16 [binder, in ITree.Extra.ITrace.ITracePreds]
R:161 [binder, in ITree.Props.Finite]
R:161 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:161 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:161 [binder, in ITree.Basics.HeterogeneousRelations]
r:161 [binder, in ITree.Eq.Eqit]
R:163 [binder, in ITree.Extra.IForest]
R:163 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:164 [binder, in ITree.Extra.ITrace.ITraceBind]
R:166 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:166 [binder, in ITree.Basics.HeterogeneousRelations]
r:167 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:168 [binder, in ITree.Simple]
R:169 [binder, in ITree.Extra.IForest]
r:169 [binder, in ITree.Eq.Eqit]
R:17 [binder, in ITree.Eq.EuttExtras]
R:17 [binder, in ITree.Interp.TranslateFacts]
R:170 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r:170 [binder, in ITree.Simple]
R:171 [binder, in ITree.Extra.Secure.SecureStateHandler]
R:172 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:172 [binder, in ITree.Basics.HeterogeneousRelations]
R:173 [binder, in ITree.Extra.ITrace.ITraceBind]
R:173 [binder, in ITree.Props.Finite]
R:173 [binder, in ITree.Simple]
R:174 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:176 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:177 [binder, in ITree.Extra.ITrace.ITraceBind]
R:178 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:178 [binder, in ITree.Simple]
R:179 [binder, in ITree.Props.Finite]
R:18 [binder, in ITree.Props.Leaf]
R:18 [binder, in ITree.Interp.HandlerFacts]
R:180 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:180 [binder, in ITree.Basics.HeterogeneousRelations]
R:181 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:183 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:184 [binder, in ITree.Extra.IForest]
R:184 [binder, in ITree.Props.Finite]
R:184 [binder, in ITree.Basics.HeterogeneousRelations]
R:186 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:186 [binder, in ITree.Simple]
R:187 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:187 [binder, in ITree.Basics.HeterogeneousRelations]
R:188 [binder, in ITree.Props.Finite]
r:188 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:189 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:19 [binder, in ITree.Props.EuttNoRet]
R:19 [binder, in ITree.Core.Subevent]
R:19 [binder, in ITree.Basics.HeterogeneousRelations]
R:190 [binder, in ITree.Extra.ITrace.ITraceBind]
R:190 [binder, in ITree.Extra.IForest]
R:190 [binder, in ITree.Simple]
r:191 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:191 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:195 [binder, in ITree.Extra.IForest]
R:195 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:196 [binder, in ITree.Simple]
r:197 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r:198 [binder, in ITree.Eq.Eqit]
R:199 [binder, in ITree.Simple]
R:2 [binder, in ITree.Eq.EqAxiom]
R:2 [binder, in ITree.Eq.EuttExtras]
R:2 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:2 [binder, in ITree.Extra.Dijkstra.IterRel]
R:2 [binder, in ITree.Interp.Traces]
R:2 [binder, in ITree.Extra.ITrace.ITracePreds]
R:2 [binder, in ITree.Core.ITreeDefinition]
R:2 [binder, in ITree.Simple]
R:20 [binder, in ITree.Events.ExceptionFacts]
R:20 [binder, in ITree.Events.StateFacts]
r:20 [binder, in ITree.Basics.Basics]
R:20 [binder, in ITree.Interp.Traces]
R:20 [binder, in ITree.Interp.InterpFacts]
R:201 [binder, in ITree.Extra.ITrace.ITraceBind]
r:201 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:203 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:205 [binder, in ITree.Basics.HeterogeneousRelations]
R:206 [binder, in ITree.Extra.IForest]
R:206 [binder, in ITree.Simple]
R:21 [binder, in ITree.Interp.Interp]
R:210 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:211 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R:211 [binder, in ITree.Extra.ITrace.ITraceBind]
R:211 [binder, in ITree.Simple]
r:212 [binder, in ITree.Extra.ITrace.ITraceBind]
r:212 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R:213 [binder, in ITree.Extra.IForest]
R:213 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:215 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:215 [binder, in ITree.Basics.HeterogeneousRelations]
R:216 [binder, in ITree.Simple]
R:22 [binder, in ITree.Events.Exception]
R:22 [binder, in ITree.Extra.ITrace.ITraceDefinition]
R:22 [binder, in ITree.Basics.CategoryRelations]
R:22 [binder, in ITree.Extra.ITrace.ITracePreds]
R:220 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:221 [binder, in ITree.Extra.ITrace.ITraceBind]
R:221 [binder, in ITree.Extra.IForest]
R:222 [binder, in ITree.Basics.HeterogeneousRelations]
R:224 [binder, in ITree.Simple]
r:226 [binder, in ITree.Extra.ITrace.ITraceBind]
R:226 [binder, in ITree.Eq.UpToTaus]
r:226 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:228 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
r:228 [binder, in ITree.Extra.ITrace.ITraceBind]
R:228 [binder, in ITree.Extra.IForest]
R:229 [binder, in ITree.Basics.HeterogeneousRelations]
R:229 [binder, in ITree.Simple]
r:23 [binder, in ITree.Basics.Basics]
R:23 [binder, in ITree.Indexed.Function]
R:23 [binder, in ITree.Basics.HeterogeneousRelations]
R:230 [binder, in ITree.Extra.ITrace.ITraceBind]
r:232 [binder, in ITree.Extra.ITrace.ITraceBind]
r:234 [binder, in ITree.Simple]
R:24 [binder, in ITree.Events.StateFacts]
r:24 [binder, in ITree.Interp.Traces]
R:240 [binder, in ITree.Basics.HeterogeneousRelations]
R:241 [binder, in ITree.Extra.ITrace.ITraceBind]
r:243 [binder, in ITree.Extra.ITrace.ITraceBind]
R:243 [binder, in ITree.Extra.IForest]
R:243 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:245 [binder, in ITree.Eq.Eqit]
R:249 [binder, in ITree.Extra.IForest]
R:25 [binder, in ITree.Extra.ITrace.ITraceBind]
r:25 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
R:25 [binder, in ITree.Eq.SimUpToTaus]
R:25 [binder, in ITree.Interp.InterpFacts]
R:25 [binder, in ITree.Interp.TranslateFacts]
R:252 [binder, in ITree.Basics.HeterogeneousRelations]
R:255 [binder, in ITree.Extra.IForest]
R:256 [binder, in ITree.Basics.HeterogeneousRelations]
R:257 [binder, in ITree.Extra.ITrace.ITraceBind]
R:258 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r:259 [binder, in ITree.Extra.ITrace.ITraceBind]
r:259 [binder, in ITree.Eq.Eqit]
R:26 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:26 [binder, in ITree.Extra.Secure.SecureStateHandler]
r:26 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
R:26 [binder, in ITree.Extra.ITrace.ITracePreds]
R:26 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R:263 [binder, in ITree.Simple]
R:264 [binder, in ITree.Extra.IForest]
R:264 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:265 [binder, in ITree.Eq.Eqit]
R:265 [binder, in ITree.Simple]
R:267 [binder, in ITree.Simple]
R:269 [binder, in ITree.Extra.ITrace.ITraceBind]
R:269 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:269 [binder, in ITree.Simple]
R:27 [binder, in ITree.Events.ExceptionFacts]
r:27 [binder, in ITree.Interp.HandlerFacts]
R:27 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:27 [binder, in ITree.Eq.Paco2]
R:27 [binder, in ITree.Simple]
R:270 [binder, in ITree.Basics.HeterogeneousRelations]
r:271 [binder, in ITree.Extra.ITrace.ITraceBind]
R:272 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:273 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:273 [binder, in ITree.Simple]
R:276 [binder, in ITree.Extra.IForest]
R:276 [binder, in ITree.Simple]
r:278 [binder, in ITree.Eq.Eqit]
R:279 [binder, in ITree.Extra.ITrace.ITraceBind]
R:28 [binder, in ITree.Props.Finite]
R:28 [binder, in ITree.Props.Infinite]
r:281 [binder, in ITree.Extra.ITrace.ITraceBind]
R:281 [binder, in ITree.Simple]
R:284 [binder, in ITree.Basics.HeterogeneousRelations]
R:285 [binder, in ITree.Eq.UpToTaus]
R:285 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
r:29 [binder, in ITree.Events.StateFacts]
R:29 [binder, in ITree.Props.Leaf]
R:29 [binder, in ITree.Props.EuttNoRet]
R:29 [binder, in ITree.Extra.Secure.SecureStateHandler]
R:29 [binder, in ITree.Eq.Shallow]
r:29 [binder, in ITree.Simple]
R:29 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
R:290 [binder, in ITree.Extra.ITrace.ITraceBind]
r:292 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
R:292 [binder, in ITree.Eq.UpToTaus]
r:292 [binder, in ITree.Eq.Eqit]
R:296 [binder, in ITree.Basics.HeterogeneousRelations]
R:297 [binder, in ITree.Eq.Eqit]
R:298 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
R:299 [binder, in ITree.Eq.UpToTaus]
R:299 [binder, in ITree.Basics.HeterogeneousRelations]
r:299 [binder, in ITree.Eq.Eqit]
R:3 [binder, in ITree.Events.ExceptionFacts]
r:3 [binder, in ITree.Eq.EuttExtras]
R:3 [binder, in ITree.Interp.InterpFacts]
R:3 [binder, in ITree.Interp.Interp]
R:3 [binder, in ITree.Interp.TranslateFacts]
R:30 [binder, in ITree.Extra.ITrace.ITraceBind]
R:30 [binder, in ITree.Events.ExceptionFacts]
r:30 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
R:30 [binder, in ITree.Interp.InterpFacts]
r:30 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R:30 [binder, in ITree.Interp.TranslateFacts]
R:30 [binder, in ITree.Extra.ITrace.ITracePreds]
R:301 [binder, in ITree.Eq.Eqit]
R:304 [binder, in ITree.Extra.ITrace.ITraceBind]
R:305 [binder, in ITree.Basics.HeterogeneousRelations]
R:306 [binder, in ITree.Eq.UpToTaus]
R:309 [binder, in ITree.Eq.Eqit]
R:31 [binder, in ITree.Props.Finite]
r:31 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
R:310 [binder, in ITree.Extra.ITrace.ITraceBind]
R:317 [binder, in ITree.Extra.ITrace.ITraceBind]
R:318 [binder, in ITree.Extra.IForest]
R:318 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
r:32 [binder, in ITree.Basics.Function]
r:32 [binder, in ITree.Basics.CategoryKleisli]
R:32 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:32 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
r:321 [binder, in ITree.Extra.ITrace.ITraceBind]
R:321 [binder, in ITree.Basics.HeterogeneousRelations]
R:323 [binder, in ITree.Extra.ITrace.ITraceBind]
R:323 [binder, in ITree.Extra.IForest]
R:329 [binder, in ITree.Extra.IForest]
R:33 [binder, in ITree.Events.ExceptionFacts]
R:33 [binder, in ITree.Props.Leaf]
R:33 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:33 [binder, in ITree.Simple]
R:332 [binder, in ITree.Extra.ITrace.ITraceBind]
r:333 [binder, in ITree.Extra.IForest]
R:337 [binder, in ITree.Extra.IForest]
r:344 [binder, in ITree.Extra.IForest]
R:346 [binder, in ITree.Extra.IForest]
R:35 [binder, in ITree.Props.Finite]
R:35 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:35 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:35 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
R:35 [binder, in ITree.Interp.InterpFacts]
r:350 [binder, in ITree.Extra.IForest]
r:36 [binder, in ITree.Eq.UpToTaus]
R:36 [binder, in ITree.Interp.Traces]
R:36 [binder, in ITree.Core.ITreeDefinition]
R:37 [binder, in ITree.Events.ExceptionFacts]
r:37 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:37 [binder, in ITree.Extra.ITrace.ITracePreds]
R:375 [binder, in ITree.Extra.IForest]
R:379 [binder, in ITree.Eq.Eqit]
r:38 [binder, in ITree.Events.ExceptionFacts]
R:38 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:38 [binder, in ITree.Extra.Secure.SecureStateHandler]
r:383 [binder, in ITree.Extra.IForest]
R:383 [binder, in ITree.Eq.Eqit]
R:385 [binder, in ITree.Extra.IForest]
R:39 [binder, in ITree.Interp.Traces]
r:39 [binder, in ITree.Extra.Secure.SecureStateHandler]
R:39 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:39 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
r:39 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
r:395 [binder, in ITree.Extra.IForest]
R:4 [binder, in ITree.Extra.ITrace.ITraceBind]
r:4 [binder, in ITree.Events.ExceptionFacts]
R:4 [binder, in ITree.Axioms]
R:4 [binder, in ITree.Events.StateFacts]
R:4 [binder, in ITree.Interp.Recursion]
R:4 [binder, in ITree.Interp.InterpFacts]
R:4 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
R:4 [binder, in ITree.Interp.RecursionFacts]
R:40 [binder, in ITree.Props.Finite]
R:401 [binder, in ITree.Eq.Eqit]
R:404 [binder, in ITree.Eq.Eqit]
R:407 [binder, in ITree.Eq.Eqit]
R:41 [binder, in ITree.Extra.ITrace.ITraceBind]
R:41 [binder, in ITree.Events.ExceptionFacts]
r:41 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:41 [binder, in ITree.Extra.ITrace.ITracePreds]
R:41 [binder, in ITree.Events.State]
R:42 [binder, in ITree.Events.FailFacts]
R:42 [binder, in ITree.Interp.Handler]
r:42 [binder, in ITree.Extra.Dijkstra.IterRel]
R:42 [binder, in ITree.Simple]
R:423 [binder, in ITree.Eq.Eqit]
r:43 [binder, in ITree.Eq.UpToTaus]
R:43 [binder, in ITree.Props.Finite]
R:43 [binder, in ITree.Props.EuttNoRet]
R:43 [binder, in ITree.Interp.InterpFacts]
R:44 [binder, in ITree.Interp.Traces]
R:44 [binder, in ITree.Extra.Secure.SecureStateHandler]
R:44 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:446 [binder, in ITree.Eq.Eqit]
R:45 [binder, in ITree.Events.ExceptionFacts]
R:45 [binder, in ITree.Extra.ITrace.ITraceDefinition]
R:45 [binder, in ITree.Interp.Handler]
R:45 [binder, in ITree.Extra.ITrace.ITracePreds]
R:45 [binder, in ITree.Core.ITreeDefinition]
R:451 [binder, in ITree.Eq.Eqit]
R:455 [binder, in ITree.Eq.Eqit]
R:459 [binder, in ITree.Eq.Eqit]
R:46 [binder, in ITree.Basics.Basics]
r:46 [binder, in ITree.Extra.Dijkstra.IterRel]
r:46 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:462 [binder, in ITree.Eq.Eqit]
R:465 [binder, in ITree.Eq.Eqit]
R:47 [binder, in ITree.Props.Finite]
r:47 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
R:47 [binder, in ITree.Simple]
R:47 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
r:475 [binder, in ITree.Eq.Eqit]
R:48 [binder, in ITree.Interp.Traces]
R:48 [binder, in ITree.Events.MapDefaultFacts]
R:49 [binder, in ITree.Events.FailFacts]
R:49 [binder, in ITree.Events.StateFacts]
R:49 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:49 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:491 [binder, in ITree.Eq.Eqit]
r:499 [binder, in ITree.Eq.Eqit]
r:5 [binder, in ITree.Extra.Secure.StrongBisimProper]
R:5 [binder, in ITree.Events.Nondeterminism]
r:5 [binder, in ITree.Basics.CategoryRelations]
r:5 [binder, in ITree.Eq.Paco2]
R:50 [binder, in ITree.Extra.ITrace.ITraceBind]
R:50 [binder, in ITree.Interp.InterpFacts]
R:50 [binder, in ITree.Interp.TranslateFacts]
R:50 [binder, in ITree.Interp.RecursionFacts]
R:51 [binder, in ITree.Events.ExceptionFacts]
R:51 [binder, in ITree.Core.ITreeDefinition]
r:513 [binder, in ITree.Eq.Eqit]
R:52 [binder, in ITree.Props.Finite]
R:52 [binder, in ITree.Props.Leaf]
R:52 [binder, in ITree.Interp.Traces]
R:52 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:521 [binder, in ITree.Eq.Eqit]
r:53 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:53 [binder, in ITree.Extra.Secure.SecureEqBind]
r:53 [binder, in ITree.Simple]
r:535 [binder, in ITree.Eq.Eqit]
r:54 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
R:55 [binder, in ITree.Events.FailFacts]
R:55 [binder, in ITree.Eq.Shallow]
R:55 [binder, in ITree.Core.ITreeDefinition]
R:56 [binder, in ITree.Extra.ITrace.ITraceBind]
r:56 [binder, in ITree.Eq.UpToTaus]
R:56 [binder, in ITree.Props.Finite]
R:56 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:56 [binder, in ITree.Interp.Traces]
R:560 [binder, in ITree.Eq.Eqit]
R:564 [binder, in ITree.Eq.Eqit]
R:566 [binder, in ITree.Eq.Eqit]
R:57 [binder, in ITree.Events.ExceptionFacts]
R:57 [binder, in ITree.Events.StateFacts]
R:57 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:57 [binder, in ITree.Events.MapDefaultFacts]
R:57 [binder, in ITree.Extra.ITrace.ITracePreds]
R:57 [binder, in ITree.Core.ITreeDefinition]
R:57 [binder, in ITree.Simple]
R:573 [binder, in ITree.Eq.Eqit]
r:58 [binder, in ITree.Extra.ITrace.ITraceBind]
r:58 [binder, in ITree.Eq.UpToTaus]
R:58 [binder, in ITree.Interp.InterpFacts]
R:58 [binder, in ITree.Basics.CategoryRelations]
R:58 [binder, in ITree.Basics.HeterogeneousRelations]
R:580 [binder, in ITree.Eq.Eqit]
R:582 [binder, in ITree.Extra.IForest]
R:588 [binder, in ITree.Eq.Eqit]
R:589 [binder, in ITree.Extra.IForest]
r:59 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:59 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R:59 [binder, in ITree.Eq.Shallow]
R:59 [binder, in ITree.Events.State]
R:599 [binder, in ITree.Eq.Eqit]
r:6 [binder, in ITree.Eq.UpToTaus]
r:6 [binder, in ITree.Core.ITreeDefinition]
R:60 [binder, in ITree.Interp.Traces]
R:60 [binder, in ITree.Basics.HeterogeneousRelations]
R:60 [binder, in ITree.Core.ITreeDefinition]
r:601 [binder, in ITree.Eq.Eqit]
R:604 [binder, in ITree.Eq.Eqit]
R:609 [binder, in ITree.Eq.Eqit]
r:61 [binder, in ITree.Eq.UpToTaus]
r:61 [binder, in ITree.Extra.Dijkstra.IterRel]
R:61 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:617 [binder, in ITree.Eq.Eqit]
R:62 [binder, in ITree.Extra.ITrace.ITraceBind]
r:62 [binder, in ITree.Eq.UpToTaus]
R:62 [binder, in ITree.Events.ExceptionFacts]
R:62 [binder, in ITree.Extra.ITrace.ITracePreds]
R:63 [binder, in ITree.Interp.InterpFacts]
r:631 [binder, in ITree.Extra.IForest]
R:631 [binder, in ITree.Eq.Eqit]
r:635 [binder, in ITree.Extra.IForest]
r:636 [binder, in ITree.Extra.IForest]
r:64 [binder, in ITree.Eq.UpToTaus]
R:64 [binder, in ITree.Events.FailFacts]
r:64 [binder, in ITree.Events.ExceptionFacts]
R:64 [binder, in ITree.Simple]
r:640 [binder, in ITree.Extra.IForest]
R:65 [binder, in ITree.Props.HasPost]
R:65 [binder, in ITree.Props.EuttNoRet]
R:65 [binder, in ITree.Eq.Shallow]
R:65 [binder, in ITree.Basics.HeterogeneousRelations]
R:65 [binder, in ITree.Extra.ITrace.ITracePreds]
R:65 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
r:66 [binder, in ITree.Extra.ITrace.ITraceBind]
r:66 [binder, in ITree.Eq.UpToTaus]
R:66 [binder, in ITree.Props.Leaf]
r:66 [binder, in ITree.Extra.Dijkstra.IterRel]
r:664 [binder, in ITree.Eq.Eqit]
R:67 [binder, in ITree.Props.Finite]
R:67 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:67 [binder, in ITree.Interp.InterpFacts]
r:68 [binder, in ITree.Extra.Dijkstra.TracesIT]
R:68 [binder, in ITree.Extra.ITrace.ITraceBind]
R:68 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:68 [binder, in ITree.Eq.Shallow]
R:68 [binder, in ITree.Extra.ITrace.ITracePreds]
r:69 [binder, in ITree.Extra.Dijkstra.TracesIT]
R:69 [binder, in ITree.Events.ExceptionFacts]
R:696 [binder, in ITree.Eq.Eqit]
R:7 [binder, in ITree.Eq.EqAxiom]
r:7 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:7 [binder, in ITree.Events.Reader]
R:7 [binder, in ITree.Interp.InterpFacts]
R:7 [binder, in ITree.Basics.HeterogeneousRelations]
R:70 [binder, in ITree.Interp.Traces]
r:70 [binder, in ITree.Eq.Shallow]
R:70 [binder, in ITree.Simple]
R:700 [binder, in ITree.Eq.Eqit]
R:71 [binder, in ITree.Props.Finite]
R:71 [binder, in ITree.Basics.HeterogeneousRelations]
R:72 [binder, in ITree.Events.FailFacts]
r:72 [binder, in ITree.Events.ExceptionFacts]
r:72 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
R:72 [binder, in ITree.Props.Infinite]
R:72 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:72 [binder, in ITree.Interp.InterpFacts]
r:73 [binder, in ITree.Eq.UpToTaus]
R:73 [binder, in ITree.Core.KTreeFacts]
R:73 [binder, in ITree.Eq.Shallow]
R:734 [binder, in ITree.Eq.Eqit]
R:739 [binder, in ITree.Eq.Eqit]
R:74 [binder, in ITree.Props.Leaf]
R:74 [binder, in ITree.Interp.InterpFacts]
R:75 [binder, in ITree.Extra.ITrace.ITraceBind]
R:759 [binder, in ITree.Eq.Eqit]
r:76 [binder, in ITree.Extra.ITrace.ITraceBind]
R:76 [binder, in ITree.Events.ExceptionFacts]
R:76 [binder, in ITree.Interp.Traces]
R:76 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:76 [binder, in ITree.Simple]
R:764 [binder, in ITree.Eq.Eqit]
R:768 [binder, in ITree.Eq.Eqit]
R:77 [binder, in ITree.Events.StateFacts]
R:77 [binder, in ITree.Interp.InterpFacts]
r:77 [binder, in ITree.Extra.ITrace.ITracePreds]
r:772 [binder, in ITree.Eq.Eqit]
R:774 [binder, in ITree.Eq.Eqit]
R:78 [binder, in ITree.Extra.ITrace.ITraceBind]
r:78 [binder, in ITree.Extra.Secure.SecureEqWcompat]
R:78 [binder, in ITree.Eq.Shallow]
R:78 [binder, in ITree.Basics.HeterogeneousRelations]
r:780 [binder, in ITree.Eq.Eqit]
R:782 [binder, in ITree.Eq.Eqit]
R:79 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:79 [binder, in ITree.Extra.Secure.SecureStateHandler]
R:790 [binder, in ITree.Eq.Eqit]
R:8 [binder, in ITree.Events.ExceptionFacts]
R:8 [binder, in ITree.Interp.Traces]
R:8 [binder, in ITree.Interp.InterpFacts]
r:80 [binder, in ITree.Events.ExceptionFacts]
R:80 [binder, in ITree.Interp.Traces]
R:81 [binder, in ITree.Props.Leaf]
R:81 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:81 [binder, in ITree.Core.ITreeDefinition]
R:82 [binder, in ITree.Props.EuttNoRet]
R:82 [binder, in ITree.Extra.Secure.SecureStateHandler]
R:82 [binder, in ITree.Interp.InterpFacts]
R:83 [binder, in ITree.Events.ExceptionFacts]
R:83 [binder, in ITree.Events.StateFacts]
R:83 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:83 [binder, in ITree.Basics.HeterogeneousRelations]
R:84 [binder, in ITree.Extra.ITrace.ITraceBind]
R:84 [binder, in ITree.Props.Finite]
R:84 [binder, in ITree.Props.Infinite]
R:84 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:84 [binder, in ITree.Interp.Traces]
r:84 [binder, in ITree.Eq.Rutt]
r:84 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:84 [binder, in ITree.Extra.ITrace.ITracePreds]
R:85 [binder, in ITree.Simple]
r:86 [binder, in ITree.Eq.UpToTaus]
r:86 [binder, in ITree.Props.Infinite]
R:86 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:87 [binder, in ITree.Events.ExceptionFacts]
r:87 [binder, in ITree.Extra.ITrace.ITracePrefix]
r:87 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:88 [binder, in ITree.Eq.UpToTaus]
R:88 [binder, in ITree.Basics.HeterogeneousRelations]
r:89 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
r:9 [binder, in ITree.Interp.TranslateFacts]
R:9 [binder, in ITree.Interp.RecursionFacts]
r:9 [binder, in ITree.Extra.ITrace.ITracePreds]
R:90 [binder, in ITree.Extra.ITrace.ITraceBind]
R:90 [binder, in ITree.Extra.ITrace.ITraceFacts]
r:91 [binder, in ITree.Eq.UpToTaus]
r:91 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:91 [binder, in ITree.Simple]
R:92 [binder, in ITree.Extra.ITrace.ITraceBind]
R:92 [binder, in ITree.Extra.IForest]
R:92 [binder, in ITree.Interp.Traces]
R:92 [binder, in ITree.Interp.InterpFacts]
R:92 [binder, in ITree.Extra.ITrace.ITracePreds]
r:93 [binder, in ITree.Extra.Secure.SecureEqBind]
R:94 [binder, in ITree.Props.Leaf]
R:94 [binder, in ITree.Extra.ITrace.ITraceFacts]
R:94 [binder, in ITree.Eq.Shallow]
R:95 [binder, in ITree.Basics.Basics]
R:95 [binder, in ITree.Extra.ITrace.ITracePrefix]
R:96 [binder, in ITree.Events.FailFacts]
r:96 [binder, in ITree.Events.ExceptionFacts]
R:96 [binder, in ITree.Props.Finite]
R:96 [binder, in ITree.Basics.CategoryRelations]
r:96 [binder, in ITree.Simple]
r:97 [binder, in ITree.Eq.UpToTaus]
R:97 [binder, in ITree.Interp.InterpFacts]
R:97 [binder, in ITree.Extra.ITrace.ITracePreds]
r:98 [binder, in ITree.Extra.ITrace.ITraceBind]
r:98 [binder, in ITree.Props.Leaf]
r:98 [binder, in ITree.Extra.Secure.SecureEqWcompat]
r:99 [binder, in ITree.Basics.Basics]

S

sab:17 [binder, in ITree.Basics.MonadState]
sab:21 [binder, in ITree.Basics.MonadState]
sa:10 [binder, in ITree.Basics.MonadState]
sa:11 [binder, in ITree.Basics.MonadState]
sa:12 [binder, in ITree.Basics.MonadState]
sa:26 [binder, in ITree.Basics.MonadState]
sa:34 [binder, in ITree.Basics.Basics]
sa:43 [binder, in ITree.Basics.Basics]
sa:59 [binder, in ITree.Basics.MonadState]
sa:9 [binder, in ITree.Basics.MonadState]
sbc:60 [binder, in ITree.Basics.MonadState]
sbif:17 [binder, in ITree.Basics.CategorySub]
SECCHECK1:101 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK1:101 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK1:49 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK1:51 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK1:51 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK1:91 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK1:91 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK2:102 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK2:102 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK2:50 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK2:52 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK2:52 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK2:92 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK2:92 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:145 [binder, in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:149 [binder, in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:155 [binder, in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:161 [binder, in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:166 [binder, in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:29 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:29 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:29 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:35 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:35 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:35 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:41 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:42 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:42 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:57 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
SECCHECK:58 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:59 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
SECCHECK:62 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:62 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:65 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:70 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:70 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:77 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:77 [binder, in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:83 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:83 [binder, in ITree.Extra.Secure.SecureEqHalt]
secEqRet [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqRet [constructor, in ITree.Extra.Secure.SecureEqHalt]
secEqTau [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqTau [constructor, in ITree.Extra.Secure.SecureEqHalt]
secEqTauL [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqTauL [constructor, in ITree.Extra.Secure.SecureEqHalt]
secEqTauR [constructor, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqTauR [constructor, in ITree.Extra.Secure.SecureEqHalt]
secret_halt_trans_3 [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
secret_halt_trans_2 [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
secret_halt_trans_1 [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
SecureEqBind [library]
SecureEqEuttHalt [library]
SecureEqEuttTrans [library]
SecureEqHalt [library]
SecureEqHaltProgInsens [library]
SecureEqProgInsens [library]
SecureEqProgInsensFacts [library]
SecureEqWcompat [library]
SecureProgInsens [section, in ITree.Extra.Secure.SecureEqProgInsens]
SecureStateHandler [library]
SecureStateHandlerPi [library]
SecureUntimed [section, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SecureUntimed [section, in ITree.Extra.Secure.SecureEqHalt]
SecureUntimedUnReflexive [section, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SecureUntimedUnReflexive [section, in ITree.Extra.Secure.SecureEqHalt]
SecureUntimedUnReflexive.eqit_secureC [section, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SecureUntimedUnReflexive.eqit_secureC [section, in ITree.Extra.Secure.SecureEqHalt]
secure_eqit_iter [lemma, in ITree.Extra.Secure.SecureEqProgInsens]
secure_eqit_mon [lemma, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqit_mono [lemma, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqitF_mono [lemma, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqit_ [definition, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqitF [inductive, in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqit_mon [lemma, in ITree.Extra.Secure.SecureEqHalt]
secure_eqit_mono [lemma, in ITree.Extra.Secure.SecureEqHalt]
secure_eqitF_mono [lemma, in ITree.Extra.Secure.SecureEqHalt]
secure_eqit_ [definition, in ITree.Extra.Secure.SecureEqHalt]
secure_eqitF [inductive, in ITree.Extra.Secure.SecureEqHalt]
secure_eqit_ret [lemma, in ITree.Extra.Secure.SecureEqBind]
secure_eqit_iter [lemma, in ITree.Extra.Secure.SecureEqBind]
secure_eqit_bind [lemma, in ITree.Extra.Secure.SecureEqBind]
secure_eqit_bind' [lemma, in ITree.Extra.Secure.SecureEqBind]
secure_in_empty_context [definition, in ITree.Extra.Secure.SecureStateHandler]
secure_in_nonempty_context [definition, in ITree.Extra.Secure.SecureStateHandler]
secure_in_empty_context [definition, in ITree.Extra.Secure.SecureStateHandlerPi]
secure_in_nonempty_context [definition, in ITree.Extra.Secure.SecureStateHandlerPi]
SEF:35 [binder, in ITree.Core.Subevent]
SemiIso [record, in ITree.Basics.CategoryTheory]
SemiIso [inductive, in ITree.Basics.CategoryTheory]
SemiIso [section, in ITree.Basics.CategoryTheory]
SemiIso_g:43 [binder, in ITree.Basics.CategoryFacts]
SemiIso_f:41 [binder, in ITree.Basics.CategoryFacts]
SemiIso_Bimap [instance, in ITree.Basics.CategoryFacts]
SemiIso_g:24 [binder, in ITree.Basics.CategoryFacts]
SemiIso_f:21 [binder, in ITree.Basics.CategoryFacts]
SemiIso_Cat [instance, in ITree.Basics.CategoryFacts]
SemiIso_Id [instance, in ITree.Basics.CategoryFacts]
semi_iso [projection, in ITree.Basics.CategoryTheory]
semi_iso [constructor, in ITree.Basics.CategoryTheory]
SE:265 [binder, in ITree.Basics.HeterogeneousRelations]
SFG:36 [binder, in ITree.Core.Subevent]
Shallow [library]
silent_terminates_eqit_secure_ret [lemma, in ITree.Extra.Secure.SecureStateHandler]
silent_diverges_eqit_secure_spin [lemma, in ITree.Extra.Secure.SecureStateHandler]
silent_terminates_eqit_secure_ret [lemma, in ITree.Extra.Secure.SecureStateHandlerPi]
Simple [module, in ITree.Simple]
Simple [library]
SimpleTheory [module, in ITree.Simple]
SimpleTheory.bind_bind [axiom, in ITree.Simple]
SimpleTheory.bind_ret_r [axiom, in ITree.Simple]
SimpleTheory.bind_vis [axiom, in ITree.Simple]
SimpleTheory.bind_ret [axiom, in ITree.Simple]
SimpleTheory.EquivalenceUpToTaus [section, in ITree.Simple]
_ ≈ _ (type_scope) [notation, in ITree.Simple]
SimpleTheory.Equivalence_eutt [instance, in ITree.Simple]
SimpleTheory.eutt [axiom, in ITree.Simple]
SimpleTheory.eutt_interp [instance, in ITree.Simple]
SimpleTheory.eutt_map [instance, in ITree.Simple]
SimpleTheory.eutt_bind [instance, in ITree.Simple]
SimpleTheory.eutt_VisF [instance, in ITree.Simple]
SimpleTheory.eutt_TauF [instance, in ITree.Simple]
SimpleTheory.eutt_observe [instance, in ITree.Simple]
SimpleTheory.eutt_go [instance, in ITree.Simple]
SimpleTheory.eutt_inv_vis [axiom, in ITree.Simple]
SimpleTheory.eutt_inv_ret [axiom, in ITree.Simple]
SimpleTheory.eutt_vis [axiom, in ITree.Simple]
SimpleTheory.eutt_ret [axiom, in ITree.Simple]
SimpleTheory.interp_mrecursive [axiom, in ITree.Simple]
SimpleTheory.interp_recursive_call [axiom, in ITree.Simple]
SimpleTheory.interp_bind [axiom, in ITree.Simple]
SimpleTheory.interp_trigger [axiom, in ITree.Simple]
SimpleTheory.interp_vis [axiom, in ITree.Simple]
SimpleTheory.interp_ret [axiom, in ITree.Simple]
SimpleTheory.itree_eta [axiom, in ITree.Simple]
SimpleTheory.mrecursive [definition, in ITree.Simple]
SimpleTheory.mrec_as_interp [axiom, in ITree.Simple]
SimpleTheory.recursive [definition, in ITree.Simple]
SimpleTheory.rec_as_interp [axiom, in ITree.Simple]
SimpleTheory.tau_eutt [axiom, in ITree.Simple]
SimpleTheory.unfold_interp [axiom, in ITree.Simple]
SimpleTheory._interp [definition, in ITree.Simple]
_ ≈ _ [notation, in ITree.Simple]
Simple.bind_bind [lemma, in ITree.Simple]
Simple.bind_ret_r [lemma, in ITree.Simple]
Simple.bind_vis [lemma, in ITree.Simple]
Simple.bind_tau [lemma, in ITree.Simple]
Simple.bind_ret [lemma, in ITree.Simple]
Simple.EquivalenceUpToTaus [section, in ITree.Simple]
_ ≈ _ (type_scope) [notation, in ITree.Simple]
Simple.Equivalence_eutt [instance, in ITree.Simple]
Simple.eutt [definition, in ITree.Simple]
Simple.eutt_interp [instance, in ITree.Simple]
Simple.eutt_map [instance, in ITree.Simple]
Simple.eutt_bind [instance, in ITree.Simple]
Simple.eutt_VisF [instance, in ITree.Simple]
Simple.eutt_TauF [instance, in ITree.Simple]
Simple.eutt_observe [instance, in ITree.Simple]
Simple.eutt_go [instance, in ITree.Simple]
Simple.eutt_inv_vis [lemma, in ITree.Simple]
Simple.eutt_inv_ret [lemma, in ITree.Simple]
Simple.eutt_vis [lemma, in ITree.Simple]
Simple.eutt_ret [lemma, in ITree.Simple]
Simple.interp_mrecursive [lemma, in ITree.Simple]
Simple.interp_recursive_call [lemma, in ITree.Simple]
Simple.interp_bind [lemma, in ITree.Simple]
Simple.interp_trigger [lemma, in ITree.Simple]
Simple.interp_vis [lemma, in ITree.Simple]
Simple.interp_ret [lemma, in ITree.Simple]
Simple.itree_eta [lemma, in ITree.Simple]
Simple.mrecursive [definition, in ITree.Simple]
Simple.mrec_as_interp [lemma, in ITree.Simple]
Simple.recursive [definition, in ITree.Simple]
Simple.rec_as_interp [lemma, in ITree.Simple]
Simple.tau_eutt [lemma, in ITree.Simple]
Simple.unfold_interp [lemma, in ITree.Simple]
Simple._interp [definition, in ITree.Simple]
_ ≈ _ [notation, in ITree.Simple]
simpobs [lemma, in ITree.Eq.Eqit]
SimStep [constructor, in ITree.Interp.Traces]
simulates [inductive, in ITree.Interp.Traces]
simulates_trace_incl [lemma, in ITree.Interp.Traces]
SimUpToTaus [library]
sim':11 [binder, in ITree.Extra.Dijkstra.IterRel]
sim':120 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim':120 [binder, in ITree.Extra.Secure.SecureEqHalt]
sim':123 [binder, in ITree.Extra.IForest]
sim':155 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim':18 [binder, in ITree.Props.Infinite]
sim':46 [binder, in ITree.Eq.Eqit]
sim':48 [binder, in ITree.Props.Infinite]
sim':82 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
sim:10 [binder, in ITree.Extra.Dijkstra.IterRel]
sim:10 [binder, in ITree.Eq.Eqit]
sim:109 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim:109 [binder, in ITree.Extra.Secure.SecureEqHalt]
sim:114 [binder, in ITree.Eq.Eqit]
sim:119 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim:119 [binder, in ITree.Extra.Secure.SecureEqHalt]
sim:12 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
sim:12 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim:12 [binder, in ITree.Extra.Secure.SecureEqHalt]
sim:12 [binder, in ITree.Eq.Rutt]
sim:122 [binder, in ITree.Extra.IForest]
sim:127 [binder, in ITree.Eq.Eqit]
sim:13 [binder, in ITree.Props.Infinite]
sim:130 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
sim:131 [binder, in ITree.Extra.IForest]
sim:146 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
sim:154 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim:157 [binder, in ITree.Extra.IForest]
sim:163 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim:17 [binder, in ITree.Props.Infinite]
sim:173 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim:249 [binder, in ITree.Eq.Eqit]
sim:251 [binder, in ITree.Eq.Eqit]
sim:254 [binder, in ITree.Eq.Eqit]
sim:256 [binder, in ITree.Eq.Eqit]
sim:268 [binder, in ITree.Eq.Eqit]
sim:270 [binder, in ITree.Eq.Eqit]
sim:273 [binder, in ITree.Eq.Eqit]
sim:275 [binder, in ITree.Eq.Eqit]
sim:31 [binder, in ITree.Eq.Rutt]
sim:36 [binder, in ITree.Eq.Eqit]
sim:374 [binder, in ITree.Eq.Eqit]
sim:43 [binder, in ITree.Props.Infinite]
sim:45 [binder, in ITree.Eq.Eqit]
sim:47 [binder, in ITree.Props.Infinite]
sim:64 [binder, in ITree.Eq.Eqit]
sim:71 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
sim:81 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
sim:87 [binder, in ITree.Eq.Eqit]
sim:94 [binder, in ITree.Extra.IForest]
singletonT [definition, in ITree.Extra.IForest]
SIOMorph [definition, in ITree.Extra.Dijkstra.StateIOTrace]
SIOObs [definition, in ITree.Extra.Dijkstra.StateIOTrace]
SIOSpecEq [definition, in ITree.Extra.Dijkstra.StateIOTrace]
SIOSpecOrder [definition, in ITree.Extra.Dijkstra.StateIOTrace]
SIOSpecOrderLaws [definition, in ITree.Extra.Dijkstra.StateIOTrace]
SIZECHECK1:53 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK1:53 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK2:54 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK2:54 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:103 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:103 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:156 [binder, in ITree.Extra.Secure.SecureStateHandler]
SIZECHECK:162 [binder, in ITree.Extra.Secure.SecureStateHandler]
SIZECHECK:36 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:36 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:43 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:43 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:63 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:63 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:71 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:71 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:78 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:78 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:84 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:84 [binder, in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:93 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:93 [binder, in ITree.Extra.Secure.SecureEqHalt]
si':70 [binder, in ITree.Basics.Basics]
si:67 [binder, in ITree.Basics.Basics]
sl:61 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
smRet [constructor, in ITree.Extra.ITrace.ITracePreds]
smTau [constructor, in ITree.Extra.ITrace.ITracePreds]
smVis [constructor, in ITree.Extra.ITrace.ITracePreds]
Snd [record, in ITree.Basics.CategoryOps]
Snd [inductive, in ITree.Basics.CategoryOps]
Snd_Fun [instance, in ITree.Basics.Function]
snd_ [projection, in ITree.Basics.CategoryOps]
snd_ [constructor, in ITree.Basics.CategoryOps]
Snd_C:227 [binder, in ITree.Basics.CategoryFacts]
Snd_rel [instance, in ITree.Basics.CategoryRelations]
snd_rel [projection, in ITree.Basics.HeterogeneousRelations]
Snd_C:211 [binder, in ITree.Basics.CategoryTheory]
Snd_C:170 [binder, in ITree.Basics.CategoryTheory]
sobj:3 [binder, in ITree.Basics.CategorySub]
Sound [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
spawn [definition, in ITree.Events.Concurrency]
Spawn [constructor, in ITree.Events.Concurrency]
spawnE [inductive, in ITree.Events.Concurrency]
specA:43 [binder, in ITree.Extra.IForest]
SpecMonad [record, in ITree.Extra.Dijkstra.DijkstraMonad]
SpecMonad [section, in ITree.Extra.Dijkstra.DijkstraMonad]
_ ∈ _ (dijkstra_scope) [notation, in ITree.Extra.Dijkstra.DijkstraMonad]
spin [abbreviation, in ITree.Extra.Dijkstra.PureITreeBasics]
spin_not_vis [lemma, in ITree.Extra.ITrace.ITraceBind]
spin_empty_Leaf [lemma, in ITree.Props.Finite]
spin_not_any_finite [lemma, in ITree.Props.Finite]
spin_not_all_finite [lemma, in ITree.Props.Finite]
spin_infinite [lemma, in ITree.Props.Infinite]
spin_bind [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
SR:259 [binder, in ITree.Basics.HeterogeneousRelations]
sr:57 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
SS:101 [binder, in ITree.Eq.SimUpToTaus]
SS:190 [binder, in ITree.Basics.HeterogeneousRelations]
SS:261 [binder, in ITree.Basics.HeterogeneousRelations]
SS:88 [binder, in ITree.Props.HasPost]
State [section, in ITree.Basics.MonadState]
State [definition, in ITree.Extra.Dijkstra.StateSpecT]
State [section, in ITree.Events.State]
State [library]
StateDelay [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelayMonadMorph [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelayObs [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpec [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpec [section, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpec [library]
StateDelaySpecEq [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpecMonadLaws [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpecOrder [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpecOrderedLaws [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
StateE [inductive, in ITree.Extra.Dijkstra.StateIOTrace]
stateE [inductive, in ITree.Events.State]
StateFacts [library]
StateIOSpec [definition, in ITree.Extra.Dijkstra.StateIOTrace]
StateIOSpecPost [definition, in ITree.Extra.Dijkstra.StateIOTrace]
StateIOSpecPre [definition, in ITree.Extra.Dijkstra.StateIOTrace]
StateIOTrace [library]
stateiotree [abbreviation, in ITree.Extra.Dijkstra.StateIOTrace]
StateIter [instance, in ITree.Extra.Dijkstra.StateSpecT]
StateMachine [section, in ITree.Extra.ITrace.ITracePreds]
StateSpec [definition, in ITree.Extra.Dijkstra.StateSpecT]
StateSpecT [definition, in ITree.Extra.Dijkstra.StateSpecT]
StateSpecT [section, in ITree.Extra.Dijkstra.StateSpecT]
StateSpecT [library]
StateSpecTEq [instance, in ITree.Extra.Dijkstra.StateSpecT]
StateSpecTMonadLaws [instance, in ITree.Extra.Dijkstra.StateSpecT]
StateSpecTOrder [instance, in ITree.Extra.Dijkstra.StateSpecT]
StateSpecTOrderedLaws [instance, in ITree.Extra.Dijkstra.StateSpecT]
StateSpecT.Observation [section, in ITree.Extra.Dijkstra.StateSpecT]
state_eq [definition, in ITree.Events.StateFacts]
state_iter_arrow_rel [definition, in ITree.Extra.Dijkstra.StateSpecT]
state_eqit_secure [definition, in ITree.Extra.Secure.SecureStateHandler]
state_machine_proper_eutt [instance, in ITree.Extra.ITrace.ITracePreds]
state_machine_proper_aux [lemma, in ITree.Extra.ITrace.ITracePreds]
state_machine [definition, in ITree.Extra.ITrace.ITracePreds]
state_machine_ [definition, in ITree.Extra.ITrace.ITracePreds]
state_machineF [inductive, in ITree.Extra.ITrace.ITracePreds]
state_pi_eqit_secure [definition, in ITree.Extra.Secure.SecureStateHandlerPi]
State.M [variable, in ITree.Basics.MonadState]
State.S [variable, in ITree.Basics.MonadState]
State.S [variable, in ITree.Events.State]
step [constructor, in ITree.Extra.Dijkstra.IterRel]
step [definition, in ITree.Interp.Traces]
StepTau [constructor, in ITree.Interp.Traces]
StepVis [constructor, in ITree.Interp.Traces]
step_ [inductive, in ITree.Interp.Traces]
step':324 [binder, in ITree.Extra.IForest]
step':334 [binder, in ITree.Extra.IForest]
step:331 [binder, in ITree.Extra.IForest]
step:38 [binder, in ITree.Core.ITreeDefinition]
step:53 [binder, in ITree.Basics.Basics]
step:64 [binder, in ITree.Basics.Basics]
step:74 [binder, in ITree.Basics.Basics]
step:81 [binder, in ITree.Basics.Basics]
step:90 [binder, in ITree.Basics.Basics]
step:97 [binder, in ITree.Basics.Basics]
stream [record, in ITree.Extra.Dijkstra.ITreeDijkstra]
streamF [inductive, in ITree.Extra.Dijkstra.ITreeDijkstra]
stream' [abbreviation, in ITree.Extra.Dijkstra.ITreeDijkstra]
StrongBisimProper [library]
strong_bisim_proper_paco [instance, in ITree.Extra.Secure.StrongBisimProper]
St:1 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
ST:263 [binder, in ITree.Basics.HeterogeneousRelations]
st:72 [binder, in ITree.Events.StateFacts]
sub [definition, in ITree.Basics.CategorySub]
Subcategory [section, in ITree.Basics.CategorySub]
Subcategory.Bimap [section, in ITree.Basics.CategorySub]
Subcategory.CatLaws [section, in ITree.Basics.CategorySub]
Subcategory.CoproductLaws [section, in ITree.Basics.CategorySub]
subevent [definition, in ITree.Core.Subevent]
Subevent [abbreviation, in ITree.Core.Subevent]
Subevent [library]
subevent_subevent [lemma, in ITree.Core.Subevent]
subevent_subevent' [lemma, in ITree.Core.Subevent]
subm [definition, in ITree.Basics.CategorySub]
SubRelationH [section, in ITree.Basics.HeterogeneousRelations]
subrelationH [definition, in ITree.Basics.HeterogeneousRelations]
subrelationH_refl_eq [lemma, in ITree.Basics.HeterogeneousRelations]
subrelationH_trans [lemma, in ITree.Basics.HeterogeneousRelations]
subrelationH_antisym [lemma, in ITree.Basics.HeterogeneousRelations]
subrelationH_Reflexive [lemma, in ITree.Basics.HeterogeneousRelations]
subrelation_i_respectful_i_pointwise [definition, in ITree.Indexed.Relation]
subrelation_i_pointwise_i_respectful [instance, in ITree.Indexed.Relation]
subrelation_eeq_eqeq [instance, in ITree.Basics.FunctionFacts]
subtree [definition, in ITree.Extra.IForest]
Sum [library]
SumNotations [module, in ITree.Core.Subevent]
(||||||| _ ) (sum_scope) [notation, in ITree.Core.Subevent]
(|||||| _ |) (sum_scope) [notation, in ITree.Core.Subevent]
(|||||| _ ) (sum_scope) [notation, in ITree.Core.Subevent]
(||||| _ |) (sum_scope) [notation, in ITree.Core.Subevent]
(||||| _ ) (sum_scope) [notation, in ITree.Core.Subevent]
(|||| _ |) (sum_scope) [notation, in ITree.Core.Subevent]
(|||| _ ) (sum_scope) [notation, in ITree.Core.Subevent]
(||| _ |) (sum_scope) [notation, in ITree.Core.Subevent]
(||| _ ) (sum_scope) [notation, in ITree.Core.Subevent]
(|| _ |) (sum_scope) [notation, in ITree.Core.Subevent]
(|| _ ) (sum_scope) [notation, in ITree.Core.Subevent]
(| _ |) (sum_scope) [notation, in ITree.Core.Subevent]
( _ |) (sum_scope) [notation, in ITree.Core.Subevent]
(| _ ) (sum_scope) [notation, in ITree.Core.Subevent]
SumRelFacts [section, in ITree.Basics.HeterogeneousRelations]
SumRelFacts.Equivalence [section, in ITree.Basics.HeterogeneousRelations]
sum_inr [instance, in ITree.Basics.Function]
sum_inl [instance, in ITree.Basics.Function]
sum_pred [definition, in ITree.Basics.Basics]
sum_compose [lemma, in ITree.Basics.HeterogeneousRelations]
sum_rel_eq [lemma, in ITree.Basics.HeterogeneousRelations]
sum_rel_monotone [lemma, in ITree.Basics.HeterogeneousRelations]
sum_rel_eqv [instance, in ITree.Basics.HeterogeneousRelations]
sum_rel_trans [instance, in ITree.Basics.HeterogeneousRelations]
sum_rel_sym [instance, in ITree.Basics.HeterogeneousRelations]
sum_rel_refl [instance, in ITree.Basics.HeterogeneousRelations]
sum_rel [inductive, in ITree.Basics.HeterogeneousRelations]
sum1 [inductive, in ITree.Indexed.Sum]
sutt [definition, in ITree.Eq.SimUpToTaus]
SUTT [section, in ITree.Eq.SimUpToTaus]
suttF [inductive, in ITree.Eq.SimUpToTaus]
suttF_inv_tau_left [lemma, in ITree.Eq.SimUpToTaus]
suttF_inv_vis [lemma, in ITree.Eq.SimUpToTaus]
suttF_tau_left [constructor, in ITree.Eq.SimUpToTaus]
suttF_tau_right [constructor, in ITree.Eq.SimUpToTaus]
suttF_vis [constructor, in ITree.Eq.SimUpToTaus]
suttF_ret [constructor, in ITree.Eq.SimUpToTaus]
SUTTK:15 [binder, in ITree.Eq.SimUpToTaus]
sutt_bind' [lemma, in ITree.Eq.SimUpToTaus]
sutt_eutt [lemma, in ITree.Eq.SimUpToTaus]
sutt_inv_tau_left [lemma, in ITree.Eq.SimUpToTaus]
sutt_elim_tau_right [lemma, in ITree.Eq.SimUpToTaus]
sutt_tau_left [lemma, in ITree.Eq.SimUpToTaus]
sutt_tau_right [lemma, in ITree.Eq.SimUpToTaus]
sutt_inv_vis [lemma, in ITree.Eq.SimUpToTaus]
SUTT_facts [section, in ITree.Eq.SimUpToTaus]
SUTT_rel [section, in ITree.Eq.SimUpToTaus]
sutt_trace_incl [lemma, in ITree.Interp.Traces]
sutt:28 [binder, in ITree.Eq.SimUpToTaus]
sutt:38 [binder, in ITree.Eq.SimUpToTaus]
sutt:5 [binder, in ITree.Eq.SimUpToTaus]
swap [projection, in ITree.Basics.CategoryOps]
Swap [record, in ITree.Basics.CategoryOps]
swap [constructor, in ITree.Basics.CategoryOps]
Swap [inductive, in ITree.Basics.CategoryOps]
SwapAssocL [record, in ITree.Basics.CategoryTheory]
SwapAssocL [inductive, in ITree.Basics.CategoryTheory]
SwapAssocL_Product [instance, in ITree.Basics.CategoryFacts]
SwapAssocL_Coproduct [instance, in ITree.Basics.CategoryFacts]
SwapAssocR [record, in ITree.Basics.CategoryTheory]
SwapAssocR [inductive, in ITree.Basics.CategoryTheory]
SwapAssocR_Product [instance, in ITree.Basics.CategoryFacts]
SwapAssocR_Coproduct [instance, in ITree.Basics.CategoryFacts]
SwapInvolutive [abbreviation, in ITree.Basics.CategoryTheory]
SwapInvolutive_Product [instance, in ITree.Basics.CategoryFacts]
SwapInvolutive_Coproduct [instance, in ITree.Basics.CategoryFacts]
SwapInvolutive_C:313 [binder, in ITree.Basics.CategoryTheory]
SwapUnitL [record, in ITree.Basics.CategoryTheory]
SwapUnitL [inductive, in ITree.Basics.CategoryTheory]
SwapUnitL_Product [instance, in ITree.Basics.CategoryFacts]
SwapUnitL_Coproduct [instance, in ITree.Basics.CategoryFacts]
Swap_Product [instance, in ITree.Basics.CategoryOps]
Swap_Coproduct [instance, in ITree.Basics.CategoryOps]
swap_ [abbreviation, in ITree.Basics.CategoryOps]
swap_bimap_prod' [lemma, in ITree.Basics.CategoryFacts]
swap_bimap_prod [lemma, in ITree.Basics.CategoryFacts]
swap_fst [lemma, in ITree.Basics.CategoryFacts]
swap_snd [lemma, in ITree.Basics.CategoryFacts]
swap_pair [lemma, in ITree.Basics.CategoryFacts]
swap_bimap' [lemma, in ITree.Basics.CategoryFacts]
swap_bimap [lemma, in ITree.Basics.CategoryFacts]
swap_case [lemma, in ITree.Basics.CategoryFacts]
swap_assoc_l [projection, in ITree.Basics.CategoryTheory]
swap_assoc_l [constructor, in ITree.Basics.CategoryTheory]
swap_assoc_r [projection, in ITree.Basics.CategoryTheory]
swap_assoc_r [constructor, in ITree.Basics.CategoryTheory]
swap_unit_l [projection, in ITree.Basics.CategoryTheory]
swap_unit_l [constructor, in ITree.Basics.CategoryTheory]
swap_involutive [lemma, in ITree.Basics.CategoryTheory]
Swap_bif:310 [binder, in ITree.Basics.CategoryTheory]
sx:39 [binder, in ITree.Events.StateFacts]
sx:9 [binder, in ITree.Events.StateFacts]
symmetric [projection, in ITree.Basics.HeterogeneousRelations]
symmetric [constructor, in ITree.Basics.HeterogeneousRelations]
SymmetricH [record, in ITree.Basics.HeterogeneousRelations]
SymmetricH [inductive, in ITree.Basics.HeterogeneousRelations]
SymmetricH_Symmetric [lemma, in ITree.Basics.HeterogeneousRelations]
SymmetricLaws [section, in ITree.Basics.CategoryTheory]
Symmetric_failT_eq1 [instance, in ITree.Events.FailFacts]
Symmetric_R:31 [binder, in ITree.Indexed.Relation]
Symmetric_i_pointwise [instance, in ITree.Indexed.Relation]
symmetric_swap_assoc_r [projection, in ITree.Basics.CategoryTheory]
symmetric_swap_unit_l [projection, in ITree.Basics.CategoryTheory]
symmetric_swap_involutive [projection, in ITree.Basics.CategoryTheory]
symmetric_monoidal [projection, in ITree.Basics.CategoryTheory]
Symmetric_eqit_eq [instance, in ITree.Eq.Eqit]
Symmetric_eqit__eq [instance, in ITree.Eq.Eqit]
Symmetric_eqitF_eq [instance, in ITree.Eq.Eqit]
Symmetric_eqit [instance, in ITree.Eq.Eqit]
Symmetric_eqit_ [instance, in ITree.Eq.Eqit]
Symmetric_eqitF [instance, in ITree.Eq.Eqit]
Symmetric_bot2 [instance, in ITree.Eq.Eqit]
SymMonoidal [record, in ITree.Basics.CategoryTheory]
SymMonoidal_Product [instance, in ITree.Basics.CategoryFacts]
SymMonoidal_Coproduct [instance, in ITree.Basics.CategoryFacts]
Symmteric_EQ_REL [lemma, in ITree.Extra.IForest]
S':208 [binder, in ITree.Basics.HeterogeneousRelations]
S':273 [binder, in ITree.Basics.HeterogeneousRelations]
s0:68 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s1:1 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
S1:101 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
s1:103 [binder, in ITree.Events.StateFacts]
s1:104 [binder, in ITree.Eq.SimUpToTaus]
s1:122 [binder, in ITree.Events.StateFacts]
s1:126 [binder, in ITree.Events.StateFacts]
S1:14 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
s1:141 [binder, in ITree.Events.StateFacts]
s1:146 [binder, in ITree.Events.StateFacts]
s1:20 [binder, in ITree.Extra.Secure.SecureStateHandler]
s1:20 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
S1:23 [binder, in ITree.Extra.Secure.SecureEqBind]
S1:267 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
S1:3 [binder, in ITree.Extra.Secure.SecureEqBind]
s1:30 [binder, in ITree.Events.MapDefaultFacts]
s1:32 [binder, in ITree.Extra.Secure.SecureStateHandler]
s1:33 [binder, in ITree.Events.MapDefaultFacts]
s1:38 [binder, in ITree.Events.MapDefaultFacts]
S1:44 [binder, in ITree.Extra.Secure.SecureEqBind]
s1:44 [binder, in ITree.Events.MapDefaultFacts]
S1:63 [binder, in ITree.Extra.Secure.SecureEqBind]
s1:67 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S1:706 [binder, in ITree.Eq.Eqit]
s1:71 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
s1:71 [binder, in ITree.Extra.Dijkstra.StateSpecT]
S1:746 [binder, in ITree.Eq.Eqit]
s1:80 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S1:86 [binder, in ITree.Props.HasPost]
S1:98 [binder, in ITree.Eq.SimUpToTaus]
s1:99 [binder, in ITree.Events.StateFacts]
s2:100 [binder, in ITree.Events.StateFacts]
S2:102 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
s2:104 [binder, in ITree.Events.StateFacts]
s2:105 [binder, in ITree.Eq.SimUpToTaus]
s2:123 [binder, in ITree.Events.StateFacts]
s2:127 [binder, in ITree.Events.StateFacts]
s2:142 [binder, in ITree.Events.StateFacts]
s2:147 [binder, in ITree.Events.StateFacts]
S2:15 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
S2:2 [binder, in ITree.Extra.Secure.SecureEqBind]
s2:2 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
s2:21 [binder, in ITree.Extra.Secure.SecureStateHandler]
s2:21 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
S2:22 [binder, in ITree.Extra.Secure.SecureEqBind]
S2:268 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
s2:31 [binder, in ITree.Events.MapDefaultFacts]
s2:34 [binder, in ITree.Events.MapDefaultFacts]
s2:39 [binder, in ITree.Events.MapDefaultFacts]
s2:40 [binder, in ITree.Extra.Secure.SecureStateHandler]
S2:45 [binder, in ITree.Extra.Secure.SecureEqBind]
s2:45 [binder, in ITree.Events.MapDefaultFacts]
S2:64 [binder, in ITree.Extra.Secure.SecureEqBind]
s2:68 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S2:707 [binder, in ITree.Eq.Eqit]
s2:72 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S2:747 [binder, in ITree.Eq.Eqit]
s2:81 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S2:87 [binder, in ITree.Props.HasPost]
S2:99 [binder, in ITree.Eq.SimUpToTaus]
S:1 [binder, in ITree.Extra.Dijkstra.StateSpecT]
S:1 [binder, in ITree.Extra.Secure.SecureStateHandler]
S:1 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
s:10 [binder, in ITree.Basics.Basics]
s:10 [binder, in ITree.Events.MapDefaultFacts]
S:102 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:103 [binder, in ITree.Extra.ITrace.ITraceBind]
S:105 [binder, in ITree.Basics.Basics]
S:105 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:105 [binder, in ITree.Interp.InterpFacts]
s:106 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
S:109 [binder, in ITree.Events.StateFacts]
s:109 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
s:11 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:11 [binder, in ITree.Events.Writer]
S:111 [binder, in ITree.Basics.HeterogeneousRelations]
s:116 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:116 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S:117 [binder, in ITree.Extra.ITrace.ITraceBind]
S:117 [binder, in ITree.Basics.HeterogeneousRelations]
s:119 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S:12 [binder, in ITree.Events.StateFacts]
s:12 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
S:122 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:124 [binder, in ITree.Interp.Traces]
S:125 [binder, in ITree.Props.Finite]
S:129 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:131 [binder, in ITree.Props.Finite]
S:132 [binder, in ITree.Events.StateFacts]
S:133 [binder, in ITree.Extra.ITrace.ITraceBind]
s:137 [binder, in ITree.Extra.ITrace.ITraceBind]
S:137 [binder, in ITree.Props.Finite]
s:137 [binder, in ITree.Extra.Secure.SecureStateHandler]
s:14 [binder, in ITree.Basics.Basics]
s:14 [binder, in ITree.Extra.Dijkstra.StateSpecT]
S:14 [binder, in ITree.Basics.HeterogeneousRelations]
s:14 [binder, in ITree.Events.MapDefaultFacts]
S:140 [binder, in ITree.Extra.ITrace.ITraceBind]
S:141 [binder, in ITree.Simple]
s:143 [binder, in ITree.Extra.ITrace.ITraceBind]
S:144 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:144 [binder, in ITree.Simple]
S:145 [binder, in ITree.Basics.HeterogeneousRelations]
S:146 [binder, in ITree.Extra.ITrace.ITraceBind]
s:146 [binder, in ITree.Extra.Secure.SecureStateHandler]
s:150 [binder, in ITree.Extra.ITrace.ITraceBind]
S:150 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:151 [binder, in ITree.Events.StateFacts]
S:151 [binder, in ITree.Props.Finite]
S:153 [binder, in ITree.Extra.ITrace.ITraceBind]
s:155 [binder, in ITree.Events.StateFacts]
S:156 [binder, in ITree.Extra.ITrace.ITraceBind]
S:156 [binder, in ITree.Props.Finite]
S:156 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:157 [binder, in ITree.Extra.Secure.SecureStateHandler]
S:158 [binder, in ITree.Events.StateFacts]
S:159 [binder, in ITree.Props.Leaf]
S:16 [binder, in ITree.Extra.ITrace.ITraceBind]
s:16 [binder, in ITree.Events.StateFacts]
s:16 [binder, in ITree.Events.MapDefaultFacts]
S:162 [binder, in ITree.Props.Finite]
S:162 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:163 [binder, in ITree.Extra.Secure.SecureStateHandler]
S:165 [binder, in ITree.Extra.ITrace.ITraceBind]
S:167 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:167 [binder, in ITree.Basics.HeterogeneousRelations]
S:169 [binder, in ITree.Events.StateFacts]
S:169 [binder, in ITree.Simple]
s:17 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:17 [binder, in ITree.Events.State]
S:174 [binder, in ITree.Props.Finite]
s:174 [binder, in ITree.Extra.Secure.SecureStateHandler]
S:179 [binder, in ITree.Extra.ITrace.ITraceBind]
S:18 [binder, in ITree.Interp.TranslateFacts]
S:180 [binder, in ITree.Props.Finite]
S:185 [binder, in ITree.Basics.HeterogeneousRelations]
s:187 [binder, in ITree.Simple]
S:188 [binder, in ITree.Basics.HeterogeneousRelations]
S:19 [binder, in ITree.Events.StateFacts]
s:19 [binder, in ITree.Basics.Basics]
s:19 [binder, in ITree.Events.MapDefaultFacts]
S:19 [binder, in ITree.Events.State]
S:191 [binder, in ITree.Extra.ITrace.ITraceBind]
S:191 [binder, in ITree.Simple]
s:193 [binder, in ITree.Simple]
S:196 [binder, in ITree.Extra.ITrace.ITraceFacts]
s:20 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
S:20 [binder, in ITree.Basics.HeterogeneousRelations]
S:202 [binder, in ITree.Extra.ITrace.ITraceBind]
S:204 [binder, in ITree.Extra.ITrace.ITraceFacts]
S:207 [binder, in ITree.Basics.HeterogeneousRelations]
S:214 [binder, in ITree.Extra.ITrace.ITraceBind]
s:22 [binder, in ITree.Events.State]
S:221 [binder, in ITree.Extra.ITrace.ITraceFacts]
S:222 [binder, in ITree.Extra.ITrace.ITraceBind]
s:23 [binder, in ITree.Extra.ITrace.ITraceDefinition]
s:23 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:23 [binder, in ITree.Events.Writer]
S:23 [binder, in ITree.Basics.CategoryRelations]
S:230 [binder, in ITree.Simple]
S:231 [binder, in ITree.Extra.ITrace.ITraceBind]
s:238 [binder, in ITree.Extra.ITrace.ITraceBind]
s:239 [binder, in ITree.Extra.ITrace.ITraceBind]
s:24 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
S:24 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:24 [binder, in ITree.Extra.ITrace.ITraceFacts]
S:241 [binder, in ITree.Basics.HeterogeneousRelations]
S:242 [binder, in ITree.Extra.ITrace.ITraceBind]
S:25 [binder, in ITree.Events.StateFacts]
S:253 [binder, in ITree.Basics.HeterogeneousRelations]
S:257 [binder, in ITree.Basics.HeterogeneousRelations]
S:258 [binder, in ITree.Extra.ITrace.ITraceBind]
S:26 [binder, in ITree.Extra.ITrace.ITraceBind]
S:266 [binder, in ITree.Extra.IForest]
S:27 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:270 [binder, in ITree.Extra.ITrace.ITraceBind]
S:272 [binder, in ITree.Basics.HeterogeneousRelations]
S:274 [binder, in ITree.Simple]
s:277 [binder, in ITree.Extra.ITrace.ITraceBind]
S:277 [binder, in ITree.Simple]
s:278 [binder, in ITree.Extra.IForest]
s:28 [binder, in ITree.Events.StateFacts]
s:28 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
S:28 [binder, in ITree.Simple]
S:280 [binder, in ITree.Extra.ITrace.ITraceBind]
s:283 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S:285 [binder, in ITree.Basics.HeterogeneousRelations]
S:286 [binder, in ITree.Eq.UpToTaus]
s:287 [binder, in ITree.Extra.ITrace.ITraceBind]
S:289 [binder, in ITree.Extra.ITrace.ITraceBind]
s:29 [binder, in ITree.Basics.Basics]
s:290 [binder, in ITree.Eq.UpToTaus]
S:293 [binder, in ITree.Eq.UpToTaus]
s:296 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
s:297 [binder, in ITree.Extra.ITrace.ITraceBind]
s:297 [binder, in ITree.Eq.UpToTaus]
S:297 [binder, in ITree.Basics.HeterogeneousRelations]
S:3 [binder, in ITree.Events.StateFacts]
S:3 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:3 [binder, in ITree.Events.State]
S:300 [binder, in ITree.Eq.UpToTaus]
s:301 [binder, in ITree.Extra.ITrace.ITraceBind]
S:303 [binder, in ITree.Extra.ITrace.ITraceBind]
s:304 [binder, in ITree.Eq.UpToTaus]
S:307 [binder, in ITree.Eq.UpToTaus]
S:31 [binder, in ITree.Extra.ITrace.ITraceBind]
s:31 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:31 [binder, in ITree.Extra.Secure.SecureStateHandler]
s:31 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
S:311 [binder, in ITree.Extra.ITrace.ITraceBind]
s:311 [binder, in ITree.Eq.UpToTaus]
S:316 [binder, in ITree.Extra.ITrace.ITraceBind]
S:32 [binder, in ITree.Events.StateFacts]
S:324 [binder, in ITree.Extra.ITrace.ITraceBind]
s:33 [binder, in ITree.Basics.Basics]
S:33 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:338 [binder, in ITree.Extra.IForest]
S:347 [binder, in ITree.Extra.IForest]
s:36 [binder, in ITree.Basics.Basics]
S:36 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:38 [binder, in ITree.Events.StateFacts]
S:386 [binder, in ITree.Extra.IForest]
s:39 [binder, in ITree.Basics.Basics]
S:39 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:39 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:41 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
S:42 [binder, in ITree.Extra.ITrace.ITraceBind]
S:42 [binder, in ITree.Events.StateFacts]
s:42 [binder, in ITree.Basics.Basics]
s:42 [binder, in ITree.Basics.MonadState]
s:43 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:43 [binder, in ITree.Simple]
s:46 [binder, in ITree.Events.StateFacts]
S:46 [binder, in ITree.Core.ITreeDefinition]
s:47 [binder, in ITree.Basics.MonadState]
S:48 [binder, in ITree.Simple]
s:49 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:49 [binder, in ITree.Extra.ITrace.ITraceDefinition]
s:49 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
S:5 [binder, in ITree.Extra.ITrace.ITraceBind]
s:5 [binder, in ITree.Basics.Basics]
S:50 [binder, in ITree.Events.StateFacts]
S:50 [binder, in ITree.Basics.Basics]
S:50 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:50 [binder, in ITree.Simple]
S:51 [binder, in ITree.Extra.ITrace.ITraceBind]
s:51 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:51 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
s:52 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
s:52 [binder, in ITree.Basics.MonadState]
s:53 [binder, in ITree.Events.StateFacts]
s:54 [binder, in ITree.Extra.ITrace.ITraceBind]
s:54 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
s:55 [binder, in ITree.Basics.Basics]
S:55 [binder, in ITree.Extra.ITrace.ITracePrefix]
S:57 [binder, in ITree.Props.HasPost]
s:57 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:571 [binder, in ITree.Eq.Eqit]
s:578 [binder, in ITree.Eq.Eqit]
S:58 [binder, in ITree.Events.StateFacts]
s:58 [binder, in ITree.Basics.Basics]
s:58 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
S:583 [binder, in ITree.Extra.IForest]
s:585 [binder, in ITree.Eq.Eqit]
S:589 [binder, in ITree.Eq.Eqit]
S:59 [binder, in ITree.Basics.CategoryRelations]
s:59 [binder, in ITree.Interp.TranslateFacts]
S:6 [binder, in ITree.Basics.HeterogeneousRelations]
S:60 [binder, in ITree.Eq.Shallow]
S:600 [binder, in ITree.Eq.Eqit]
s:61 [binder, in ITree.Events.StateFacts]
S:61 [binder, in ITree.Basics.Basics]
S:61 [binder, in ITree.Core.ITreeDefinition]
S:62 [binder, in ITree.Core.KTreeFacts]
s:62 [binder, in ITree.Events.State]
S:63 [binder, in ITree.Extra.ITrace.ITraceBind]
s:63 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
S:632 [binder, in ITree.Eq.Eqit]
s:65 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
S:65 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:65 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
s:65 [binder, in ITree.Events.State]
S:66 [binder, in ITree.Events.StateFacts]
s:66 [binder, in ITree.Basics.Basics]
s:66 [binder, in ITree.Basics.MonadState]
S:66 [binder, in ITree.Eq.Shallow]
S:66 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
S:67 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:68 [binder, in ITree.Basics.Basics]
S:68 [binder, in ITree.Interp.InterpFacts]
S:69 [binder, in ITree.Extra.ITrace.ITraceBind]
S:69 [binder, in ITree.Eq.Shallow]
s:7 [binder, in ITree.Events.StateFacts]
s:7 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:70 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:71 [binder, in ITree.Events.StateFacts]
S:72 [binder, in ITree.Basics.Basics]
S:73 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:73 [binder, in ITree.Basics.MonadState]
S:735 [binder, in ITree.Eq.Eqit]
S:74 [binder, in ITree.Core.KTreeFacts]
S:740 [binder, in ITree.Eq.Eqit]
S:75 [binder, in ITree.Events.StateFacts]
S:75 [binder, in ITree.Props.Leaf]
s:75 [binder, in ITree.Basics.MonadState]
S:75 [binder, in ITree.Extra.Dijkstra.StateSpecT]
s:76 [binder, in ITree.Basics.Basics]
S:760 [binder, in ITree.Eq.Eqit]
s:765 [binder, in ITree.Eq.Eqit]
s:77 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
S:775 [binder, in ITree.Eq.Eqit]
s:777 [binder, in ITree.Eq.Eqit]
S:78 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:78 [binder, in ITree.Extra.Dijkstra.StateSpecT]
S:783 [binder, in ITree.Eq.Eqit]
S:79 [binder, in ITree.Extra.ITrace.ITraceBind]
S:791 [binder, in ITree.Eq.Eqit]
s:8 [binder, in ITree.Basics.Basics]
S:81 [binder, in ITree.Events.StateFacts]
S:81 [binder, in ITree.Extra.Dijkstra.StateSpecT]
S:82 [binder, in ITree.Props.Leaf]
S:83 [binder, in ITree.Extra.ITrace.ITracePrefix]
s:83 [binder, in ITree.Extra.Secure.SecureStateHandler]
S:84 [binder, in ITree.Events.ExceptionFacts]
s:84 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:84 [binder, in ITree.Extra.Dijkstra.StateSpecT]
S:85 [binder, in ITree.Extra.ITrace.ITraceBind]
S:86 [binder, in ITree.Events.StateFacts]
s:86 [binder, in ITree.Extra.Dijkstra.StateSpecT]
S:9 [binder, in ITree.Interp.Traces]
S:91 [binder, in ITree.Extra.ITrace.ITraceBind]
s:92 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
S:92 [binder, in ITree.Simple]
S:94 [binder, in ITree.Extra.ITrace.ITraceBind]
s:94 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
s:95 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
S:95 [binder, in ITree.Props.Leaf]
S:95 [binder, in ITree.Eq.Shallow]
s:96 [binder, in ITree.Extra.Dijkstra.StateDelaySpec]
S:96 [binder, in ITree.Extra.ITrace.ITracePrefix]

T

Tacs [library]
Tau [abbreviation, in ITree.Core.ITreeDefinition]
TauF [constructor, in ITree.Core.ITreeDefinition]
tau_vis_ans [constructor, in ITree.Extra.ITrace.ITracePrefix]
tau_vis_empty [constructor, in ITree.Extra.ITrace.ITracePrefix]
tau_l_prefix [constructor, in ITree.Extra.ITrace.ITracePrefix]
tau_r_prefix [constructor, in ITree.Extra.ITrace.ITracePrefix]
tau_prefix [constructor, in ITree.Extra.ITrace.ITracePrefix]
tau_eqit_secure [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
tau_invar_resp_eutt1 [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
tau_invar [definition, in ITree.Extra.Dijkstra.PureITreeBasics]
tau_eutt_RR_r [lemma, in ITree.Eq.Eqit]
tau_eqit_RR_l [lemma, in ITree.Eq.Eqit]
tau_eutt_RR_l [lemma, in ITree.Eq.Eqit]
tau_eutt [lemma, in ITree.Eq.Eqit]
tau_euttge [lemma, in ITree.Eq.Eqit]
ta1:527 [binder, in ITree.Extra.IForest]
ta2:528 [binder, in ITree.Extra.IForest]
ta:10 [binder, in ITree.Eq.EuttExtras]
ta:109 [binder, in ITree.Extra.IForest]
ta:18 [binder, in ITree.Eq.EuttExtras]
ta:20 [binder, in ITree.Props.EuttNoRet]
ta:215 [binder, in ITree.Extra.IForest]
ta:222 [binder, in ITree.Extra.IForest]
ta:30 [binder, in ITree.Props.EuttNoRet]
ta:35 [binder, in ITree.Extra.IForest]
ta:4 [binder, in ITree.Props.EuttNoRet]
ta:452 [binder, in ITree.Extra.IForest]
ta:456 [binder, in ITree.Extra.IForest]
ta:46 [binder, in ITree.Extra.IForest]
ta:461 [binder, in ITree.Extra.IForest]
ta:537 [binder, in ITree.Extra.IForest]
ta:542 [binder, in ITree.Extra.IForest]
ta:558 [binder, in ITree.Extra.IForest]
ta:57 [binder, in ITree.Extra.IForest]
ta:570 [binder, in ITree.Extra.IForest]
ta:575 [binder, in ITree.Extra.IForest]
ta:578 [binder, in ITree.Extra.IForest]
ta:588 [binder, in ITree.Extra.IForest]
ta:592 [binder, in ITree.Extra.IForest]
ta:595 [binder, in ITree.Extra.IForest]
ta:614 [binder, in ITree.Extra.IForest]
ta:68 [binder, in ITree.Extra.IForest]
tb:11 [binder, in ITree.Eq.EuttExtras]
tb:19 [binder, in ITree.Eq.EuttExtras]
tb:21 [binder, in ITree.Props.EuttNoRet]
tb:31 [binder, in ITree.Props.EuttNoRet]
tb:36 [binder, in ITree.Extra.IForest]
tb:45 [binder, in ITree.Extra.IForest]
tb:5 [binder, in ITree.Props.EuttNoRet]
tb:536 [binder, in ITree.Extra.IForest]
tb:559 [binder, in ITree.Extra.IForest]
tb:56 [binder, in ITree.Extra.IForest]
tb:67 [binder, in ITree.Extra.IForest]
tb:78 [binder, in ITree.Extra.IForest]
tc:617 [binder, in ITree.Extra.IForest]
tc:618 [binder, in ITree.Extra.IForest]
tc:889 [binder, in ITree.Eq.Eqit]
tell [definition, in ITree.Events.Writer]
Tell [constructor, in ITree.Events.Writer]
TEnd [constructor, in ITree.Interp.Traces]
Terminal [record, in ITree.Basics.CategoryOps]
Terminal [inductive, in ITree.Basics.CategoryOps]
TerminalObject [record, in ITree.Basics.CategoryTheory]
TerminalObject [inductive, in ITree.Basics.CategoryTheory]
TerminalObject_unit [instance, in ITree.Basics.FunctionFacts]
TerminalObject_t:323 [binder, in ITree.Basics.CategoryFacts]
TerminalObject_t:60 [binder, in ITree.Basics.CategoryFacts]
Terminal_unit [instance, in ITree.Basics.Function]
Terminal_t:322 [binder, in ITree.Basics.CategoryFacts]
terminal_unique [lemma, in ITree.Basics.CategoryFacts]
Terminal_t:59 [binder, in ITree.Basics.CategoryFacts]
Terminal_t:40 [binder, in ITree.Basics.CategoryTheory]
terminal_object [projection, in ITree.Basics.CategoryTheory]
terminal_object [constructor, in ITree.Basics.CategoryTheory]
terminates [inductive, in ITree.Extra.Secure.SecureStateHandler]
terminates_vis [constructor, in ITree.Extra.Secure.SecureStateHandler]
terminates_tau [constructor, in ITree.Extra.Secure.SecureStateHandler]
terminates_ret [constructor, in ITree.Extra.Secure.SecureStateHandler]
term_b [constructor, in ITree.Extra.Dijkstra.PureITreeDijkstra]
term_b_pred_resp_eutt [lemma, in ITree.Extra.Dijkstra.PureITreeDijkstra]
Term_C:207 [binder, in ITree.Basics.CategoryTheory]
TEventEnd [constructor, in ITree.Interp.Traces]
TEventResponse [constructor, in ITree.Interp.Traces]
throw [definition, in ITree.Events.Exception]
Throw [constructor, in ITree.Events.Exception]
throw_prefix_iter [lemma, in ITree.Events.ExceptionFacts]
throw_prefix_bind [lemma, in ITree.Events.ExceptionFacts]
throw_prefix_of_try_catch [lemma, in ITree.Events.ExceptionFacts]
throw_prefix_bind_decomp [lemma, in ITree.Events.ExceptionFacts]
throw_prefix_ev [definition, in ITree.Events.ExceptionFacts]
throw_prefix_exc [definition, in ITree.Events.ExceptionFacts]
throw_prefix_tau [definition, in ITree.Events.ExceptionFacts]
throw_prefix_ret [definition, in ITree.Events.ExceptionFacts]
throw_prefix [definition, in ITree.Events.Exception]
TMP:62 [binder, in ITree.Eq.Paco2]
ToBifunctor [record, in ITree.Basics.CategorySub]
ToBifunctor [inductive, in ITree.Basics.CategorySub]
ToBif:26 [binder, in ITree.Basics.CategorySub]
top2 [definition, in ITree.Extra.Secure.SecureStateHandler]
top2 [definition, in ITree.Extra.Secure.SecureStateHandlerPi]
to_bif [projection, in ITree.Basics.CategorySub]
to_bif [constructor, in ITree.Basics.CategorySub]
trace [inductive, in ITree.Interp.Traces]
TracedIterativeFacts [section, in ITree.Basics.CategoryFacts]
TraceEmpty [constructor, in ITree.Interp.Traces]
TraceRet [constructor, in ITree.Interp.Traces]
traces [definition, in ITree.Interp.Traces]
Traces [library]
TracesIT [library]
TraceSpec [definition, in ITree.Extra.Dijkstra.TracesIT]
TraceSpec [section, in ITree.Extra.Dijkstra.TracesIT]
TraceSpecInput [definition, in ITree.Extra.Dijkstra.TracesIT]
TraceSpecMonad [instance, in ITree.Extra.Dijkstra.TracesIT]
TraceSpecMonadLaws [instance, in ITree.Extra.Dijkstra.TracesIT]
TraceSpecMorph [instance, in ITree.Extra.Dijkstra.TracesIT]
TraceSpecObs [instance, in ITree.Extra.Dijkstra.TracesIT]
TraceSpecOrder [instance, in ITree.Extra.Dijkstra.TracesIT]
TraceSpecOrderLaws [instance, in ITree.Extra.Dijkstra.TracesIT]
↑ _ [notation, in ITree.Extra.Dijkstra.TracesIT]
TraceTau [constructor, in ITree.Interp.Traces]
TraceVisContinue [constructor, in ITree.Interp.Traces]
TraceVisEnd [constructor, in ITree.Interp.Traces]
trace_prefix_peel [lemma, in ITree.Extra.ITrace.ITraceBind]
trace_prefix_peel_ret_vis_empty [lemma, in ITree.Extra.ITrace.ITraceBind]
trace_prefix_peel_ret_vis [lemma, in ITree.Extra.ITrace.ITraceBind]
trace_prefix_vis_evempty [lemma, in ITree.Extra.ITrace.ITraceBind]
trace_prefix_vis_evans [lemma, in ITree.Extra.ITrace.ITraceBind]
trace_prefix_tau_ret [lemma, in ITree.Extra.ITrace.ITraceBind]
trace_refine [definition, in ITree.Extra.ITrace.ITraceDefinition]
trace_prefix_bind [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_div [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ind_bind [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ind_comb [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ind [inductive, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_proper [instance, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_proper_r [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefixF_vis_l [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefixF_tau_inv_r [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_proper_l [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_tau_inv [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_proper_aux_vis [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ret [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix [definition, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_monot [lemma, in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ [definition, in ITree.Extra.ITrace.ITracePrefix]
trace_prefixF [inductive, in ITree.Extra.ITrace.ITracePrefix]
trace_eq_iff_eutt [lemma, in ITree.Interp.Traces]
trace_eq_eutt [lemma, in ITree.Interp.Traces]
trace_incl_iff_sutt [lemma, in ITree.Interp.Traces]
trace_incl_sutt [lemma, in ITree.Interp.Traces]
trace_eq [definition, in ITree.Interp.Traces]
trace_incl [definition, in ITree.Interp.Traces]
trace_ret [definition, in ITree.Interp.Traces]
trace_refine_bind_cont_inv [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_set_complete [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_diverge_bind [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_converge_bind [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_all_infinite [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_may_converge [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_may_converge_ex [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis_l [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis_add [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis_inv [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_ret_inv_l [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_ret_inv_r [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_ret [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_proper [instance, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_proper_right' [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_refine_proper_left' [lemma, in ITree.Extra.ITrace.ITraceFacts]
trace_inf_often [definition, in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_monot [lemma, in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_ [definition, in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_vis_pos [constructor, in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_vis_neg [constructor, in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_tau [constructor, in ITree.Extra.ITrace.ITracePreds]
trace_inf_oftenF [inductive, in ITree.Extra.ITrace.ITracePreds]
trace_forall_proper_eutt [instance, in ITree.Extra.ITrace.ITracePreds]
trace_forall_proper_aux [lemma, in ITree.Extra.ITrace.ITracePreds]
trace_forall [definition, in ITree.Extra.ITrace.ITracePreds]
trace_forall_monot [lemma, in ITree.Extra.ITrace.ITracePreds]
trace_forall_ [definition, in ITree.Extra.ITrace.ITracePreds]
trace_forall_vis [constructor, in ITree.Extra.ITrace.ITracePreds]
trace_forall_tau [constructor, in ITree.Extra.ITrace.ITracePreds]
trace_forall_ret [constructor, in ITree.Extra.ITrace.ITracePreds]
trace_forallF [inductive, in ITree.Extra.ITrace.ITracePreds]
trans [projection, in ITree.Extra.Dijkstra.DijkstraMonad]
transD [definition, in ITree.Eq.UpToTaus]
transDleU [lemma, in ITree.Eq.UpToTaus]
transD_transL [lemma, in ITree.Eq.UpToTaus]
transD_dist [lemma, in ITree.Eq.UpToTaus]
transD_flip [lemma, in ITree.Eq.UpToTaus]
transD_id [lemma, in ITree.Eq.UpToTaus]
transD_compose [lemma, in ITree.Eq.UpToTaus]
transD_mon [lemma, in ITree.Eq.UpToTaus]
transitive [projection, in ITree.Basics.HeterogeneousRelations]
transitive [constructor, in ITree.Basics.HeterogeneousRelations]
TransitiveH [record, in ITree.Basics.HeterogeneousRelations]
TransitiveH [inductive, in ITree.Basics.HeterogeneousRelations]
TransitiveH_Transitive [lemma, in ITree.Basics.HeterogeneousRelations]
Transitive_failT_eq1 [instance, in ITree.Events.FailFacts]
Transitive_EQ_REL [lemma, in ITree.Extra.IForest]
Transitive_R:37 [binder, in ITree.Indexed.Relation]
Transitive_i_pointwise [instance, in ITree.Indexed.Relation]
Transitive_eutt [instance, in ITree.Eq.Eqit]
Transitive_eqit_eq [instance, in ITree.Eq.Eqit]
Transitive_eqit [instance, in ITree.Eq.Eqit]
Transitive_bot2 [instance, in ITree.Eq.Eqit]
transL [inductive, in ITree.Eq.UpToTaus]
translate [definition, in ITree.Interp.Interp]
translateF [definition, in ITree.Interp.Interp]
TranslateFacts [section, in ITree.Interp.TranslateFacts]
TranslateFacts [library]
translate_to_interp [lemma, in ITree.Interp.InterpFacts]
translate_trigger [lemma, in ITree.Interp.TranslateFacts]
translate_cmpE [lemma, in ITree.Interp.TranslateFacts]
translate_id [lemma, in ITree.Interp.TranslateFacts]
translate_bind [lemma, in ITree.Interp.TranslateFacts]
translate_vis [lemma, in ITree.Interp.TranslateFacts]
translate_tau [lemma, in ITree.Interp.TranslateFacts]
translate_ret [lemma, in ITree.Interp.TranslateFacts]
transLleU [lemma, in ITree.Eq.UpToTaus]
transL_closed [lemma, in ITree.Eq.UpToTaus]
transL_intro [constructor, in ITree.Eq.UpToTaus]
transpose [definition, in ITree.Basics.HeterogeneousRelations]
TransposeFacts [section, in ITree.Basics.HeterogeneousRelations]
transpose_sum [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_prod [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_monotone [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_sym_eq_rel [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_Proper [instance, in ITree.Basics.HeterogeneousRelations]
transpose_inclusion [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_involution [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_compose [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_sym [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_eq [lemma, in ITree.Basics.HeterogeneousRelations]
transpose_Transitive [instance, in ITree.Basics.HeterogeneousRelations]
transpose_Symmetric [instance, in ITree.Basics.HeterogeneousRelations]
transpose_Reflexive [instance, in ITree.Basics.HeterogeneousRelations]
transU [definition, in ITree.Eq.UpToTaus]
transU_dist_rev [lemma, in ITree.Eq.UpToTaus]
transU_dist [lemma, in ITree.Eq.UpToTaus]
transU_flip [lemma, in ITree.Eq.UpToTaus]
transU_id [lemma, in ITree.Eq.UpToTaus]
transU_compose [lemma, in ITree.Eq.UpToTaus]
transU_mon [lemma, in ITree.Eq.UpToTaus]
trans_rcompose [lemma, in ITree.Eq.Eqit]
TRANS:425 [binder, in ITree.Eq.Eqit]
TRANS:562 [binder, in ITree.Eq.Eqit]
TRet [constructor, in ITree.Interp.Traces]
trigger [abbreviation, in ITree.Core.Subevent]
trigger_inl1 [definition, in ITree.Interp.Recursion]
try_catch_to_throw_prefix [lemma, in ITree.Events.ExceptionFacts]
try_catch_throw_prefix_nop [lemma, in ITree.Events.ExceptionFacts]
try_catch_ev [lemma, in ITree.Events.ExceptionFacts]
try_catch_exc [lemma, in ITree.Events.ExceptionFacts]
try_catch_tau [lemma, in ITree.Events.ExceptionFacts]
try_catch_ret [lemma, in ITree.Events.ExceptionFacts]
try_catch [definition, in ITree.Events.Exception]
tr1:10 [binder, in ITree.Interp.Traces]
tr1:131 [binder, in ITree.Interp.Traces]
tr2:11 [binder, in ITree.Interp.Traces]
tr2:132 [binder, in ITree.Interp.Traces]
tr:119 [binder, in ITree.Extra.ITrace.ITracePreds]
tr:122 [binder, in ITree.Extra.ITrace.ITracePreds]
tr:127 [binder, in ITree.Interp.Traces]
tr:136 [binder, in ITree.Interp.Traces]
tr:15 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
tr:16 [binder, in ITree.Interp.Traces]
tr:26 [binder, in ITree.Interp.Traces]
tr:30 [binder, in ITree.Events.State]
tr:34 [binder, in ITree.Interp.Traces]
tr:34 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
tr:42 [binder, in ITree.Interp.Traces]
tr:43 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
tr:50 [binder, in ITree.Interp.Traces]
tr:73 [binder, in ITree.Interp.Traces]
tr:74 [binder, in ITree.Interp.Traces]
ts:125 [binder, in ITree.Interp.Traces]
TT [definition, in ITree.Basics.Basics]
ttry:14 [binder, in ITree.Events.Exception]
ttry:59 [binder, in ITree.Events.ExceptionFacts]
ttry:70 [binder, in ITree.Events.ExceptionFacts]
ttry:77 [binder, in ITree.Events.ExceptionFacts]
TT:302 [binder, in ITree.Extra.IForest]
TT:315 [binder, in ITree.Extra.IForest]
t_spec:251 [binder, in ITree.Extra.IForest]
t':106 [binder, in ITree.Interp.Traces]
t':113 [binder, in ITree.Interp.InterpFacts]
t':149 [binder, in ITree.Extra.ITrace.ITraceBind]
t':163 [binder, in ITree.Events.StateFacts]
t':194 [binder, in ITree.Extra.IForest]
t':25 [binder, in ITree.Events.Exception]
t':28 [binder, in ITree.Events.Exception]
t':311 [binder, in ITree.Eq.Eqit]
t':320 [binder, in ITree.Extra.IForest]
t':38 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
t':78 [binder, in ITree.Eq.UpToTaus]
t':88 [binder, in ITree.Extra.ITrace.ITraceBind]
t':94 [binder, in ITree.Interp.Traces]
T0:1 [binder, in ITree.Eq.Paco2]
t0:114 [binder, in ITree.Extra.ITrace.ITraceBind]
t0:120 [binder, in ITree.Extra.IForest]
t0:121 [binder, in ITree.Extra.Secure.SecureEqBind]
t0:132 [binder, in ITree.Extra.IForest]
t0:184 [binder, in ITree.Extra.ITrace.ITraceBind]
T0:22 [binder, in ITree.Eq.Paco2]
t0:237 [binder, in ITree.Extra.ITrace.ITraceBind]
t0:249 [binder, in ITree.Extra.ITrace.ITraceBind]
t0:266 [binder, in ITree.Extra.ITrace.ITraceBind]
t0:276 [binder, in ITree.Extra.ITrace.ITraceBind]
t0:286 [binder, in ITree.Extra.ITrace.ITraceBind]
t0:312 [binder, in ITree.Eq.Eqit]
t0:320 [binder, in ITree.Extra.ITrace.ITraceBind]
t0:75 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t0:97 [binder, in ITree.Extra.Secure.SecureEqBind]
t1':114 [binder, in ITree.Interp.Traces]
t1':152 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1':152 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1':203 [binder, in ITree.Eq.Eqit]
t1':311 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1':34 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1':59 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1':71 [binder, in ITree.Eq.Eqit]
t1':89 [binder, in ITree.Eq.Rutt]
t1:102 [binder, in ITree.Extra.IForest]
t1:102 [binder, in ITree.Eq.SimUpToTaus]
t1:104 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:104 [binder, in ITree.Props.Leaf]
t1:106 [binder, in ITree.Eq.Rutt]
t1:11 [binder, in ITree.Eq.UpToTaus]
t1:110 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:110 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:111 [binder, in ITree.Interp.Traces]
t1:112 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
t1:113 [binder, in ITree.Extra.ITrace.ITraceBind]
t1:115 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:118 [binder, in ITree.Events.StateFacts]
t1:118 [binder, in ITree.Interp.Traces]
t1:12 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
t1:121 [binder, in ITree.Extra.IForest]
t1:122 [binder, in ITree.Extra.Secure.SecureStateHandler]
t1:123 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:125 [binder, in ITree.Extra.ITrace.ITracePreds]
t1:129 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:133 [binder, in ITree.Extra.IForest]
t1:134 [binder, in ITree.Props.Leaf]
t1:134 [binder, in ITree.Extra.ITrace.ITraceFacts]
t1:135 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:137 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:138 [binder, in ITree.Events.StateFacts]
t1:138 [binder, in ITree.Extra.ITrace.ITraceFacts]
t1:139 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:14 [binder, in ITree.Props.Infinite]
t1:141 [binder, in ITree.Eq.Eqit]
t1:144 [binder, in ITree.Extra.Secure.SecureEqBind]
t1:147 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:149 [binder, in ITree.Props.Leaf]
t1:150 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:150 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:151 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:153 [binder, in ITree.Events.StateFacts]
t1:161 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:169 [binder, in ITree.Eq.UpToTaus]
t1:17 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:17 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:17 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:173 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:173 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:174 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:175 [binder, in ITree.Eq.UpToTaus]
t1:179 [binder, in ITree.Extra.Secure.SecureStateHandler]
t1:18 [binder, in ITree.Eq.UpToTaus]
t1:181 [binder, in ITree.Eq.UpToTaus]
t1:185 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:186 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:186 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:187 [binder, in ITree.Eq.UpToTaus]
t1:189 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:19 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:19 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:19 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:19 [binder, in ITree.Eq.SimUpToTaus]
t1:193 [binder, in ITree.Eq.UpToTaus]
t1:196 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:20 [binder, in ITree.Extra.Secure.SecureEqBind]
t1:200 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:200 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:201 [binder, in ITree.Eq.Eqit]
t1:203 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:210 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:211 [binder, in ITree.Extra.ITrace.ITraceFacts]
t1:216 [binder, in ITree.Extra.ITrace.ITraceFacts]
t1:217 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:219 [binder, in ITree.Eq.UpToTaus]
t1:22 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:22 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:22 [binder, in ITree.Eq.SimUpToTaus]
t1:224 [binder, in ITree.Eq.Eqit]
t1:230 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t1:233 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:239 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:24 [binder, in ITree.Eq.UpToTaus]
T1:24 [binder, in ITree.Eq.Paco2]
t1:244 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:25 [binder, in ITree.Eq.Eqit]
t1:253 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:259 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:263 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:265 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:27 [binder, in ITree.Eq.Rutt]
t1:273 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:277 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:28 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
t1:28 [binder, in ITree.Events.MapDefaultFacts]
t1:292 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:295 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:3 [binder, in ITree.Eq.EqAxiom]
T1:3 [binder, in ITree.Eq.Paco2]
t1:310 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:32 [binder, in ITree.Eq.Rutt]
t1:324 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:33 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:333 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:35 [binder, in ITree.Props.EuttNoRet]
t1:350 [binder, in ITree.Eq.Eqit]
t1:354 [binder, in ITree.Extra.IForest]
t1:357 [binder, in ITree.Eq.Eqit]
t1:365 [binder, in ITree.Eq.Eqit]
t1:37 [binder, in ITree.Eq.Eqit]
t1:376 [binder, in ITree.Eq.Eqit]
t1:379 [binder, in ITree.Extra.IForest]
t1:38 [binder, in ITree.Interp.HandlerFacts]
t1:38 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
t1:38 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
t1:39 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:39 [binder, in ITree.Extra.Secure.SecureEqBind]
t1:391 [binder, in ITree.Extra.IForest]
t1:391 [binder, in ITree.Eq.Eqit]
t1:398 [binder, in ITree.Eq.Eqit]
t1:40 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:40 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:40 [binder, in ITree.Props.EuttNoRet]
t1:40 [binder, in ITree.Interp.Traces]
t1:41 [binder, in ITree.Eq.Rutt]
t1:43 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
t1:436 [binder, in ITree.Eq.Eqit]
t1:44 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
t1:45 [binder, in ITree.Interp.Traces]
t1:50 [binder, in ITree.Eq.Rutt]
t1:50 [binder, in ITree.Eq.Shallow]
t1:51 [binder, in ITree.Props.EuttNoRet]
t1:53 [binder, in ITree.Interp.Traces]
t1:54 [binder, in ITree.Extra.Secure.SecureEqBind]
t1:57 [binder, in ITree.Eq.SimUpToTaus]
t1:57 [binder, in ITree.Extra.ITrace.ITracePrefix]
t1:57 [binder, in ITree.Interp.Traces]
t1:58 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:59 [binder, in ITree.Eq.Rutt]
t1:6 [binder, in ITree.Events.Nondeterminism]
t1:61 [binder, in ITree.Interp.Traces]
t1:62 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:63 [binder, in ITree.Eq.SimUpToTaus]
t1:640 [binder, in ITree.Eq.Eqit]
t1:65 [binder, in ITree.Eq.Eqit]
t1:67 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:67 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:670 [binder, in ITree.Eq.Eqit]
t1:68 [binder, in ITree.Eq.Rutt]
t1:687 [binder, in ITree.Eq.Eqit]
t1:69 [binder, in ITree.Eq.SimUpToTaus]
t1:697 [binder, in ITree.Eq.Eqit]
t1:701 [binder, in ITree.Eq.Eqit]
t1:71 [binder, in ITree.Interp.Traces]
t1:712 [binder, in ITree.Eq.Eqit]
t1:72 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t1:72 [binder, in ITree.Extra.Secure.SecureEqBind]
t1:725 [binder, in ITree.Eq.Eqit]
t1:73 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
t1:74 [binder, in ITree.Eq.UpToTaus]
t1:75 [binder, in ITree.Eq.SimUpToTaus]
t1:754 [binder, in ITree.Eq.Eqit]
t1:77 [binder, in ITree.Interp.Traces]
t1:77 [binder, in ITree.Eq.Rutt]
t1:78 [binder, in ITree.Extra.ITrace.ITraceFacts]
t1:8 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t1:80 [binder, in ITree.Extra.ITrace.ITracePrefix]
t1:80 [binder, in ITree.Props.EuttNoRet]
t1:81 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:81 [binder, in ITree.Extra.Secure.SecureEqHalt]
t1:81 [binder, in ITree.Eq.SimUpToTaus]
t1:81 [binder, in ITree.Interp.Traces]
t1:85 [binder, in ITree.Interp.Traces]
t1:87 [binder, in ITree.Eq.SimUpToTaus]
t1:87 [binder, in ITree.Eq.Rutt]
t1:91 [binder, in ITree.Props.HasPost]
t1:93 [binder, in ITree.Eq.SimUpToTaus]
t1:95 [binder, in ITree.Events.StateFacts]
t1:95 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
t1:99 [binder, in ITree.Extra.ITrace.ITraceBind]
t2':115 [binder, in ITree.Interp.Traces]
t2':153 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2':153 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2':204 [binder, in ITree.Eq.Eqit]
t2':90 [binder, in ITree.Eq.Rutt]
t2:100 [binder, in ITree.Extra.IForest]
t2:103 [binder, in ITree.Extra.IForest]
t2:103 [binder, in ITree.Eq.SimUpToTaus]
t2:105 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:105 [binder, in ITree.Props.Leaf]
t2:107 [binder, in ITree.Eq.Rutt]
t2:108 [binder, in ITree.Extra.IForest]
t2:111 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:111 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:112 [binder, in ITree.Interp.Traces]
t2:113 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
t2:116 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:119 [binder, in ITree.Events.StateFacts]
t2:119 [binder, in ITree.Interp.Traces]
t2:12 [binder, in ITree.Eq.UpToTaus]
t2:123 [binder, in ITree.Extra.Secure.SecureStateHandler]
t2:124 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:126 [binder, in ITree.Extra.ITrace.ITracePreds]
t2:13 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
t2:130 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:135 [binder, in ITree.Props.Leaf]
t2:135 [binder, in ITree.Extra.ITrace.ITraceFacts]
t2:136 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:139 [binder, in ITree.Events.StateFacts]
t2:139 [binder, in ITree.Extra.ITrace.ITraceFacts]
t2:140 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:142 [binder, in ITree.Eq.Eqit]
t2:145 [binder, in ITree.Extra.Secure.SecureEqBind]
t2:148 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:150 [binder, in ITree.Props.Leaf]
t2:151 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:151 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:154 [binder, in ITree.Events.StateFacts]
t2:162 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:17 [binder, in ITree.Eq.SimUpToTaus]
t2:170 [binder, in ITree.Eq.UpToTaus]
t2:174 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:174 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:175 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:176 [binder, in ITree.Eq.UpToTaus]
t2:18 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:18 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:18 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:180 [binder, in ITree.Extra.Secure.SecureStateHandler]
t2:182 [binder, in ITree.Eq.UpToTaus]
t2:186 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:187 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:187 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:188 [binder, in ITree.Eq.UpToTaus]
t2:19 [binder, in ITree.Eq.UpToTaus]
t2:19 [binder, in ITree.Extra.Secure.SecureEqBind]
t2:190 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:194 [binder, in ITree.Eq.UpToTaus]
t2:197 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:20 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:20 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:201 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:201 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:202 [binder, in ITree.Eq.Eqit]
t2:204 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:211 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:212 [binder, in ITree.Extra.ITrace.ITraceFacts]
t2:217 [binder, in ITree.Extra.ITrace.ITraceFacts]
t2:218 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:220 [binder, in ITree.Eq.UpToTaus]
t2:225 [binder, in ITree.Eq.Eqit]
t2:23 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:23 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:23 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:23 [binder, in ITree.Eq.SimUpToTaus]
t2:231 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t2:240 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:245 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:25 [binder, in ITree.Eq.UpToTaus]
t2:251 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:254 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:260 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:264 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:266 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:274 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:278 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:29 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
t2:29 [binder, in ITree.Events.MapDefaultFacts]
t2:293 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:296 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:30 [binder, in ITree.Eq.Rutt]
t2:30 [binder, in ITree.Eq.Eqit]
t2:312 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:325 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:33 [binder, in ITree.Eq.Rutt]
t2:334 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:34 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:34 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:34 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:35 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:351 [binder, in ITree.Eq.Eqit]
t2:355 [binder, in ITree.Extra.IForest]
t2:358 [binder, in ITree.Eq.Eqit]
t2:36 [binder, in ITree.Props.EuttNoRet]
t2:366 [binder, in ITree.Eq.Eqit]
t2:377 [binder, in ITree.Eq.Eqit]
t2:38 [binder, in ITree.Eq.Eqit]
t2:380 [binder, in ITree.Extra.IForest]
t2:39 [binder, in ITree.Interp.HandlerFacts]
t2:39 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
t2:392 [binder, in ITree.Extra.IForest]
t2:392 [binder, in ITree.Eq.Eqit]
t2:399 [binder, in ITree.Eq.Eqit]
t2:4 [binder, in ITree.Eq.EqAxiom]
t2:40 [binder, in ITree.Extra.Secure.SecureEqBind]
t2:41 [binder, in ITree.Props.EuttNoRet]
t2:41 [binder, in ITree.Interp.Traces]
t2:42 [binder, in ITree.Eq.Rutt]
t2:437 [binder, in ITree.Eq.Eqit]
t2:44 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
t2:45 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
t2:46 [binder, in ITree.Interp.Traces]
t2:51 [binder, in ITree.Eq.Rutt]
t2:51 [binder, in ITree.Eq.Shallow]
t2:52 [binder, in ITree.Props.EuttNoRet]
t2:54 [binder, in ITree.Interp.Traces]
t2:55 [binder, in ITree.Extra.Secure.SecureEqBind]
t2:56 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:58 [binder, in ITree.Eq.SimUpToTaus]
t2:58 [binder, in ITree.Interp.Traces]
t2:60 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:60 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:60 [binder, in ITree.Eq.Rutt]
t2:60 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:62 [binder, in ITree.Interp.Traces]
t2:64 [binder, in ITree.Eq.SimUpToTaus]
t2:641 [binder, in ITree.Eq.Eqit]
t2:671 [binder, in ITree.Eq.Eqit]
t2:688 [binder, in ITree.Eq.Eqit]
t2:69 [binder, in ITree.Eq.Rutt]
t2:698 [binder, in ITree.Eq.Eqit]
t2:7 [binder, in ITree.Events.Nondeterminism]
t2:70 [binder, in ITree.Eq.SimUpToTaus]
t2:702 [binder, in ITree.Eq.Eqit]
t2:713 [binder, in ITree.Eq.Eqit]
t2:72 [binder, in ITree.Interp.Traces]
t2:726 [binder, in ITree.Eq.Eqit]
t2:73 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t2:73 [binder, in ITree.Extra.Secure.SecureEqBind]
t2:74 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
t2:75 [binder, in ITree.Eq.UpToTaus]
t2:755 [binder, in ITree.Eq.Eqit]
t2:76 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:76 [binder, in ITree.Extra.Secure.SecureEqHalt]
t2:78 [binder, in ITree.Interp.Traces]
t2:78 [binder, in ITree.Eq.Rutt]
t2:79 [binder, in ITree.Extra.ITrace.ITraceFacts]
t2:81 [binder, in ITree.Props.EuttNoRet]
t2:82 [binder, in ITree.Eq.SimUpToTaus]
t2:82 [binder, in ITree.Interp.Traces]
t2:83 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
t2:86 [binder, in ITree.Interp.Traces]
t2:88 [binder, in ITree.Eq.SimUpToTaus]
t2:88 [binder, in ITree.Eq.Rutt]
t2:9 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t2:93 [binder, in ITree.Props.HasPost]
t2:94 [binder, in ITree.Eq.SimUpToTaus]
t2:96 [binder, in ITree.Events.StateFacts]
t3:102 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:176 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
t3:219 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:236 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:252 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:261 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t3:294 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:30 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
t3:313 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:314 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:315 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:316 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:326 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t3:40 [binder, in ITree.Extra.Secure.SecureEqProgInsensFacts]
t3:438 [binder, in ITree.Eq.Eqit]
t3:45 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
t3:53 [binder, in ITree.Props.EuttNoRet]
t3:87 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t4:199 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t4:216 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t4:299 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t4:300 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t4:301 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t4:302 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t4:76 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t5:295 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t5:296 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t5:297 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t5:298 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
T:1 [binder, in ITree.Basics.Basics]
t:10 [binder, in ITree.Interp.TranslateFacts]
T:10 [binder, in ITree.Indexed.FunctionFacts]
t:10 [binder, in ITree.Interp.RecursionFacts]
T:10 [binder, in ITree.Indexed.Sum]
t:101 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:103 [binder, in ITree.Events.FailFacts]
t:103 [binder, in ITree.Core.KTreeFacts]
t:103 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:105 [binder, in ITree.Extra.ITrace.ITraceBind]
t:105 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:105 [binder, in ITree.Interp.Traces]
t:106 [binder, in ITree.Core.KTreeFacts]
t:106 [binder, in ITree.Props.Finite]
t:106 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:106 [binder, in ITree.Interp.InterpFacts]
t:107 [binder, in ITree.Props.HasPost]
t:107 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:11 [binder, in ITree.Props.Finite]
t:11 [binder, in ITree.Props.Leaf]
T:11 [binder, in ITree.Interp.HandlerFacts]
t:11 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
t:111 [binder, in ITree.Extra.ITrace.ITracePreds]
t:112 [binder, in ITree.Events.FailFacts]
t:112 [binder, in ITree.Interp.InterpFacts]
t:114 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:115 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:118 [binder, in ITree.Props.HasPost]
t:118 [binder, in ITree.Props.Finite]
T:118 [binder, in ITree.Basics.HeterogeneousRelations]
t:119 [binder, in ITree.Props.HasPost]
T:119 [binder, in ITree.Simple]
t:12 [binder, in ITree.Indexed.FunctionFacts]
t:121 [binder, in ITree.Props.HasPost]
t:122 [binder, in ITree.Interp.InterpFacts]
t:125 [binder, in ITree.Props.HasPost]
T:125 [binder, in ITree.Simple]
t:126 [binder, in ITree.Props.Finite]
t:126 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:127 [binder, in ITree.Extra.ITrace.ITraceBind]
t:129 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:13 [binder, in ITree.Interp.Interp]
t:131 [binder, in ITree.Props.HasPost]
t:131 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:131 [binder, in ITree.Interp.InterpFacts]
t:132 [binder, in ITree.Props.Finite]
t:133 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:136 [binder, in ITree.Extra.ITrace.ITraceBind]
t:138 [binder, in ITree.Props.Finite]
t:14 [binder, in ITree.Props.EuttNoRet]
T:14 [binder, in ITree.Indexed.Relation]
t:142 [binder, in ITree.Extra.ITrace.ITraceBind]
t:142 [binder, in ITree.Props.Finite]
t:146 [binder, in ITree.Props.Finite]
T:146 [binder, in ITree.Basics.HeterogeneousRelations]
t:148 [binder, in ITree.Extra.ITrace.ITraceBind]
t:15 [binder, in ITree.Events.StateFacts]
T:15 [binder, in ITree.Indexed.Function]
t:15 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
t:15 [binder, in ITree.Core.ITreeDefinition]
t:151 [binder, in ITree.Simple]
t:152 [binder, in ITree.Props.Finite]
t:152 [binder, in ITree.Simple]
t:155 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t:156 [binder, in ITree.Extra.IForest]
t:157 [binder, in ITree.Props.Finite]
t:158 [binder, in ITree.Extra.IForest]
t:16 [binder, in ITree.Props.HasPost]
t:16 [binder, in ITree.Events.Exception]
T:16 [binder, in ITree.Interp.RecursionFacts]
T:160 [binder, in ITree.Props.Leaf]
t:162 [binder, in ITree.Events.StateFacts]
t:162 [binder, in ITree.Props.Leaf]
t:163 [binder, in ITree.Props.Finite]
t:165 [binder, in ITree.Extra.IForest]
t:168 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:169 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t:17 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:17 [binder, in ITree.Events.Writer]
T:17 [binder, in ITree.Events.Concurrency]
t:17 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
t:17 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
t:17 [binder, in ITree.Interp.RecursionFacts]
T:17 [binder, in ITree.Core.ITreeDefinition]
t:171 [binder, in ITree.Extra.ITrace.ITraceBind]
t:171 [binder, in ITree.Extra.IForest]
t:172 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:172 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:173 [binder, in ITree.Events.StateFacts]
t:174 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:175 [binder, in ITree.Props.Finite]
t:175 [binder, in ITree.Simple]
T:18 [binder, in ITree.Indexed.Relation]
t:181 [binder, in ITree.Props.Finite]
t:182 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:185 [binder, in ITree.Props.Finite]
t:187 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:188 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:189 [binder, in ITree.Props.Finite]
T:19 [binder, in ITree.Interp.Recursion]
t:19 [binder, in ITree.Props.Finite]
t:19 [binder, in ITree.Events.Exception]
t:19 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
T:19 [binder, in ITree.Interp.HandlerFacts]
t:190 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:192 [binder, in ITree.Props.Finite]
t:192 [binder, in ITree.Extra.ITrace.ITraceFacts]
T:192 [binder, in ITree.Simple]
t:193 [binder, in ITree.Extra.IForest]
t:194 [binder, in ITree.Props.Finite]
t:196 [binder, in ITree.Extra.ITrace.ITraceBind]
t:197 [binder, in ITree.Props.Finite]
t:198 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:20 [binder, in ITree.Props.Finite]
t:20 [binder, in ITree.Props.Leaf]
t:20 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t:20 [binder, in ITree.Interp.TranslateFacts]
t:20 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
t:200 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t:206 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:207 [binder, in ITree.Extra.ITrace.ITraceBind]
t:208 [binder, in ITree.Simple]
t:21 [binder, in ITree.Basics.CategoryOps]
T:21 [binder, in ITree.Interp.Recursion]
t:216 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:217 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:219 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
T:22 [binder, in ITree.Interp.HandlerFacts]
T:22 [binder, in ITree.Indexed.Relation]
t:22 [binder, in ITree.Interp.InterpFacts]
t:22 [binder, in ITree.Interp.Interp]
T:22 [binder, in ITree.Interp.RecursionFacts]
t:220 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
t:221 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:223 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:224 [binder, in ITree.Extra.ITrace.ITraceBind]
t:226 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:227 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:23 [binder, in ITree.Interp.Traces]
t:23 [binder, in ITree.Events.Concurrency]
T:230 [binder, in ITree.Extra.IForest]
t:231 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:232 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:232 [binder, in ITree.Simple]
t:233 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:234 [binder, in ITree.Extra.ITrace.ITraceBind]
t:24 [binder, in ITree.Props.HasPost]
t:24 [binder, in ITree.Extra.IForest]
t:24 [binder, in ITree.Props.Finite]
t:24 [binder, in ITree.Events.Exception]
T:24 [binder, in ITree.Indexed.Relation]
T:24 [binder, in ITree.Interp.RecursionFacts]
T:24 [binder, in ITree.Core.ITreeDefinition]
T:242 [binder, in ITree.Basics.HeterogeneousRelations]
t:245 [binder, in ITree.Extra.IForest]
t:25 [binder, in ITree.Extra.IForest]
t:25 [binder, in ITree.Interp.Traces]
T:25 [binder, in ITree.Core.Subevent]
t:254 [binder, in ITree.Extra.ITrace.ITraceBind]
T:254 [binder, in ITree.Simple]
t:258 [binder, in ITree.Extra.IForest]
T:259 [binder, in ITree.Simple]
T:26 [binder, in ITree.Events.FailFacts]
T:26 [binder, in ITree.Events.StateFacts]
t:26 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:26 [binder, in ITree.Interp.TranslateFacts]
t:26 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
T:26 [binder, in ITree.Interp.RecursionFacts]
t:26 [binder, in ITree.Events.State]
t:269 [binder, in ITree.Extra.IForest]
t:274 [binder, in ITree.Eq.UpToTaus]
t:276 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:279 [binder, in ITree.Extra.IForest]
t:28 [binder, in ITree.Extra.ITrace.ITraceBind]
T:28 [binder, in ITree.Events.FailFacts]
T:28 [binder, in ITree.Indexed.Relation]
t:28 [binder, in ITree.Events.Writer]
T:28 [binder, in ITree.Interp.RecursionFacts]
t:282 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:285 [binder, in ITree.Extra.IForest]
T:286 [binder, in ITree.Basics.HeterogeneousRelations]
t:289 [binder, in ITree.Eq.UpToTaus]
t:289 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:29 [binder, in ITree.Props.HasPost]
T:29 [binder, in ITree.Interp.Recursion]
t:29 [binder, in ITree.Interp.HandlerFacts]
t:29 [binder, in ITree.Extra.Dijkstra.StateSpecT]
t:29 [binder, in ITree.Interp.RecursionFacts]
T:29 [binder, in ITree.Core.ITreeDefinition]
t:292 [binder, in ITree.Extra.ITrace.ITraceBind]
t:293 [binder, in ITree.Eq.Eqit]
t:294 [binder, in ITree.Eq.Eqit]
t:295 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:296 [binder, in ITree.Eq.UpToTaus]
t:298 [binder, in ITree.Eq.Eqit]
t:3 [binder, in ITree.Props.HasPost]
T:3 [binder, in ITree.Indexed.Relation]
t:3 [binder, in ITree.Props.Cofinite]
T:3 [binder, in ITree.Indexed.FunctionFacts]
T:30 [binder, in ITree.Events.FailFacts]
t:30 [binder, in ITree.Extra.IForest]
T:30 [binder, in ITree.Indexed.Relation]
T:301 [binder, in ITree.Extra.IForest]
t:301 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:303 [binder, in ITree.Eq.UpToTaus]
t:303 [binder, in ITree.Eq.Eqit]
t:306 [binder, in ITree.Extra.ITrace.ITraceBind]
t:310 [binder, in ITree.Eq.UpToTaus]
t:310 [binder, in ITree.Eq.Eqit]
t:313 [binder, in ITree.Extra.ITrace.ITraceBind]
T:314 [binder, in ITree.Extra.IForest]
t:319 [binder, in ITree.Extra.IForest]
T:32 [binder, in ITree.Events.FailFacts]
t:32 [binder, in ITree.Props.Finite]
t:32 [binder, in ITree.Interp.InterpFacts]
t:321 [binder, in ITree.Basics.CategoryFacts]
t:326 [binder, in ITree.Extra.ITrace.ITraceBind]
T:33 [binder, in ITree.Events.StateFacts]
t:33 [binder, in ITree.Interp.TranslateFacts]
t:33 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
T:339 [binder, in ITree.Extra.IForest]
t:34 [binder, in ITree.Props.HasPost]
t:34 [binder, in ITree.Interp.HandlerFacts]
T:34 [binder, in ITree.Indexed.Relation]
t:34 [binder, in ITree.Core.ITreeDefinition]
t:341 [binder, in ITree.Extra.IForest]
t:35 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:36 [binder, in ITree.Props.Infinite]
T:36 [binder, in ITree.Indexed.Relation]
t:37 [binder, in ITree.Interp.Traces]
T:37 [binder, in ITree.Core.Subevent]
t:37 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
T:376 [binder, in ITree.Extra.IForest]
T:387 [binder, in ITree.Extra.IForest]
t:39 [binder, in ITree.Props.HasPost]
t:39 [binder, in ITree.Basics.CategoryTheory]
t:39 [binder, in ITree.Events.State]
t:4 [binder, in ITree.Eq.EuttExtras]
t:4 [binder, in ITree.Events.Concurrency]
T:4 [binder, in ITree.Indexed.FunctionFacts]
t:4 [binder, in ITree.Simple]
t:40 [binder, in ITree.Basics.Basics]
T:40 [binder, in ITree.Interp.HandlerFacts]
T:40 [binder, in ITree.Indexed.Relation]
T:40 [binder, in ITree.Interp.TranslateFacts]
t:40 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
t:402 [binder, in ITree.Eq.Eqit]
t:405 [binder, in ITree.Eq.Eqit]
t:406 [binder, in ITree.Extra.IForest]
t:409 [binder, in ITree.Eq.Eqit]
t:42 [binder, in ITree.Events.ExceptionFacts]
t:42 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
T:42 [binder, in ITree.Interp.HandlerFacts]
T:42 [binder, in ITree.Indexed.Relation]
t:42 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:424 [binder, in ITree.Extra.IForest]
T:43 [binder, in ITree.Events.StateFacts]
T:43 [binder, in ITree.Interp.TranslateFacts]
t:431 [binder, in ITree.Extra.IForest]
t:44 [binder, in ITree.Props.HasPost]
t:44 [binder, in ITree.Events.StateFacts]
t:44 [binder, in ITree.Props.Finite]
t:44 [binder, in ITree.Props.Infinite]
t:44 [binder, in ITree.Extra.ITrace.ITracePrefix]
T:44 [binder, in ITree.Interp.HandlerFacts]
t:45 [binder, in ITree.Props.EuttNoRet]
T:45 [binder, in ITree.Events.State]
t:46 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:46 [binder, in ITree.Extra.ITrace.ITraceDefinition]
T:46 [binder, in ITree.Interp.HandlerFacts]
T:46 [binder, in ITree.Indexed.Relation]
t:48 [binder, in ITree.Props.HasPost]
T:48 [binder, in ITree.Interp.HandlerFacts]
T:48 [binder, in ITree.Indexed.Relation]
t:48 [binder, in ITree.Core.ITreeDefinition]
t:49 [binder, in ITree.Eq.UpToTaus]
t:49 [binder, in ITree.Props.Infinite]
t:49 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:49 [binder, in ITree.Interp.Traces]
T:49 [binder, in ITree.Simple]
t:5 [binder, in ITree.Interp.Recursion]
T:5 [binder, in ITree.Indexed.Function]
T:5 [binder, in ITree.Indexed.Relation]
t:5 [binder, in ITree.Interp.TranslateFacts]
T:50 [binder, in ITree.Interp.HandlerFacts]
t:51 [binder, in ITree.Events.FailFacts]
T:51 [binder, in ITree.Indexed.Relation]
t:53 [binder, in ITree.Extra.ITrace.ITraceBind]
t:53 [binder, in ITree.Props.Finite]
t:53 [binder, in ITree.Props.Leaf]
T:53 [binder, in ITree.Indexed.Relation]
t:53 [binder, in ITree.Events.MapDefaultFacts]
t:54 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:55 [binder, in ITree.Props.HasPost]
t:55 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:56 [binder, in ITree.Events.State]
t:57 [binder, in ITree.Extra.Dijkstra.TracesIT]
t:570 [binder, in ITree.Eq.Eqit]
t:577 [binder, in ITree.Eq.Eqit]
t:58 [binder, in ITree.Basics.CategoryFacts]
t:58 [binder, in ITree.Interp.TranslateFacts]
t:584 [binder, in ITree.Eq.Eqit]
t:590 [binder, in ITree.Eq.Eqit]
t:592 [binder, in ITree.Eq.Eqit]
t:593 [binder, in ITree.Eq.Eqit]
t:594 [binder, in ITree.Eq.Eqit]
t:595 [binder, in ITree.Eq.Eqit]
t:596 [binder, in ITree.Eq.Eqit]
t:597 [binder, in ITree.Eq.Eqit]
t:6 [binder, in ITree.Props.Finite]
t:6 [binder, in ITree.Props.Infinite]
t:6 [binder, in ITree.Props.Leaf]
t:6 [binder, in ITree.Props.Cofinite]
t:6 [binder, in ITree.Interp.Interp]
t:6 [binder, in ITree.Interp.TranslateFacts]
T:6 [binder, in ITree.Indexed.FunctionFacts]
t:6 [binder, in ITree.Simple]
t:60 [binder, in ITree.Events.State]
t:606 [binder, in ITree.Eq.Eqit]
t:608 [binder, in ITree.Extra.IForest]
t:61 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:61 [binder, in ITree.Props.Infinite]
t:61 [binder, in ITree.Eq.Shallow]
t:61 [binder, in ITree.Events.State]
t:62 [binder, in ITree.Props.Infinite]
t:62 [binder, in ITree.Extra.Dijkstra.StateSpecT]
t:62 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
t:62 [binder, in ITree.Core.ITreeDefinition]
t:63 [binder, in ITree.Events.ExceptionFacts]
t:633 [binder, in ITree.Eq.Eqit]
t:641 [binder, in ITree.Extra.IForest]
t:65 [binder, in ITree.Extra.ITrace.ITraceBind]
t:65 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:65 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:66 [binder, in ITree.Simple]
T:67 [binder, in ITree.Events.StateFacts]
t:67 [binder, in ITree.Props.Leaf]
t:68 [binder, in ITree.Props.Finite]
t:68 [binder, in ITree.Extra.Secure.SecureStateHandlerPi]
t:69 [binder, in ITree.Events.StateFacts]
t:69 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:7 [binder, in ITree.Props.Finite]
t:7 [binder, in ITree.Props.Leaf]
t:7 [binder, in ITree.Interp.TranslateFacts]
t:7 [binder, in ITree.Core.ITreeDefinition]
t:70 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:70 [binder, in ITree.Extra.ITrace.ITracePrefix]
t:70 [binder, in ITree.Props.EuttNoRet]
t:70 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:70 [binder, in ITree.Interp.InterpFacts]
t:71 [binder, in ITree.Extra.ITrace.ITraceBind]
t:71 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:72 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:73 [binder, in ITree.Props.EuttNoRet]
t:74 [binder, in ITree.Events.FailFacts]
t:75 [binder, in ITree.Props.Infinite]
t:75 [binder, in ITree.Eq.Shallow]
t:75 [binder, in ITree.Interp.InterpFacts]
t:76 [binder, in ITree.Props.Leaf]
T:77 [binder, in ITree.Events.FailFacts]
t:77 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
T:776 [binder, in ITree.Eq.Eqit]
t:78 [binder, in ITree.Interp.InterpFacts]
T:784 [binder, in ITree.Eq.Eqit]
t:787 [binder, in ITree.Eq.Eqit]
t:79 [binder, in ITree.Props.HasPost]
t:79 [binder, in ITree.Props.Infinite]
T:792 [binder, in ITree.Eq.Eqit]
t:795 [binder, in ITree.Eq.Eqit]
t:8 [binder, in ITree.Eq.EqAxiom]
t:8 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:8 [binder, in ITree.Events.Concurrency]
t:8 [binder, in ITree.Interp.TranslateFacts]
t:8 [binder, in ITree.Extra.Dijkstra.PureITreeBasics]
t:801 [binder, in ITree.Eq.Eqit]
t:814 [binder, in ITree.Eq.Eqit]
t:82 [binder, in ITree.Extra.ITrace.ITraceBind]
t:82 [binder, in ITree.Core.ITreeDefinition]
t:83 [binder, in ITree.Props.Leaf]
t:85 [binder, in ITree.Events.ExceptionFacts]
t:85 [binder, in ITree.Props.Finite]
t:85 [binder, in ITree.Props.Infinite]
t:85 [binder, in ITree.Interp.InterpFacts]
T:86 [binder, in ITree.Extra.IForest]
t:87 [binder, in ITree.Extra.ITrace.ITraceBind]
t:87 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:88 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
t:88 [binder, in ITree.Extra.ITrace.ITraceFacts]
t:897 [binder, in ITree.Eq.Eqit]
t:9 [binder, in ITree.Props.HasPost]
t:9 [binder, in ITree.Events.ExceptionFacts]
T:9 [binder, in ITree.Interp.HandlerFacts]
T:9 [binder, in ITree.Indexed.Relation]
T:9 [binder, in ITree.Indexed.Sum]
T:90 [binder, in ITree.Extra.IForest]
t:905 [binder, in ITree.Eq.Eqit]
t:91 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:92 [binder, in ITree.Extra.Secure.SecureStateHandler]
t:93 [binder, in ITree.Props.Infinite]
t:93 [binder, in ITree.Interp.InterpFacts]
t:94 [binder, in ITree.Simple]
t:96 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:96 [binder, in ITree.Eq.Shallow]
t:97 [binder, in ITree.Props.Finite]
t:97 [binder, in ITree.Interp.Traces]
t:99 [binder, in ITree.Interp.InterpFacts]

U

unCall [definition, in ITree.Interp.Recursion]
undep [definition, in ITree.Events.Dependent]
unfold_interp_fail [lemma, in ITree.Events.FailFacts]
unfold_interp_state [lemma, in ITree.Events.StateFacts]
unfold_iter_ktree [lemma, in ITree.Core.KTreeFacts]
unfold_forever_ [lemma, in ITree.Eq.Shallow]
unfold_aloop_ [lemma, in ITree.Eq.Shallow]
unfold_interp [lemma, in ITree.Interp.InterpFacts]
unfold_translate [lemma, in ITree.Interp.TranslateFacts]
unfold_translate_ [lemma, in ITree.Interp.TranslateFacts]
unfold_spin [lemma, in ITree.Extra.Dijkstra.PureITreeBasics]
unfold_interp_mrec_h [lemma, in ITree.Interp.RecursionFacts]
unfold_interp_mrec [lemma, in ITree.Interp.RecursionFacts]
unfold_forever [lemma, in ITree.Eq.Eqit]
unfold_iter [lemma, in ITree.Eq.Eqit]
unfold_bind [lemma, in ITree.Eq.Eqit]
unique_terminal [abbreviation, in ITree.Basics.CategoryTheory]
unique_initial [abbreviation, in ITree.Basics.CategoryTheory]
UnitL [record, in ITree.Basics.CategoryOps]
UnitL [inductive, in ITree.Basics.CategoryOps]
UnitLEpi_Product [instance, in ITree.Basics.CategoryFacts]
UnitLEpi_Coproduct [instance, in ITree.Basics.CategoryFacts]
UnitLIso [abbreviation, in ITree.Basics.CategoryTheory]
UnitLIso_C:267 [binder, in ITree.Basics.CategoryTheory]
UnitLIso_C:265 [binder, in ITree.Basics.CategoryTheory]
UnitLMono_Product [instance, in ITree.Basics.CategoryFacts]
UnitLMono_Coproduct [instance, in ITree.Basics.CategoryFacts]
UnitLNatural [record, in ITree.Basics.CategoryTheory]
UnitLNatural [inductive, in ITree.Basics.CategoryTheory]
UnitLNatural_Product [instance, in ITree.Basics.CategoryFacts]
UnitLNatural_Coproduct [instance, in ITree.Basics.CategoryFacts]
UnitLNatural_sum_rel [instance, in ITree.Basics.CategoryRelations]
UnitLNatural_prod_rel [instance, in ITree.Basics.CategoryRelations]
UnitL_Product [instance, in ITree.Basics.CategoryOps]
UnitL_Coproduct [instance, in ITree.Basics.CategoryOps]
UnitL_prod [instance, in ITree.Basics.CategoryRelations]
UnitL_sum [instance, in ITree.Basics.CategoryRelations]
UnitL_i:317 [binder, in ITree.Basics.CategoryTheory]
UnitL_bif:250 [binder, in ITree.Basics.CategoryTheory]
UnitL' [record, in ITree.Basics.CategoryOps]
UnitL' [inductive, in ITree.Basics.CategoryOps]
UnitL'Natural [record, in ITree.Basics.CategoryTheory]
UnitL'Natural [inductive, in ITree.Basics.CategoryTheory]
UnitL'Natural_Product [instance, in ITree.Basics.CategoryFacts]
UnitL'Natural_Coproduct [instance, in ITree.Basics.CategoryFacts]
UnitL'Natural_sum_rel [instance, in ITree.Basics.CategoryRelations]
UnitL'Natural_prod_rel [instance, in ITree.Basics.CategoryRelations]
UnitL'_Product [instance, in ITree.Basics.CategoryOps]
UnitL'_Coproduct [instance, in ITree.Basics.CategoryOps]
UnitL'_prod [instance, in ITree.Basics.CategoryRelations]
UnitL'_sum [instance, in ITree.Basics.CategoryRelations]
UnitL'_i:318 [binder, in ITree.Basics.CategoryTheory]
UnitL'_bif:251 [binder, in ITree.Basics.CategoryTheory]
UnitR [record, in ITree.Basics.CategoryOps]
UnitR [inductive, in ITree.Basics.CategoryOps]
UnitREpi_Product [instance, in ITree.Basics.CategoryFacts]
UnitREpi_Coproduct [instance, in ITree.Basics.CategoryFacts]
UnitRIso [abbreviation, in ITree.Basics.CategoryTheory]
UnitRIso_C:272 [binder, in ITree.Basics.CategoryTheory]
UnitRIso_C:270 [binder, in ITree.Basics.CategoryTheory]
UnitRMono_Product [instance, in ITree.Basics.CategoryFacts]
UnitRMono_Coproduct [instance, in ITree.Basics.CategoryFacts]
UnitR_Product [instance, in ITree.Basics.CategoryOps]
UnitR_Coproduct [instance, in ITree.Basics.CategoryOps]
UnitR_prod [instance, in ITree.Basics.CategoryRelations]
UnitR_sum [instance, in ITree.Basics.CategoryRelations]
UnitR_i:319 [binder, in ITree.Basics.CategoryTheory]
UnitR_bif:252 [binder, in ITree.Basics.CategoryTheory]
UnitR' [record, in ITree.Basics.CategoryOps]
UnitR' [inductive, in ITree.Basics.CategoryOps]
UnitR'_Product [instance, in ITree.Basics.CategoryOps]
UnitR'_Coproduct [instance, in ITree.Basics.CategoryOps]
UnitR'_prod [instance, in ITree.Basics.CategoryRelations]
UnitR'_sum [instance, in ITree.Basics.CategoryRelations]
UnitR'_i:320 [binder, in ITree.Basics.CategoryTheory]
UnitR'_bif:253 [binder, in ITree.Basics.CategoryTheory]
unit_r'_ [abbreviation, in ITree.Basics.CategoryOps]
unit_r_ [abbreviation, in ITree.Basics.CategoryOps]
unit_l'_ [abbreviation, in ITree.Basics.CategoryOps]
unit_l_ [abbreviation, in ITree.Basics.CategoryOps]
unit_r' [projection, in ITree.Basics.CategoryOps]
unit_r' [constructor, in ITree.Basics.CategoryOps]
unit_r [projection, in ITree.Basics.CategoryOps]
unit_r [constructor, in ITree.Basics.CategoryOps]
unit_l' [projection, in ITree.Basics.CategoryOps]
unit_l' [constructor, in ITree.Basics.CategoryOps]
unit_l [projection, in ITree.Basics.CategoryOps]
unit_l [constructor, in ITree.Basics.CategoryOps]
unit_r'_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
unit_r_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
unit_l'_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
unit_l_pure [lemma, in ITree.Basics.CategoryKleisliFacts]
unit_r'_fst [lemma, in ITree.Basics.CategoryFacts]
unit_l'_snd [lemma, in ITree.Basics.CategoryFacts]
unit_r_epi [lemma, in ITree.Basics.CategoryTheory]
unit_r_mono [lemma, in ITree.Basics.CategoryTheory]
unit_l_epi [lemma, in ITree.Basics.CategoryTheory]
unit_l_mono [lemma, in ITree.Basics.CategoryTheory]
unpriv_e_eqit_secure [lemma, in ITree.Extra.Secure.SecureEqEuttHalt]
unsubm [definition, in ITree.Basics.CategorySub]
UpToTaus [library]
UU:131 [binder, in ITree.Props.Leaf]
UU:148 [binder, in ITree.Props.Leaf]
UU:686 [binder, in ITree.Eq.Eqit]
UU:724 [binder, in ITree.Eq.Eqit]
U1:101 [binder, in ITree.Props.Leaf]
u1:109 [binder, in ITree.Props.Leaf]
U1:129 [binder, in ITree.Props.Leaf]
u1:138 [binder, in ITree.Props.Leaf]
U1:146 [binder, in ITree.Props.Leaf]
u1:153 [binder, in ITree.Props.Leaf]
u1:208 [binder, in ITree.Eq.UpToTaus]
u1:218 [binder, in ITree.Extra.IForest]
u1:223 [binder, in ITree.Extra.IForest]
u1:234 [binder, in ITree.Extra.IForest]
u1:236 [binder, in ITree.Extra.IForest]
u1:327 [binder, in ITree.Eq.Eqit]
U1:644 [binder, in ITree.Eq.Eqit]
U1:667 [binder, in ITree.Eq.Eqit]
u1:675 [binder, in ITree.Eq.Eqit]
U1:684 [binder, in ITree.Eq.Eqit]
u1:692 [binder, in ITree.Eq.Eqit]
U1:722 [binder, in ITree.Eq.Eqit]
u1:730 [binder, in ITree.Eq.Eqit]
u1:95 [binder, in ITree.Props.HasPost]
U2:102 [binder, in ITree.Props.Leaf]
u2:110 [binder, in ITree.Props.Leaf]
U2:130 [binder, in ITree.Props.Leaf]
u2:139 [binder, in ITree.Props.Leaf]
U2:147 [binder, in ITree.Props.Leaf]
u2:154 [binder, in ITree.Props.Leaf]
u2:210 [binder, in ITree.Eq.UpToTaus]
u2:219 [binder, in ITree.Extra.IForest]
u2:224 [binder, in ITree.Extra.IForest]
u2:235 [binder, in ITree.Extra.IForest]
u2:237 [binder, in ITree.Extra.IForest]
u2:328 [binder, in ITree.Eq.Eqit]
U2:645 [binder, in ITree.Eq.Eqit]
U2:668 [binder, in ITree.Eq.Eqit]
u2:676 [binder, in ITree.Eq.Eqit]
U2:685 [binder, in ITree.Eq.Eqit]
u2:693 [binder, in ITree.Eq.Eqit]
U2:723 [binder, in ITree.Eq.Eqit]
u2:731 [binder, in ITree.Eq.Eqit]
u2:96 [binder, in ITree.Props.HasPost]
u:10 [binder, in ITree.Eq.SimUpToTaus]
U:105 [binder, in ITree.Props.HasPost]
u:107 [binder, in ITree.Props.Finite]
U:11 [binder, in ITree.Simple]
u:110 [binder, in ITree.Props.HasPost]
u:119 [binder, in ITree.Props.Finite]
u:120 [binder, in ITree.Props.HasPost]
u:122 [binder, in ITree.Props.HasPost]
u:141 [binder, in ITree.Props.Finite]
u:145 [binder, in ITree.Props.Finite]
u:15 [binder, in ITree.Core.Subevent]
U:15 [binder, in ITree.Interp.RecursionFacts]
u:15 [binder, in ITree.Simple]
U:155 [binder, in ITree.Simple]
u:159 [binder, in ITree.Simple]
U:162 [binder, in ITree.Simple]
u:165 [binder, in ITree.Props.Leaf]
u:166 [binder, in ITree.Simple]
U:172 [binder, in ITree.Extra.IForest]
U:174 [binder, in ITree.Simple]
u:176 [binder, in ITree.Eq.Eqit]
U:179 [binder, in ITree.Simple]
U:18 [binder, in ITree.Core.ITreeDefinition]
u:19 [binder, in ITree.Eq.Eqit]
u:199 [binder, in ITree.Eq.UpToTaus]
U:20 [binder, in ITree.Interp.RecursionFacts]
u:20 [binder, in ITree.Core.ITreeDefinition]
U:20 [binder, in ITree.Simple]
u:21 [binder, in ITree.Props.Finite]
u:21 [binder, in ITree.Basics.CategoryKleisli]
u:210 [binder, in ITree.Extra.IForest]
U:218 [binder, in ITree.Simple]
u:24 [binder, in ITree.Simple]
U:243 [binder, in ITree.Basics.HeterogeneousRelations]
U:25 [binder, in ITree.Core.ITreeDefinition]
u:26 [binder, in ITree.Extra.IForest]
u:26 [binder, in ITree.Core.ITreeDefinition]
U:273 [binder, in ITree.Eq.UpToTaus]
u:277 [binder, in ITree.Eq.UpToTaus]
U:28 [binder, in ITree.Interp.HandlerFacts]
U:287 [binder, in ITree.Basics.HeterogeneousRelations]
u:289 [binder, in ITree.Eq.Eqit]
U:30 [binder, in ITree.Core.ITreeDefinition]
U:302 [binder, in ITree.Eq.Eqit]
u:307 [binder, in ITree.Eq.Eqit]
u:32 [binder, in ITree.Events.State]
U:33 [binder, in ITree.Interp.HandlerFacts]
U:34 [binder, in ITree.Events.StateFacts]
u:34 [binder, in ITree.Props.Leaf]
U:34 [binder, in ITree.Simple]
U:340 [binder, in ITree.Eq.Eqit]
u:344 [binder, in ITree.Eq.Eqit]
U:353 [binder, in ITree.Extra.IForest]
u:359 [binder, in ITree.Extra.IForest]
U:37 [binder, in ITree.Interp.InterpFacts]
U:4 [binder, in ITree.Core.Subevent]
u:423 [binder, in ITree.Extra.IForest]
u:438 [binder, in ITree.Extra.IForest]
U:44 [binder, in ITree.Props.EuttNoRet]
u:54 [binder, in ITree.Props.Leaf]
U:605 [binder, in ITree.Eq.Eqit]
U:610 [binder, in ITree.Eq.Eqit]
U:618 [binder, in ITree.Eq.Eqit]
U:653 [binder, in ITree.Eq.Eqit]
u:657 [binder, in ITree.Eq.Eqit]
u:68 [binder, in ITree.Props.Leaf]
U:74 [binder, in ITree.Eq.Shallow]
u:769 [binder, in ITree.Eq.Eqit]
U:78 [binder, in ITree.Events.FailFacts]
U:78 [binder, in ITree.Simple]
U:79 [binder, in ITree.Eq.Shallow]
u:79 [binder, in ITree.Extra.ITrace.ITracePreds]
u:8 [binder, in ITree.Props.Finite]
u:8 [binder, in ITree.Props.Leaf]
u:86 [binder, in ITree.Props.Finite]
U:9 [binder, in ITree.Core.Subevent]
u:98 [binder, in ITree.Props.Finite]

V

vclo':118 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo':118 [binder, in ITree.Extra.Secure.SecureEqHalt]
vclo':44 [binder, in ITree.Eq.Eqit]
vclo':80 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
vclo:108 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:108 [binder, in ITree.Extra.Secure.SecureEqHalt]
vclo:11 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
vclo:11 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:11 [binder, in ITree.Extra.Secure.SecureEqHalt]
vclo:113 [binder, in ITree.Eq.Eqit]
vclo:115 [binder, in ITree.Props.Leaf]
vclo:117 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:117 [binder, in ITree.Extra.Secure.SecureEqHalt]
vclo:126 [binder, in ITree.Eq.Eqit]
vclo:128 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:128 [binder, in ITree.Extra.Secure.SecureEqHalt]
vclo:168 [binder, in ITree.Eq.Eqit]
vclo:230 [binder, in ITree.Eq.Eqit]
vclo:241 [binder, in ITree.Eq.Eqit]
vclo:35 [binder, in ITree.Eq.Eqit]
vclo:364 [binder, in ITree.Extra.IForest]
vclo:373 [binder, in ITree.Eq.Eqit]
vclo:43 [binder, in ITree.Eq.Eqit]
vclo:53 [binder, in ITree.Eq.Eqit]
vclo:63 [binder, in ITree.Eq.Eqit]
vclo:680 [binder, in ITree.Eq.Eqit]
vclo:70 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
vclo:79 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
vclo:86 [binder, in ITree.Eq.Eqit]
vclo:87 [binder, in ITree.Eq.UpToTaus]
vclo:9 [binder, in ITree.Eq.Eqit]
vclo:90 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
verify_cond [definition, in ITree.Extra.Dijkstra.TracesIT]
verify_cond [definition, in ITree.Extra.Dijkstra.StateDelaySpec]
verify_cond [definition, in ITree.Extra.Dijkstra.StateIOTrace]
vis [abbreviation, in ITree.Core.Subevent]
Vis [abbreviation, in ITree.Core.ITreeDefinition]
VisF [constructor, in ITree.Core.ITreeDefinition]
vis_peel_r [lemma, in ITree.Extra.ITrace.ITraceBind]
vis_peel_l [lemma, in ITree.Extra.ITrace.ITraceBind]
vis_refine_peel_cont [lemma, in ITree.Extra.ITrace.ITraceBind]
vis_refine_peel [lemma, in ITree.Extra.ITrace.ITraceBind]
void [abbreviation, in ITree.Basics.Basics]
void1 [inductive, in ITree.Indexed.Sum]
v':70 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v':71 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v':72 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v':73 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v':74 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v':75 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v1:163 [binder, in ITree.Eq.UpToTaus]
v2:164 [binder, in ITree.Eq.UpToTaus]
V:10 [binder, in ITree.Core.Subevent]
v:11 [binder, in ITree.Indexed.Sum]
v:119 [binder, in ITree.Extra.ITrace.ITraceFacts]
v:122 [binder, in ITree.Extra.ITrace.ITraceFacts]
v:123 [binder, in ITree.Extra.ITrace.ITraceBind]
v:13 [binder, in ITree.Events.MapDefaultFacts]
v:14 [binder, in ITree.Events.Map]
v:152 [binder, in ITree.Extra.ITrace.ITraceFacts]
v:154 [binder, in ITree.Extra.ITrace.ITraceFacts]
v:177 [binder, in ITree.Eq.Eqit]
V:18 [binder, in ITree.Events.MapDefault]
V:180 [binder, in ITree.Simple]
v:19 [binder, in ITree.Basics.Function]
v:203 [binder, in ITree.Eq.UpToTaus]
v:22 [binder, in ITree.Extra.ITrace.ITraceBind]
v:22 [binder, in ITree.Basics.CategoryKleisli]
v:23 [binder, in ITree.Eq.Eqit]
v:3 [binder, in ITree.Basics.CategoryRelations]
v:30 [binder, in ITree.Basics.CategoryKleisli]
V:31 [binder, in ITree.Core.ITreeDefinition]
V:35 [binder, in ITree.Simple]
v:36 [binder, in ITree.Events.MapDefaultFacts]
v:47 [binder, in ITree.Extra.Secure.SecureStateHandler]
V:49 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
V:5 [binder, in ITree.Core.Subevent]
v:50 [binder, in ITree.Eq.UpToTaus]
v:50 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v:60 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
V:611 [binder, in ITree.Eq.Eqit]
v:64 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v:66 [binder, in ITree.Events.ExceptionFacts]
v:68 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
v:70 [binder, in ITree.Eq.Eqit]
v:8 [binder, in ITree.Basics.FunctionFacts]
V:80 [binder, in ITree.Eq.Shallow]
v:9 [binder, in ITree.Events.Exception]
v:9 [binder, in ITree.Events.MapDefaultFacts]
v:912 [binder, in ITree.Eq.Eqit]
v:917 [binder, in ITree.Eq.Eqit]

W

w [definition, in ITree.Extra.Dijkstra.ITreeDijkstra]
well_found_wf_from [lemma, in ITree.Extra.Dijkstra.IterRel]
wf_intro_gt [lemma, in ITree.Extra.Dijkstra.IterRel]
wf_from_gt [lemma, in ITree.Extra.Dijkstra.IterRel]
wf_from_sub_rel [lemma, in ITree.Extra.Dijkstra.IterRel]
wf_from [inductive, in ITree.Extra.Dijkstra.IterRel]
Witness [constructor, in ITree.Axioms]
WMonad:42 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
WMonad:61 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
wn [constructor, in ITree.Extra.Dijkstra.StateIOTrace]
wnm [constructor, in ITree.Extra.Dijkstra.StateIOTrace]
wnm_ev [definition, in ITree.Extra.Dijkstra.StateIOTrace]
WOrderLaws:46 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
WOrderLaws:65 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
WOrder:45 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
WOrder:64 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
Write [constructor, in ITree.Extra.Dijkstra.StateIOTrace]
Writer [library]
writerE [inductive, in ITree.Events.Writer]
writes_n [inductive, in ITree.Extra.Dijkstra.StateIOTrace]
write_next_mult [inductive, in ITree.Extra.Dijkstra.StateIOTrace]
wsx:18 [binder, in ITree.Events.Writer]
w1:11 [binder, in ITree.Extra.Dijkstra.TracesIT]
w1:12 [binder, in ITree.Extra.Dijkstra.StateSpecT]
w1:15 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w1:15 [binder, in ITree.Extra.Dijkstra.StateSpecT]
w1:192 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w1:21 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
w1:21 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w1:211 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w1:32 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
w1:36 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
w1:70 [binder, in ITree.Extra.Dijkstra.TracesIT]
w2:12 [binder, in ITree.Extra.Dijkstra.TracesIT]
w2:13 [binder, in ITree.Extra.Dijkstra.StateSpecT]
w2:16 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w2:16 [binder, in ITree.Extra.Dijkstra.StateSpecT]
w2:193 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w2:212 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w2:22 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
w2:22 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w2:33 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
w2:37 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
w2:71 [binder, in ITree.Extra.Dijkstra.TracesIT]
w3:17 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
W:1 [binder, in ITree.Events.Writer]
w:12 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:12 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
W:13 [binder, in ITree.Events.Writer]
w:14 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
W:15 [binder, in ITree.Events.Writer]
w:16 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
w:19 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
W:19 [binder, in ITree.Events.Writer]
W:2 [binder, in ITree.Extra.Dijkstra.StateSpecT]
w:201 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:206 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:21 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:23 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
w:25 [binder, in ITree.Basics.Basics]
W:25 [binder, in ITree.Events.Writer]
w:26 [binder, in ITree.Extra.Dijkstra.TracesIT]
W:27 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w:28 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:30 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
w:35 [binder, in ITree.Extra.Dijkstra.TracesIT]
W:36 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
W:4 [binder, in ITree.Events.Writer]
W:40 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w:43 [binder, in ITree.Extra.Dijkstra.TracesIT]
w:5 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:5 [binder, in ITree.Extra.Dijkstra.ITreeDijkstra]
W:5 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w:50 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:58 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
W:59 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w:68 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w:7 [binder, in ITree.Extra.Dijkstra.TracesIT]
w:7 [binder, in ITree.Events.Writer]
w:71 [binder, in ITree.Extra.Dijkstra.DijkstraMonad]
w:77 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
W:8 [binder, in ITree.Events.Writer]

X

xs:13 [binder, in ITree.Events.Nondeterminism]
xs:18 [binder, in ITree.Events.Nondeterminism]
xs:28 [binder, in ITree.Events.Nondeterminism]
x_:65 [binder, in ITree.Core.ITreeDefinition]
x':101 [binder, in ITree.Extra.Secure.SecureEqWcompat]
x':137 [binder, in ITree.Eq.Rutt]
x':160 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
x':160 [binder, in ITree.Extra.Secure.SecureEqHalt]
x':160 [binder, in ITree.Eq.Rutt]
x':211 [binder, in ITree.Eq.Eqit]
x':214 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
x':478 [binder, in ITree.Eq.Eqit]
x':496 [binder, in ITree.Extra.IForest]
x':502 [binder, in ITree.Eq.Eqit]
x':524 [binder, in ITree.Eq.Eqit]
x':546 [binder, in ITree.Eq.Eqit]
x':62 [binder, in ITree.Extra.Secure.SecureEqWcompat]
x':81 [binder, in ITree.Extra.Secure.SecureEqWcompat]
x':83 [binder, in ITree.Eq.UpToTaus]
x':97 [binder, in ITree.Eq.Rutt]
x0:115 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
x0:115 [binder, in ITree.Extra.Secure.SecureEqHalt]
x0:19 [binder, in ITree.Props.Infinite]
x0:41 [binder, in ITree.Eq.Eqit]
x0:467 [binder, in ITree.Extra.IForest]
x0:483 [binder, in ITree.Extra.IForest]
x0:488 [binder, in ITree.Extra.IForest]
x0:77 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
X1:10 [binder, in ITree.Eq.Shallow]
x1:116 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
x1:116 [binder, in ITree.Extra.Secure.SecureEqHalt]
X1:128 [binder, in ITree.Eq.Eqit]
X1:21 [binder, in ITree.Eq.Shallow]
x1:230 [binder, in ITree.Basics.HeterogeneousRelations]
X1:30 [binder, in ITree.Eq.Shallow]
x1:42 [binder, in ITree.Eq.Eqit]
x1:78 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
X1:88 [binder, in ITree.Eq.Eqit]
X2:11 [binder, in ITree.Eq.Shallow]
X2:129 [binder, in ITree.Eq.Eqit]
X2:22 [binder, in ITree.Eq.Shallow]
x2:231 [binder, in ITree.Basics.HeterogeneousRelations]
X2:31 [binder, in ITree.Eq.Shallow]
X2:66 [binder, in ITree.Eq.Eqit]
X2:91 [binder, in ITree.Eq.Eqit]
X:1 [binder, in ITree.Basics.Tacs]
x:1 [binder, in ITree.Basics.MonadProp]
x:10 [binder, in ITree.Events.FailFacts]
x:10 [binder, in ITree.Extra.IForest]
x:100 [binder, in ITree.Interp.Traces]
x:100 [binder, in ITree.Extra.Secure.SecureEqBind]
x:100 [binder, in ITree.Extra.Secure.SecureEqWcompat]
x:100 [binder, in ITree.Eq.Rutt]
x:103 [binder, in ITree.Extra.Secure.SecureEqWcompat]
X:103 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:104 [binder, in ITree.Core.KTreeFacts]
x:107 [binder, in ITree.Core.KTreeFacts]
X:108 [binder, in ITree.Events.FailFacts]
x:11 [binder, in ITree.Props.HasPost]
x:11 [binder, in ITree.Basics.CategoryKleisliFacts]
X:11 [binder, in ITree.Events.Nondeterminism]
X:11 [binder, in ITree.Interp.TranslateFacts]
x:110 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:111 [binder, in ITree.Props.HasPost]
x:111 [binder, in ITree.Basics.Basics]
x:112 [binder, in ITree.Simple]
x:113 [binder, in ITree.Props.HasPost]
x:115 [binder, in ITree.Events.FailFacts]
X:115 [binder, in ITree.Eq.Eqit]
X:116 [binder, in ITree.Props.HasPost]
x:118 [binder, in ITree.Eq.UpToTaus]
x:118 [binder, in ITree.Extra.ITrace.ITraceFacts]
x:119 [binder, in ITree.Props.Leaf]
x:119 [binder, in ITree.Eq.Eqit]
x:12 [binder, in ITree.Props.HasPost]
x:12 [binder, in ITree.Events.FailFacts]
X:12 [binder, in ITree.Props.Infinite]
x:12 [binder, in ITree.Events.Nondeterminism]
x:120 [binder, in ITree.Props.Leaf]
X:120 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:121 [binder, in ITree.Props.Leaf]
x:121 [binder, in ITree.Extra.ITrace.ITraceFacts]
x:122 [binder, in ITree.Props.Leaf]
x:123 [binder, in ITree.Props.Leaf]
x:123 [binder, in ITree.Extra.Secure.SecureEqBind]
X:124 [binder, in ITree.Props.HasPost]
x:124 [binder, in ITree.Props.Leaf]
x:126 [binder, in ITree.Extra.ITrace.ITracePrefix]
x:127 [binder, in ITree.Eq.UpToTaus]
x:127 [binder, in ITree.Props.HasPost]
X:128 [binder, in ITree.Extra.ITrace.ITraceBind]
x:128 [binder, in ITree.Props.Finite]
X:128 [binder, in ITree.Interp.Traces]
x:128 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:13 [binder, in ITree.Props.Finite]
x:13 [binder, in ITree.Props.Leaf]
x:13 [binder, in ITree.Basics.Basics]
x:13 [binder, in ITree.Eq.Paco2]
X:130 [binder, in ITree.Props.HasPost]
x:133 [binder, in ITree.Props.HasPost]
x:134 [binder, in ITree.Props.Finite]
x:136 [binder, in ITree.Eq.Rutt]
X:137 [binder, in ITree.Simple]
X:138 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
X:139 [binder, in ITree.Eq.UpToTaus]
x:14 [binder, in ITree.Basics.CategoryKleisliFacts]
x:14 [binder, in ITree.Eq.SimUpToTaus]
x:14 [binder, in ITree.Basics.CategoryRelations]
x:14 [binder, in ITree.Interp.TranslateFacts]
x:14 [binder, in ITree.Eq.Paco2]
x:140 [binder, in ITree.Props.Finite]
x:140 [binder, in ITree.Props.Leaf]
x:140 [binder, in ITree.Eq.Rutt]
x:141 [binder, in ITree.Props.Leaf]
x:144 [binder, in ITree.Eq.UpToTaus]
x:144 [binder, in ITree.Props.Finite]
x:146 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:148 [binder, in ITree.Eq.UpToTaus]
x:148 [binder, in ITree.Props.Finite]
X:15 [binder, in ITree.Props.HasPost]
x:15 [binder, in ITree.Events.FailFacts]
x:15 [binder, in ITree.Basics.HeterogeneousRelations]
x:15 [binder, in ITree.Eq.Paco2]
x:150 [binder, in ITree.Eq.UpToTaus]
x:152 [binder, in ITree.Eq.UpToTaus]
X:152 [binder, in ITree.Events.StateFacts]
x:155 [binder, in ITree.Eq.UpToTaus]
x:155 [binder, in ITree.Props.Leaf]
x:156 [binder, in ITree.Props.Leaf]
x:158 [binder, in ITree.Eq.UpToTaus]
x:159 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
x:159 [binder, in ITree.Extra.Secure.SecureEqHalt]
x:159 [binder, in ITree.Props.Finite]
x:159 [binder, in ITree.Eq.Rutt]
X:16 [binder, in ITree.Props.Infinite]
X:16 [binder, in ITree.Events.Nondeterminism]
x:16 [binder, in ITree.Eq.Shallow]
x:16 [binder, in ITree.Basics.CategoryRelations]
x:160 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
X:162 [binder, in ITree.Extra.ITrace.ITraceFacts]
x:163 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
x:163 [binder, in ITree.Extra.Secure.SecureEqHalt]
x:163 [binder, in ITree.Eq.Rutt]
x:165 [binder, in ITree.Props.Finite]
X:165 [binder, in ITree.Extra.ITrace.ITraceFacts]
X:168 [binder, in ITree.Extra.ITrace.ITraceFacts]
x:17 [binder, in ITree.Basics.CategoryKleisli]
x:17 [binder, in ITree.Interp.InterpFacts]
x:175 [binder, in ITree.Extra.IForest]
x:175 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:177 [binder, in ITree.Props.Finite]
X:177 [binder, in ITree.Extra.ITrace.ITraceFacts]
x:18 [binder, in ITree.Basics.Monad]
x:18 [binder, in ITree.Events.Exception]
x:18 [binder, in ITree.Events.Concurrency]
x:18 [binder, in ITree.Eq.Paco2]
x:184 [binder, in ITree.Simple]
x:186 [binder, in ITree.Props.Finite]
x:188 [binder, in ITree.Simple]
X:19 [binder, in ITree.Props.HasPost]
x:19 [binder, in ITree.Interp.RecursionFacts]
x:190 [binder, in ITree.Props.Finite]
x:190 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
X:191 [binder, in ITree.Props.Finite]
X:193 [binder, in ITree.Props.Finite]
x:195 [binder, in ITree.Props.Finite]
X:196 [binder, in ITree.Props.Finite]
X:2 [binder, in ITree.Basics.Tacs]
X:2 [binder, in ITree.Props.HasPost]
X:2 [binder, in ITree.Extra.IForest]
X:2 [binder, in ITree.Props.Infinite]
x:20 [binder, in ITree.Basics.Function]
X:201 [binder, in ITree.Props.Finite]
x:202 [binder, in ITree.Extra.Dijkstra.PureITreeDijkstra]
X:203 [binder, in ITree.Props.Finite]
x:203 [binder, in ITree.Simple]
X:205 [binder, in ITree.Props.Finite]
x:205 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:206 [binder, in ITree.Props.Finite]
X:207 [binder, in ITree.Extra.IForest]
X:209 [binder, in ITree.Props.Finite]
X:21 [binder, in ITree.Props.HasPost]
x:21 [binder, in ITree.Basics.Monad]
x:21 [binder, in ITree.Eq.Paco2]
x:210 [binder, in ITree.Eq.Eqit]
x:211 [binder, in ITree.Extra.IForest]
x:213 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
X:213 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:213 [binder, in ITree.Simple]
x:214 [binder, in ITree.Eq.Eqit]
x:216 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
x:216 [binder, in ITree.Basics.HeterogeneousRelations]
x:22 [binder, in ITree.Events.FailFacts]
X:22 [binder, in ITree.Props.Finite]
X:22 [binder, in ITree.Props.Leaf]
x:22 [binder, in ITree.Interp.TranslateFacts]
x:22 [binder, in ITree.Core.ITreeDefinition]
x:221 [binder, in ITree.Simple]
x:223 [binder, in ITree.Basics.HeterogeneousRelations]
X:23 [binder, in ITree.Props.HasPost]
x:23 [binder, in ITree.Basics.CategoryKleisli]
X:23 [binder, in ITree.Props.Infinite]
x:23 [binder, in ITree.Interp.Interp]
x:23 [binder, in ITree.Interp.TranslateFacts]
x:23 [binder, in ITree.Events.State]
x:232 [binder, in ITree.Extra.IForest]
x:233 [binder, in ITree.Extra.IForest]
x:238 [binder, in ITree.Extra.IForest]
x:239 [binder, in ITree.Extra.IForest]
x:24 [binder, in ITree.Events.ExceptionFacts]
x:24 [binder, in ITree.Basics.HeterogeneousRelations]
x:248 [binder, in ITree.Simple]
x:26 [binder, in ITree.Basics.Function]
x:26 [binder, in ITree.Props.Finite]
X:27 [binder, in ITree.Extra.IForest]
x:27 [binder, in ITree.Basics.Monad]
x:27 [binder, in ITree.Events.Exception]
X:27 [binder, in ITree.Props.Infinite]
x:27 [binder, in ITree.Props.Leaf]
X:27 [binder, in ITree.Events.Nondeterminism]
X:27 [binder, in ITree.Interp.Traces]
x:27 [binder, in ITree.Interp.InterpFacts]
X:270 [binder, in ITree.Simple]
X:28 [binder, in ITree.Props.HasPost]
x:29 [binder, in ITree.Extra.IForest]
x:29 [binder, in ITree.Basics.HeterogeneousRelations]
x:29 [binder, in ITree.Events.State]
X:29 [binder, in ITree.Eq.Paco2]
X:3 [binder, in ITree.Indexed.Sum]
X:30 [binder, in ITree.Interp.Traces]
X:30 [binder, in ITree.Core.Subevent]
X:31 [binder, in ITree.Extra.Secure.SecureEqEuttTrans]
x:31 [binder, in ITree.Events.State]
x:31 [binder, in ITree.Eq.Paco2]
x:312 [binder, in ITree.Basics.HeterogeneousRelations]
x:32 [binder, in ITree.Interp.HandlerFacts]
x:32 [binder, in ITree.Interp.Traces]
X:320 [binder, in ITree.Basics.HeterogeneousRelations]
X:33 [binder, in ITree.Props.HasPost]
X:34 [binder, in ITree.Props.Finite]
x:34 [binder, in ITree.Eq.Paco2]
x:35 [binder, in ITree.Events.State]
X:36 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:36 [binder, in ITree.Eq.Paco2]
x:368 [binder, in ITree.Extra.IForest]
x:369 [binder, in ITree.Extra.IForest]
X:37 [binder, in ITree.Props.Leaf]
x:37 [binder, in ITree.Interp.HandlerFacts]
X:37 [binder, in ITree.Eq.Shallow]
x:37 [binder, in ITree.Eq.Paco2]
x:370 [binder, in ITree.Extra.IForest]
x:371 [binder, in ITree.Extra.IForest]
x:372 [binder, in ITree.Extra.IForest]
x:373 [binder, in ITree.Extra.IForest]
X:38 [binder, in ITree.Props.HasPost]
x:38 [binder, in ITree.Props.Finite]
X:39 [binder, in ITree.Eq.SimUpToTaus]
x:39 [binder, in ITree.Basics.CategoryFunctor]
x:39 [binder, in ITree.Core.Subevent]
x:39 [binder, in ITree.Eq.Paco2]
x:39 [binder, in ITree.Simple]
X:396 [binder, in ITree.Extra.IForest]
x:399 [binder, in ITree.Extra.IForest]
X:4 [binder, in ITree.Extra.IForest]
x:40 [binder, in ITree.Interp.InterpFacts]
x:40 [binder, in ITree.Interp.RecursionFacts]
x:405 [binder, in ITree.Extra.IForest]
x:410 [binder, in ITree.Extra.IForest]
x:42 [binder, in ITree.Props.Leaf]
x:42 [binder, in ITree.Eq.Paco2]
x:426 [binder, in ITree.Eq.Eqit]
X:43 [binder, in ITree.Props.HasPost]
x:43 [binder, in ITree.Eq.SimUpToTaus]
X:43 [binder, in ITree.Events.MapDefaultFacts]
x:44 [binder, in ITree.Events.State]
x:44 [binder, in ITree.Simple]
x:45 [binder, in ITree.Interp.RecursionFacts]
x:45 [binder, in ITree.Eq.Paco2]
X:46 [binder, in ITree.Props.HasPost]
x:46 [binder, in ITree.Events.FailFacts]
X:46 [binder, in ITree.Props.Finite]
x:46 [binder, in ITree.Basics.MonadState]
x:46 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
x:470 [binder, in ITree.Extra.IForest]
x:477 [binder, in ITree.Eq.Eqit]
x:478 [binder, in ITree.Extra.IForest]
X:48 [binder, in ITree.Events.ExceptionFacts]
X:48 [binder, in ITree.Eq.SimUpToTaus]
x:48 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
x:481 [binder, in ITree.Eq.Eqit]
x:49 [binder, in ITree.Core.ITreeDefinition]
x:491 [binder, in ITree.Extra.IForest]
x:5 [binder, in ITree.Props.HasPost]
x:5 [binder, in ITree.Axioms]
X:5 [binder, in ITree.Interp.Traces]
x:50 [binder, in ITree.Props.Finite]
x:50 [binder, in ITree.Events.State]
x:501 [binder, in ITree.Eq.Eqit]
x:504 [binder, in ITree.Extra.IForest]
x:505 [binder, in ITree.Eq.Eqit]
x:507 [binder, in ITree.Extra.IForest]
x:51 [binder, in ITree.Props.HasPost]
x:51 [binder, in ITree.Basics.MonadState]
x:51 [binder, in ITree.Eq.Paco2]
x:516 [binder, in ITree.Extra.IForest]
X:52 [binder, in ITree.Events.FailFacts]
x:52 [binder, in ITree.Eq.SimUpToTaus]
X:52 [binder, in ITree.Events.MapDefaultFacts]
x:523 [binder, in ITree.Eq.Eqit]
x:527 [binder, in ITree.Eq.Eqit]
X:53 [binder, in ITree.Props.HasPost]
x:53 [binder, in ITree.Core.ITreeDefinition]
x:54 [binder, in ITree.Events.ExceptionFacts]
x:54 [binder, in ITree.Events.StateFacts]
X:54 [binder, in ITree.Interp.TranslateFacts]
x:54 [binder, in ITree.Events.MapDefaultFacts]
x:545 [binder, in ITree.Eq.Eqit]
x:549 [binder, in ITree.Eq.Eqit]
X:55 [binder, in ITree.Props.Finite]
x:55 [binder, in ITree.Basics.HeterogeneousRelations]
x:55 [binder, in ITree.Events.MapDefaultFacts]
x:56 [binder, in ITree.Events.MapDefaultFacts]
x:565 [binder, in ITree.Extra.IForest]
x:566 [binder, in ITree.Extra.IForest]
x:567 [binder, in ITree.Extra.IForest]
X:57 [binder, in ITree.Events.FailFacts]
x:57 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
x:586 [binder, in ITree.Eq.Eqit]
x:59 [binder, in ITree.Props.HasPost]
x:59 [binder, in ITree.Props.Finite]
x:59 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
x:596 [binder, in ITree.Extra.IForest]
x:6 [binder, in ITree.Props.HasPost]
x:6 [binder, in ITree.Interp.Recursion]
X:6 [binder, in ITree.Interp.Traces]
X:6 [binder, in ITree.Eq.Paco2]
x:60 [binder, in ITree.Eq.UpToTaus]
x:60 [binder, in ITree.Props.HasPost]
X:60 [binder, in ITree.Extra.ITrace.ITracePrefix]
X:61 [binder, in ITree.Events.FailFacts]
x:61 [binder, in ITree.Extra.Secure.SecureEqWcompat]
x:61 [binder, in ITree.Simple]
x:615 [binder, in ITree.Eq.Eqit]
x:62 [binder, in ITree.Props.HasPost]
x:62 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
x:620 [binder, in ITree.Extra.IForest]
x:621 [binder, in ITree.Extra.IForest]
x:621 [binder, in ITree.Eq.Eqit]
x:624 [binder, in ITree.Extra.IForest]
x:625 [binder, in ITree.Extra.IForest]
x:626 [binder, in ITree.Eq.Eqit]
x:627 [binder, in ITree.Extra.IForest]
x:628 [binder, in ITree.Extra.IForest]
x:629 [binder, in ITree.Extra.IForest]
x:63 [binder, in ITree.Eq.Shallow]
x:630 [binder, in ITree.Extra.IForest]
x:633 [binder, in ITree.Extra.IForest]
x:634 [binder, in ITree.Extra.IForest]
x:638 [binder, in ITree.Extra.IForest]
x:639 [binder, in ITree.Extra.IForest]
x:64 [binder, in ITree.Extra.Secure.SecureEqWcompat]
X:64 [binder, in ITree.Interp.TranslateFacts]
x:64 [binder, in ITree.Events.State]
x:64 [binder, in ITree.Core.ITreeDefinition]
x:65 [binder, in ITree.Basics.MonadState]
X:66 [binder, in ITree.Events.FailFacts]
x:66 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
x:67 [binder, in ITree.Basics.HeterogeneousRelations]
x:67 [binder, in ITree.Extra.Dijkstra.DelaySpecMonad]
X:68 [binder, in ITree.Interp.Traces]
x:68 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:69 [binder, in ITree.Core.ITreeDefinition]
x:7 [binder, in ITree.Events.FailFacts]
x:7 [binder, in ITree.Core.KTreeFacts]
X:7 [binder, in ITree.Events.Exception]
X:70 [binder, in ITree.Props.Finite]
x:71 [binder, in ITree.Core.ITreeDefinition]
x:72 [binder, in ITree.Props.HasPost]
x:72 [binder, in ITree.Basics.MonadState]
x:72 [binder, in ITree.Simple]
x:73 [binder, in ITree.Basics.HeterogeneousRelations]
x:73 [binder, in ITree.Core.ITreeDefinition]
x:74 [binder, in ITree.Props.HasPost]
x:74 [binder, in ITree.Props.Finite]
x:74 [binder, in ITree.Basics.MonadState]
x:75 [binder, in ITree.Core.ITreeDefinition]
x:766 [binder, in ITree.Eq.Eqit]
x:771 [binder, in ITree.Eq.Eqit]
X:78 [binder, in ITree.Props.HasPost]
x:788 [binder, in ITree.Eq.Eqit]
x:796 [binder, in ITree.Eq.Eqit]
X:798 [binder, in ITree.Eq.Eqit]
X:8 [binder, in ITree.Props.HasPost]
x:8 [binder, in ITree.Axioms]
x:8 [binder, in ITree.Basics.HeterogeneousRelations]
x:8 [binder, in ITree.Interp.Interp]
x:8 [binder, in ITree.Interp.RecursionFacts]
X:8 [binder, in ITree.Core.ITreeDefinition]
x:8 [binder, in ITree.Eq.Paco2]
x:80 [binder, in ITree.Extra.IForest]
x:80 [binder, in ITree.Extra.Secure.SecureEqWcompat]
x:80 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:804 [binder, in ITree.Eq.Eqit]
x:81 [binder, in ITree.Simple]
X:816 [binder, in ITree.Eq.Eqit]
x:82 [binder, in ITree.Eq.UpToTaus]
x:83 [binder, in ITree.Extra.Secure.SecureEqWcompat]
X:84 [binder, in ITree.Events.FailFacts]
x:84 [binder, in ITree.Eq.Shallow]
X:847 [binder, in ITree.Eq.Eqit]
x:856 [binder, in ITree.Eq.Eqit]
X:861 [binder, in ITree.Eq.Eqit]
x:867 [binder, in ITree.Eq.Eqit]
X:872 [binder, in ITree.Eq.Eqit]
x:878 [binder, in ITree.Eq.Eqit]
x:88 [binder, in ITree.Events.FailFacts]
X:88 [binder, in ITree.Extra.ITrace.ITracePrefix]
X:88 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
X:89 [binder, in ITree.Events.FailFacts]
x:89 [binder, in ITree.Eq.Shallow]
X:9 [binder, in ITree.Props.Finite]
X:9 [binder, in ITree.Props.Leaf]
X:90 [binder, in ITree.Interp.Traces]
X:922 [binder, in ITree.Eq.Eqit]
X:929 [binder, in ITree.Eq.Eqit]
x:93 [binder, in ITree.Events.FailFacts]
X:95 [binder, in ITree.Extra.ITrace.ITraceBind]
x:95 [binder, in ITree.Extra.Secure.SecureEqEuttHalt]
x:96 [binder, in ITree.Eq.Rutt]
x:97 [binder, in ITree.Props.HasPost]
x:97 [binder, in ITree.Extra.Secure.SecureEqWcompat]
X:98 [binder, in ITree.Interp.Traces]
x:99 [binder, in ITree.Props.HasPost]
X:99 [binder, in ITree.Events.FailFacts]

Y

y':102 [binder, in ITree.Eq.Rutt]
y':105 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y':142 [binder, in ITree.Eq.Rutt]
y':165 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
y':165 [binder, in ITree.Extra.Secure.SecureEqHalt]
y':165 [binder, in ITree.Eq.Rutt]
y':216 [binder, in ITree.Eq.Eqit]
y':218 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
y':483 [binder, in ITree.Eq.Eqit]
y':507 [binder, in ITree.Eq.Eqit]
y':529 [binder, in ITree.Eq.Eqit]
y':551 [binder, in ITree.Eq.Eqit]
y':66 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y':85 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y1:232 [binder, in ITree.Basics.HeterogeneousRelations]
y2:233 [binder, in ITree.Basics.HeterogeneousRelations]
y:100 [binder, in ITree.Props.HasPost]
Y:100 [binder, in ITree.Events.FailFacts]
y:101 [binder, in ITree.Eq.Rutt]
y:102 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y:104 [binder, in ITree.Extra.Secure.SecureEqWcompat]
Y:109 [binder, in ITree.Events.FailFacts]
y:11 [binder, in ITree.Extra.IForest]
y:112 [binder, in ITree.Props.HasPost]
y:114 [binder, in ITree.Props.HasPost]
y:128 [binder, in ITree.Props.HasPost]
y:13 [binder, in ITree.Props.HasPost]
y:134 [binder, in ITree.Props.HasPost]
y:138 [binder, in ITree.Eq.Rutt]
y:141 [binder, in ITree.Eq.Rutt]
y:16 [binder, in ITree.Basics.HeterogeneousRelations]
y:161 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
y:161 [binder, in ITree.Extra.Secure.SecureEqHalt]
y:161 [binder, in ITree.Eq.Rutt]
y:164 [binder, in ITree.Extra.Secure.SecureEqHaltProgInsens]
y:164 [binder, in ITree.Extra.Secure.SecureEqHalt]
y:164 [binder, in ITree.Eq.Rutt]
y:176 [binder, in ITree.Extra.IForest]
y:2 [binder, in ITree.Basics.MonadProp]
y:212 [binder, in ITree.Eq.Eqit]
y:215 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
y:215 [binder, in ITree.Eq.Eqit]
y:217 [binder, in ITree.Extra.Secure.SecureEqProgInsens]
y:217 [binder, in ITree.Basics.HeterogeneousRelations]
y:22 [binder, in ITree.Basics.Monad]
y:224 [binder, in ITree.Basics.HeterogeneousRelations]
Y:23 [binder, in ITree.Props.Leaf]
y:24 [binder, in ITree.Basics.CategoryKleisli]
y:25 [binder, in ITree.Basics.HeterogeneousRelations]
y:30 [binder, in ITree.Basics.Monad]
y:30 [binder, in ITree.Basics.HeterogeneousRelations]
y:313 [binder, in ITree.Basics.HeterogeneousRelations]
y:35 [binder, in ITree.Eq.Paco2]
Y:38 [binder, in ITree.Props.Leaf]
Y:397 [binder, in ITree.Extra.IForest]
y:427 [binder, in ITree.Eq.Eqit]
Y:47 [binder, in ITree.Props.HasPost]
y:47 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
y:479 [binder, in ITree.Eq.Eqit]
y:482 [binder, in ITree.Eq.Eqit]
y:503 [binder, in ITree.Eq.Eqit]
y:505 [binder, in ITree.Extra.IForest]
y:506 [binder, in ITree.Extra.IForest]
y:506 [binder, in ITree.Eq.Eqit]
y:525 [binder, in ITree.Eq.Eqit]
y:528 [binder, in ITree.Eq.Eqit]
Y:54 [binder, in ITree.Props.HasPost]
y:547 [binder, in ITree.Eq.Eqit]
Y:55 [binder, in ITree.Interp.TranslateFacts]
y:550 [binder, in ITree.Eq.Eqit]
y:56 [binder, in ITree.Basics.HeterogeneousRelations]
y:597 [binder, in ITree.Extra.IForest]
y:6 [binder, in ITree.Axioms]
y:61 [binder, in ITree.Props.HasPost]
y:63 [binder, in ITree.Props.HasPost]
y:63 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y:65 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y:67 [binder, in ITree.Extra.Dijkstra.StateIOTrace]
y:68 [binder, in ITree.Basics.HeterogeneousRelations]
y:73 [binder, in ITree.Props.HasPost]
y:74 [binder, in ITree.Basics.HeterogeneousRelations]
y:75 [binder, in ITree.Props.HasPost]
Y:799 [binder, in ITree.Eq.Eqit]
y:8 [binder, in ITree.Events.FailFacts]
y:81 [binder, in ITree.Extra.IForest]
y:82 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y:84 [binder, in ITree.Eq.UpToTaus]
y:84 [binder, in ITree.Extra.Secure.SecureEqWcompat]
y:9 [binder, in ITree.Basics.HeterogeneousRelations]
y:98 [binder, in ITree.Props.HasPost]
y:98 [binder, in ITree.Eq.Rutt]

Z

z:75 [binder, in ITree.Basics.HeterogeneousRelations]
Z:800 [binder, in ITree.Eq.Eqit]

_

_interp_fail [definition, in ITree.Events.FailFacts]
_interp_state [definition, in ITree.Events.StateFacts]
_obsip [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
_iter [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
_bindpi [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
_retpi [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
_div_spec [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
_PureITreeSpec [definition, in ITree.Extra.Dijkstra.PureITreeDijkstra]
_observe [projection, in ITree.Extra.Dijkstra.ITreeDijkstra]
_interp [definition, in ITree.Interp.InterpFacts]
_bind_del [definition, in ITree.Extra.Dijkstra.DelaySpecMonad]
_interp_mrec [definition, in ITree.Interp.RecursionFacts]
_observe [projection, in ITree.Core.ITreeDefinition]

other

_ -+> _ (delayspec_scope) [notation, in ITree.Extra.Dijkstra.DelaySpecMonad]
_ =[ _ ]=> _ (delayspec_scope) [notation, in ITree.Extra.Dijkstra.DelaySpecMonad]
_ ∋ _ (delayspec_scope) [notation, in ITree.Extra.Dijkstra.DelaySpecMonad]
_ ∈ _ (delayspec_scope) [notation, in ITree.Extra.Dijkstra.DelaySpecMonad]
_ <≈ _ (dijkstra_scope) [notation, in ITree.Extra.Dijkstra.DijkstraMonad]
_ ≈ _ (monad_scope) [notation, in ITree.Basics.Monad]
_ ~> _ (type_scope) [notation, in ITree.Basics.Basics]
_ -< _ (type_scope) [notation, in ITree.Core.Subevent]
_ +' _ (type_scope) [notation, in ITree.Indexed.Sum]
_ ≳ _ (type_scope) [notation, in ITree.Eq.Eqit]
_ ≈ _ (type_scope) [notation, in ITree.Eq.Eqit]
_ ≅ _ (type_scope) [notation, in ITree.Eq.Eqit]
_ ⊑ _ [notation, in ITree.Extra.ITrace.ITraceDefinition]
_ ++ _ [notation, in ITree.Extra.ITrace.ITraceDefinition]
mrec-fix _ _ := _ [notation, in ITree.Interp.Recursion]
rec-fix _ _ := _ [notation, in ITree.Interp.Recursion]

---

Notation Index

C

_ >>> _ (cat_scope) [in ITree.Basics.CategoryOps]
_ ⩯ _ (cat_scope) [in ITree.Basics.CategoryOps]

H

_ ⤳ _ [in ITree.Props.HasPost]

I

_ >=> _ (itree_scope) [in ITree.Core.ITreeDefinition]
' _ <- _ ;; _ (itree_scope) [in ITree.Core.ITreeDefinition]
_ ;; _ (itree_scope) [in ITree.Core.ITreeDefinition]
_ <- _ ;; _ (itree_scope) [in ITree.Core.ITreeDefinition]
_ >>= _ (itree_scope) [in ITree.Core.ITreeDefinition]

L

_ ∈ _ [in ITree.Props.Leaf]

R

_ ≡ _ (relationH_scope) [in ITree.Basics.HeterogeneousRelations]
† _ (relationH_scope) [in ITree.Basics.HeterogeneousRelations]
_ ⊑ _ (relationH_scope) [in ITree.Basics.HeterogeneousRelations]
_ ⊗ _ (relationH_scope) [in ITree.Basics.HeterogeneousRelations]
_ ⊕ _ (relationH_scope) [in ITree.Basics.HeterogeneousRelations]
_ ∘ _ (relationH_scope) [in ITree.Basics.HeterogeneousRelations]

S

_ ≈ _ (type_scope) [in ITree.Simple]
_ ≈ _ [in ITree.Simple]
_ ≈ _ (type_scope) [in ITree.Simple]
_ ≈ _ [in ITree.Simple]
_ ∈ _ (dijkstra_scope) [in ITree.Extra.Dijkstra.DijkstraMonad]
(||||||| _ ) (sum_scope) [in ITree.Core.Subevent]
(|||||| _ |) (sum_scope) [in ITree.Core.Subevent]
(|||||| _ ) (sum_scope) [in ITree.Core.Subevent]
(||||| _ |) (sum_scope) [in ITree.Core.Subevent]
(||||| _ ) (sum_scope) [in ITree.Core.Subevent]
(|||| _ |) (sum_scope) [in ITree.Core.Subevent]
(|||| _ ) (sum_scope) [in ITree.Core.Subevent]
(||| _ |) (sum_scope) [in ITree.Core.Subevent]
(||| _ ) (sum_scope) [in ITree.Core.Subevent]
(|| _ |) (sum_scope) [in ITree.Core.Subevent]
(|| _ ) (sum_scope) [in ITree.Core.Subevent]
(| _ |) (sum_scope) [in ITree.Core.Subevent]
( _ |) (sum_scope) [in ITree.Core.Subevent]
(| _ ) (sum_scope) [in ITree.Core.Subevent]

T

↑ _ [in ITree.Extra.Dijkstra.TracesIT]

other

_ -+> _ (delayspec_scope) [in ITree.Extra.Dijkstra.DelaySpecMonad]
_ =[ _ ]=> _ (delayspec_scope) [in ITree.Extra.Dijkstra.DelaySpecMonad]
_ ∋ _ (delayspec_scope) [in ITree.Extra.Dijkstra.DelaySpecMonad]
_ ∈ _ (delayspec_scope) [in ITree.Extra.Dijkstra.DelaySpecMonad]
_ <≈ _ (dijkstra_scope) [in ITree.Extra.Dijkstra.DijkstraMonad]
_ ≈ _ (monad_scope) [in ITree.Basics.Monad]
_ ~> _ (type_scope) [in ITree.Basics.Basics]
_ -< _ (type_scope) [in ITree.Core.Subevent]
_ +' _ (type_scope) [in ITree.Indexed.Sum]
_ ≳ _ (type_scope) [in ITree.Eq.Eqit]
_ ≈ _ (type_scope) [in ITree.Eq.Eqit]
_ ≅ _ (type_scope) [in ITree.Eq.Eqit]
_ ⊑ _ [in ITree.Extra.ITrace.ITraceDefinition]
_ ++ _ [in ITree.Extra.ITrace.ITraceDefinition]
mrec-fix _ _ := _ [in ITree.Interp.Recursion]
rec-fix _ _ := _ [in ITree.Interp.Recursion]

---

Binder Index

A

ab_:404 [in ITree.Basics.CategoryFacts]
ab_c:34 [in ITree.Basics.CategoryRelations]
ab_c:27 [in ITree.Basics.CategoryRelations]
ab:100 [in ITree.Core.KTreeFacts]
ab:207 [in ITree.Basics.CategoryFacts]
ab:213 [in ITree.Basics.CategoryFacts]
ab:22 [in ITree.Interp.Handler]
ab:247 [in ITree.Basics.CategoryFacts]
ab:29 [in ITree.Basics.CategoryKleisli]
ab:30 [in ITree.Indexed.Function]
ab:30 [in ITree.Extra.Dijkstra.StateSpecT]
ab:33 [in ITree.Basics.CategoryKleisliFacts]
ab:334 [in ITree.Basics.CategoryFacts]
ab:340 [in ITree.Basics.CategoryFacts]
ab:395 [in ITree.Basics.CategoryFacts]
ab:408 [in ITree.Basics.CategoryFacts]
ab:438 [in ITree.Basics.CategoryFacts]
ab:53 [in ITree.Interp.HandlerFacts]
ab:56 [in ITree.Interp.HandlerFacts]
ab:56 [in ITree.Extra.Dijkstra.DelaySpecMonad]
ab:58 [in ITree.Basics.CategoryKleisliFacts]
ab:59 [in ITree.Interp.HandlerFacts]
ab:62 [in ITree.Interp.HandlerFacts]
ab:77 [in ITree.Basics.CategoryKleisliFacts]
ab:8 [in ITree.Core.KTreeFacts]
ab:83 [in ITree.Core.KTreeFacts]
ab:84 [in ITree.Basics.CategoryKleisliFacts]
ab:87 [in ITree.Extra.Dijkstra.StateSpecT]
ac:106 [in ITree.Basics.CategoryFacts]
ac:113 [in ITree.Basics.CategoryFacts]
ac:120 [in ITree.Basics.CategoryFacts]
ac:69 [in ITree.Basics.CategoryKleisliFacts]
ac:80 [in ITree.Basics.CategoryFacts]
ac:86 [in ITree.Basics.CategoryFacts]
AM:52 [in ITree.Basics.Basics]
AM:63 [in ITree.Basics.Basics]
AM:73 [in ITree.Basics.Basics]
AM:80 [in ITree.Basics.Basics]
AM:89 [in ITree.Basics.Basics]
ans:114 [in ITree.Extra.ITrace.ITracePrefix]
ans:120 [in ITree.Extra.ITrace.ITraceBind]
ans:137 [in ITree.Extra.ITrace.ITracePrefix]
ans:217 [in ITree.Extra.ITrace.ITraceBind]
ans:22 [in ITree.Extra.ITrace.ITracePrefix]
ans:246 [in ITree.Extra.ITrace.ITraceBind]
ans:274 [in ITree.Extra.ITrace.ITraceBind]
ans:42 [in ITree.Extra.ITrace.ITracePrefix]
ans:6 [in ITree.Extra.ITrace.ITraceDefinition]
Apply_C:213 [in ITree.Basics.CategoryTheory]
AssocIso_C:245 [in ITree.Basics.CategoryTheory]
AssocIso_C:241 [in ITree.Basics.CategoryTheory]
AssocL_bif:325 [in ITree.Basics.CategoryTheory]
AssocL_bif:237 [in ITree.Basics.CategoryTheory]
AssocR_bif:324 [in ITree.Basics.CategoryTheory]
AssocR_bif:236 [in ITree.Basics.CategoryTheory]
a_bc:35 [in ITree.Basics.CategoryRelations]
a_bc:28 [in ITree.Basics.CategoryRelations]
a':109 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A':111 [in ITree.Events.StateFacts]
a':123 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a':125 [in ITree.Events.StateFacts]
a':162 [in ITree.Basics.CategoryFacts]
a':18 [in ITree.Extra.Dijkstra.IterRel]
a':19 [in ITree.Extra.Dijkstra.IterRel]
a':21 [in ITree.Extra.Dijkstra.IterRel]
a':22 [in ITree.Extra.Dijkstra.IterRel]
a':23 [in ITree.Extra.Dijkstra.IterRel]
a':24 [in ITree.Extra.Dijkstra.IterRel]
a':362 [in ITree.Basics.CategoryFacts]
a':39 [in ITree.Basics.CategoryRelations]
a':43 [in ITree.Basics.CategoryRelations]
a':69 [in ITree.Basics.CategoryRelations]
a':7 [in ITree.Extra.Dijkstra.IterRel]
a':80 [in ITree.Basics.CategoryRelations]
a':84 [in ITree.Basics.CategoryRelations]
a':87 [in ITree.Basics.CategoryRelations]
a':89 [in ITree.Basics.CategoryRelations]
A':90 [in ITree.Events.StateFacts]
a':90 [in ITree.Props.Infinite]
a':92 [in ITree.Basics.CategoryRelations]
a':97 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a0:11 [in ITree.Eq.Paco2]
a0:113 [in ITree.Core.KTreeFacts]
a0:123 [in ITree.Interp.InterpFacts]
a0:124 [in ITree.Extra.Secure.SecureEqEuttHalt]
a0:142 [in ITree.Extra.Secure.SecureEqEuttHalt]
a0:16 [in ITree.Eq.Paco2]
A0:180 [in ITree.Extra.ITrace.ITraceBind]
a0:19 [in ITree.Eq.Paco2]
A0:244 [in ITree.Extra.ITrace.ITraceBind]
A0:260 [in ITree.Extra.ITrace.ITraceBind]
A0:272 [in ITree.Extra.ITrace.ITraceBind]
A0:282 [in ITree.Extra.ITrace.ITraceBind]
a0:40 [in ITree.Eq.Paco2]
a0:43 [in ITree.Extra.Dijkstra.IterRel]
a0:43 [in ITree.Eq.Paco2]
a0:67 [in ITree.Extra.Dijkstra.StateSpecT]
a0:82 [in ITree.Core.KTreeFacts]
a0:93 [in ITree.Core.KTreeFacts]
A1:1 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
a1:10 [in ITree.Indexed.Relation]
a1:104 [in ITree.Basics.CategoryTheory]
A1:106 [in ITree.Extra.Secure.SecureEqBind]
a1:12 [in ITree.Eq.Paco2]
A1:131 [in ITree.Extra.Secure.SecureEqBind]
a1:146 [in ITree.Extra.Secure.SecureEqBind]
A1:153 [in ITree.Extra.Secure.SecureEqBind]
a1:166 [in ITree.Extra.Secure.SecureEqBind]
a1:168 [in ITree.Extra.Secure.SecureEqBind]
a1:17 [in ITree.Eq.Paco2]
a1:20 [in ITree.Eq.Paco2]
a1:225 [in ITree.Basics.HeterogeneousRelations]
A1:280 [in ITree.Extra.Secure.SecureEqProgInsens]
a1:293 [in ITree.Extra.Secure.SecureEqProgInsens]
a1:3 [in ITree.Eq.Shallow]
A1:302 [in ITree.Extra.Secure.SecureEqProgInsens]
a1:31 [in ITree.Extra.Dijkstra.IterRel]
A1:31 [in ITree.Basics.HeterogeneousRelations]
a1:315 [in ITree.Extra.Secure.SecureEqProgInsens]
a1:317 [in ITree.Extra.Secure.SecureEqProgInsens]
a1:37 [in ITree.Extra.Dijkstra.IterRel]
a1:39 [in ITree.Extra.Dijkstra.IterRel]
a1:39 [in ITree.Basics.HeterogeneousRelations]
a1:41 [in ITree.Eq.Paco2]
A1:43 [in ITree.Basics.HeterogeneousRelations]
a1:44 [in ITree.Extra.Dijkstra.IterRel]
a1:44 [in ITree.Eq.Paco2]
a1:45 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a1:468 [in ITree.Extra.IForest]
a1:484 [in ITree.Extra.IForest]
a1:489 [in ITree.Extra.IForest]
a1:70 [in ITree.Extra.Dijkstra.IterRel]
a1:70 [in ITree.Extra.Dijkstra.StateSpecT]
a1:72 [in ITree.Extra.Dijkstra.IterRel]
a1:8 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
A1:81 [in ITree.Extra.Secure.SecureEqBind]
a1:97 [in ITree.Basics.CategoryKleisliFacts]
a2:10 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
a2:105 [in ITree.Basics.CategoryKleisliFacts]
a2:105 [in ITree.Basics.CategoryTheory]
A2:107 [in ITree.Extra.Secure.SecureEqBind]
a2:11 [in ITree.Indexed.Relation]
A2:132 [in ITree.Extra.Secure.SecureEqBind]
a2:147 [in ITree.Extra.Secure.SecureEqBind]
A2:154 [in ITree.Extra.Secure.SecureEqBind]
a2:167 [in ITree.Extra.Secure.SecureEqBind]
a2:169 [in ITree.Extra.Secure.SecureEqBind]
A2:2 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
a2:226 [in ITree.Basics.HeterogeneousRelations]
A2:281 [in ITree.Extra.Secure.SecureEqProgInsens]
a2:294 [in ITree.Extra.Secure.SecureEqProgInsens]
A2:303 [in ITree.Extra.Secure.SecureEqProgInsens]
a2:316 [in ITree.Extra.Secure.SecureEqProgInsens]
a2:318 [in ITree.Extra.Secure.SecureEqProgInsens]
a2:32 [in ITree.Extra.Dijkstra.IterRel]
A2:32 [in ITree.Basics.HeterogeneousRelations]
a2:38 [in ITree.Extra.Dijkstra.IterRel]
a2:4 [in ITree.Eq.Shallow]
a2:40 [in ITree.Extra.Dijkstra.IterRel]
a2:40 [in ITree.Basics.HeterogeneousRelations]
A2:44 [in ITree.Basics.HeterogeneousRelations]
a2:46 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a2:71 [in ITree.Extra.Dijkstra.IterRel]
a2:73 [in ITree.Extra.Dijkstra.IterRel]
A2:82 [in ITree.Extra.Secure.SecureEqBind]
A:1 [in ITree.Basics.Function]
A:1 [in ITree.Axioms]
A:1 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:1 [in ITree.Interp.Handler]
A:1 [in ITree.Extra.Dijkstra.IterRel]
A:1 [in ITree.Interp.HandlerFacts]
A:1 [in ITree.Indexed.Relation]
A:1 [in ITree.Basics.FunctionFacts]
A:1 [in ITree.Extra.ITrace.ITraceFacts]
A:1 [in ITree.Eq.Shallow]
A:1 [in ITree.Basics.HeterogeneousRelations]
a:1 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:1 [in ITree.Extra.Secure.Labels]
A:1 [in ITree.Eq.Eqit]
a:10 [in ITree.Basics.Function]
a:10 [in ITree.Basics.CategoryOps]
a:10 [in ITree.Props.Infinite]
a:10 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:10 [in ITree.Extra.Dijkstra.StateSpecT]
A:10 [in ITree.Extra.Secure.SecureStateHandler]
A:10 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:10 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:10 [in ITree.Basics.CategorySub]
A:10 [in ITree.Extra.Secure.SecureStateHandlerPi]
A:100 [in ITree.Props.Finite]
A:100 [in ITree.Extra.Secure.SecureStateHandler]
a:100 [in ITree.Basics.CategoryRelations]
a:100 [in ITree.Basics.CategoryTheory]
A:101 [in ITree.Basics.HeterogeneousRelations]
A:101 [in ITree.Extra.ITrace.ITracePreds]
A:102 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:102 [in ITree.Extra.ITrace.ITraceFacts]
a:102 [in ITree.Basics.CategoryFacts]
A:103 [in ITree.Props.Finite]
A:103 [in ITree.Basics.Basics]
a:103 [in ITree.Basics.CategoryRelations]
A:103 [in ITree.Basics.HeterogeneousRelations]
A:103 [in ITree.Extra.ITrace.ITracePreds]
A:103 [in ITree.Simple]
a:104 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:104 [in ITree.Extra.Secure.SecureEqHalt]
a:104 [in ITree.Extra.ITrace.ITraceFacts]
A:105 [in ITree.Extra.IForest]
a:105 [in ITree.Events.StateFacts]
a:105 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:105 [in ITree.Basics.HeterogeneousRelations]
a:106 [in ITree.Basics.CategoryOps]
a:106 [in ITree.Basics.Basics]
A:106 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:106 [in ITree.Basics.CategoryRelations]
a:106 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:106 [in ITree.Extra.ITrace.ITracePreds]
a:106 [in ITree.Simple]
A:107 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:107 [in ITree.Basics.Basics]
A:108 [in ITree.Extra.Secure.SecureStateHandler]
A:108 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:108 [in ITree.Basics.HeterogeneousRelations]
a:109 [in ITree.Basics.CategoryFacts]
a:109 [in ITree.Basics.CategoryRelations]
A:109 [in ITree.Simple]
A:11 [in ITree.Basics.Function]
A:11 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:11 [in ITree.Extra.Dijkstra.DijkstraMonad]
A:11 [in ITree.Extra.Dijkstra.StateSpecT]
A:11 [in ITree.Extra.Secure.SecureEqBind]
A:11 [in ITree.Extra.ITrace.ITraceFacts]
a:11 [in ITree.Core.Subevent]
A:11 [in ITree.Basics.HeterogeneousRelations]
A:11 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:11 [in ITree.Extra.ITrace.ITracePreds]
A:110 [in ITree.Events.StateFacts]
A:110 [in ITree.Core.KTreeFacts]
A:110 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:110 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:110 [in ITree.Extra.ITrace.ITraceFacts]
a:110 [in ITree.Basics.CategoryRelations]
A:111 [in ITree.Interp.InterpFacts]
a:111 [in ITree.Basics.CategoryRelations]
a:112 [in ITree.Basics.CategoryOps]
A:112 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:112 [in ITree.Extra.ITrace.ITracePrefix]
A:112 [in ITree.Extra.ITrace.ITracePreds]
a:113 [in ITree.Extra.IForest]
a:113 [in ITree.Basics.CategoryKleisliFacts]
A:113 [in ITree.Basics.Basics]
A:113 [in ITree.Extra.Secure.SecureEqBind]
a:114 [in ITree.Basics.CategoryOps]
a:114 [in ITree.Core.KTreeFacts]
A:114 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:114 [in ITree.Eq.Rutt]
a:114 [in ITree.Basics.CategoryRelations]
A:114 [in ITree.Basics.HeterogeneousRelations]
a:114 [in ITree.Extra.ITrace.ITracePreds]
A:115 [in ITree.Props.Finite]
a:115 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:115 [in ITree.Basics.CategoryRelations]
a:116 [in ITree.Basics.CategoryFacts]
a:117 [in ITree.Basics.CategoryOps]
a:117 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:117 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:117 [in ITree.Eq.Rutt]
A:117 [in ITree.Extra.Secure.SecureStateHandler]
A:117 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:118 [in ITree.Extra.ITrace.ITraceBind]
a:118 [in ITree.Basics.Basics]
a:118 [in ITree.Basics.CategoryTheory]
A:119 [in ITree.Extra.Secure.SecureEqBind]
A:119 [in ITree.Extra.Secure.SecureStateHandler]
a:12 [in ITree.Basics.Function]
a:12 [in ITree.Eq.EuttExtras]
a:12 [in ITree.Basics.CategoryKleisliFacts]
a:12 [in ITree.Basics.Basics]
a:12 [in ITree.Extra.Dijkstra.IterRel]
A:12 [in ITree.Props.EuttNoRet]
A:12 [in ITree.Indexed.Relation]
a:12 [in ITree.Basics.FunctionFacts]
a:12 [in ITree.Basics.CategoryFacts]
a:12 [in ITree.Basics.CategoryTheory]
a:120 [in ITree.Core.KTreeFacts]
A:120 [in ITree.Basics.Basics]
A:120 [in ITree.Interp.InterpFacts]
A:121 [in ITree.Props.Finite]
A:121 [in ITree.Basics.Basics]
A:121 [in ITree.Basics.HeterogeneousRelations]
A:122 [in ITree.Basics.Basics]
a:123 [in ITree.Basics.CategoryOps]
A:123 [in ITree.Basics.Basics]
a:123 [in ITree.Basics.CategoryFacts]
a:123 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:124 [in ITree.Basics.CategoryOps]
a:124 [in ITree.Events.StateFacts]
A:124 [in ITree.Basics.Basics]
a:124 [in ITree.Interp.InterpFacts]
A:124 [in ITree.Basics.HeterogeneousRelations]
a:125 [in ITree.Basics.CategoryOps]
A:125 [in ITree.Eq.Rutt]
a:125 [in ITree.Basics.CategoryFacts]
a:126 [in ITree.Basics.CategoryOps]
A:126 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:126 [in ITree.Basics.HeterogeneousRelations]
a:128 [in ITree.Events.StateFacts]
A:128 [in ITree.Eq.Rutt]
A:128 [in ITree.Interp.InterpFacts]
A:128 [in ITree.Basics.HeterogeneousRelations]
a:129 [in ITree.Basics.CategoryFacts]
A:13 [in ITree.Basics.Function]
A:13 [in ITree.Extra.IForest]
a:13 [in ITree.Basics.CategoryOps]
A:13 [in ITree.Interp.HandlerFacts]
a:13 [in ITree.Core.Subevent]
A:13 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:130 [in ITree.Extra.Secure.SecureStateHandler]
A:130 [in ITree.Basics.HeterogeneousRelations]
A:132 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:132 [in ITree.Interp.InterpFacts]
A:132 [in ITree.Basics.HeterogeneousRelations]
A:133 [in ITree.Events.StateFacts]
a:133 [in ITree.Basics.CategoryTheory]
a:134 [in ITree.Basics.CategoryOps]
a:134 [in ITree.Basics.CategoryFacts]
A:134 [in ITree.Basics.HeterogeneousRelations]
A:135 [in ITree.Extra.ITrace.ITracePrefix]
A:135 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:137 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:137 [in ITree.Basics.HeterogeneousRelations]
A:138 [in ITree.Extra.Secure.SecureEqBind]
a:139 [in ITree.Basics.CategoryFacts]
a:14 [in ITree.Basics.CategoryKleisli]
A:14 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:14 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:14 [in ITree.Extra.Dijkstra.DijkstraMonad]
a:14 [in ITree.Extra.ITrace.ITraceFacts]
a:14 [in ITree.Core.Subevent]
A:14 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:14 [in ITree.Extra.ITrace.ITracePreds]
A:140 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:140 [in ITree.Extra.Secure.SecureEqHalt]
a:140 [in ITree.Basics.CategoryOps]
A:140 [in ITree.Basics.HeterogeneousRelations]
a:140 [in ITree.Basics.CategoryTheory]
A:141 [in ITree.Extra.Secure.SecureStateHandler]
a:141 [in ITree.Basics.CategoryFacts]
a:141 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:142 [in ITree.Basics.CategoryOps]
A:142 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:142 [in ITree.Extra.ITrace.ITraceFacts]
a:143 [in ITree.Events.StateFacts]
a:143 [in ITree.Basics.CategoryFacts]
a:145 [in ITree.Basics.CategoryOps]
a:145 [in ITree.Events.StateFacts]
a:145 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:147 [in ITree.Basics.HeterogeneousRelations]
a:147 [in ITree.Basics.CategoryTheory]
A:148 [in ITree.Extra.Secure.SecureEqProgInsens]
a:148 [in ITree.Events.StateFacts]
A:148 [in ITree.Eq.Rutt]
a:149 [in ITree.Basics.CategoryFacts]
A:15 [in ITree.Eq.EuttExtras]
A:15 [in ITree.Basics.Monad]
a:15 [in ITree.Basics.CategoryKleisliFacts]
A:15 [in ITree.Props.Finite]
A:15 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:15 [in ITree.Basics.Basics]
A:15 [in ITree.Extra.ITrace.ITracePrefix]
a:15 [in ITree.Extra.Dijkstra.IterRel]
a:15 [in ITree.Basics.MonadState]
A:15 [in ITree.Basics.FunctionFacts]
a:15 [in ITree.Basics.CategoryRelations]
A:150 [in ITree.Basics.HeterogeneousRelations]
a:151 [in ITree.Basics.CategoryOps]
A:151 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:151 [in ITree.Eq.Rutt]
A:151 [in ITree.Extra.Secure.SecureStateHandler]
a:152 [in ITree.Basics.CategoryOps]
A:152 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:153 [in ITree.Eq.UpToTaus]
a:153 [in ITree.Basics.CategoryOps]
A:153 [in ITree.Basics.HeterogeneousRelations]
a:154 [in ITree.Basics.CategoryOps]
a:155 [in ITree.Basics.CategoryFacts]
a:156 [in ITree.Eq.UpToTaus]
a:156 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:156 [in ITree.Basics.HeterogeneousRelations]
a:156 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:157 [in ITree.Extra.ITrace.ITraceBind]
A:157 [in ITree.Eq.Eqit]
A:158 [in ITree.Extra.Secure.SecureEqProgInsens]
A:158 [in ITree.Extra.ITrace.ITraceFacts]
a:158 [in ITree.Basics.CategoryTheory]
a:159 [in ITree.Extra.ITrace.ITraceBind]
A:159 [in ITree.Basics.HeterogeneousRelations]
A:16 [in ITree.Extra.Dijkstra.TracesIT]
a:16 [in ITree.Basics.CategoryFunctor]
a:16 [in ITree.Props.Leaf]
A:16 [in ITree.Extra.Secure.SecureEqBind]
a:16 [in ITree.Basics.CategoryFacts]
a:16 [in ITree.Core.Subevent]
A:16 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:160 [in ITree.Basics.CategoryOps]
A:160 [in ITree.Basics.HeterogeneousRelations]
A:161 [in ITree.Events.StateFacts]
A:161 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:161 [in ITree.Basics.CategoryFacts]
A:163 [in ITree.Basics.HeterogeneousRelations]
a:164 [in ITree.Basics.CategoryOps]
a:165 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:166 [in ITree.Extra.ITrace.ITraceBind]
A:166 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:168 [in ITree.Extra.ITrace.ITraceBind]
A:168 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:168 [in ITree.Extra.Secure.SecureStateHandler]
A:168 [in ITree.Basics.HeterogeneousRelations]
a:17 [in ITree.Extra.Dijkstra.TracesIT]
A:17 [in ITree.Events.FailFacts]
A:17 [in ITree.Props.EuttNoRet]
a:17 [in ITree.Basics.CategoryRelations]
A:17 [in ITree.Basics.HeterogeneousRelations]
a:17 [in ITree.Basics.CategoryTheory]
a:170 [in ITree.Basics.CategoryFacts]
A:170 [in ITree.Basics.HeterogeneousRelations]
a:170 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:171 [in ITree.Basics.CategoryOps]
A:172 [in ITree.Events.StateFacts]
a:172 [in ITree.Basics.CategoryTheory]
A:173 [in ITree.Extra.ITrace.ITraceFacts]
a:173 [in ITree.Basics.CategoryFacts]
A:173 [in ITree.Basics.HeterogeneousRelations]
A:174 [in ITree.Extra.ITrace.ITraceBind]
a:174 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:175 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:176 [in ITree.Basics.CategoryFacts]
A:177 [in ITree.Basics.HeterogeneousRelations]
a:178 [in ITree.Basics.CategoryOps]
a:178 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:179 [in ITree.Basics.CategoryFacts]
A:179 [in ITree.Basics.HeterogeneousRelations]
a:179 [in ITree.Basics.CategoryTheory]
a:18 [in ITree.Basics.Function]
a:18 [in ITree.Extra.IForest]
A:18 [in ITree.Events.ExceptionFacts]
a:18 [in ITree.Basics.CategoryKleisliFacts]
a:18 [in ITree.Props.Finite]
a:18 [in ITree.Basics.CategoryFunctor]
A:18 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:18 [in ITree.Basics.CategoryRelations]
A:18 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:18 [in ITree.Extra.Dijkstra.PureITreeBasics]
A:181 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:182 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:182 [in ITree.Basics.CategoryFacts]
A:182 [in ITree.Basics.HeterogeneousRelations]
A:183 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:185 [in ITree.Extra.ITrace.ITraceBind]
a:185 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:186 [in ITree.Extra.ITrace.ITraceBind]
a:186 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:186 [in ITree.Basics.CategoryFacts]
a:186 [in ITree.Basics.CategoryTheory]
a:187 [in ITree.Basics.CategoryOps]
A:187 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:188 [in ITree.Basics.CategoryFacts]
a:19 [in ITree.Basics.CategoryOps]
A:19 [in ITree.Extra.Secure.SecureEqEuttTrans]
A:19 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:19 [in ITree.Props.Leaf]
A:19 [in ITree.Extra.Dijkstra.DijkstraMonad]
a:19 [in ITree.Basics.MonadState]
a:19 [in ITree.Indexed.Relation]
A:19 [in ITree.Extra.Secure.SecureEqWcompat]
A:19 [in ITree.Eq.Rutt]
a:19 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:19 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:19 [in ITree.Basics.CategorySub]
A:191 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:191 [in ITree.Basics.CategoryFacts]
A:192 [in ITree.Extra.ITrace.ITraceBind]
a:194 [in ITree.Extra.ITrace.ITraceBind]
A:196 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:197 [in ITree.Basics.CategoryFacts]
a:197 [in ITree.Basics.CategoryTheory]
a:198 [in ITree.Props.Finite]
a:198 [in ITree.Basics.CategoryFacts]
a:199 [in ITree.Basics.CategoryOps]
a:199 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:199 [in ITree.Basics.CategoryFacts]
A:2 [in ITree.Extra.Dijkstra.TracesIT]
A:2 [in ITree.Core.KTreeFacts]
A:2 [in ITree.Props.Finite]
a:2 [in ITree.Basics.CategoryKleisli]
A:2 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:2 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:2 [in ITree.Props.Leaf]
A:2 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:2 [in ITree.Props.EuttNoRet]
a:2 [in ITree.Core.ITreeMonad]
A:2 [in ITree.Props.Cofinite]
a:2 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:2 [in ITree.Extra.Dijkstra.PureITreeBasics]
A:2 [in ITree.Eq.Eqit]
a:2 [in ITree.Eq.Paco2]
A:20 [in ITree.Extra.Dijkstra.TracesIT]
A:20 [in ITree.Extra.IForest]
A:20 [in ITree.Basics.Monad]
A:20 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:20 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:20 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:20 [in ITree.Extra.ITrace.ITracePrefix]
a:20 [in ITree.Extra.Dijkstra.IterRel]
A:20 [in ITree.Indexed.Relation]
A:200 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:200 [in ITree.Basics.CategoryFacts]
a:201 [in ITree.Basics.CategoryFacts]
A:201 [in ITree.Basics.HeterogeneousRelations]
a:202 [in ITree.Basics.CategoryFacts]
A:203 [in ITree.Extra.ITrace.ITraceBind]
A:203 [in ITree.Extra.IForest]
A:203 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:203 [in ITree.Basics.CategoryFacts]
a:204 [in ITree.Extra.IForest]
a:204 [in ITree.Basics.CategoryOps]
a:205 [in ITree.Extra.ITrace.ITraceBind]
a:205 [in ITree.Basics.CategoryOps]
a:209 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:209 [in ITree.Basics.CategoryFacts]
a:21 [in ITree.Extra.Dijkstra.TracesIT]
A:21 [in ITree.Basics.Function]
a:21 [in ITree.Extra.IForest]
a:21 [in ITree.Basics.CategoryKleisliFacts]
A:21 [in ITree.Basics.HeterogeneousRelations]
a:21 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:21 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:21 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:21 [in ITree.Interp.RecursionFacts]
a:210 [in ITree.Basics.CategoryOps]
A:210 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:211 [in ITree.Basics.HeterogeneousRelations]
A:213 [in ITree.Basics.HeterogeneousRelations]
a:214 [in ITree.Basics.CategoryOps]
A:215 [in ITree.Extra.ITrace.ITraceBind]
A:215 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:216 [in ITree.Extra.IForest]
A:216 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:216 [in ITree.Basics.CategoryTheory]
A:218 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:218 [in ITree.Basics.CategoryFacts]
a:22 [in ITree.Basics.Basics]
a:22 [in ITree.Props.EuttNoRet]
a:22 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:220 [in ITree.Basics.CategoryOps]
A:220 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:220 [in ITree.Basics.HeterogeneousRelations]
A:222 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:222 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:223 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:224 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:225 [in ITree.Basics.CategoryTheory]
A:226 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:227 [in ITree.Basics.HeterogeneousRelations]
a:228 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:228 [in ITree.Extra.ITrace.ITraceFacts]
A:229 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:229 [in ITree.Basics.CategoryFacts]
a:23 [in ITree.Basics.CategoryOps]
A:23 [in ITree.Interp.Recursion]
a:23 [in ITree.Basics.MonadState]
a:23 [in ITree.Extra.Secure.SecureEqWcompat]
a:23 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:23 [in ITree.Eq.Paco2]
a:23 [in ITree.Basics.CategorySub]
A:230 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:230 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:232 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:232 [in ITree.Extra.ITrace.ITraceFacts]
A:234 [in ITree.Basics.HeterogeneousRelations]
A:235 [in ITree.Extra.ITrace.ITraceFacts]
a:236 [in ITree.Basics.CategoryFacts]
A:236 [in ITree.Simple]
a:238 [in ITree.Basics.CategoryTheory]
A:24 [in ITree.Extra.Dijkstra.TracesIT]
A:24 [in ITree.Basics.Monad]
a:24 [in ITree.Basics.CategoryKleisliFacts]
a:24 [in ITree.Basics.CategoryFunctor]
a:24 [in ITree.Basics.Basics]
A:24 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:24 [in ITree.Props.EuttNoRet]
a:24 [in ITree.Extra.Secure.SecureEqWcompat]
A:24 [in ITree.Extra.Dijkstra.StateIOTrace]
A:24 [in ITree.Basics.CategoryRelations]
A:24 [in ITree.Extra.Dijkstra.PureITreeBasics]
A:240 [in ITree.Simple]
a:242 [in ITree.Basics.CategoryTheory]
a:243 [in ITree.Basics.CategoryFacts]
a:243 [in ITree.Simple]
A:244 [in ITree.Basics.HeterogeneousRelations]
A:245 [in ITree.Simple]
A:246 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:246 [in ITree.Basics.CategoryTheory]
A:248 [in ITree.Basics.HeterogeneousRelations]
A:25 [in ITree.Extra.Secure.SecureEqProgInsens]
A:25 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:25 [in ITree.Extra.Secure.SecureEqHalt]
A:25 [in ITree.Basics.CategoryOps]
a:25 [in ITree.Basics.CategoryKleisli]
A:25 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:25 [in ITree.Props.Infinite]
a:25 [in ITree.Extra.Dijkstra.IterRel]
a:25 [in ITree.Extra.Dijkstra.DijkstraMonad]
A:25 [in ITree.Indexed.Function]
A:25 [in ITree.Extra.Dijkstra.StateSpecT]
a:25 [in ITree.Extra.Secure.SecureEqWcompat]
a:25 [in ITree.Eq.Rutt]
a:250 [in ITree.Basics.CategoryFacts]
a:251 [in ITree.Extra.ITrace.ITraceBind]
a:252 [in ITree.Basics.CategoryFacts]
A:254 [in ITree.Basics.HeterogeneousRelations]
a:255 [in ITree.Basics.CategoryTheory]
a:256 [in ITree.Basics.CategoryFacts]
A:26 [in ITree.Extra.ITrace.ITraceDefinition]
a:26 [in ITree.Extra.Dijkstra.IterRel]
A:26 [in ITree.Indexed.Relation]
A:26 [in ITree.Extra.Dijkstra.StateSpecT]
a:26 [in ITree.Extra.Secure.SecureEqWcompat]
A:26 [in ITree.Basics.HeterogeneousRelations]
A:26 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:26 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:260 [in ITree.Basics.CategoryTheory]
a:261 [in ITree.Basics.CategoryFacts]
A:264 [in ITree.Extra.ITrace.ITraceBind]
a:264 [in ITree.Basics.CategoryTheory]
a:266 [in ITree.Basics.CategoryFacts]
A:266 [in ITree.Basics.HeterogeneousRelations]
a:266 [in ITree.Basics.CategoryTheory]
a:268 [in ITree.Basics.CategoryFacts]
a:268 [in ITree.Basics.CategoryTheory]
a:269 [in ITree.Basics.CategoryTheory]
A:27 [in ITree.Interp.Recursion]
A:27 [in ITree.Basics.CategoryKleisliFacts]
A:27 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:27 [in ITree.Basics.Basics]
A:27 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:27 [in ITree.Extra.Dijkstra.IterRel]
A:27 [in ITree.Props.EuttNoRet]
a:27 [in ITree.Basics.MonadState]
A:27 [in ITree.Extra.Dijkstra.StateSpecT]
a:27 [in ITree.Extra.Secure.SecureEqWcompat]
a:27 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:27 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:270 [in ITree.Basics.CategoryFacts]
a:271 [in ITree.Basics.CategoryTheory]
a:273 [in ITree.Basics.CategoryTheory]
A:274 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:275 [in ITree.Basics.CategoryTheory]
a:276 [in ITree.Basics.CategoryFacts]
A:276 [in ITree.Basics.HeterogeneousRelations]
A:278 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:278 [in ITree.Basics.HeterogeneousRelations]
a:279 [in ITree.Basics.CategoryTheory]
A:28 [in ITree.Basics.Function]
a:28 [in ITree.Extra.Secure.SecureEqWcompat]
A:28 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:28 [in ITree.Basics.CategorySub]
a:280 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:282 [in ITree.Extra.IForest]
a:282 [in ITree.Basics.CategoryFacts]
a:283 [in ITree.Extra.IForest]
A:287 [in ITree.Extra.Secure.SecureEqProgInsens]
A:287 [in ITree.Extra.IForest]
a:288 [in ITree.Extra.IForest]
a:288 [in ITree.Basics.CategoryFacts]
A:288 [in ITree.Basics.HeterogeneousRelations]
A:29 [in ITree.Basics.CategoryKleisliFacts]
a:29 [in ITree.Props.Finite]
A:29 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:29 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:29 [in ITree.Extra.Secure.SecureEqWcompat]
A:29 [in ITree.Extra.Dijkstra.StateIOTrace]
a:29 [in ITree.Basics.CategoryFacts]
a:29 [in ITree.Basics.CategoryTheory]
a:29 [in ITree.Extra.Dijkstra.PureITreeBasics]
A:291 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:292 [in ITree.Basics.HeterogeneousRelations]
a:293 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:294 [in ITree.Basics.CategoryTheory]
a:297 [in ITree.Basics.CategoryFacts]
A:298 [in ITree.Basics.HeterogeneousRelations]
a:298 [in ITree.Basics.CategoryTheory]
a:3 [in ITree.Basics.Tacs]
A:3 [in ITree.Basics.Function]
A:3 [in ITree.Basics.Monad]
A:3 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:3 [in ITree.Props.Leaf]
A:3 [in ITree.Extra.Dijkstra.DijkstraMonad]
A:3 [in ITree.Basics.FunctionFacts]
a:3 [in ITree.Extra.ITrace.ITraceFacts]
A:3 [in ITree.Basics.HeterogeneousRelations]
A:3 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:30 [in ITree.Extra.Secure.SecureEqProgInsens]
a:30 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:30 [in ITree.Extra.Secure.SecureEqHalt]
A:30 [in ITree.Basics.CategoryKleisliFacts]
a:30 [in ITree.Basics.CategoryFunctor]
A:30 [in ITree.Props.Infinite]
a:30 [in ITree.Props.Leaf]
A:30 [in ITree.Extra.ITrace.ITraceDefinition]
A:30 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:30 [in ITree.Extra.Dijkstra.IterRel]
a:30 [in ITree.Extra.Secure.SecureEqWcompat]
a:300 [in ITree.Basics.CategoryFacts]
a:302 [in ITree.Basics.HeterogeneousRelations]
a:303 [in ITree.Basics.CategoryFacts]
a:304 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:304 [in ITree.Basics.HeterogeneousRelations]
a:306 [in ITree.Basics.CategoryFacts]
a:308 [in ITree.Basics.HeterogeneousRelations]
a:309 [in ITree.Basics.CategoryFacts]
A:31 [in ITree.Extra.Secure.SecureEqProgInsens]
A:31 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:31 [in ITree.Extra.Dijkstra.TracesIT]
A:31 [in ITree.Extra.Secure.SecureEqHalt]
a:31 [in ITree.Basics.CategoryOps]
A:31 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:31 [in ITree.Basics.MonadState]
A:31 [in ITree.Extra.Secure.SecureEqBind]
a:31 [in ITree.Extra.Secure.SecureEqWcompat]
a:31 [in ITree.Extra.ITrace.ITraceFacts]
A:31 [in ITree.Basics.CategoryRelations]
A:31 [in ITree.Extra.Dijkstra.PureITreeBasics]
A:31 [in ITree.Extra.ITrace.ITracePreds]
A:310 [in ITree.Basics.HeterogeneousRelations]
a:311 [in ITree.Basics.CategoryTheory]
a:313 [in ITree.Basics.CategoryFacts]
A:314 [in ITree.Basics.HeterogeneousRelations]
a:314 [in ITree.Basics.CategoryTheory]
a:315 [in ITree.Basics.CategoryFacts]
A:316 [in ITree.Basics.HeterogeneousRelations]
a:318 [in ITree.Basics.CategoryFacts]
A:318 [in ITree.Basics.HeterogeneousRelations]
A:32 [in ITree.Extra.ITrace.ITraceBind]
A:32 [in ITree.Basics.Monad]
A:32 [in ITree.Interp.Recursion]
A:32 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:32 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:32 [in ITree.Props.Infinite]
a:32 [in ITree.Extra.ITrace.ITraceDefinition]
A:32 [in ITree.Indexed.Relation]
a:32 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:322 [in ITree.Basics.CategoryTheory]
a:324 [in ITree.Basics.CategoryFacts]
a:325 [in ITree.Basics.CategoryFacts]
a:326 [in ITree.Basics.CategoryFacts]
A:326 [in ITree.Basics.HeterogeneousRelations]
a:327 [in ITree.Basics.CategoryFacts]
a:327 [in ITree.Basics.CategoryTheory]
a:328 [in ITree.Basics.CategoryFacts]
a:329 [in ITree.Basics.CategoryFacts]
A:33 [in ITree.Extra.Dijkstra.TracesIT]
A:33 [in ITree.Extra.IForest]
A:33 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:33 [in ITree.Extra.ITrace.ITraceDefinition]
a:33 [in ITree.Extra.Dijkstra.IterRel]
A:33 [in ITree.Props.EuttNoRet]
A:33 [in ITree.Extra.Dijkstra.DijkstraMonad]
a:33 [in ITree.Extra.Secure.SecureEqWcompat]
A:33 [in ITree.Extra.Secure.SecureStateHandler]
A:33 [in ITree.Interp.RecursionFacts]
A:33 [in ITree.Extra.Secure.SecureStateHandlerPi]
a:330 [in ITree.Basics.CategoryFacts]
A:331 [in ITree.Extra.ITrace.ITraceBind]
a:336 [in ITree.Extra.ITrace.ITraceBind]
a:336 [in ITree.Basics.CategoryFacts]
a:337 [in ITree.Extra.ITrace.ITraceBind]
a:337 [in ITree.Basics.CategoryTheory]
A:34 [in ITree.Basics.Function]
a:34 [in ITree.Basics.CategoryKleisli]
A:34 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:34 [in ITree.Extra.Dijkstra.StateSpecT]
a:34 [in ITree.Basics.CategoryFacts]
a:345 [in ITree.Basics.CategoryFacts]
a:35 [in ITree.Extra.ITrace.ITraceBind]
A:35 [in ITree.Basics.CategoryKleisliFacts]
a:35 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:35 [in ITree.Extra.Secure.SecureEqWcompat]
A:35 [in ITree.Extra.Secure.SecureStateHandler]
A:35 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:35 [in ITree.Extra.Dijkstra.PureITreeBasics]
A:35 [in ITree.Extra.Secure.SecureStateHandlerPi]
a:352 [in ITree.Basics.CategoryTheory]
a:357 [in ITree.Basics.CategoryTheory]
a:358 [in ITree.Basics.CategoryFacts]
a:36 [in ITree.Extra.Secure.SecureEqProgInsens]
A:36 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:36 [in ITree.Extra.Dijkstra.IterRel]
a:36 [in ITree.Basics.MonadState]
A:36 [in ITree.Extra.Secure.SecureEqBind]
a:36 [in ITree.Extra.Secure.SecureEqWcompat]
a:36 [in ITree.Basics.CategoryTheory]
A:36 [in ITree.Extra.Dijkstra.PureITreeBasics]
a:361 [in ITree.Basics.CategoryFacts]
a:364 [in ITree.Basics.CategoryTheory]
a:367 [in ITree.Basics.CategoryFacts]
A:37 [in ITree.Extra.Secure.SecureEqProgInsens]
a:37 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:37 [in ITree.Extra.Secure.SecureEqHalt]
a:37 [in ITree.Basics.CategoryOps]
A:37 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:37 [in ITree.Extra.ITrace.ITraceDefinition]
a:37 [in ITree.Extra.Secure.SecureEqWcompat]
A:37 [in ITree.Interp.RecursionFacts]
a:371 [in ITree.Basics.CategoryTheory]
a:373 [in ITree.Basics.CategoryFacts]
A:38 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:38 [in ITree.Extra.Secure.SecureEqHalt]
A:38 [in ITree.Interp.Recursion]
a:38 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:38 [in ITree.Basics.Basics]
A:38 [in ITree.Props.EuttNoRet]
A:38 [in ITree.Indexed.Relation]
a:38 [in ITree.Extra.Dijkstra.StateSpecT]
a:38 [in ITree.Extra.Secure.SecureEqWcompat]
a:380 [in ITree.Basics.CategoryTheory]
a:382 [in ITree.Basics.CategoryFacts]
a:383 [in ITree.Basics.CategoryTheory]
a:385 [in ITree.Basics.CategoryFacts]
A:39 [in ITree.Basics.Function]
A:39 [in ITree.Extra.IForest]
A:39 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:39 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:39 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:39 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:390 [in ITree.Basics.CategoryFacts]
a:397 [in ITree.Basics.CategoryFacts]
a:398 [in ITree.Basics.CategoryFacts]
A:4 [in ITree.Extra.Dijkstra.TracesIT]
a:4 [in ITree.Basics.CategoryOps]
A:4 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:4 [in ITree.Extra.ITrace.ITraceDefinition]
a:4 [in ITree.Basics.Basics]
A:4 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:4 [in ITree.Extra.Dijkstra.IterRel]
A:4 [in ITree.Interp.HandlerFacts]
a:4 [in ITree.Extra.ITrace.ITraceFacts]
a:4 [in ITree.Extra.Secure.Labels]
A:4 [in ITree.Extra.ITrace.ITracePreds]
a:40 [in ITree.Extra.Dijkstra.TracesIT]
A:40 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:40 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:40 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:40 [in ITree.Extra.ITrace.ITracePrefix]
A:40 [in ITree.Extra.Dijkstra.StateSpecT]
A:403 [in ITree.Extra.IForest]
a:404 [in ITree.Extra.IForest]
a:405 [in ITree.Basics.CategoryFacts]
A:408 [in ITree.Extra.IForest]
a:409 [in ITree.Extra.IForest]
A:41 [in ITree.Extra.IForest]
a:41 [in ITree.Props.Finite]
a:41 [in ITree.Basics.CategoryFunctor]
A:41 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:41 [in ITree.Extra.ITrace.ITraceDefinition]
A:41 [in ITree.Extra.Dijkstra.IterRel]
A:41 [in ITree.Extra.Secure.SecureStateHandler]
a:41 [in ITree.Basics.CategorySub]
A:41 [in ITree.Extra.Secure.SecureStateHandlerPi]
a:410 [in ITree.Basics.CategoryFacts]
A:412 [in ITree.Extra.IForest]
a:414 [in ITree.Extra.IForest]
a:415 [in ITree.Basics.CategoryFacts]
a:42 [in ITree.Extra.Secure.SecureEqProgInsens]
A:42 [in ITree.Extra.Dijkstra.TracesIT]
a:42 [in ITree.Basics.CategoryOps]
A:42 [in ITree.Basics.CategoryKleisliFacts]
a:42 [in ITree.Basics.CategoryFunctor]
A:42 [in ITree.Props.Infinite]
a:42 [in ITree.Basics.CategoryTheory]
A:42 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:42 [in ITree.Interp.RecursionFacts]
A:421 [in ITree.Extra.IForest]
a:421 [in ITree.Basics.CategoryFacts]
a:427 [in ITree.Extra.IForest]
a:427 [in ITree.Basics.CategoryFacts]
A:429 [in ITree.Extra.IForest]
A:43 [in ITree.Extra.Secure.SecureEqProgInsens]
a:43 [in ITree.Extra.ITrace.ITraceDefinition]
A:43 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:43 [in ITree.Basics.MonadState]
A:43 [in ITree.Extra.Secure.SecureStateHandler]
A:43 [in ITree.Extra.Secure.SecureEqEuttHalt]
a:430 [in ITree.Basics.CategoryFacts]
a:433 [in ITree.Basics.CategoryFacts]
a:434 [in ITree.Extra.IForest]
A:436 [in ITree.Extra.IForest]
a:44 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:44 [in ITree.Extra.Secure.SecureEqHalt]
a:44 [in ITree.Basics.Function]
A:44 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:44 [in ITree.Indexed.Relation]
a:44 [in ITree.Extra.Dijkstra.StateSpecT]
a:442 [in ITree.Extra.IForest]
A:444 [in ITree.Extra.IForest]
a:449 [in ITree.Extra.IForest]
A:45 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:45 [in ITree.Extra.Secure.SecureEqHalt]
A:45 [in ITree.Interp.Recursion]
A:45 [in ITree.Extra.Dijkstra.IterRel]
a:45 [in ITree.Basics.CategorySub]
A:451 [in ITree.Extra.IForest]
A:455 [in ITree.Extra.IForest]
a:457 [in ITree.Extra.IForest]
A:459 [in ITree.Extra.IForest]
a:46 [in ITree.Basics.CategoryOps]
A:46 [in ITree.Props.Infinite]
a:46 [in ITree.Basics.CategoryRelations]
A:46 [in ITree.Extra.ITrace.ITracePreds]
A:46 [in ITree.Eq.Paco2]
a:464 [in ITree.Extra.IForest]
A:47 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:47 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:47 [in ITree.Extra.Dijkstra.IterRel]
A:47 [in ITree.Extra.Dijkstra.StateSpecT]
a:47 [in ITree.Basics.CategoryFacts]
A:47 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:47 [in ITree.Basics.CategorySub]
a:474 [in ITree.Extra.IForest]
a:48 [in ITree.Extra.Dijkstra.TracesIT]
a:48 [in ITree.Extra.IForest]
a:48 [in ITree.Interp.Recursion]
A:48 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:48 [in ITree.Extra.Dijkstra.IterRel]
A:48 [in ITree.Props.EuttNoRet]
a:48 [in ITree.Basics.MonadState]
a:48 [in ITree.Eq.Paco2]
a:480 [in ITree.Extra.IForest]
a:485 [in ITree.Extra.IForest]
A:49 [in ITree.Basics.CategoryKleisliFacts]
A:49 [in ITree.Extra.Dijkstra.DijkstraMonad]
A:49 [in ITree.Indexed.Relation]
A:49 [in ITree.Extra.Secure.SecureStateHandler]
a:49 [in ITree.Basics.CategorySub]
A:5 [in ITree.Extra.Secure.SecureEqProgInsens]
A:5 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:5 [in ITree.Basics.Tacs]
A:5 [in ITree.Extra.Secure.SecureEqHalt]
A:5 [in ITree.Extra.Secure.SecureEqEuttTrans]
a:5 [in ITree.Props.Finite]
a:5 [in ITree.Basics.CategoryKleisli]
A:5 [in ITree.Eq.Rutt]
A:5 [in ITree.Props.Cofinite]
A:5 [in ITree.Basics.FunctionFacts]
A:5 [in ITree.Extra.Secure.Labels]
a:5 [in ITree.Basics.CategorySub]
a:50 [in ITree.Extra.Dijkstra.TracesIT]
A:50 [in ITree.Extra.IForest]
a:50 [in ITree.Basics.CategoryOps]
A:50 [in ITree.Interp.Recursion]
A:50 [in ITree.Props.Leaf]
A:50 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:50 [in ITree.Extra.Dijkstra.DijkstraMonad]
a:50 [in ITree.Extra.Dijkstra.StateSpecT]
A:50 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
a:50 [in ITree.Basics.CategoryRelations]
a:50 [in ITree.Basics.CategoryTheory]
a:50 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:501 [in ITree.Extra.IForest]
a:509 [in ITree.Extra.IForest]
a:51 [in ITree.Extra.Secure.SecureEqProgInsens]
a:51 [in ITree.Extra.Dijkstra.IterRel]
A:51 [in ITree.Extra.Secure.SecureStateHandler]
A:51 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:51 [in ITree.Events.State]
a:51 [in ITree.Basics.CategorySub]
a:513 [in ITree.Extra.IForest]
A:518 [in ITree.Extra.IForest]
a:52 [in ITree.Extra.Dijkstra.TracesIT]
A:52 [in ITree.Extra.IForest]
a:52 [in ITree.Interp.Recursion]
A:52 [in ITree.Extra.Dijkstra.DijkstraMonad]
A:52 [in ITree.Extra.Dijkstra.StateIOTrace]
a:52 [in ITree.Eq.Paco2]
A:521 [in ITree.Extra.IForest]
A:526 [in ITree.Extra.IForest]
a:529 [in ITree.Extra.IForest]
A:53 [in ITree.Extra.Secure.SecureEqProgInsens]
A:53 [in ITree.Props.Infinite]
A:53 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:53 [in ITree.Basics.MonadState]
A:53 [in ITree.Extra.Dijkstra.StateSpecT]
A:53 [in ITree.Extra.Secure.SecureStateHandlerPi]
A:532 [in ITree.Extra.IForest]
a:54 [in ITree.Extra.Dijkstra.TracesIT]
A:54 [in ITree.Interp.Recursion]
a:54 [in ITree.Basics.CategoryKleisliFacts]
A:54 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:54 [in ITree.Props.EuttNoRet]
a:54 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
a:54 [in ITree.Basics.CategoryRelations]
A:54 [in ITree.Basics.HeterogeneousRelations]
a:54 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:540 [in ITree.Extra.IForest]
a:545 [in ITree.Extra.IForest]
A:547 [in ITree.Extra.IForest]
a:549 [in ITree.Extra.IForest]
a:55 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:55 [in ITree.Extra.Secure.SecureEqHalt]
a:55 [in ITree.Basics.CategoryOps]
A:55 [in ITree.Basics.CategoryKleisliFacts]
A:55 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:55 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:55 [in ITree.Props.Infinite]
a:55 [in ITree.Props.Leaf]
A:55 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:55 [in ITree.Basics.MonadState]
a:55 [in ITree.Basics.CategoryFacts]
a:55 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:55 [in ITree.Eq.Paco2]
A:556 [in ITree.Extra.IForest]
A:56 [in ITree.Extra.Dijkstra.TracesIT]
A:56 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:56 [in ITree.Extra.Dijkstra.DijkstraMonad]
a:56 [in ITree.Extra.Dijkstra.StateSpecT]
a:56 [in ITree.Basics.CategoryTheory]
a:56 [in ITree.Basics.CategorySub]
a:561 [in ITree.Extra.IForest]
A:563 [in ITree.Extra.IForest]
A:569 [in ITree.Extra.IForest]
A:57 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:57 [in ITree.Extra.ITrace.ITraceBind]
A:57 [in ITree.Extra.Secure.SecureEqHalt]
A:57 [in ITree.Props.Infinite]
A:57 [in ITree.Basics.HeterogeneousRelations]
a:571 [in ITree.Extra.IForest]
A:574 [in ITree.Extra.IForest]
A:577 [in ITree.Extra.IForest]
a:58 [in ITree.Interp.Recursion]
A:58 [in ITree.Core.KTreeFacts]
a:58 [in ITree.Props.Infinite]
a:58 [in ITree.Props.EuttNoRet]
A:58 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:58 [in ITree.Eq.Paco2]
A:580 [in ITree.Extra.IForest]
A:581 [in ITree.Extra.IForest]
A:585 [in ITree.Extra.IForest]
A:587 [in ITree.Extra.IForest]
a:59 [in ITree.Extra.Secure.SecureEqProgInsens]
a:59 [in ITree.Extra.IForest]
A:59 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:59 [in ITree.Extra.Secure.SecureStateHandler]
A:59 [in ITree.Basics.HeterogeneousRelations]
A:591 [in ITree.Extra.IForest]
A:594 [in ITree.Extra.IForest]
A:599 [in ITree.Extra.IForest]
A:6 [in ITree.Extra.Dijkstra.TracesIT]
A:6 [in ITree.Extra.ITrace.ITraceBind]
A:6 [in ITree.Basics.Function]
a:6 [in ITree.Events.FailFacts]
A:6 [in ITree.Eq.EuttExtras]
a:6 [in ITree.Basics.CategoryKleisliFacts]
a:6 [in ITree.Basics.CategoryFunctor]
a:6 [in ITree.Props.EuttNoRet]
A:6 [in ITree.Extra.ITrace.ITraceFacts]
A:6 [in ITree.Basics.CategoryRelations]
a:6 [in ITree.Basics.MonadProp]
A:6 [in ITree.Extra.Dijkstra.PureITreeBasics]
A:60 [in ITree.Extra.Secure.SecureEqProgInsens]
A:60 [in ITree.Basics.CategoryKleisliFacts]
A:60 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:60 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:60 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:60 [in ITree.Basics.CategoryRelations]
a:609 [in ITree.Extra.IForest]
A:61 [in ITree.Extra.Dijkstra.TracesIT]
A:61 [in ITree.Extra.IForest]
a:61 [in ITree.Basics.CategoryOps]
a:61 [in ITree.Basics.MonadState]
A:61 [in ITree.Extra.Secure.SecureStateHandler]
a:61 [in ITree.Basics.CategoryFacts]
A:61 [in ITree.Extra.Secure.SecureStateHandlerPi]
a:610 [in ITree.Extra.IForest]
a:611 [in ITree.Extra.IForest]
A:62 [in ITree.Basics.CategoryKleisliFacts]
A:62 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:62 [in ITree.Basics.HeterogeneousRelations]
a:622 [in ITree.Extra.IForest]
A:623 [in ITree.Eq.Eqit]
A:63 [in ITree.Extra.IForest]
A:63 [in ITree.Props.EuttNoRet]
A:63 [in ITree.Extra.Dijkstra.StateSpecT]
A:63 [in ITree.Extra.Secure.SecureStateHandler]
a:64 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:64 [in ITree.Extra.Secure.SecureEqHalt]
A:64 [in ITree.Events.StateFacts]
A:64 [in ITree.Basics.CategoryKleisliFacts]
a:64 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:64 [in ITree.Props.Leaf]
A:64 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:64 [in ITree.Basics.HeterogeneousRelations]
A:64 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:642 [in ITree.Extra.IForest]
A:65 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:65 [in ITree.Extra.Secure.SecureEqHalt]
a:65 [in ITree.Basics.CategoryOps]
A:65 [in ITree.Core.KTreeFacts]
A:65 [in ITree.Extra.Dijkstra.IterRel]
a:65 [in ITree.Basics.CategoryRelations]
a:66 [in ITree.Extra.Secure.SecureEqProgInsens]
A:66 [in ITree.Basics.CategoryKleisliFacts]
A:66 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:67 [in ITree.Props.Infinite]
A:67 [in ITree.Extra.Dijkstra.DijkstraMonad]
a:67 [in ITree.Basics.MonadState]
A:67 [in ITree.Extra.Secure.SecureStateHandler]
a:67 [in ITree.Basics.CategoryFacts]
A:68 [in ITree.Core.KTreeFacts]
a:68 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:68 [in ITree.Props.EuttNoRet]
a:68 [in ITree.Basics.CategoryTheory]
a:69 [in ITree.Basics.CategoryOps]
a:69 [in ITree.Props.Infinite]
A:69 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:69 [in ITree.Extra.Dijkstra.IterRel]
A:69 [in ITree.Extra.Secure.SecureStateHandler]
A:69 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:69 [in ITree.Extra.ITrace.ITracePreds]
a:7 [in ITree.Basics.Tacs]
a:7 [in ITree.Extra.IForest]
A:7 [in ITree.Props.Infinite]
A:7 [in ITree.Extra.ITrace.ITraceDefinition]
a:7 [in ITree.Basics.Basics]
A:7 [in ITree.Interp.HandlerFacts]
a:7 [in ITree.Basics.MonadState]
A:7 [in ITree.Extra.Dijkstra.StateSpecT]
A:7 [in ITree.Extra.Dijkstra.StateIOTrace]
a:7 [in ITree.Basics.CategoryFacts]
a:7 [in ITree.Basics.CategoryTheory]
a:7 [in ITree.Extra.Dijkstra.DelaySpecMonad]
a:7 [in ITree.Basics.MonadProp]
a:7 [in ITree.Basics.CategorySub]
a:70 [in ITree.Extra.IForest]
a:70 [in ITree.Props.Leaf]
A:70 [in ITree.Extra.Dijkstra.DijkstraMonad]
a:70 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:70 [in ITree.Basics.HeterogeneousRelations]
a:70 [in ITree.Basics.CategoryTheory]
A:71 [in ITree.Core.KTreeFacts]
A:71 [in ITree.Basics.CategoryKleisliFacts]
A:71 [in ITree.Props.Infinite]
A:71 [in ITree.Basics.CategoryRelations]
A:71 [in ITree.Extra.ITrace.ITracePreds]
a:72 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
a:72 [in ITree.Extra.Secure.SecureEqHalt]
a:72 [in ITree.Extra.IForest]
A:72 [in ITree.Basics.CategoryKleisliFacts]
A:72 [in ITree.Props.Leaf]
A:72 [in ITree.Props.EuttNoRet]
A:72 [in ITree.Extra.Secure.SecureStateHandler]
a:72 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:73 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:73 [in ITree.Extra.Secure.SecureEqHalt]
a:73 [in ITree.Basics.CategoryOps]
A:73 [in ITree.Basics.CategoryKleisliFacts]
A:73 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:73 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:73 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:73 [in ITree.Extra.Dijkstra.StateSpecT]
A:73 [in ITree.Interp.InterpFacts]
A:74 [in ITree.Extra.Dijkstra.TracesIT]
A:74 [in ITree.Extra.IForest]
A:74 [in ITree.Basics.CategoryKleisliFacts]
a:74 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:74 [in ITree.Props.Infinite]
A:74 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:74 [in ITree.Extra.Dijkstra.IterRel]
A:74 [in ITree.Extra.Secure.SecureStateHandler]
A:75 [in ITree.Extra.Dijkstra.TracesIT]
A:75 [in ITree.Basics.CategoryKleisliFacts]
A:75 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:75 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:75 [in ITree.Extra.Dijkstra.IterRel]
A:75 [in ITree.Extra.Secure.SecureStateHandler]
a:76 [in ITree.Basics.CategoryOps]
A:76 [in ITree.Core.KTreeFacts]
a:76 [in ITree.Props.Infinite]
A:76 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:76 [in ITree.Basics.CategoryFacts]
a:76 [in ITree.Basics.CategoryRelations]
A:77 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:77 [in ITree.Extra.Dijkstra.StateSpecT]
A:77 [in ITree.Basics.HeterogeneousRelations]
A:78 [in ITree.Basics.CategoryKleisliFacts]
A:78 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:78 [in ITree.Props.Infinite]
a:78 [in ITree.Props.Leaf]
A:78 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:78 [in ITree.Props.EuttNoRet]
A:78 [in ITree.Extra.Secure.SecureStateHandler]
A:79 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:79 [in ITree.Extra.Secure.SecureEqHalt]
A:79 [in ITree.Core.KTreeFacts]
A:79 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:79 [in ITree.Extra.Dijkstra.StateSpecT]
a:8 [in ITree.Basics.CategoryKleisliFacts]
A:8 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:8 [in ITree.Basics.MonadState]
A:8 [in ITree.Eq.Rutt]
A:8 [in ITree.Extra.Secure.SecureStateHandler]
A:8 [in ITree.Extra.Dijkstra.StateIOTrace]
a:8 [in ITree.Basics.CategoryFacts]
A:8 [in ITree.Core.Subevent]
A:8 [in ITree.Basics.CategoryRelations]
A:8 [in ITree.Extra.Dijkstra.DelaySpecMonad]
A:8 [in ITree.Extra.Secure.Labels]
A:8 [in ITree.Extra.Secure.SecureStateHandlerPi]
a:80 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:80 [in ITree.Props.Infinite]
A:80 [in ITree.Extra.Secure.SecureStateHandler]
A:80 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:806 [in ITree.Eq.Eqit]
a:809 [in ITree.Eq.Eqit]
A:81 [in ITree.Extra.Dijkstra.TracesIT]
a:81 [in ITree.Basics.CategoryOps]
a:81 [in ITree.Basics.CategoryKleisliFacts]
a:81 [in ITree.Props.Infinite]
a:81 [in ITree.Basics.CategoryTheory]
A:811 [in ITree.Eq.Eqit]
A:82 [in ITree.Basics.CategoryKleisliFacts]
A:82 [in ITree.Props.Finite]
A:82 [in ITree.Extra.Dijkstra.StateDelaySpec]
a:82 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
a:82 [in ITree.Props.Infinite]
A:82 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:82 [in ITree.Basics.CategoryFacts]
a:82 [in ITree.Basics.CategoryRelations]
A:82 [in ITree.Basics.HeterogeneousRelations]
a:825 [in ITree.Eq.Eqit]
A:827 [in ITree.Eq.Eqit]
a:83 [in ITree.Extra.Dijkstra.StateSpecT]
a:832 [in ITree.Eq.Eqit]
A:834 [in ITree.Eq.Eqit]
a:839 [in ITree.Eq.Eqit]
A:84 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:84 [in ITree.Extra.Secure.SecureStateHandler]
a:84 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:843 [in ITree.Eq.Eqit]
A:85 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:85 [in ITree.Extra.Secure.SecureEqHalt]
a:85 [in ITree.Basics.CategoryOps]
A:85 [in ITree.Basics.CategoryKleisliFacts]
a:85 [in ITree.Props.Leaf]
a:85 [in ITree.Extra.Dijkstra.StateSpecT]
a:85 [in ITree.Basics.CategoryRelations]
a:85 [in ITree.Basics.CategoryTheory]
A:85 [in ITree.Extra.ITrace.ITracePreds]
a:857 [in ITree.Eq.Eqit]
A:858 [in ITree.Eq.Eqit]
A:86 [in ITree.Eq.Shallow]
a:868 [in ITree.Eq.Eqit]
A:869 [in ITree.Eq.Eqit]
A:87 [in ITree.Extra.Secure.SecureStateHandler]
A:87 [in ITree.Basics.HeterogeneousRelations]
a:879 [in ITree.Eq.Eqit]
A:88 [in ITree.Core.KTreeFacts]
a:88 [in ITree.Basics.CategoryKleisliFacts]
A:88 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:88 [in ITree.Props.Infinite]
A:88 [in ITree.Extra.Secure.SecureEqBind]
a:88 [in ITree.Basics.CategoryRelations]
A:881 [in ITree.Eq.Eqit]
a:89 [in ITree.Basics.CategoryOps]
A:89 [in ITree.Events.StateFacts]
A:89 [in ITree.Basics.CategoryKleisliFacts]
a:89 [in ITree.Props.Infinite]
A:89 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:89 [in ITree.Extra.Secure.SecureStateHandler]
a:891 [in ITree.Eq.Eqit]
A:893 [in ITree.Eq.Eqit]
a:899 [in ITree.Eq.Eqit]
a:9 [in ITree.Basics.Tacs]
a:9 [in ITree.Extra.ITrace.ITraceBind]
A:9 [in ITree.Axioms]
A:9 [in ITree.Basics.Monad]
a:9 [in ITree.Basics.CategoryKleisli]
a:9 [in ITree.Basics.Basics]
A:9 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:9 [in ITree.Props.EuttNoRet]
A:9 [in ITree.Basics.FunctionFacts]
a:9 [in ITree.Extra.ITrace.ITraceFacts]
A:9 [in ITree.Extra.Dijkstra.StateIOTrace]
A:90 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:901 [in ITree.Eq.Eqit]
a:907 [in ITree.Eq.Eqit]
A:91 [in ITree.Events.ExceptionFacts]
a:91 [in ITree.Basics.CategoryFacts]
a:91 [in ITree.Basics.CategoryRelations]
a:91 [in ITree.Extra.Secure.SecureEqEuttHalt]
A:92 [in ITree.Extra.Dijkstra.TracesIT]
A:92 [in ITree.Props.Infinite]
A:93 [in ITree.Basics.CategoryKleisliFacts]
A:93 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:93 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:93 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
A:93 [in ITree.Basics.HeterogeneousRelations]
a:94 [in ITree.Core.KTreeFacts]
A:94 [in ITree.Props.Finite]
a:94 [in ITree.Props.Infinite]
A:94 [in ITree.Extra.Secure.SecureEqBind]
A:94 [in ITree.Extra.Secure.SecureStateHandler]
a:94 [in ITree.Basics.CategoryRelations]
A:94 [in ITree.Basics.HeterogeneousRelations]
A:95 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
A:95 [in ITree.Extra.Secure.SecureEqHalt]
a:95 [in ITree.Events.ExceptionFacts]
A:95 [in ITree.Extra.Dijkstra.ITreeDijkstra]
A:95 [in ITree.Extra.ITrace.ITraceFacts]
A:95 [in ITree.Basics.HeterogeneousRelations]
A:96 [in ITree.Basics.HeterogeneousRelations]
a:97 [in ITree.Basics.CategoryOps]
A:97 [in ITree.Extra.Dijkstra.StateDelaySpec]
A:97 [in ITree.Extra.Dijkstra.ITreeDijkstra]
a:97 [in ITree.Extra.ITrace.ITraceFacts]
a:97 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
a:97 [in ITree.Basics.CategoryRelations]
A:97 [in ITree.Basics.HeterogeneousRelations]
a:98 [in ITree.Basics.CategoryOps]
A:98 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
A:98 [in ITree.Extra.Secure.SecureStateHandler]
A:98 [in ITree.Basics.HeterogeneousRelations]
A:98 [in ITree.Extra.ITrace.ITracePreds]
A:99 [in ITree.Basics.HeterogeneousRelations]
A:99 [in ITree.Simple]

B

bc:107 [in ITree.Basics.CategoryFacts]
bc:114 [in ITree.Basics.CategoryFacts]
bc:121 [in ITree.Basics.CategoryFacts]
bc:248 [in ITree.Basics.CategoryFacts]
bc:34 [in ITree.Basics.CategoryKleisliFacts]
bc:409 [in ITree.Basics.CategoryFacts]
bc:53 [in ITree.Basics.CategoryKleisliFacts]
bc:70 [in ITree.Basics.CategoryKleisliFacts]
bd:249 [in ITree.Basics.CategoryFacts]
bd:81 [in ITree.Basics.CategoryFacts]
bd:87 [in ITree.Basics.CategoryFacts]
Bifunctor_bif:75 [in ITree.Basics.CategoryFacts]
bif:128 [in ITree.Basics.CategoryTheory]
bif:16 [in ITree.Basics.CategorySub]
bif:167 [in ITree.Basics.CategoryTheory]
bif:193 [in ITree.Basics.CategoryOps]
bif:224 [in ITree.Basics.CategoryFacts]
bif:234 [in ITree.Basics.CategoryTheory]
bif:25 [in ITree.Basics.CategoryFacts]
bif:29 [in ITree.Basics.CategoryOps]
bif:308 [in ITree.Basics.CategoryTheory]
bif:346 [in ITree.Basics.CategoryTheory]
bif:351 [in ITree.Basics.CategoryFacts]
bif:73 [in ITree.Basics.CategoryFacts]
bif:94 [in ITree.Basics.CategoryOps]
bif:97 [in ITree.Basics.CategoryFacts]
bif:97 [in ITree.Basics.CategoryTheory]
BimapCat_bif:28 [in ITree.Basics.CategoryFacts]
BimapId_bif:27 [in ITree.Basics.CategoryFacts]
Bimap_bif:74 [in ITree.Basics.CategoryFacts]
Bimap_bif:26 [in ITree.Basics.CategoryFacts]
Bimap_bif:309 [in ITree.Basics.CategoryTheory]
Bimap_bif:235 [in ITree.Basics.CategoryTheory]
Bimap_bif:98 [in ITree.Basics.CategoryTheory]
Bimap_C:31 [in ITree.Basics.CategorySub]
body1:116 [in ITree.Extra.Secure.SecureEqBind]
body1:141 [in ITree.Extra.Secure.SecureEqBind]
body1:164 [in ITree.Extra.Secure.SecureEqBind]
body1:17 [in ITree.Core.KTreeFacts]
body1:290 [in ITree.Extra.Secure.SecureEqProgInsens]
body1:313 [in ITree.Extra.Secure.SecureEqProgInsens]
body1:32 [in ITree.Core.KTreeFacts]
body1:49 [in ITree.Core.KTreeFacts]
body1:91 [in ITree.Extra.Secure.SecureEqBind]
body2:117 [in ITree.Extra.Secure.SecureEqBind]
body2:142 [in ITree.Extra.Secure.SecureEqBind]
body2:165 [in ITree.Extra.Secure.SecureEqBind]
body2:18 [in ITree.Core.KTreeFacts]
body2:291 [in ITree.Extra.Secure.SecureEqProgInsens]
body2:314 [in ITree.Extra.Secure.SecureEqProgInsens]
body2:33 [in ITree.Core.KTreeFacts]
body2:50 [in ITree.Core.KTreeFacts]
body2:92 [in ITree.Extra.Secure.SecureEqBind]
body:144 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:153 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:164 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:170 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:189 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
body:19 [in ITree.Events.FailFacts]
body:21 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
body:47 [in ITree.Interp.Recursion]
body:56 [in ITree.Interp.Recursion]
body:67 [in ITree.Props.HasPost]
body:93 [in ITree.Events.ExceptionFacts]
br:11 [in ITree.Extra.ITrace.ITracePrefix]
br:29 [in ITree.Extra.ITrace.ITracePrefix]
br:9 [in ITree.Extra.ITrace.ITracePrefix]
bs:10 [in ITree.Extra.ITrace.ITracePrefix]
bs:14 [in ITree.Extra.ITrace.ITracePrefix]
bs:30 [in ITree.Extra.ITrace.ITracePrefix]
B':113 [in ITree.Events.StateFacts]
b':126 [in ITree.Extra.ITrace.ITraceBind]
b':135 [in ITree.Extra.ITrace.ITraceBind]
b':164 [in ITree.Basics.CategoryFacts]
b':237 [in ITree.Extra.ITrace.ITraceFacts]
b':290 [in ITree.Basics.CategoryFacts]
b':328 [in ITree.Extra.ITrace.ITraceBind]
b':369 [in ITree.Basics.CategoryFacts]
b':66 [in ITree.Extra.Dijkstra.TracesIT]
b':68 [in ITree.Basics.CategoryRelations]
b':79 [in ITree.Basics.CategoryRelations]
b':81 [in ITree.Extra.ITrace.ITraceBind]
b1':145 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1':145 [in ITree.Extra.Secure.SecureEqHalt]
b1':185 [in ITree.Eq.Eqit]
b1':196 [in ITree.Eq.Eqit]
b1:1 [in ITree.Extra.Secure.SecureEqWcompat]
b1:105 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:105 [in ITree.Extra.Secure.SecureEqHalt]
B1:105 [in ITree.Extra.Secure.SecureEqBind]
b1:105 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:106 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:106 [in ITree.Basics.CategoryKleisliFacts]
b1:106 [in ITree.Basics.CategoryTheory]
b1:109 [in ITree.Extra.ITrace.ITracePrefix]
b1:110 [in ITree.Extra.Secure.SecureEqBind]
b1:110 [in ITree.Extra.Secure.SecureEqWcompat]
b1:111 [in ITree.Eq.Eqit]
b1:112 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:112 [in ITree.Extra.Secure.SecureEqHalt]
b1:113 [in ITree.Props.Leaf]
b1:113 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:117 [in ITree.Extra.ITrace.ITracePrefix]
b1:118 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:123 [in ITree.Extra.ITrace.ITracePrefix]
b1:124 [in ITree.Eq.Eqit]
b1:125 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:125 [in ITree.Extra.Secure.SecureEqHalt]
b1:13 [in ITree.Extra.Secure.SecureEqWcompat]
b1:130 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:130 [in ITree.Extra.Secure.SecureEqHalt]
B1:130 [in ITree.Extra.Secure.SecureEqBind]
b1:131 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:132 [in ITree.Props.Leaf]
b1:133 [in ITree.Extra.ITrace.ITracePrefix]
b1:135 [in ITree.Extra.Secure.SecureEqBind]
b1:139 [in ITree.Eq.Eqit]
b1:140 [in ITree.Extra.ITrace.ITracePrefix]
b1:143 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:143 [in ITree.Extra.Secure.SecureEqHalt]
b1:145 [in ITree.Extra.ITrace.ITracePrefix]
b1:15 [in ITree.Extra.Secure.SecureStateHandler]
b1:15 [in ITree.Extra.Secure.SecureStateHandlerPi]
b1:151 [in ITree.Extra.ITrace.ITracePrefix]
B1:155 [in ITree.Extra.Secure.SecureEqBind]
b1:157 [in ITree.Extra.ITrace.ITracePrefix]
b1:159 [in ITree.Extra.Secure.SecureEqBind]
b1:163 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:163 [in ITree.Extra.ITrace.ITracePrefix]
b1:163 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:166 [in ITree.Eq.Eqit]
b1:167 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:167 [in ITree.Extra.Secure.SecureEqHalt]
b1:168 [in ITree.Extra.ITrace.ITracePrefix]
b1:169 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:169 [in ITree.Extra.Secure.SecureEqHalt]
b1:174 [in ITree.Extra.Secure.SecureEqBind]
b1:174 [in ITree.Eq.Eqit]
b1:177 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:177 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:177 [in ITree.Extra.Secure.SecureEqHalt]
b1:178 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:183 [in ITree.Eq.Eqit]
b1:189 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:189 [in ITree.Extra.Secure.SecureEqHalt]
b1:191 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:194 [in ITree.Eq.Eqit]
b1:209 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:218 [in ITree.Basics.HeterogeneousRelations]
b1:218 [in ITree.Eq.Eqit]
b1:220 [in ITree.Eq.Eqit]
b1:225 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:226 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:228 [in ITree.Eq.Eqit]
b1:233 [in ITree.Eq.Eqit]
b1:235 [in ITree.Eq.Eqit]
b1:237 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:239 [in ITree.Eq.Eqit]
b1:241 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:246 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:247 [in ITree.Eq.Eqit]
b1:252 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:252 [in ITree.Eq.Eqit]
b1:254 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:257 [in ITree.Eq.Eqit]
b1:261 [in ITree.Eq.Eqit]
b1:263 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:266 [in ITree.Eq.Eqit]
b1:269 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:271 [in ITree.Eq.Eqit]
b1:276 [in ITree.Eq.Eqit]
B1:279 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:28 [in ITree.Extra.Secure.SecureEqBind]
b1:280 [in ITree.Eq.Eqit]
b1:283 [in ITree.Eq.Eqit]
b1:284 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:285 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:285 [in ITree.Eq.Eqit]
b1:287 [in ITree.Eq.Eqit]
B1:304 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:308 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:317 [in ITree.Eq.Eqit]
b1:319 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:325 [in ITree.Eq.Eqit]
B1:33 [in ITree.Basics.HeterogeneousRelations]
b1:33 [in ITree.Eq.Eqit]
b1:338 [in ITree.Eq.Eqit]
b1:34 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:34 [in ITree.Extra.ITrace.ITracePreds]
b1:348 [in ITree.Extra.IForest]
b1:349 [in ITree.Eq.Eqit]
b1:362 [in ITree.Extra.IForest]
b1:363 [in ITree.Eq.Eqit]
b1:371 [in ITree.Eq.Eqit]
b1:377 [in ITree.Extra.IForest]
b1:389 [in ITree.Extra.IForest]
b1:39 [in ITree.Extra.Secure.SecureEqWcompat]
b1:39 [in ITree.Eq.Eqit]
b1:397 [in ITree.Eq.Eqit]
b1:41 [in ITree.Basics.HeterogeneousRelations]
b1:434 [in ITree.Eq.Eqit]
b1:448 [in ITree.Eq.Eqit]
B1:45 [in ITree.Basics.HeterogeneousRelations]
b1:452 [in ITree.Eq.Eqit]
b1:473 [in ITree.Eq.Eqit]
b1:48 [in ITree.Extra.Secure.SecureEqBind]
b1:48 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:489 [in ITree.Eq.Eqit]
b1:51 [in ITree.Eq.Eqit]
b1:543 [in ITree.Eq.Eqit]
b1:55 [in ITree.Eq.Eqit]
b1:557 [in ITree.Eq.Eqit]
b1:57 [in ITree.Extra.Secure.SecureEqWcompat]
b1:61 [in ITree.Eq.Eqit]
b1:62 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:63 [in ITree.Extra.ITrace.ITracePrefix]
b1:638 [in ITree.Eq.Eqit]
b1:642 [in ITree.Eq.Eqit]
b1:651 [in ITree.Eq.Eqit]
b1:658 [in ITree.Eq.Eqit]
b1:662 [in ITree.Eq.Eqit]
b1:67 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:67 [in ITree.Extra.Secure.SecureEqBind]
b1:678 [in ITree.Eq.Eqit]
b1:68 [in ITree.Extra.ITrace.ITraceFacts]
b1:7 [in ITree.Eq.Eqit]
b1:709 [in ITree.Eq.Eqit]
b1:71 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:736 [in ITree.Eq.Eqit]
b1:74 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:74 [in ITree.Extra.ITrace.ITracePrefix]
b1:741 [in ITree.Eq.Eqit]
b1:749 [in ITree.Eq.Eqit]
b1:76 [in ITree.Extra.Secure.SecureEqWcompat]
b1:761 [in ITree.Eq.Eqit]
b1:8 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:8 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b1:8 [in ITree.Extra.Secure.SecureEqHalt]
b1:8 [in ITree.Extra.Secure.SecureEqBind]
B1:80 [in ITree.Extra.Secure.SecureEqBind]
b1:820 [in ITree.Eq.Eqit]
b1:83 [in ITree.Extra.Secure.SecureEqEuttHalt]
b1:84 [in ITree.Eq.Eqit]
b1:849 [in ITree.Eq.Eqit]
b1:85 [in ITree.Extra.Secure.SecureEqBind]
b1:87 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:885 [in ITree.Eq.Eqit]
b1:89 [in ITree.Extra.ITrace.ITracePreds]
b1:90 [in ITree.Extra.Secure.SecureEqWcompat]
b1:92 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:92 [in ITree.Extra.ITrace.ITracePrefix]
b1:92 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b1:95 [in ITree.Extra.Secure.SecureEqProgInsens]
b1:96 [in ITree.Props.Leaf]
b1:98 [in ITree.Basics.CategoryKleisliFacts]
b1:98 [in ITree.Extra.ITrace.ITracePrefix]
b1:98 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2':146 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2':146 [in ITree.Extra.Secure.SecureEqHalt]
b2':186 [in ITree.Eq.Eqit]
b2':197 [in ITree.Eq.Eqit]
B2:104 [in ITree.Extra.Secure.SecureEqBind]
b2:106 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:106 [in ITree.Extra.Secure.SecureEqHalt]
b2:106 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:107 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:107 [in ITree.Basics.CategoryKleisliFacts]
b2:107 [in ITree.Basics.CategoryTheory]
b2:110 [in ITree.Extra.ITrace.ITracePrefix]
b2:111 [in ITree.Extra.Secure.SecureEqBind]
b2:111 [in ITree.Extra.Secure.SecureEqWcompat]
b2:112 [in ITree.Eq.Eqit]
b2:113 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:113 [in ITree.Extra.Secure.SecureEqHalt]
b2:114 [in ITree.Props.Leaf]
b2:114 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:118 [in ITree.Extra.ITrace.ITracePrefix]
b2:119 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:124 [in ITree.Extra.ITrace.ITracePrefix]
b2:125 [in ITree.Eq.Eqit]
b2:126 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:126 [in ITree.Extra.Secure.SecureEqHalt]
B2:129 [in ITree.Extra.Secure.SecureEqBind]
b2:131 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:131 [in ITree.Extra.Secure.SecureEqHalt]
b2:132 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:133 [in ITree.Props.Leaf]
b2:134 [in ITree.Extra.ITrace.ITracePrefix]
b2:136 [in ITree.Extra.Secure.SecureEqBind]
b2:14 [in ITree.Extra.Secure.SecureEqWcompat]
b2:140 [in ITree.Eq.Eqit]
b2:141 [in ITree.Extra.ITrace.ITracePrefix]
b2:144 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:144 [in ITree.Extra.Secure.SecureEqHalt]
b2:146 [in ITree.Extra.ITrace.ITracePrefix]
b2:149 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:152 [in ITree.Extra.ITrace.ITracePrefix]
b2:154 [in ITree.Extra.Secure.SecureEqProgInsens]
B2:156 [in ITree.Extra.Secure.SecureEqBind]
b2:158 [in ITree.Extra.ITrace.ITracePrefix]
b2:16 [in ITree.Extra.Secure.SecureStateHandler]
b2:16 [in ITree.Extra.Secure.SecureStateHandlerPi]
b2:160 [in ITree.Extra.Secure.SecureEqBind]
b2:164 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:164 [in ITree.Extra.ITrace.ITracePrefix]
b2:167 [in ITree.Eq.Eqit]
b2:168 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:168 [in ITree.Extra.Secure.SecureEqHalt]
b2:169 [in ITree.Extra.ITrace.ITracePrefix]
b2:170 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:170 [in ITree.Extra.Secure.SecureEqHalt]
b2:175 [in ITree.Extra.Secure.SecureEqBind]
b2:175 [in ITree.Eq.Eqit]
b2:178 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:178 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:178 [in ITree.Extra.Secure.SecureEqHalt]
b2:179 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:184 [in ITree.Eq.Eqit]
b2:19 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:190 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:190 [in ITree.Extra.Secure.SecureEqHalt]
b2:192 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:193 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:195 [in ITree.Eq.Eqit]
b2:2 [in ITree.Extra.Secure.SecureEqWcompat]
b2:208 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:210 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:219 [in ITree.Basics.HeterogeneousRelations]
b2:219 [in ITree.Eq.Eqit]
b2:221 [in ITree.Eq.Eqit]
b2:226 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:227 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:229 [in ITree.Eq.Eqit]
b2:234 [in ITree.Eq.Eqit]
b2:236 [in ITree.Eq.Eqit]
b2:238 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:240 [in ITree.Eq.Eqit]
b2:242 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:247 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:248 [in ITree.Eq.Eqit]
b2:253 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:253 [in ITree.Eq.Eqit]
b2:255 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:258 [in ITree.Eq.Eqit]
b2:262 [in ITree.Eq.Eqit]
b2:264 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:267 [in ITree.Eq.Eqit]
b2:270 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:272 [in ITree.Eq.Eqit]
b2:277 [in ITree.Eq.Eqit]
B2:278 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:281 [in ITree.Eq.Eqit]
b2:284 [in ITree.Eq.Eqit]
b2:285 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:286 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:286 [in ITree.Eq.Eqit]
b2:288 [in ITree.Eq.Eqit]
b2:29 [in ITree.Extra.Secure.SecureEqBind]
B2:305 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:309 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:318 [in ITree.Eq.Eqit]
b2:320 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:326 [in ITree.Eq.Eqit]
b2:339 [in ITree.Eq.Eqit]
B2:34 [in ITree.Basics.HeterogeneousRelations]
b2:34 [in ITree.Eq.Eqit]
b2:349 [in ITree.Extra.IForest]
b2:35 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:35 [in ITree.Extra.ITrace.ITracePreds]
b2:356 [in ITree.Eq.Eqit]
b2:363 [in ITree.Extra.IForest]
b2:364 [in ITree.Eq.Eqit]
b2:372 [in ITree.Eq.Eqit]
b2:378 [in ITree.Extra.IForest]
b2:390 [in ITree.Extra.IForest]
b2:390 [in ITree.Eq.Eqit]
b2:40 [in ITree.Extra.Secure.SecureEqWcompat]
b2:40 [in ITree.Eq.Eqit]
b2:42 [in ITree.Basics.HeterogeneousRelations]
b2:435 [in ITree.Eq.Eqit]
b2:449 [in ITree.Eq.Eqit]
b2:453 [in ITree.Eq.Eqit]
B2:46 [in ITree.Basics.HeterogeneousRelations]
b2:474 [in ITree.Eq.Eqit]
b2:49 [in ITree.Extra.Secure.SecureEqBind]
b2:49 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:490 [in ITree.Eq.Eqit]
b2:52 [in ITree.Eq.Eqit]
b2:544 [in ITree.Eq.Eqit]
b2:558 [in ITree.Eq.Eqit]
b2:56 [in ITree.Eq.Eqit]
b2:58 [in ITree.Extra.ITrace.ITracePrefix]
b2:58 [in ITree.Extra.Secure.SecureEqWcompat]
b2:62 [in ITree.Eq.Eqit]
b2:63 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:639 [in ITree.Eq.Eqit]
b2:64 [in ITree.Extra.ITrace.ITracePrefix]
b2:643 [in ITree.Eq.Eqit]
b2:652 [in ITree.Eq.Eqit]
b2:659 [in ITree.Eq.Eqit]
b2:663 [in ITree.Eq.Eqit]
b2:679 [in ITree.Eq.Eqit]
b2:68 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:68 [in ITree.Extra.Secure.SecureEqBind]
b2:69 [in ITree.Extra.ITrace.ITraceFacts]
b2:710 [in ITree.Eq.Eqit]
b2:72 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:737 [in ITree.Eq.Eqit]
b2:742 [in ITree.Eq.Eqit]
b2:75 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:75 [in ITree.Extra.ITrace.ITracePrefix]
b2:750 [in ITree.Eq.Eqit]
b2:762 [in ITree.Eq.Eqit]
b2:77 [in ITree.Extra.Secure.SecureEqWcompat]
B2:79 [in ITree.Extra.Secure.SecureEqBind]
b2:79 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b2:8 [in ITree.Eq.Eqit]
b2:821 [in ITree.Eq.Eqit]
b2:84 [in ITree.Extra.Secure.SecureEqEuttHalt]
b2:85 [in ITree.Eq.Eqit]
b2:850 [in ITree.Eq.Eqit]
b2:86 [in ITree.Extra.Secure.SecureEqBind]
b2:88 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:886 [in ITree.Eq.Eqit]
b2:9 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:9 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b2:9 [in ITree.Extra.Secure.SecureEqHalt]
b2:9 [in ITree.Extra.Secure.SecureEqBind]
b2:90 [in ITree.Extra.ITrace.ITracePreds]
b2:91 [in ITree.Extra.Secure.SecureEqWcompat]
b2:93 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:93 [in ITree.Extra.ITrace.ITracePrefix]
b2:96 [in ITree.Extra.Secure.SecureEqProgInsens]
b2:97 [in ITree.Props.Leaf]
b2:99 [in ITree.Basics.CategoryKleisliFacts]
b2:99 [in ITree.Extra.ITrace.ITracePrefix]
b2:99 [in ITree.Extra.Secure.SecureEqEuttHalt]
b3:120 [in ITree.Extra.Secure.SecureEqProgInsens]
b3:147 [in ITree.Extra.ITrace.ITracePrefix]
b3:191 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b3:191 [in ITree.Extra.Secure.SecureEqHalt]
b4:121 [in ITree.Extra.Secure.SecureEqProgInsens]
b4:192 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b4:192 [in ITree.Extra.Secure.SecureEqHalt]
b:10 [in ITree.Basics.Tacs]
b:10 [in ITree.Extra.Dijkstra.TracesIT]
B:10 [in ITree.Axioms]
b:10 [in ITree.Basics.CategoryKleisli]
B:10 [in ITree.Props.EuttNoRet]
B:10 [in ITree.Basics.FunctionFacts]
b:10 [in ITree.Basics.HeterogeneousRelations]
b:10 [in ITree.Extra.ITrace.ITracePreds]
B:100 [in ITree.Simple]
b:101 [in ITree.Basics.CategoryRelations]
b:101 [in ITree.Basics.CategoryTheory]
B:103 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:103 [in ITree.Basics.CategoryFacts]
b:104 [in ITree.Extra.ITrace.ITraceBind]
B:104 [in ITree.Props.Finite]
b:104 [in ITree.Basics.CategoryRelations]
B:104 [in ITree.Simple]
b:105 [in ITree.Extra.ITrace.ITraceFacts]
b:106 [in ITree.Events.StateFacts]
B:106 [in ITree.Basics.HeterogeneousRelations]
b:107 [in ITree.Basics.CategoryOps]
b:107 [in ITree.Basics.CategoryRelations]
B:108 [in ITree.Extra.Dijkstra.StateDelaySpec]
b:108 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:108 [in ITree.Basics.Basics]
B:109 [in ITree.Basics.HeterogeneousRelations]
b:11 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b:11 [in ITree.Basics.CategorySub]
b:110 [in ITree.Basics.CategoryFacts]
B:110 [in ITree.Simple]
B:111 [in ITree.Core.KTreeFacts]
B:111 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:111 [in ITree.Extra.ITrace.ITracePrefix]
B:112 [in ITree.Events.StateFacts]
b:112 [in ITree.Basics.CategoryRelations]
b:113 [in ITree.Basics.CategoryOps]
b:114 [in ITree.Basics.CategoryKleisliFacts]
B:114 [in ITree.Basics.Basics]
b:115 [in ITree.Basics.CategoryOps]
B:115 [in ITree.Eq.Rutt]
B:115 [in ITree.Basics.HeterogeneousRelations]
B:116 [in ITree.Props.Finite]
b:117 [in ITree.Basics.Basics]
b:117 [in ITree.Basics.CategoryFacts]
b:118 [in ITree.Basics.CategoryOps]
B:118 [in ITree.Eq.Rutt]
b:119 [in ITree.Extra.ITrace.ITracePrefix]
b:119 [in ITree.Basics.CategoryTheory]
B:12 [in ITree.Basics.HeterogeneousRelations]
b:120 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:120 [in ITree.Extra.Secure.SecureStateHandler]
b:121 [in ITree.Core.KTreeFacts]
B:121 [in ITree.Interp.InterpFacts]
b:124 [in ITree.Basics.CategoryFacts]
b:125 [in ITree.Extra.ITrace.ITraceBind]
b:125 [in ITree.Extra.ITrace.ITracePrefix]
B:125 [in ITree.Basics.HeterogeneousRelations]
B:126 [in ITree.Eq.Rutt]
b:126 [in ITree.Basics.CategoryFacts]
B:127 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:127 [in ITree.Basics.HeterogeneousRelations]
b:129 [in ITree.Events.StateFacts]
B:129 [in ITree.Eq.Rutt]
B:129 [in ITree.Interp.InterpFacts]
B:129 [in ITree.Basics.HeterogeneousRelations]
b:13 [in ITree.Eq.EuttExtras]
b:13 [in ITree.Basics.CategoryKleisliFacts]
B:13 [in ITree.Props.EuttNoRet]
B:13 [in ITree.Indexed.Relation]
b:13 [in ITree.Basics.FunctionFacts]
b:13 [in ITree.Basics.CategoryFacts]
b:13 [in ITree.Basics.CategoryTheory]
b:130 [in ITree.Extra.ITrace.ITraceFacts]
b:130 [in ITree.Basics.CategoryFacts]
b:131 [in ITree.Extra.Secure.SecureEqProgInsens]
B:131 [in ITree.Extra.Secure.SecureStateHandler]
B:131 [in ITree.Basics.HeterogeneousRelations]
B:133 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:133 [in ITree.Basics.HeterogeneousRelations]
b:134 [in ITree.Extra.ITrace.ITraceBind]
B:134 [in ITree.Events.StateFacts]
b:134 [in ITree.Basics.CategoryTheory]
b:135 [in ITree.Basics.CategoryOps]
b:135 [in ITree.Basics.CategoryFacts]
B:135 [in ITree.Basics.HeterogeneousRelations]
b:136 [in ITree.Extra.ITrace.ITraceFacts]
B:138 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:138 [in ITree.Extra.Secure.SecureStateHandler]
B:138 [in ITree.Basics.HeterogeneousRelations]
B:14 [in ITree.Basics.Function]
B:14 [in ITree.Extra.IForest]
b:14 [in ITree.Basics.CategoryOps]
B:14 [in ITree.Interp.HandlerFacts]
b:140 [in ITree.Extra.Secure.SecureEqProgInsens]
b:140 [in ITree.Extra.ITrace.ITraceFacts]
b:140 [in ITree.Basics.CategoryFacts]
b:141 [in ITree.Extra.ITrace.ITraceBind]
b:141 [in ITree.Basics.CategoryOps]
B:141 [in ITree.Basics.HeterogeneousRelations]
b:141 [in ITree.Basics.CategoryTheory]
b:142 [in ITree.Basics.CategoryFacts]
b:143 [in ITree.Basics.CategoryOps]
B:143 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:143 [in ITree.Extra.ITrace.ITraceFacts]
b:144 [in ITree.Events.StateFacts]
b:144 [in ITree.Basics.CategoryFacts]
b:146 [in ITree.Basics.CategoryOps]
b:147 [in ITree.Extra.ITrace.ITraceBind]
B:148 [in ITree.Basics.HeterogeneousRelations]
b:148 [in ITree.Basics.CategoryTheory]
b:149 [in ITree.Events.StateFacts]
B:149 [in ITree.Eq.Rutt]
b:15 [in ITree.Basics.CategoryKleisli]
B:15 [in ITree.Extra.Dijkstra.ITreeDijkstra]
b:150 [in ITree.Extra.ITrace.ITraceFacts]
b:150 [in ITree.Basics.CategoryFacts]
b:151 [in ITree.Extra.ITrace.ITraceFacts]
B:152 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:152 [in ITree.Eq.Rutt]
b:154 [in ITree.Eq.UpToTaus]
b:156 [in ITree.Basics.CategoryFacts]
b:157 [in ITree.Eq.UpToTaus]
B:158 [in ITree.Extra.Secure.SecureStateHandler]
B:158 [in ITree.Eq.Eqit]
b:159 [in ITree.Extra.ITrace.ITraceFacts]
b:159 [in ITree.Basics.CategoryTheory]
B:16 [in ITree.Eq.EuttExtras]
B:16 [in ITree.Basics.Monad]
b:16 [in ITree.Basics.CategoryKleisliFacts]
b:16 [in ITree.Basics.MonadState]
B:16 [in ITree.Basics.FunctionFacts]
b:161 [in ITree.Basics.CategoryOps]
B:162 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:163 [in ITree.Basics.CategoryFacts]
B:164 [in ITree.Basics.HeterogeneousRelations]
b:165 [in ITree.Basics.CategoryOps]
B:169 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:169 [in ITree.Basics.HeterogeneousRelations]
b:17 [in ITree.Extra.IForest]
b:17 [in ITree.Axioms]
b:17 [in ITree.Extra.ITrace.ITraceFacts]
b:17 [in ITree.Basics.CategoryFacts]
b:171 [in ITree.Basics.CategoryFacts]
B:171 [in ITree.Basics.HeterogeneousRelations]
b:172 [in ITree.Basics.CategoryOps]
b:173 [in ITree.Basics.CategoryTheory]
b:174 [in ITree.Basics.CategoryFacts]
B:174 [in ITree.Basics.HeterogeneousRelations]
B:176 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:177 [in ITree.Basics.CategoryFacts]
B:178 [in ITree.Basics.HeterogeneousRelations]
b:179 [in ITree.Basics.CategoryOps]
B:18 [in ITree.Props.EuttNoRet]
B:18 [in ITree.Basics.HeterogeneousRelations]
b:18 [in ITree.Basics.CategoryTheory]
b:180 [in ITree.Basics.CategoryFacts]
b:180 [in ITree.Basics.CategoryTheory]
b:183 [in ITree.Basics.CategoryFacts]
B:183 [in ITree.Basics.HeterogeneousRelations]
B:184 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:184 [in ITree.Extra.ITrace.ITraceFacts]
b:187 [in ITree.Basics.CategoryFacts]
b:187 [in ITree.Basics.CategoryTheory]
b:188 [in ITree.Basics.CategoryOps]
B:188 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:189 [in ITree.Extra.ITrace.ITraceFacts]
b:189 [in ITree.Basics.CategoryFacts]
b:19 [in ITree.Basics.CategoryKleisliFacts]
b:19 [in ITree.Basics.CategoryFunctor]
b:19 [in ITree.Basics.CategoryRelations]
b:192 [in ITree.Basics.CategoryFacts]
b:193 [in ITree.Extra.ITrace.ITraceFacts]
b:195 [in ITree.Extra.ITrace.ITraceBind]
B:197 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:197 [in ITree.Extra.ITrace.ITraceFacts]
b:198 [in ITree.Basics.CategoryTheory]
b:199 [in ITree.Props.Finite]
B:2 [in ITree.Basics.Function]
B:2 [in ITree.Axioms]
B:2 [in ITree.Interp.Handler]
B:2 [in ITree.Interp.HandlerFacts]
B:2 [in ITree.Indexed.Relation]
B:2 [in ITree.Basics.FunctionFacts]
B:2 [in ITree.Basics.HeterogeneousRelations]
b:20 [in ITree.Axioms]
B:20 [in ITree.Extra.Dijkstra.DijkstraMonad]
b:20 [in ITree.Basics.MonadState]
B:20 [in ITree.Eq.Rutt]
B:20 [in ITree.Extra.Dijkstra.StateIOTrace]
b:20 [in ITree.Extra.ITrace.ITracePreds]
b:20 [in ITree.Basics.CategorySub]
b:200 [in ITree.Basics.CategoryOps]
B:202 [in ITree.Basics.HeterogeneousRelations]
B:204 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:204 [in ITree.Basics.CategoryFacts]
b:205 [in ITree.Extra.ITrace.ITraceFacts]
b:206 [in ITree.Extra.ITrace.ITraceBind]
b:206 [in ITree.Basics.CategoryOps]
b:207 [in ITree.Props.Finite]
B:21 [in ITree.Indexed.Relation]
b:210 [in ITree.Basics.CategoryFacts]
b:211 [in ITree.Basics.CategoryOps]
B:212 [in ITree.Basics.HeterogeneousRelations]
b:213 [in ITree.Extra.ITrace.ITraceFacts]
B:214 [in ITree.Basics.HeterogeneousRelations]
b:215 [in ITree.Basics.CategoryOps]
b:217 [in ITree.Basics.CategoryTheory]
b:218 [in ITree.Extra.ITrace.ITraceFacts]
b:219 [in ITree.Basics.CategoryFacts]
B:22 [in ITree.Basics.Function]
b:22 [in ITree.Basics.CategoryKleisliFacts]
B:22 [in ITree.Basics.HeterogeneousRelations]
B:22 [in ITree.Extra.Dijkstra.DelaySpecMonad]
B:221 [in ITree.Basics.HeterogeneousRelations]
b:222 [in ITree.Extra.ITrace.ITraceFacts]
b:223 [in ITree.Extra.ITrace.ITraceBind]
B:225 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:226 [in ITree.Basics.CategoryTheory]
B:228 [in ITree.Basics.HeterogeneousRelations]
B:229 [in ITree.Extra.ITrace.ITraceFacts]
b:23 [in ITree.Props.EuttNoRet]
b:230 [in ITree.Basics.CategoryFacts]
b:231 [in ITree.Extra.ITrace.ITraceFacts]
b:233 [in ITree.Extra.ITrace.ITraceBind]
B:235 [in ITree.Basics.HeterogeneousRelations]
b:237 [in ITree.Basics.CategoryFacts]
B:237 [in ITree.Simple]
b:239 [in ITree.Basics.CategoryTheory]
B:24 [in ITree.Interp.Recursion]
b:24 [in ITree.Extra.ITrace.ITraceDefinition]
b:24 [in ITree.Basics.MonadState]
b:24 [in ITree.Basics.CategorySub]
B:241 [in ITree.Simple]
b:243 [in ITree.Basics.CategoryTheory]
b:244 [in ITree.Basics.CategoryFacts]
B:245 [in ITree.Basics.HeterogeneousRelations]
B:246 [in ITree.Simple]
b:247 [in ITree.Basics.CategoryTheory]
B:249 [in ITree.Basics.HeterogeneousRelations]
B:25 [in ITree.Extra.Dijkstra.TracesIT]
B:25 [in ITree.Basics.Monad]
b:25 [in ITree.Basics.CategoryKleisliFacts]
b:25 [in ITree.Basics.CategoryFunctor]
b:25 [in ITree.Props.EuttNoRet]
B:25 [in ITree.Basics.CategoryRelations]
b:250 [in ITree.Eq.Eqit]
b:251 [in ITree.Basics.CategoryFacts]
b:252 [in ITree.Extra.ITrace.ITraceBind]
b:253 [in ITree.Extra.ITrace.ITraceBind]
b:253 [in ITree.Basics.CategoryFacts]
B:255 [in ITree.Basics.HeterogeneousRelations]
b:255 [in ITree.Eq.Eqit]
b:256 [in ITree.Basics.CategoryTheory]
b:257 [in ITree.Basics.CategoryFacts]
B:26 [in ITree.Basics.CategoryOps]
b:26 [in ITree.Basics.CategoryKleisli]
b:26 [in ITree.Props.Leaf]
B:26 [in ITree.Indexed.Function]
b:26 [in ITree.Eq.Rutt]
B:26 [in ITree.Extra.Dijkstra.StateIOTrace]
b:261 [in ITree.Basics.CategoryTheory]
b:262 [in ITree.Basics.CategoryFacts]
b:263 [in ITree.Eq.Eqit]
b:267 [in ITree.Basics.CategoryFacts]
B:267 [in ITree.Basics.HeterogeneousRelations]
b:269 [in ITree.Basics.CategoryFacts]
b:269 [in ITree.Eq.Eqit]
b:27 [in ITree.Extra.ITrace.ITraceBind]
B:27 [in ITree.Extra.ITrace.ITraceDefinition]
B:27 [in ITree.Indexed.Relation]
B:27 [in ITree.Basics.HeterogeneousRelations]
b:271 [in ITree.Basics.CategoryFacts]
b:274 [in ITree.Eq.Eqit]
b:276 [in ITree.Basics.CategoryTheory]
b:277 [in ITree.Basics.CategoryFacts]
B:277 [in ITree.Basics.HeterogeneousRelations]
B:279 [in ITree.Basics.HeterogeneousRelations]
B:28 [in ITree.Interp.Recursion]
B:28 [in ITree.Basics.CategoryKleisliFacts]
B:28 [in ITree.Props.EuttNoRet]
b:28 [in ITree.Basics.MonadState]
B:28 [in ITree.Extra.Dijkstra.StateSpecT]
b:280 [in ITree.Basics.CategoryTheory]
b:282 [in ITree.Eq.Eqit]
b:283 [in ITree.Basics.CategoryFacts]
b:284 [in ITree.Extra.IForest]
b:289 [in ITree.Extra.IForest]
b:289 [in ITree.Basics.CategoryFacts]
B:289 [in ITree.Basics.HeterogeneousRelations]
B:29 [in ITree.Basics.Function]
B:29 [in ITree.Extra.Dijkstra.DelaySpecMonad]
b:29 [in ITree.Basics.CategorySub]
b:291 [in ITree.Extra.ITrace.ITraceBind]
B:293 [in ITree.Basics.HeterogeneousRelations]
B:294 [in ITree.Extra.ITrace.ITraceBind]
b:295 [in ITree.Basics.CategoryTheory]
B:298 [in ITree.Extra.ITrace.ITraceBind]
b:298 [in ITree.Basics.CategoryFacts]
b:299 [in ITree.Basics.CategoryTheory]
B:3 [in ITree.Core.KTreeFacts]
b:3 [in ITree.Basics.CategoryKleisli]
B:3 [in ITree.Props.EuttNoRet]
B:3 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
B:3 [in ITree.Extra.Dijkstra.PureITreeBasics]
b:30 [in ITree.Extra.Dijkstra.TracesIT]
b:30 [in ITree.Extra.ITrace.ITraceFacts]
b:30 [in ITree.Basics.CategoryFacts]
b:30 [in ITree.Basics.CategoryTheory]
b:301 [in ITree.Basics.CategoryFacts]
b:303 [in ITree.Basics.HeterogeneousRelations]
b:304 [in ITree.Basics.CategoryFacts]
b:305 [in ITree.Extra.ITrace.ITraceBind]
b:307 [in ITree.Basics.CategoryFacts]
b:309 [in ITree.Basics.HeterogeneousRelations]
B:31 [in ITree.Basics.CategoryKleisliFacts]
b:31 [in ITree.Basics.CategoryFunctor]
b:31 [in ITree.Props.Leaf]
b:310 [in ITree.Basics.CategoryFacts]
b:312 [in ITree.Extra.ITrace.ITraceBind]
b:312 [in ITree.Basics.CategoryTheory]
b:314 [in ITree.Basics.CategoryFacts]
b:315 [in ITree.Basics.CategoryTheory]
b:316 [in ITree.Basics.CategoryFacts]
b:319 [in ITree.Basics.CategoryFacts]
b:32 [in ITree.Basics.CategoryOps]
b:32 [in ITree.Basics.MonadState]
b:32 [in ITree.Extra.Secure.SecureEqWcompat]
B:32 [in ITree.Basics.CategoryRelations]
b:325 [in ITree.Extra.ITrace.ITraceBind]
b:328 [in ITree.Basics.CategoryTheory]
b:329 [in ITree.Extra.Secure.SecureEqEuttHalt]
B:33 [in ITree.Extra.ITrace.ITraceBind]
B:33 [in ITree.Basics.Monad]
B:33 [in ITree.Interp.Recursion]
B:33 [in ITree.Indexed.Relation]
b:331 [in ITree.Basics.CategoryFacts]
b:333 [in ITree.Extra.ITrace.ITraceBind]
b:337 [in ITree.Basics.CategoryFacts]
b:338 [in ITree.Extra.Secure.SecureEqEuttHalt]
b:338 [in ITree.Basics.CategoryTheory]
B:34 [in ITree.Extra.Dijkstra.TracesIT]
B:34 [in ITree.Extra.IForest]
b:34 [in ITree.Events.ExceptionFacts]
B:34 [in ITree.Props.EuttNoRet]
b:34 [in ITree.Extra.Secure.SecureEqWcompat]
B:34 [in ITree.Interp.RecursionFacts]
b:344 [in ITree.Extra.Secure.SecureEqEuttHalt]
b:346 [in ITree.Basics.CategoryFacts]
B:35 [in ITree.Basics.Function]
b:35 [in ITree.Basics.CategoryKleisli]
b:35 [in ITree.Props.Leaf]
B:35 [in ITree.Extra.Dijkstra.StateSpecT]
b:35 [in ITree.Basics.CategoryFacts]
b:353 [in ITree.Basics.CategoryTheory]
b:358 [in ITree.Basics.CategoryTheory]
b:359 [in ITree.Basics.CategoryFacts]
b:36 [in ITree.Basics.Function]
B:36 [in ITree.Basics.CategoryKleisliFacts]
B:36 [in ITree.Extra.Secure.SecureStateHandlerPi]
b:363 [in ITree.Basics.CategoryFacts]
b:365 [in ITree.Basics.CategoryTheory]
b:368 [in ITree.Basics.CategoryFacts]
B:37 [in ITree.Props.Infinite]
b:37 [in ITree.Basics.MonadState]
b:372 [in ITree.Basics.CategoryTheory]
b:374 [in ITree.Basics.CategoryFacts]
b:38 [in ITree.Basics.CategoryOps]
B:38 [in ITree.Extra.ITrace.ITraceDefinition]
B:38 [in ITree.Interp.RecursionFacts]
b:381 [in ITree.Basics.CategoryTheory]
b:383 [in ITree.Basics.CategoryFacts]
b:384 [in ITree.Basics.CategoryTheory]
b:386 [in ITree.Basics.CategoryFacts]
b:39 [in ITree.Extra.Dijkstra.TracesIT]
B:39 [in ITree.Interp.Recursion]
B:39 [in ITree.Props.EuttNoRet]
B:39 [in ITree.Indexed.Relation]
b:391 [in ITree.Basics.CategoryFacts]
b:399 [in ITree.Basics.CategoryFacts]
b:4 [in ITree.Basics.Tacs]
B:4 [in ITree.Basics.Function]
B:4 [in ITree.Basics.FunctionFacts]
B:4 [in ITree.Basics.HeterogeneousRelations]
B:40 [in ITree.Basics.Function]
B:40 [in ITree.Extra.IForest]
b:40 [in ITree.Props.Infinite]
b:40 [in ITree.Extra.ITrace.ITraceFacts]
b:406 [in ITree.Basics.CategoryFacts]
b:41 [in ITree.Props.Leaf]
b:41 [in ITree.Basics.MonadState]
B:41 [in ITree.Extra.Dijkstra.StateSpecT]
b:411 [in ITree.Basics.CategoryFacts]
B:413 [in ITree.Extra.IForest]
b:415 [in ITree.Extra.IForest]
b:416 [in ITree.Basics.CategoryFacts]
B:42 [in ITree.Extra.IForest]
B:42 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:42 [in ITree.Basics.CategorySub]
B:42 [in ITree.Extra.Secure.SecureStateHandlerPi]
B:422 [in ITree.Extra.IForest]
b:422 [in ITree.Basics.CategoryFacts]
b:426 [in ITree.Extra.IForest]
b:428 [in ITree.Basics.CategoryFacts]
b:43 [in ITree.Basics.CategoryOps]
B:43 [in ITree.Basics.CategoryKleisliFacts]
b:43 [in ITree.Basics.CategoryFunctor]
B:43 [in ITree.Extra.Dijkstra.DelaySpecMonad]
B:43 [in ITree.Interp.RecursionFacts]
B:430 [in ITree.Extra.IForest]
b:431 [in ITree.Basics.CategoryFacts]
b:433 [in ITree.Extra.IForest]
b:434 [in ITree.Basics.CategoryFacts]
B:437 [in ITree.Extra.IForest]
B:44 [in ITree.Extra.Secure.SecureEqProgInsens]
b:44 [in ITree.Basics.MonadState]
b:441 [in ITree.Extra.IForest]
B:445 [in ITree.Extra.IForest]
b:448 [in ITree.Extra.IForest]
B:45 [in ITree.Indexed.Relation]
b:45 [in ITree.Extra.Dijkstra.StateSpecT]
b:45 [in ITree.Extra.ITrace.ITraceFacts]
b:457 [in ITree.Eq.Eqit]
B:46 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
B:46 [in ITree.Extra.Secure.SecureEqHalt]
B:46 [in ITree.Interp.Recursion]
b:46 [in ITree.Basics.CategorySub]
B:460 [in ITree.Extra.IForest]
b:460 [in ITree.Eq.Eqit]
b:465 [in ITree.Extra.IForest]
b:47 [in ITree.Extra.Dijkstra.TracesIT]
b:47 [in ITree.Basics.CategoryOps]
b:47 [in ITree.Extra.ITrace.ITraceDefinition]
b:475 [in ITree.Extra.IForest]
B:48 [in ITree.Extra.Dijkstra.StateSpecT]
b:48 [in ITree.Basics.CategoryFacts]
B:48 [in ITree.Extra.Dijkstra.DelaySpecMonad]
b:48 [in ITree.Basics.CategorySub]
b:481 [in ITree.Extra.IForest]
b:486 [in ITree.Extra.IForest]
b:49 [in ITree.Extra.Dijkstra.TracesIT]
B:49 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:49 [in ITree.Props.EuttNoRet]
b:49 [in ITree.Basics.MonadState]
b:49 [in ITree.Eq.Paco2]
b:5 [in ITree.Basics.CategoryOps]
B:5 [in ITree.Interp.HandlerFacts]
b:5 [in ITree.Basics.MonadProp]
B:50 [in ITree.Basics.CategoryKleisliFacts]
B:50 [in ITree.Indexed.Relation]
b:50 [in ITree.Extra.ITrace.ITraceFacts]
b:50 [in ITree.Basics.CategorySub]
B:50 [in ITree.Extra.Secure.SecureStateHandlerPi]
b:51 [in ITree.Extra.Dijkstra.TracesIT]
B:51 [in ITree.Extra.IForest]
b:51 [in ITree.Basics.CategoryOps]
B:51 [in ITree.Interp.Recursion]
B:51 [in ITree.Props.Leaf]
b:51 [in ITree.Basics.CategoryTheory]
b:51 [in ITree.Extra.ITrace.ITracePreds]
b:514 [in ITree.Extra.IForest]
B:519 [in ITree.Extra.IForest]
b:52 [in ITree.Extra.Secure.SecureEqProgInsens]
b:52 [in ITree.Extra.ITrace.ITraceBind]
B:52 [in ITree.Extra.Dijkstra.DelaySpecMonad]
b:52 [in ITree.Events.State]
b:52 [in ITree.Basics.CategorySub]
B:522 [in ITree.Extra.IForest]
b:53 [in ITree.Extra.Dijkstra.TracesIT]
B:53 [in ITree.Extra.IForest]
B:53 [in ITree.Extra.Dijkstra.DijkstraMonad]
b:53 [in ITree.Extra.ITrace.ITraceFacts]
B:533 [in ITree.Extra.IForest]
b:54 [in ITree.Basics.MonadState]
B:54 [in ITree.Extra.Dijkstra.StateSpecT]
B:541 [in ITree.Extra.IForest]
B:548 [in ITree.Extra.IForest]
b:55 [in ITree.Extra.Dijkstra.TracesIT]
B:55 [in ITree.Interp.Recursion]
b:55 [in ITree.Props.EuttNoRet]
b:55 [in ITree.Basics.CategoryRelations]
B:557 [in ITree.Extra.IForest]
b:56 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b:56 [in ITree.Extra.Secure.SecureEqHalt]
b:56 [in ITree.Basics.CategoryOps]
B:56 [in ITree.Basics.CategoryKleisliFacts]
b:56 [in ITree.Props.Leaf]
b:56 [in ITree.Props.EuttNoRet]
b:56 [in ITree.Basics.MonadState]
B:56 [in ITree.Extra.Secure.SecureStateHandler]
B:57 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:57 [in ITree.Basics.CategoryTheory]
b:57 [in ITree.Extra.Dijkstra.DelaySpecMonad]
b:57 [in ITree.Basics.CategorySub]
b:572 [in ITree.Extra.IForest]
b:58 [in ITree.Extra.ITrace.ITraceFacts]
B:59 [in ITree.Core.KTreeFacts]
b:59 [in ITree.Props.EuttNoRet]
B:59 [in ITree.Extra.Dijkstra.DelaySpecMonad]
b:6 [in ITree.Basics.Tacs]
b:6 [in ITree.Basics.CategoryKleisli]
B:6 [in ITree.Eq.Rutt]
B:6 [in ITree.Basics.FunctionFacts]
b:6 [in ITree.Basics.CategorySub]
b:60 [in ITree.Extra.Dijkstra.TracesIT]
b:60 [in ITree.Props.EuttNoRet]
b:60 [in ITree.Extra.ITrace.ITracePreds]
B:600 [in ITree.Extra.IForest]
B:61 [in ITree.Basics.CategoryKleisliFacts]
B:61 [in ITree.Basics.CategoryRelations]
b:615 [in ITree.Extra.IForest]
b:616 [in ITree.Extra.IForest]
b:619 [in ITree.Extra.IForest]
B:62 [in ITree.Extra.Dijkstra.TracesIT]
B:62 [in ITree.Extra.IForest]
b:62 [in ITree.Basics.MonadState]
b:623 [in ITree.Extra.IForest]
B:624 [in ITree.Eq.Eqit]
b:626 [in ITree.Extra.IForest]
B:63 [in ITree.Basics.CategoryKleisliFacts]
B:63 [in ITree.Props.Infinite]
b:63 [in ITree.Extra.Dijkstra.DelaySpecMonad]
b:632 [in ITree.Extra.IForest]
b:637 [in ITree.Extra.IForest]
b:64 [in ITree.Extra.ITrace.ITraceBind]
B:64 [in ITree.Extra.IForest]
B:64 [in ITree.Props.EuttNoRet]
B:64 [in ITree.Extra.Dijkstra.StateSpecT]
b:64 [in ITree.Basics.CategoryRelations]
b:65 [in ITree.Extra.Dijkstra.TracesIT]
B:65 [in ITree.Events.StateFacts]
B:65 [in ITree.Basics.CategoryKleisliFacts]
B:65 [in ITree.Props.Leaf]
b:65 [in ITree.Extra.ITrace.ITracePrefix]
B:65 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
B:65 [in ITree.Extra.Dijkstra.DelaySpecMonad]
B:66 [in ITree.Core.KTreeFacts]
b:66 [in ITree.Props.Infinite]
B:67 [in ITree.Basics.CategoryKleisliFacts]
b:68 [in ITree.Basics.MonadState]
b:68 [in ITree.Basics.CategoryFacts]
B:69 [in ITree.Core.KTreeFacts]
b:69 [in ITree.Props.Leaf]
B:69 [in ITree.Props.EuttNoRet]
b:69 [in ITree.Basics.CategoryTheory]
B:7 [in ITree.Extra.ITrace.ITraceBind]
B:7 [in ITree.Basics.Function]
B:7 [in ITree.Eq.EuttExtras]
b:7 [in ITree.Basics.CategoryKleisliFacts]
b:7 [in ITree.Basics.CategoryFunctor]
b:7 [in ITree.Props.EuttNoRet]
B:7 [in ITree.Basics.CategoryRelations]
b:70 [in ITree.Extra.ITrace.ITraceBind]
B:70 [in ITree.Extra.Dijkstra.DelaySpecMonad]
b:71 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
b:71 [in ITree.Basics.CategoryTheory]
B:72 [in ITree.Core.KTreeFacts]
B:72 [in ITree.Basics.CategoryRelations]
B:74 [in ITree.Extra.Dijkstra.StateSpecT]
B:75 [in ITree.Extra.IForest]
b:75 [in ITree.Basics.CategoryRelations]
B:76 [in ITree.Basics.CategoryKleisliFacts]
B:76 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:76 [in ITree.Extra.ITrace.ITracePrefix]
b:77 [in ITree.Basics.CategoryOps]
B:77 [in ITree.Core.KTreeFacts]
b:77 [in ITree.Extra.ITrace.ITraceFacts]
b:77 [in ITree.Basics.CategoryFacts]
b:78 [in ITree.Extra.ITrace.ITracePreds]
B:79 [in ITree.Basics.CategoryKleisliFacts]
b:79 [in ITree.Props.Leaf]
B:79 [in ITree.Props.EuttNoRet]
b:8 [in ITree.Basics.Tacs]
b:8 [in ITree.Extra.ITrace.ITracePrefix]
b:8 [in ITree.Events.Nondeterminism]
B:8 [in ITree.Interp.HandlerFacts]
b:8 [in ITree.Basics.CategoryTheory]
b:8 [in ITree.Basics.MonadProp]
b:8 [in ITree.Basics.CategorySub]
b:80 [in ITree.Extra.Dijkstra.TracesIT]
b:80 [in ITree.Extra.ITrace.ITraceBind]
B:80 [in ITree.Core.KTreeFacts]
B:80 [in ITree.Extra.Dijkstra.StateSpecT]
B:807 [in ITree.Eq.Eqit]
b:81 [in ITree.Extra.ITrace.ITracePrefix]
B:812 [in ITree.Eq.Eqit]
b:82 [in ITree.Basics.CategoryOps]
b:82 [in ITree.Basics.CategoryTheory]
b:82 [in ITree.Extra.ITrace.ITracePreds]
b:824 [in ITree.Eq.Eqit]
B:828 [in ITree.Eq.Eqit]
B:83 [in ITree.Basics.CategoryKleisliFacts]
B:83 [in ITree.Props.Finite]
b:83 [in ITree.Basics.CategoryFacts]
b:831 [in ITree.Eq.Eqit]
B:835 [in ITree.Eq.Eqit]
b:838 [in ITree.Eq.Eqit]
B:844 [in ITree.Eq.Eqit]
B:85 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:859 [in ITree.Eq.Eqit]
B:86 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b:86 [in ITree.Extra.Dijkstra.TracesIT]
b:86 [in ITree.Extra.ITrace.ITraceBind]
B:86 [in ITree.Extra.Secure.SecureEqHalt]
b:86 [in ITree.Basics.CategoryOps]
B:86 [in ITree.Basics.CategoryKleisliFacts]
b:86 [in ITree.Props.Leaf]
b:86 [in ITree.Basics.CategoryTheory]
B:87 [in ITree.Eq.Shallow]
B:870 [in ITree.Eq.Eqit]
B:882 [in ITree.Eq.Eqit]
b:89 [in ITree.Extra.Dijkstra.TracesIT]
B:89 [in ITree.Core.KTreeFacts]
B:89 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
B:894 [in ITree.Eq.Eqit]
b:9 [in ITree.Basics.CategoryKleisliFacts]
B:9 [in ITree.Eq.Rutt]
b:9 [in ITree.Basics.CategoryFacts]
b:9 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
B:9 [in ITree.Basics.CategoryRelations]
b:90 [in ITree.Basics.CategoryOps]
B:90 [in ITree.Basics.CategoryKleisliFacts]
B:90 [in ITree.Extra.Secure.SecureStateHandler]
B:902 [in ITree.Eq.Eqit]
b:91 [in ITree.Extra.Dijkstra.TracesIT]
b:91 [in ITree.Extra.ITrace.ITracePrefix]
B:92 [in ITree.Events.ExceptionFacts]
b:92 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:92 [in ITree.Extra.ITrace.ITraceFacts]
b:92 [in ITree.Basics.CategoryFacts]
b:94 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
b:94 [in ITree.Extra.Secure.SecureEqHalt]
B:94 [in ITree.Basics.CategoryKleisliFacts]
B:94 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
b:95 [in ITree.Extra.Dijkstra.TracesIT]
B:95 [in ITree.Props.Finite]
B:95 [in ITree.Extra.Secure.SecureStateHandler]
b:95 [in ITree.Basics.CategoryRelations]
B:96 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
B:96 [in ITree.Extra.Secure.SecureEqHalt]
b:97 [in ITree.Extra.ITrace.ITracePrefix]
B:98 [in ITree.Extra.Dijkstra.StateDelaySpec]
b:98 [in ITree.Extra.ITrace.ITraceFacts]
b:98 [in ITree.Basics.CategoryRelations]
B:99 [in ITree.Extra.ITrace.ITracePreds]

C

Case_bif:183 [in ITree.Basics.CategoryOps]
Case_C:352 [in ITree.Basics.CategoryFacts]
Case_C:98 [in ITree.Basics.CategoryFacts]
Case_C:347 [in ITree.Basics.CategoryTheory]
Case_C:129 [in ITree.Basics.CategoryTheory]
Case_C:34 [in ITree.Basics.CategorySub]
CatAssoc_C:11 [in ITree.Basics.CategoryFacts]
catch_body:20 [in ITree.Events.Exception]
CatC:49 [in ITree.Basics.CategoryTheory]
CatC:5 [in ITree.Basics.CategoryFacts]
CatC:5 [in ITree.Basics.CategoryTheory]
CatC:67 [in ITree.Basics.CategoryTheory]
CatC:79 [in ITree.Basics.CategoryTheory]
Category_C:350 [in ITree.Basics.CategoryFacts]
Category_C:223 [in ITree.Basics.CategoryFacts]
Category_C:96 [in ITree.Basics.CategoryFacts]
Category_C:72 [in ITree.Basics.CategoryFacts]
Category_C:54 [in ITree.Basics.CategorySub]
Category_C:44 [in ITree.Basics.CategorySub]
CatIdL_C:6 [in ITree.Basics.CategoryFacts]
Cat_C:182 [in ITree.Basics.CategoryOps]
Cat_C:129 [in ITree.Basics.CategoryOps]
Cat_C:101 [in ITree.Basics.CategoryOps]
Cat_C:349 [in ITree.Basics.CategoryFacts]
Cat_C:222 [in ITree.Basics.CategoryFacts]
Cat_C:95 [in ITree.Basics.CategoryFacts]
Cat_C:71 [in ITree.Basics.CategoryFacts]
Cat_C:51 [in ITree.Basics.CategoryFacts]
Cat_C:345 [in ITree.Basics.CategoryTheory]
Cat_C:307 [in ITree.Basics.CategoryTheory]
Cat_C:233 [in ITree.Basics.CategoryTheory]
Cat_C:205 [in ITree.Basics.CategoryTheory]
Cat_C:166 [in ITree.Basics.CategoryTheory]
Cat_C:127 [in ITree.Basics.CategoryTheory]
Cat_C:96 [in ITree.Basics.CategoryTheory]
Cat_C:15 [in ITree.Basics.CategorySub]
ca':121 [in ITree.Events.StateFacts]
ca:120 [in ITree.Events.StateFacts]
ca:133 [in ITree.Interp.InterpFacts]
ca:140 [in ITree.Events.StateFacts]
ca:233 [in ITree.Basics.CategoryFacts]
ca:240 [in ITree.Basics.CategoryFacts]
cb:234 [in ITree.Basics.CategoryFacts]
cb:241 [in ITree.Basics.CategoryFacts]
cb:95 [in ITree.Core.KTreeFacts]
cb:97 [in ITree.Core.KTreeFacts]
cd:108 [in ITree.Basics.CategoryFacts]
cd:115 [in ITree.Basics.CategoryFacts]
cd:122 [in ITree.Basics.CategoryFacts]
cd:208 [in ITree.Basics.CategoryFacts]
cd:214 [in ITree.Basics.CategoryFacts]
cd:335 [in ITree.Basics.CategoryFacts]
cd:341 [in ITree.Basics.CategoryFacts]
cd:396 [in ITree.Basics.CategoryFacts]
cd:402 [in ITree.Basics.CategoryFacts]
cd:439 [in ITree.Basics.CategoryFacts]
CHECK:21 [in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:21 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:21 [in ITree.Extra.Secure.SecureEqHalt]
CHECK:24 [in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:24 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:24 [in ITree.Extra.Secure.SecureEqHalt]
CHECK:27 [in ITree.Eq.Eqit]
CHECK:31 [in ITree.Eq.Eqit]
CHECK:57 [in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:61 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:61 [in ITree.Extra.Secure.SecureEqHalt]
CHECK:64 [in ITree.Extra.Secure.SecureEqProgInsens]
CHECK:69 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
CHECK:69 [in ITree.Extra.Secure.SecureEqHalt]
CIHH:133 [in ITree.Eq.UpToTaus]
CIHH:149 [in ITree.Eq.UpToTaus]
CIHL:130 [in ITree.Eq.UpToTaus]
CIHL:145 [in ITree.Eq.UpToTaus]
CIH:137 [in ITree.Extra.ITrace.ITraceFacts]
classicT:113 [in ITree.Extra.ITrace.ITraceFacts]
classicT:2 [in ITree.Extra.ITrace.ITraceBind]
CLOD:95 [in ITree.Eq.UpToTaus]
CLOL:92 [in ITree.Eq.UpToTaus]
CLOL:94 [in ITree.Eq.UpToTaus]
CLOR:104 [in ITree.Eq.UpToTaus]
CLOR:107 [in ITree.Eq.UpToTaus]
CLOV:93 [in ITree.Eq.UpToTaus]
clo:160 [in ITree.Eq.Eqit]
clo:26 [in ITree.Eq.Paco2]
clo:57 [in ITree.Eq.UpToTaus]
CMP:117 [in ITree.Props.Leaf]
CMP:232 [in ITree.Eq.Eqit]
CMP:243 [in ITree.Eq.Eqit]
CMP:366 [in ITree.Extra.IForest]
CMP:682 [in ITree.Eq.Eqit]
CM:14 [in ITree.Basics.MonadState]
COMP:90 [in ITree.Eq.UpToTaus]
Coproduct_C:96 [in ITree.Basics.CategoryOps]
Coproduct_C:355 [in ITree.Basics.CategoryFacts]
Coproduct_C:101 [in ITree.Basics.CategoryFacts]
Coproduct_C:55 [in ITree.Basics.CategorySub]
ctx:120 [in ITree.Simple]
ctx:126 [in ITree.Simple]
ctx:17 [in ITree.Interp.Recursion]
ctx:255 [in ITree.Simple]
ctx:260 [in ITree.Simple]
ctx:3 [in ITree.Interp.Recursion]
ctx:3 [in ITree.Interp.RecursionFacts]
ctx:51 [in ITree.Interp.RecursionFacts]
ctx:9 [in ITree.Interp.Recursion]
Curry_C:214 [in ITree.Basics.CategoryTheory]
c':292 [in ITree.Basics.CategoryFacts]
c':376 [in ITree.Basics.CategoryFacts]
c':67 [in ITree.Basics.CategoryRelations]
c':78 [in ITree.Basics.CategoryRelations]
c1:100 [in ITree.Basics.CategoryKleisliFacts]
c1:108 [in ITree.Basics.CategoryKleisliFacts]
c1:108 [in ITree.Basics.CategoryTheory]
C1:28 [in ITree.Basics.CategoryFunctor]
C1:297 [in ITree.Extra.IForest]
C1:3 [in ITree.Basics.CategoryFunctor]
c2:101 [in ITree.Basics.CategoryKleisliFacts]
c2:109 [in ITree.Basics.CategoryKleisliFacts]
c2:109 [in ITree.Basics.CategoryTheory]
C2:29 [in ITree.Basics.CategoryFunctor]
C2:298 [in ITree.Extra.IForest]
C2:4 [in ITree.Basics.CategoryFunctor]
C:10 [in ITree.Basics.CategoryRelations]
C:100 [in ITree.Basics.CategoryOps]
c:102 [in ITree.Basics.CategoryRelations]
c:104 [in ITree.Basics.CategoryFacts]
c:105 [in ITree.Basics.CategoryRelations]
c:108 [in ITree.Basics.CategoryOps]
c:108 [in ITree.Basics.CategoryRelations]
C:11 [in ITree.Basics.FunctionFacts]
c:111 [in ITree.Basics.CategoryFacts]
c:113 [in ITree.Basics.CategoryRelations]
c:115 [in ITree.Basics.CategoryKleisliFacts]
c:116 [in ITree.Basics.CategoryOps]
c:118 [in ITree.Basics.CategoryFacts]
c:119 [in ITree.Basics.CategoryOps]
c:120 [in ITree.Basics.CategoryTheory]
c:122 [in ITree.Core.KTreeFacts]
C:124 [in ITree.Basics.CategoryTheory]
c:127 [in ITree.Basics.CategoryFacts]
C:128 [in ITree.Basics.CategoryOps]
c:13 [in ITree.Events.FailFacts]
c:13 [in ITree.Basics.CategoryRelations]
C:130 [in ITree.Interp.InterpFacts]
c:131 [in ITree.Basics.CategoryFacts]
C:135 [in ITree.Events.StateFacts]
c:135 [in ITree.Basics.CategoryTheory]
c:136 [in ITree.Basics.CategoryOps]
c:136 [in ITree.Basics.CategoryFacts]
c:14 [in ITree.Basics.FunctionFacts]
c:14 [in ITree.Basics.CategoryFacts]
C:142 [in ITree.Basics.HeterogeneousRelations]
c:142 [in ITree.Basics.CategoryTheory]
c:144 [in ITree.Basics.CategoryOps]
c:145 [in ITree.Basics.CategoryFacts]
c:147 [in ITree.Basics.CategoryOps]
C:149 [in ITree.Basics.HeterogeneousRelations]
c:149 [in ITree.Basics.CategoryTheory]
C:15 [in ITree.Basics.Function]
c:15 [in ITree.Basics.CategoryOps]
C:15 [in ITree.Interp.HandlerFacts]
c:151 [in ITree.Basics.CategoryFacts]
C:156 [in ITree.Basics.CategoryOps]
c:157 [in ITree.Basics.CategoryFacts]
C:159 [in ITree.Eq.Eqit]
c:160 [in ITree.Basics.CategoryTheory]
C:163 [in ITree.Basics.CategoryTheory]
c:165 [in ITree.Basics.CategoryFacts]
C:165 [in ITree.Basics.HeterogeneousRelations]
c:166 [in ITree.Basics.CategoryOps]
C:169 [in ITree.Basics.CategoryOps]
c:17 [in ITree.Basics.CategoryKleisliFacts]
C:17 [in ITree.Basics.FunctionFacts]
c:172 [in ITree.Basics.CategoryFacts]
c:174 [in ITree.Basics.CategoryTheory]
C:175 [in ITree.Basics.CategoryOps]
c:175 [in ITree.Basics.CategoryFacts]
c:178 [in ITree.Basics.CategoryFacts]
c:18 [in ITree.Basics.CategoryFacts]
c:181 [in ITree.Basics.CategoryFacts]
c:181 [in ITree.Basics.CategoryTheory]
c:184 [in ITree.Basics.CategoryFacts]
c:188 [in ITree.Basics.CategoryTheory]
c:189 [in ITree.Basics.CategoryOps]
c:19 [in ITree.Basics.CategoryTheory]
c:190 [in ITree.Basics.CategoryFacts]
C:192 [in ITree.Basics.CategoryOps]
c:193 [in ITree.Basics.CategoryFacts]
c:199 [in ITree.Basics.CategoryTheory]
C:2 [in ITree.Basics.CategoryOps]
C:2 [in ITree.Basics.CategoryFacts]
C:2 [in ITree.Basics.CategoryTheory]
C:2 [in ITree.Basics.CategorySub]
c:20 [in ITree.Basics.CategoryKleisliFacts]
c:20 [in ITree.Basics.CategoryFunctor]
c:20 [in ITree.Basics.CategoryRelations]
C:202 [in ITree.Basics.CategoryTheory]
C:203 [in ITree.Basics.HeterogeneousRelations]
C:205 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
c:205 [in ITree.Basics.CategoryFacts]
c:207 [in ITree.Basics.CategoryOps]
c:211 [in ITree.Basics.CategoryFacts]
c:212 [in ITree.Basics.CategoryOps]
c:216 [in ITree.Basics.CategoryOps]
C:216 [in ITree.Basics.CategoryFacts]
c:218 [in ITree.Basics.CategoryTheory]
c:227 [in ITree.Basics.CategoryTheory]
C:23 [in ITree.Basics.Function]
c:23 [in ITree.Basics.CategoryKleisliFacts]
c:23 [in ITree.Interp.RecursionFacts]
C:230 [in ITree.Basics.CategoryTheory]
c:231 [in ITree.Basics.CategoryFacts]
C:236 [in ITree.Basics.HeterogeneousRelations]
c:238 [in ITree.Basics.CategoryFacts]
c:240 [in ITree.Basics.CategoryTheory]
c:244 [in ITree.Basics.CategoryTheory]
c:245 [in ITree.Basics.CategoryFacts]
C:246 [in ITree.Basics.HeterogeneousRelations]
c:248 [in ITree.Basics.CategoryTheory]
C:250 [in ITree.Basics.HeterogeneousRelations]
c:254 [in ITree.Basics.CategoryFacts]
c:258 [in ITree.Basics.CategoryFacts]
C:26 [in ITree.Basics.Monad]
c:26 [in ITree.Basics.CategoryKleisliFacts]
C:26 [in ITree.Basics.CategoryRelations]
c:263 [in ITree.Basics.CategoryFacts]
C:268 [in ITree.Basics.HeterogeneousRelations]
c:27 [in ITree.Basics.CategoryKleisli]
C:27 [in ITree.Indexed.Function]
c:272 [in ITree.Basics.CategoryFacts]
c:278 [in ITree.Basics.CategoryFacts]
C:28 [in ITree.Basics.CategoryOps]
C:280 [in ITree.Basics.HeterogeneousRelations]
c:281 [in ITree.Basics.CategoryTheory]
c:284 [in ITree.Basics.CategoryFacts]
C:290 [in ITree.Basics.HeterogeneousRelations]
c:291 [in ITree.Basics.CategoryFacts]
C:294 [in ITree.Basics.HeterogeneousRelations]
c:299 [in ITree.Basics.CategoryFacts]
C:3 [in ITree.Interp.HandlerFacts]
C:30 [in ITree.Basics.Function]
c:300 [in ITree.Basics.CategoryTheory]
c:302 [in ITree.Basics.CategoryFacts]
C:304 [in ITree.Basics.CategoryTheory]
c:305 [in ITree.Basics.CategoryFacts]
c:308 [in ITree.Basics.CategoryFacts]
c:31 [in ITree.Basics.CategoryFacts]
c:31 [in ITree.Basics.CategoryTheory]
c:311 [in ITree.Basics.CategoryFacts]
c:317 [in ITree.Basics.CategoryFacts]
C:32 [in ITree.Basics.CategoryKleisliFacts]
c:320 [in ITree.Basics.CategoryFacts]
c:329 [in ITree.Basics.CategoryTheory]
c:33 [in ITree.Basics.Function]
c:33 [in ITree.Basics.CategoryOps]
c:33 [in ITree.Basics.MonadState]
C:33 [in ITree.Basics.CategoryRelations]
c:332 [in ITree.Basics.CategoryFacts]
c:338 [in ITree.Basics.CategoryFacts]
c:339 [in ITree.Basics.CategoryTheory]
C:342 [in ITree.Basics.CategoryTheory]
C:343 [in ITree.Basics.CategoryFacts]
c:359 [in ITree.Basics.CategoryTheory]
c:36 [in ITree.Basics.CategoryFacts]
c:360 [in ITree.Basics.CategoryFacts]
c:364 [in ITree.Basics.CategoryFacts]
c:366 [in ITree.Basics.CategoryTheory]
C:37 [in ITree.Basics.CategoryKleisliFacts]
c:370 [in ITree.Basics.CategoryFacts]
c:375 [in ITree.Basics.CategoryFacts]
c:38 [in ITree.Basics.MonadState]
c:385 [in ITree.Basics.CategoryTheory]
c:387 [in ITree.Basics.CategoryFacts]
c:39 [in ITree.Basics.CategoryOps]
c:392 [in ITree.Basics.CategoryFacts]
C:4 [in ITree.Core.KTreeFacts]
c:400 [in ITree.Basics.CategoryFacts]
c:407 [in ITree.Basics.CategoryFacts]
C:41 [in ITree.Basics.Function]
c:417 [in ITree.Basics.CategoryFacts]
C:42 [in ITree.Extra.Dijkstra.StateSpecT]
c:423 [in ITree.Basics.CategoryFacts]
c:429 [in ITree.Basics.CategoryFacts]
c:43 [in ITree.Basics.Function]
c:432 [in ITree.Basics.CategoryFacts]
c:435 [in ITree.Basics.CategoryFacts]
C:44 [in ITree.Basics.CategoryKleisliFacts]
c:44 [in ITree.Basics.CategoryFunctor]
C:45 [in ITree.Basics.CategoryFacts]
C:46 [in ITree.Basics.CategoryTheory]
C:5 [in ITree.Basics.HeterogeneousRelations]
C:50 [in ITree.Props.EuttNoRet]
C:51 [in ITree.Basics.CategoryKleisliFacts]
c:52 [in ITree.Basics.CategoryOps]
c:56 [in ITree.Basics.CategoryRelations]
c:57 [in ITree.Basics.CategoryOps]
C:57 [in ITree.Basics.CategoryKleisliFacts]
c:57 [in ITree.Props.EuttNoRet]
c:57 [in ITree.Basics.MonadState]
c:58 [in ITree.Basics.CategorySub]
C:6 [in ITree.Interp.HandlerFacts]
C:601 [in ITree.Extra.IForest]
c:61 [in ITree.Props.EuttNoRet]
C:62 [in ITree.Basics.CategoryRelations]
c:63 [in ITree.Basics.CategoryRelations]
C:64 [in ITree.Basics.CategoryTheory]
C:65 [in ITree.Basics.CategoryFacts]
C:68 [in ITree.Basics.CategoryKleisliFacts]
c:69 [in ITree.Basics.MonadState]
C:7 [in ITree.Basics.FunctionFacts]
c:72 [in ITree.Basics.CategoryTheory]
C:73 [in ITree.Basics.CategoryRelations]
c:74 [in ITree.Basics.CategoryRelations]
C:76 [in ITree.Basics.CategoryTheory]
c:78 [in ITree.Basics.CategoryOps]
c:78 [in ITree.Basics.CategoryFacts]
c:84 [in ITree.Basics.CategoryFacts]
C:845 [in ITree.Eq.Eqit]
C:883 [in ITree.Eq.Eqit]
C:89 [in ITree.Basics.CategoryFacts]
C:90 [in ITree.Core.KTreeFacts]
C:91 [in ITree.Basics.CategoryKleisliFacts]
C:93 [in ITree.Basics.CategoryOps]
C:93 [in ITree.Basics.CategoryTheory]
C:95 [in ITree.Basics.CategoryKleisliFacts]
c:99 [in ITree.Core.KTreeFacts]
c:99 [in ITree.Basics.CategoryRelations]

D

DagC:80 [in ITree.Basics.CategoryTheory]
dc:235 [in ITree.Basics.CategoryFacts]
dc:242 [in ITree.Basics.CategoryFacts]
dc:403 [in ITree.Basics.CategoryFacts]
DIVCHECK:165 [in ITree.Extra.Secure.SecureStateHandler]
D:1 [in ITree.Interp.Recursion]
D:1 [in ITree.Interp.RecursionFacts]
d:10 [in ITree.Events.MapDefault]
d:105 [in ITree.Basics.CategoryFacts]
d:109 [in ITree.Basics.CategoryOps]
d:11 [in ITree.Interp.Recursion]
d:112 [in ITree.Basics.CategoryFacts]
D:114 [in ITree.Simple]
d:116 [in ITree.Basics.CategoryKleisliFacts]
D:117 [in ITree.Simple]
d:119 [in ITree.Basics.CategoryFacts]
D:12 [in ITree.Interp.Recursion]
d:121 [in ITree.Basics.CategoryTheory]
d:121 [in ITree.Simple]
D:123 [in ITree.Simple]
d:127 [in ITree.Simple]
d:13 [in ITree.Events.MapDefault]
d:137 [in ITree.Basics.CategoryOps]
d:14 [in ITree.Interp.Recursion]
D:143 [in ITree.Basics.HeterogeneousRelations]
d:146 [in ITree.Basics.CategoryFacts]
D:15 [in ITree.Interp.Recursion]
d:15 [in ITree.Events.Dependent]
d:152 [in ITree.Basics.CategoryFacts]
d:158 [in ITree.Basics.CategoryFacts]
D:18 [in ITree.Interp.Recursion]
D:18 [in ITree.Basics.FunctionFacts]
d:185 [in ITree.Basics.CategoryFacts]
d:20 [in ITree.Events.MapDefaultFacts]
d:20 [in ITree.Basics.CategoryTheory]
D:204 [in ITree.Basics.HeterogeneousRelations]
d:206 [in ITree.Basics.CategoryFacts]
d:21 [in ITree.Basics.CategoryRelations]
d:21 [in ITree.Events.MapDefaultFacts]
d:212 [in ITree.Basics.CategoryFacts]
d:22 [in ITree.Interp.Recursion]
d:22 [in ITree.Events.MapDefault]
d:22 [in ITree.Events.MapDefaultFacts]
d:232 [in ITree.Basics.CategoryFacts]
d:233 [in ITree.Extra.Dijkstra.ITreeDijkstra]
D:237 [in ITree.Basics.HeterogeneousRelations]
d:239 [in ITree.Basics.CategoryFacts]
d:246 [in ITree.Basics.CategoryFacts]
D:247 [in ITree.Basics.HeterogeneousRelations]
D:249 [in ITree.Simple]
d:25 [in ITree.Events.MapDefault]
d:25 [in ITree.Interp.RecursionFacts]
D:251 [in ITree.Basics.HeterogeneousRelations]
D:252 [in ITree.Simple]
d:256 [in ITree.Simple]
D:257 [in ITree.Simple]
d:26 [in ITree.Events.MapDefaultFacts]
d:261 [in ITree.Simple]
D:269 [in ITree.Basics.HeterogeneousRelations]
d:27 [in ITree.Interp.RecursionFacts]
d:273 [in ITree.Basics.CategoryFacts]
d:277 [in ITree.Extra.Dijkstra.ITreeDijkstra]
d:279 [in ITree.Basics.CategoryFacts]
D:281 [in ITree.Basics.HeterogeneousRelations]
d:282 [in ITree.Basics.CategoryTheory]
d:284 [in ITree.Extra.Dijkstra.ITreeDijkstra]
d:285 [in ITree.Basics.CategoryFacts]
d:290 [in ITree.Extra.Dijkstra.ITreeDijkstra]
D:291 [in ITree.Basics.HeterogeneousRelations]
D:295 [in ITree.Basics.HeterogeneousRelations]
d:297 [in ITree.Extra.Dijkstra.ITreeDijkstra]
d:3 [in ITree.Events.MapDefault]
d:30 [in ITree.Events.MapDefault]
D:30 [in ITree.Interp.RecursionFacts]
d:301 [in ITree.Basics.CategoryTheory]
d:31 [in ITree.Events.MapDefault]
d:312 [in ITree.Basics.CategoryFacts]
d:32 [in ITree.Basics.CategoryFacts]
d:32 [in ITree.Events.MapDefaultFacts]
d:333 [in ITree.Basics.CategoryFacts]
d:339 [in ITree.Basics.CategoryFacts]
d:34 [in ITree.Basics.CategoryOps]
d:37 [in ITree.Basics.CategoryFacts]
d:37 [in ITree.Events.MapDefaultFacts]
D:38 [in ITree.Basics.CategoryKleisliFacts]
d:388 [in ITree.Basics.CategoryFacts]
d:393 [in ITree.Basics.CategoryFacts]
d:401 [in ITree.Basics.CategoryFacts]
d:41 [in ITree.Events.MapDefaultFacts]
d:436 [in ITree.Basics.CategoryFacts]
D:45 [in ITree.Basics.CategoryKleisliFacts]
D:46 [in ITree.Interp.RecursionFacts]
d:49 [in ITree.Events.MapDefaultFacts]
D:49 [in ITree.Interp.RecursionFacts]
d:50 [in ITree.Events.MapDefaultFacts]
d:52 [in ITree.Interp.HandlerFacts]
d:57 [in ITree.Basics.CategoryRelations]
d:58 [in ITree.Interp.HandlerFacts]
d:59 [in ITree.Events.MapDefaultFacts]
d:59 [in ITree.Basics.CategorySub]
d:61 [in ITree.Extra.Dijkstra.StateIOTrace]
d:69 [in ITree.Extra.Dijkstra.StateIOTrace]
D:7 [in ITree.Interp.Recursion]
d:7 [in ITree.Events.MapDefault]
d:79 [in ITree.Basics.CategoryFacts]
d:85 [in ITree.Basics.CategoryFacts]

E

ea:12 [in ITree.Extra.ITrace.ITraceFacts]
EffectObsMW:20 [in ITree.Extra.Dijkstra.StateSpecT]
ei:93 [in ITree.Basics.Basics]
ek:182 [in ITree.Simple]
ek:37 [in ITree.Simple]
ek:613 [in ITree.Eq.Eqit]
ek:82 [in ITree.Eq.Shallow]
Embed:4 [in ITree.Basics.CategorySub]
entry:68 [in ITree.Props.HasPost]
env:21 [in ITree.Events.Map]
env:27 [in ITree.Events.MapDefault]
EQK:694 [in ITree.Eq.Eqit]
EQK:732 [in ITree.Eq.Eqit]
EQL:80 [in ITree.Eq.UpToTaus]
EQM:3 [in ITree.Basics.MonadState]
EQR:81 [in ITree.Eq.UpToTaus]
EQTAUS:18 [in ITree.Eq.SimUpToTaus]
EQTAUS:21 [in ITree.Eq.SimUpToTaus]
EQT:691 [in ITree.Eq.Eqit]
EQT:729 [in ITree.Eq.Eqit]
Equivalence_R:43 [in ITree.Indexed.Relation]
Equivalence_Eq2_C:10 [in ITree.Basics.CategoryFacts]
Equivalence_C:53 [in ITree.Basics.CategorySub]
Equivalence_C:43 [in ITree.Basics.CategorySub]
EquivRel:8 [in ITree.Extra.Dijkstra.StateSpecT]
EQVl:156 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EQVl:156 [in ITree.Extra.Secure.SecureEqHalt]
EQVl:207 [in ITree.Eq.Eqit]
EQVl:93 [in ITree.Eq.Rutt]
EQVr:157 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EQVr:157 [in ITree.Extra.Secure.SecureEqHalt]
EQVr:208 [in ITree.Eq.Eqit]
EQVr:94 [in ITree.Eq.Rutt]
EQV:108 [in ITree.Props.Leaf]
EQV:358 [in ITree.Extra.IForest]
EQV:674 [in ITree.Eq.Eqit]
EqW:43 [in ITree.Extra.Dijkstra.DijkstraMonad]
EqW:6 [in ITree.Extra.Dijkstra.StateSpecT]
EqW:62 [in ITree.Extra.Dijkstra.DijkstraMonad]
EQ_t:165 [in ITree.Events.StateFacts]
eq_':114 [in ITree.Eq.Shallow]
eq_:108 [in ITree.Eq.Shallow]
eq_':57 [in ITree.Eq.Shallow]
eq_:49 [in ITree.Eq.Shallow]
EQ_t:115 [in ITree.Interp.InterpFacts]
Eq1P:4 [in ITree.Basics.CategoryKleisliFacts]
Eq1:12 [in ITree.Basics.Monad]
Eq1:2 [in ITree.Basics.CategoryKleisliFacts]
Eq2C:3 [in ITree.Basics.CategoryFacts]
Eq2C:3 [in ITree.Basics.CategoryTheory]
Eq2C:47 [in ITree.Basics.CategoryTheory]
Eq2C:65 [in ITree.Basics.CategoryTheory]
Eq2C:77 [in ITree.Basics.CategoryTheory]
Eq2_C:344 [in ITree.Basics.CategoryFacts]
Eq2_C:217 [in ITree.Basics.CategoryFacts]
Eq2_C:90 [in ITree.Basics.CategoryFacts]
Eq2_C:66 [in ITree.Basics.CategoryFacts]
Eq2_C:46 [in ITree.Basics.CategoryFacts]
Eq2_C:343 [in ITree.Basics.CategoryTheory]
Eq2_C:305 [in ITree.Basics.CategoryTheory]
Eq2_C:231 [in ITree.Basics.CategoryTheory]
Eq2_C:203 [in ITree.Basics.CategoryTheory]
Eq2_C:164 [in ITree.Basics.CategoryTheory]
Eq2_C:125 [in ITree.Basics.CategoryTheory]
Eq2_C:94 [in ITree.Basics.CategoryTheory]
Eq2_C:13 [in ITree.Basics.CategorySub]
eq2:101 [in ITree.Extra.IForest]
eq2:112 [in ITree.Extra.IForest]
EQ:410 [in ITree.Eq.Eqit]
Eq:6 [in ITree.Extra.Dijkstra.DijkstraMonad]
Err:1 [in ITree.Events.Exception]
Err:11 [in ITree.Events.Exception]
Err:12 [in ITree.Events.ExceptionFacts]
Err:19 [in ITree.Events.ExceptionFacts]
Err:2 [in ITree.Events.ExceptionFacts]
Err:21 [in ITree.Events.Exception]
Err:26 [in ITree.Events.ExceptionFacts]
Err:29 [in ITree.Events.ExceptionFacts]
Err:32 [in ITree.Events.ExceptionFacts]
Err:36 [in ITree.Events.ExceptionFacts]
Err:4 [in ITree.Events.Exception]
Err:40 [in ITree.Events.ExceptionFacts]
Err:44 [in ITree.Events.ExceptionFacts]
Err:50 [in ITree.Events.ExceptionFacts]
Err:56 [in ITree.Events.ExceptionFacts]
Err:61 [in ITree.Events.ExceptionFacts]
Err:68 [in ITree.Events.ExceptionFacts]
Err:7 [in ITree.Events.ExceptionFacts]
Err:75 [in ITree.Events.ExceptionFacts]
Err:82 [in ITree.Events.ExceptionFacts]
Err:90 [in ITree.Events.ExceptionFacts]
eutt_body:53 [in ITree.Core.KTreeFacts]
eutt_body:36 [in ITree.Core.KTreeFacts]
eutt_body:21 [in ITree.Core.KTreeFacts]
EvTrans:100 [in ITree.Extra.ITrace.ITracePreds]
ev:104 [in ITree.Interp.Traces]
ev:113 [in ITree.Interp.Traces]
ev:119 [in ITree.Extra.ITrace.ITraceBind]
ev:182 [in ITree.Extra.ITrace.ITraceBind]
ev:21 [in ITree.Events.ExceptionFacts]
ev:216 [in ITree.Extra.ITrace.ITraceBind]
ev:245 [in ITree.Extra.ITrace.ITraceBind]
ev:262 [in ITree.Extra.ITrace.ITraceBind]
ev:273 [in ITree.Extra.ITrace.ITraceBind]
ev:284 [in ITree.Extra.ITrace.ITraceBind]
ev:5 [in ITree.Extra.ITrace.ITraceDefinition]
ev:53 [in ITree.Extra.Dijkstra.StateIOTrace]
ev:9 [in ITree.Extra.ITrace.ITraceDefinition]
ev:93 [in ITree.Interp.Traces]
exc:14 [in ITree.Events.ExceptionFacts]
EXP:158 [in ITree.Basics.CategoryOps]
EXP:212 [in ITree.Basics.CategoryTheory]
E_Eq2_C:347 [in ITree.Basics.CategoryFacts]
E_Eq2_C:220 [in ITree.Basics.CategoryFacts]
E_Eq2_C:93 [in ITree.Basics.CategoryFacts]
E_Eq2_C:69 [in ITree.Basics.CategoryFacts]
E_Eq2_C:49 [in ITree.Basics.CategoryFacts]
e':111 [in ITree.Extra.ITrace.ITraceFacts]
e':147 [in ITree.Extra.Secure.SecureStateHandler]
e':159 [in ITree.Extra.Secure.SecureStateHandler]
e':164 [in ITree.Extra.Secure.SecureStateHandler]
e':47 [in ITree.Events.State]
e':8 [in ITree.Extra.ITrace.ITraceFacts]
e0:121 [in ITree.Extra.Secure.SecureEqEuttHalt]
e0:139 [in ITree.Extra.Secure.SecureEqEuttHalt]
e0:145 [in ITree.Extra.ITrace.ITraceFacts]
e0:163 [in ITree.Extra.ITrace.ITraceFacts]
e0:166 [in ITree.Extra.ITrace.ITraceFacts]
e0:169 [in ITree.Extra.ITrace.ITraceFacts]
e0:178 [in ITree.Extra.ITrace.ITraceFacts]
e0:214 [in ITree.Extra.Secure.SecureEqEuttHalt]
e0:265 [in ITree.Extra.ITrace.ITraceBind]
e0:34 [in ITree.Extra.ITrace.ITraceBind]
e0:8 [in ITree.Extra.ITrace.ITraceBind]
E1:1 [in ITree.Eq.Rutt]
E1:1 [in ITree.Indexed.Sum]
e1:11 [in ITree.Extra.ITrace.ITraceBind]
E1:110 [in ITree.Eq.Rutt]
E1:120 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:123 [in ITree.Eq.Rutt]
E1:125 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e1:131 [in ITree.Eq.Eqit]
E1:141 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:146 [in ITree.Eq.Rutt]
E1:149 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:154 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:159 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:175 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:177 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:179 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:181 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:198 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:205 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e1:209 [in ITree.Eq.UpToTaus]
e1:21 [in ITree.Eq.Rutt]
E1:212 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:214 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:220 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:224 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:228 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:234 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:241 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:246 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:255 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:262 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:267 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:270 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E1:290 [in ITree.Extra.IForest]
e1:296 [in ITree.Extra.ITrace.ITraceBind]
e1:300 [in ITree.Extra.ITrace.ITraceBind]
e1:32 [in ITree.Eq.Shallow]
e1:329 [in ITree.Eq.Eqit]
E1:34 [in ITree.Eq.Rutt]
e1:37 [in ITree.Extra.ITrace.ITraceBind]
E1:4 [in ITree.Extra.Secure.SecureStateHandler]
E1:4 [in ITree.Extra.Secure.SecureStateHandlerPi]
E1:43 [in ITree.Eq.Rutt]
e1:45 [in ITree.Extra.Secure.SecureEqProgInsens]
e1:47 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e1:47 [in ITree.Extra.Secure.SecureEqHalt]
E1:52 [in ITree.Eq.Rutt]
E1:61 [in ITree.Eq.Rutt]
e1:647 [in ITree.Eq.Eqit]
e1:66 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
E1:70 [in ITree.Eq.Rutt]
E1:79 [in ITree.Eq.Rutt]
e1:81 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
e1:87 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e1:87 [in ITree.Extra.Secure.SecureEqHalt]
e1:89 [in ITree.Eq.Eqit]
e1:94 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
e1:97 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e1:97 [in ITree.Extra.Secure.SecureEqHalt]
E2:111 [in ITree.Eq.Rutt]
E2:121 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:124 [in ITree.Eq.Rutt]
E2:126 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e2:133 [in ITree.Eq.Eqit]
E2:142 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:147 [in ITree.Eq.Rutt]
E2:150 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:155 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:160 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:199 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:2 [in ITree.Eq.Rutt]
E2:2 [in ITree.Indexed.Sum]
E2:206 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e2:211 [in ITree.Eq.UpToTaus]
E2:215 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e2:22 [in ITree.Eq.Rutt]
E2:221 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:225 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:229 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:235 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:242 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:247 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:256 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:263 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:268 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:271 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E2:291 [in ITree.Extra.IForest]
e2:33 [in ITree.Eq.Shallow]
e2:330 [in ITree.Eq.Eqit]
E2:35 [in ITree.Eq.Rutt]
E2:44 [in ITree.Eq.Rutt]
e2:46 [in ITree.Extra.Secure.SecureEqProgInsens]
e2:48 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e2:48 [in ITree.Extra.Secure.SecureEqHalt]
E2:5 [in ITree.Extra.Secure.SecureStateHandler]
E2:5 [in ITree.Extra.Secure.SecureStateHandlerPi]
E2:53 [in ITree.Eq.Rutt]
E2:62 [in ITree.Eq.Rutt]
e2:648 [in ITree.Eq.Eqit]
e2:67 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
e2:67 [in ITree.Eq.Eqit]
E2:71 [in ITree.Eq.Rutt]
E2:80 [in ITree.Eq.Rutt]
e2:88 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e2:88 [in ITree.Extra.Secure.SecureEqHalt]
e2:92 [in ITree.Eq.Eqit]
e2:98 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e2:98 [in ITree.Extra.Secure.SecureEqHalt]
E3:248 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E3:257 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E4:249 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E:1 [in ITree.Extra.Secure.SecureEqProgInsens]
E:1 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:1 [in ITree.Extra.Dijkstra.TracesIT]
E:1 [in ITree.Extra.Secure.SecureEqHalt]
E:1 [in ITree.Eq.UpToTaus]
E:1 [in ITree.Props.HasPost]
E:1 [in ITree.Eq.EqAxiom]
E:1 [in ITree.Extra.IForest]
E:1 [in ITree.Events.ExceptionFacts]
E:1 [in ITree.Eq.EuttExtras]
E:1 [in ITree.Extra.Secure.SecureEqEuttTrans]
E:1 [in ITree.Events.StateFacts]
E:1 [in ITree.Core.KTree]
E:1 [in ITree.Core.KTreeFacts]
E:1 [in ITree.Props.Finite]
E:1 [in ITree.Eq.SimUpToTaus]
E:1 [in ITree.Props.Infinite]
E:1 [in ITree.Props.Leaf]
E:1 [in ITree.Extra.ITrace.ITraceDefinition]
E:1 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E:1 [in ITree.Extra.ITrace.ITracePrefix]
E:1 [in ITree.Extra.Secure.StrongBisimProper]
E:1 [in ITree.Props.EuttNoRet]
E:1 [in ITree.Indexed.Function]
E:1 [in ITree.Core.ITreeMonad]
E:1 [in ITree.Interp.Traces]
E:1 [in ITree.Extra.Secure.SecureEqBind]
E:1 [in ITree.Props.Cofinite]
E:1 [in ITree.Events.Concurrency]
E:1 [in ITree.Interp.InterpFacts]
E:1 [in ITree.Core.Subevent]
E:1 [in ITree.Interp.Interp]
E:1 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:1 [in ITree.Interp.TranslateFacts]
E:1 [in ITree.Indexed.FunctionFacts]
E:1 [in ITree.Extra.Dijkstra.PureITreeBasics]
E:1 [in ITree.Extra.ITrace.ITracePreds]
E:1 [in ITree.Events.State]
E:1 [in ITree.Core.ITreeDefinition]
E:1 [in ITree.Simple]
E:10 [in ITree.Events.StateFacts]
E:10 [in ITree.Core.KTreeFacts]
e:10 [in ITree.Props.Finite]
e:10 [in ITree.Props.Leaf]
E:10 [in ITree.Extra.ITrace.ITraceDefinition]
E:10 [in ITree.Events.Reader]
e:10 [in ITree.Interp.HandlerFacts]
E:10 [in ITree.Indexed.Function]
e:10 [in ITree.Events.Writer]
E:10 [in ITree.Extra.Secure.SecureEqWcompat]
E:10 [in ITree.Extra.ITrace.ITraceFacts]
E:10 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:100 [in ITree.Extra.ITrace.ITracePrefix]
E:100 [in ITree.Extra.ITrace.ITraceFacts]
e:100 [in ITree.Interp.InterpFacts]
E:101 [in ITree.Props.HasPost]
E:101 [in ITree.Events.FailFacts]
E:101 [in ITree.Interp.InterpFacts]
E:102 [in ITree.Extra.ITrace.ITraceBind]
E:102 [in ITree.Core.KTreeFacts]
E:102 [in ITree.Props.Finite]
E:102 [in ITree.Interp.Traces]
E:102 [in ITree.Simple]
E:103 [in ITree.Extra.ITrace.ITracePrefix]
E:103 [in ITree.Extra.Secure.SecureEqBind]
e:103 [in ITree.Extra.ITrace.ITraceFacts]
e:104 [in ITree.Extra.Secure.SecureStateHandler]
e:104 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:105 [in ITree.Eq.Shallow]
E:106 [in ITree.Extra.ITrace.ITraceBind]
e:106 [in ITree.Extra.IForest]
E:106 [in ITree.Extra.Secure.SecureEqWcompat]
E:107 [in ITree.Events.StateFacts]
E:107 [in ITree.Interp.Traces]
e:107 [in ITree.Extra.Secure.SecureStateHandler]
E:107 [in ITree.Extra.ITrace.ITraceFacts]
E:107 [in ITree.Interp.InterpFacts]
E:107 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:107 [in ITree.Eq.Eqit]
E:108 [in ITree.Extra.Secure.SecureEqProgInsens]
E:108 [in ITree.Eq.SimUpToTaus]
E:108 [in ITree.Simple]
E:109 [in ITree.Core.KTreeFacts]
e:109 [in ITree.Extra.ITrace.ITraceFacts]
E:11 [in ITree.Events.Map]
E:11 [in ITree.Events.ExceptionFacts]
e:11 [in ITree.Eq.SimUpToTaus]
E:11 [in ITree.Props.Infinite]
E:11 [in ITree.Props.EuttNoRet]
E:11 [in ITree.Interp.InterpFacts]
E:11 [in ITree.Events.State]
E:110 [in ITree.Extra.ITrace.ITraceBind]
E:110 [in ITree.Events.FailFacts]
E:111 [in ITree.Eq.Shallow]
e:112 [in ITree.Extra.Secure.SecureStateHandler]
e:113 [in ITree.Extra.ITrace.ITracePrefix]
e:113 [in ITree.Extra.ITrace.ITracePreds]
E:114 [in ITree.Props.Finite]
E:114 [in ITree.Extra.ITrace.ITraceFacts]
E:115 [in ITree.Extra.ITrace.ITraceBind]
E:115 [in ITree.Props.HasPost]
E:115 [in ITree.Extra.IForest]
e:115 [in ITree.Extra.Secure.SecureStateHandler]
E:115 [in ITree.Simple]
E:116 [in ITree.Interp.Traces]
E:116 [in ITree.Extra.Secure.SecureStateHandler]
e:116 [in ITree.Eq.Eqit]
E:117 [in ITree.Extra.Secure.SecureEqProgInsens]
E:117 [in ITree.Core.KTreeFacts]
E:117 [in ITree.Interp.InterpFacts]
E:118 [in ITree.Core.KTreeFacts]
e:118 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:118 [in ITree.Simple]
E:119 [in ITree.Eq.UpToTaus]
E:119 [in ITree.Core.KTreeFacts]
E:12 [in ITree.Extra.IForest]
E:12 [in ITree.Extra.ITrace.ITraceDefinition]
e:12 [in ITree.Interp.Handler]
E:12 [in ITree.Events.MapDefault]
e:12 [in ITree.Interp.HandlerFacts]
E:12 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
e:12 [in ITree.Interp.TranslateFacts]
e:12 [in ITree.Extra.ITrace.ITracePreds]
e:12 [in ITree.Simple]
E:120 [in ITree.Props.Finite]
E:120 [in ITree.Extra.ITrace.ITracePrefix]
E:120 [in ITree.Interp.Traces]
e:120 [in ITree.Extra.Secure.SecureEqBind]
E:120 [in ITree.Eq.Eqit]
E:122 [in ITree.Interp.Traces]
E:123 [in ITree.Props.HasPost]
E:123 [in ITree.Props.Finite]
e:124 [in ITree.Extra.Secure.SecureStateHandler]
E:124 [in ITree.Extra.ITrace.ITraceFacts]
E:124 [in ITree.Simple]
E:125 [in ITree.Props.Leaf]
e:125 [in ITree.Extra.Secure.SecureStateHandler]
E:125 [in ITree.Interp.InterpFacts]
E:125 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:126 [in ITree.Extra.IForest]
e:126 [in ITree.Extra.Secure.SecureStateHandler]
E:127 [in ITree.Extra.ITrace.ITracePrefix]
e:127 [in ITree.Extra.Secure.SecureStateHandler]
E:127 [in ITree.Extra.ITrace.ITraceFacts]
E:128 [in ITree.Extra.Secure.SecureEqBind]
e:128 [in ITree.Extra.Secure.SecureStateHandler]
e:129 [in ITree.Extra.ITrace.ITraceBind]
E:129 [in ITree.Props.HasPost]
E:129 [in ITree.Props.Finite]
e:129 [in ITree.Interp.Traces]
e:129 [in ITree.Extra.Secure.SecureStateHandler]
E:129 [in ITree.Simple]
E:13 [in ITree.Interp.Recursion]
E:13 [in ITree.Events.Exception]
E:13 [in ITree.Interp.Handler]
E:13 [in ITree.Indexed.Function]
e:13 [in ITree.Extra.ITrace.ITraceFacts]
E:13 [in ITree.Events.State]
E:13 [in ITree.Core.ITreeDefinition]
E:130 [in ITree.Events.StateFacts]
E:131 [in ITree.Extra.ITrace.ITraceBind]
E:131 [in ITree.Extra.ITrace.ITraceFacts]
E:131 [in ITree.Simple]
E:132 [in ITree.Extra.Secure.SecureEqProgInsens]
E:133 [in ITree.Interp.Traces]
E:133 [in ITree.Simple]
E:134 [in ITree.Extra.IForest]
e:134 [in ITree.Extra.Secure.SecureStateHandler]
E:135 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:135 [in ITree.Extra.Secure.SecureEqHalt]
E:135 [in ITree.Props.Finite]
E:135 [in ITree.Eq.Eqit]
E:135 [in ITree.Simple]
e:136 [in ITree.Extra.ITrace.ITracePrefix]
e:136 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:138 [in ITree.Extra.ITrace.ITraceBind]
e:138 [in ITree.Simple]
E:139 [in ITree.Extra.IForest]
e:139 [in ITree.Extra.Secure.SecureStateHandler]
E:139 [in ITree.Simple]
E:14 [in ITree.Extra.ITrace.ITraceBind]
E:14 [in ITree.Props.HasPost]
E:14 [in ITree.Eq.EuttExtras]
E:14 [in ITree.Props.Finite]
E:14 [in ITree.Props.Leaf]
E:14 [in ITree.Extra.ITrace.ITraceDefinition]
E:14 [in ITree.Interp.Traces]
E:14 [in ITree.Events.Writer]
E:141 [in ITree.Extra.Secure.SecureEqProgInsens]
E:142 [in ITree.Props.Leaf]
E:142 [in ITree.Extra.ITrace.ITracePrefix]
e:142 [in ITree.Extra.Secure.SecureStateHandler]
E:142 [in ITree.Simple]
E:143 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:144 [in ITree.Extra.ITrace.ITraceBind]
e:144 [in ITree.Extra.ITrace.ITraceFacts]
E:145 [in ITree.Eq.Eqit]
E:145 [in ITree.Simple]
E:147 [in ITree.Extra.IForest]
E:148 [in ITree.Extra.ITrace.ITracePrefix]
E:148 [in ITree.Eq.Eqit]
e:149 [in ITree.Extra.Secure.SecureEqProgInsens]
E:149 [in ITree.Props.Finite]
E:149 [in ITree.Simple]
E:15 [in ITree.Extra.Secure.SecureEqEuttTrans]
E:15 [in ITree.Props.Infinite]
E:15 [in ITree.Extra.ITrace.ITraceDefinition]
E:15 [in ITree.Interp.Handler]
E:15 [in ITree.Extra.ITrace.ITraceFacts]
E:15 [in ITree.Interp.Interp]
E:15 [in ITree.Interp.TranslateFacts]
E:15 [in ITree.Extra.ITrace.ITracePreds]
E:15 [in ITree.Events.State]
E:150 [in ITree.Events.StateFacts]
E:151 [in ITree.Extra.ITrace.ITraceBind]
E:151 [in ITree.Extra.IForest]
E:151 [in ITree.Eq.Eqit]
E:152 [in ITree.Extra.Secure.SecureEqProgInsens]
E:152 [in ITree.Extra.Secure.SecureEqBind]
e:152 [in ITree.Extra.Secure.SecureStateHandler]
e:153 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:154 [in ITree.Extra.ITrace.ITraceBind]
E:154 [in ITree.Props.Finite]
E:154 [in ITree.Extra.ITrace.ITracePrefix]
E:154 [in ITree.Eq.Eqit]
E:156 [in ITree.Events.StateFacts]
E:156 [in ITree.Extra.ITrace.ITraceFacts]
e:156 [in ITree.Simple]
E:157 [in ITree.Props.Leaf]
E:157 [in ITree.Extra.Secure.SecureEqEuttHalt]
e:158 [in ITree.Extra.ITrace.ITraceBind]
E:16 [in ITree.Interp.Recursion]
E:16 [in ITree.Extra.ITrace.ITraceDefinition]
e:16 [in ITree.Extra.ITrace.ITracePrefix]
E:16 [in ITree.Props.EuttNoRet]
E:16 [in ITree.Indexed.Function]
E:16 [in ITree.Events.Writer]
e:16 [in ITree.Events.State]
E:16 [in ITree.Core.ITreeDefinition]
E:160 [in ITree.Extra.IForest]
E:160 [in ITree.Props.Finite]
E:160 [in ITree.Extra.ITrace.ITracePrefix]
e:160 [in ITree.Extra.ITrace.ITraceFacts]
E:162 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E:162 [in ITree.Eq.Eqit]
E:163 [in ITree.Extra.ITrace.ITraceBind]
e:163 [in ITree.Simple]
E:165 [in ITree.Extra.Secure.SecureEqProgInsens]
E:165 [in ITree.Extra.ITrace.ITracePrefix]
E:166 [in ITree.Extra.IForest]
e:167 [in ITree.Extra.ITrace.ITraceBind]
E:167 [in ITree.Events.StateFacts]
e:167 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:167 [in ITree.Simple]
E:169 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e:169 [in ITree.Extra.Secure.SecureStateHandler]
E:17 [in ITree.Events.ExceptionFacts]
E:17 [in ITree.Events.StateFacts]
E:17 [in ITree.Props.Leaf]
E:17 [in ITree.Extra.ITrace.ITraceDefinition]
E:17 [in ITree.Interp.Handler]
e:17 [in ITree.Indexed.Function]
e:17 [in ITree.Extra.Secure.SecureEqBind]
E:17 [in ITree.Core.Subevent]
E:170 [in ITree.Extra.Secure.SecureEqBind]
E:170 [in ITree.Eq.Eqit]
E:171 [in ITree.Extra.ITrace.ITraceFacts]
E:171 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:172 [in ITree.Extra.ITrace.ITraceBind]
E:172 [in ITree.Props.Finite]
E:172 [in ITree.Simple]
E:173 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e:173 [in ITree.Extra.Secure.SecureStateHandler]
e:175 [in ITree.Extra.ITrace.ITraceBind]
e:175 [in ITree.Extra.Secure.SecureStateHandler]
e:175 [in ITree.Extra.ITrace.ITraceFacts]
E:177 [in ITree.Simple]
E:178 [in ITree.Extra.ITrace.ITraceBind]
E:178 [in ITree.Props.Finite]
E:178 [in ITree.Eq.Eqit]
E:179 [in ITree.Extra.Secure.SecureEqProgInsens]
E:179 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:179 [in ITree.Extra.Secure.SecureEqHalt]
E:18 [in ITree.Props.HasPost]
E:18 [in ITree.Indexed.Function]
E:18 [in ITree.Interp.InterpFacts]
e:18 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:180 [in ITree.Extra.ITrace.ITraceFacts]
E:181 [in ITree.Extra.IForest]
e:181 [in ITree.Simple]
e:182 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:183 [in ITree.Props.Finite]
E:185 [in ITree.Extra.ITrace.ITraceFacts]
E:185 [in ITree.Simple]
E:186 [in ITree.Extra.IForest]
E:186 [in ITree.Extra.Secure.SecureEqEuttHalt]
e:187 [in ITree.Extra.ITrace.ITraceBind]
E:187 [in ITree.Props.Finite]
E:188 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:188 [in ITree.Extra.Secure.SecureEqHalt]
E:189 [in ITree.Extra.ITrace.ITraceBind]
E:189 [in ITree.Simple]
E:19 [in ITree.Events.Map]
E:19 [in ITree.Extra.IForest]
E:19 [in ITree.Interp.Traces]
E:19 [in ITree.Events.Concurrency]
E:190 [in ITree.Extra.ITrace.ITraceFacts]
E:190 [in ITree.Eq.Eqit]
E:192 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E:193 [in ITree.Extra.Secure.SecureEqProgInsens]
e:193 [in ITree.Extra.ITrace.ITraceBind]
E:194 [in ITree.Extra.ITrace.ITraceFacts]
E:197 [in ITree.Simple]
E:199 [in ITree.Extra.IForest]
E:2 [in ITree.Interp.Recursion]
E:2 [in ITree.Basics.Basics]
e:2 [in ITree.Extra.ITrace.ITraceFacts]
E:2 [in ITree.Interp.RecursionFacts]
e:20 [in ITree.Events.Map]
E:20 [in ITree.Props.HasPost]
e:20 [in ITree.Interp.HandlerFacts]
E:20 [in ITree.Events.Writer]
e:20 [in ITree.Extra.Secure.SecureEqWcompat]
E:20 [in ITree.Extra.ITrace.ITraceFacts]
E:20 [in ITree.Events.State]
e:20 [in ITree.Eq.Eqit]
E:200 [in ITree.Extra.Secure.SecureEqProgInsens]
E:200 [in ITree.Extra.ITrace.ITraceBind]
e:200 [in ITree.Eq.UpToTaus]
E:200 [in ITree.Props.Finite]
E:201 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:202 [in ITree.Extra.IForest]
E:202 [in ITree.Props.Finite]
E:202 [in ITree.Extra.ITrace.ITraceFacts]
e:204 [in ITree.Extra.ITrace.ITraceBind]
E:204 [in ITree.Props.Finite]
E:204 [in ITree.Simple]
E:205 [in ITree.Extra.IForest]
e:208 [in ITree.Extra.IForest]
E:208 [in ITree.Props.Finite]
E:209 [in ITree.Extra.ITrace.ITraceFacts]
E:209 [in ITree.Simple]
E:21 [in ITree.Props.Leaf]
E:21 [in ITree.Extra.ITrace.ITraceDefinition]
e:21 [in ITree.Extra.ITrace.ITracePrefix]
E:21 [in ITree.Extra.Secure.SecureEqBind]
E:21 [in ITree.Extra.ITrace.ITraceFacts]
e:21 [in ITree.Core.Subevent]
E:21 [in ITree.Extra.ITrace.ITracePreds]
e:21 [in ITree.Events.State]
e:21 [in ITree.Simple]
E:212 [in ITree.Extra.IForest]
E:213 [in ITree.Extra.ITrace.ITraceBind]
E:214 [in ITree.Extra.ITrace.ITraceFacts]
E:214 [in ITree.Simple]
E:219 [in ITree.Extra.Secure.SecureEqProgInsens]
E:219 [in ITree.Extra.ITrace.ITraceFacts]
e:219 [in ITree.Simple]
E:22 [in ITree.Props.HasPost]
E:22 [in ITree.Events.StateFacts]
E:22 [in ITree.Props.Infinite]
e:22 [in ITree.Events.Writer]
E:22 [in ITree.Events.Concurrency]
E:22 [in ITree.Core.Subevent]
E:22 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:220 [in ITree.Extra.ITrace.ITraceBind]
E:220 [in ITree.Extra.IForest]
E:221 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:222 [in ITree.Simple]
E:225 [in ITree.Eq.UpToTaus]
E:225 [in ITree.Extra.IForest]
e:226 [in ITree.Simple]
E:227 [in ITree.Extra.ITrace.ITraceFacts]
E:227 [in ITree.Simple]
E:229 [in ITree.Extra.ITrace.ITraceBind]
e:229 [in ITree.Extra.IForest]
E:23 [in ITree.Events.Map]
e:23 [in ITree.Props.Finite]
E:23 [in ITree.Events.Exception]
e:23 [in ITree.Interp.HandlerFacts]
E:23 [in ITree.Extra.ITrace.ITraceFacts]
E:23 [in ITree.Interp.InterpFacts]
E:23 [in ITree.Core.ITreeDefinition]
E:230 [in ITree.Extra.Secure.SecureEqProgInsens]
E:231 [in ITree.Eq.UpToTaus]
E:234 [in ITree.Extra.ITrace.ITraceFacts]
e:234 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:235 [in ITree.Simple]
E:237 [in ITree.Eq.UpToTaus]
E:237 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:238 [in ITree.Basics.HeterogeneousRelations]
E:239 [in ITree.Extra.Secure.SecureEqProgInsens]
E:239 [in ITree.Simple]
E:24 [in ITree.Extra.ITrace.ITraceBind]
E:24 [in ITree.Events.FailFacts]
E:24 [in ITree.Eq.SimUpToTaus]
E:24 [in ITree.Props.Infinite]
e:24 [in ITree.Props.Leaf]
E:24 [in ITree.Interp.Handler]
E:24 [in ITree.Events.MapDefault]
E:24 [in ITree.Events.Nondeterminism]
e:24 [in ITree.Indexed.Function]
E:24 [in ITree.Interp.TranslateFacts]
E:24 [in ITree.Events.State]
E:240 [in ITree.Extra.ITrace.ITraceBind]
E:240 [in ITree.Extra.IForest]
E:244 [in ITree.Eq.Eqit]
E:244 [in ITree.Simple]
E:245 [in ITree.Eq.UpToTaus]
E:246 [in ITree.Extra.IForest]
E:248 [in ITree.Extra.Secure.SecureEqProgInsens]
e:249 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:25 [in ITree.Events.FailFacts]
E:25 [in ITree.Events.ExceptionFacts]
E:25 [in ITree.Core.KTreeFacts]
E:25 [in ITree.Extra.ITrace.ITraceDefinition]
E:25 [in ITree.Extra.ITrace.ITracePrefix]
E:25 [in ITree.Extra.Dijkstra.PureITreeBasics]
E:25 [in ITree.Extra.ITrace.ITracePreds]
E:25 [in ITree.Events.State]
E:250 [in ITree.Simple]
E:252 [in ITree.Extra.IForest]
E:253 [in ITree.Eq.UpToTaus]
E:253 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:253 [in ITree.Simple]
E:256 [in ITree.Extra.ITrace.ITraceBind]
E:257 [in ITree.Eq.UpToTaus]
E:258 [in ITree.Simple]
E:259 [in ITree.Extra.Secure.SecureEqProgInsens]
e:26 [in ITree.Extra.Secure.SecureEqProgInsens]
e:26 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:26 [in ITree.Extra.Secure.SecureEqHalt]
E:26 [in ITree.Props.Infinite]
e:26 [in ITree.Events.MapDefault]
E:26 [in ITree.Props.EuttNoRet]
E:26 [in ITree.Events.Writer]
E:26 [in ITree.Extra.ITrace.ITraceFacts]
e:26 [in ITree.Core.Subevent]
E:26 [in ITree.Simple]
E:261 [in ITree.Eq.UpToTaus]
E:261 [in ITree.Extra.IForest]
E:262 [in ITree.Simple]
E:264 [in ITree.Eq.Eqit]
E:264 [in ITree.Simple]
E:265 [in ITree.Eq.UpToTaus]
E:265 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:266 [in ITree.Simple]
e:267 [in ITree.Extra.IForest]
E:268 [in ITree.Extra.ITrace.ITraceBind]
E:268 [in ITree.Simple]
E:269 [in ITree.Eq.UpToTaus]
E:27 [in ITree.Props.HasPost]
E:27 [in ITree.Events.FailFacts]
E:27 [in ITree.Props.Finite]
E:27 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:27 [in ITree.Core.Subevent]
E:27 [in ITree.Interp.TranslateFacts]
E:27 [in ITree.Events.MapDefaultFacts]
e:271 [in ITree.Simple]
E:272 [in ITree.Simple]
E:273 [in ITree.Extra.IForest]
E:275 [in ITree.Simple]
E:277 [in ITree.Extra.Secure.SecureEqProgInsens]
E:278 [in ITree.Extra.ITrace.ITraceBind]
E:278 [in ITree.Eq.UpToTaus]
E:278 [in ITree.Simple]
e:279 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e:279 [in ITree.Extra.Secure.SecureEqEuttHalt]
e:28 [in ITree.Extra.IForest]
E:28 [in ITree.Events.ExceptionFacts]
E:28 [in ITree.Props.Leaf]
e:28 [in ITree.Extra.Dijkstra.ITreeDijkstra]
e:28 [in ITree.Interp.Traces]
e:28 [in ITree.Extra.ITrace.ITraceFacts]
E:28 [in ITree.Eq.Shallow]
E:28 [in ITree.Interp.InterpFacts]
E:28 [in ITree.Extra.Dijkstra.PureITreeBasics]
E:28 [in ITree.Core.ITreeDefinition]
E:281 [in ITree.Extra.IForest]
E:281 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:282 [in ITree.Basics.HeterogeneousRelations]
E:284 [in ITree.Eq.UpToTaus]
E:286 [in ITree.Extra.IForest]
E:288 [in ITree.Extra.ITrace.ITraceBind]
E:29 [in ITree.Extra.ITrace.ITraceBind]
E:29 [in ITree.Events.FailFacts]
E:29 [in ITree.Props.Infinite]
E:29 [in ITree.Events.MapDefault]
E:29 [in ITree.Extra.ITrace.ITracePreds]
e:290 [in ITree.Eq.Eqit]
E:291 [in ITree.Eq.UpToTaus]
e:292 [in ITree.Extra.Dijkstra.ITreeDijkstra]
E:296 [in ITree.Eq.Eqit]
E:298 [in ITree.Eq.UpToTaus]
E:3 [in ITree.Extra.ITrace.ITraceBind]
E:3 [in ITree.Extra.IForest]
e:3 [in ITree.Basics.Basics]
E:3 [in ITree.Events.Nondeterminism]
E:3 [in ITree.Indexed.Function]
E:3 [in ITree.Core.ITreeMonad]
E:3 [in ITree.Extra.Secure.SecureEqWcompat]
E:3 [in ITree.Eq.Eqit]
E:30 [in ITree.Events.StateFacts]
e:30 [in ITree.Interp.Recursion]
E:30 [in ITree.Props.Finite]
E:30 [in ITree.Eq.SimUpToTaus]
E:30 [in ITree.Interp.Handler]
E:30 [in ITree.Extra.Dijkstra.PureITreeBasics]
E:300 [in ITree.Eq.Eqit]
E:301 [in ITree.Extra.Secure.SecureEqProgInsens]
E:302 [in ITree.Extra.ITrace.ITraceBind]
E:303 [in ITree.Extra.Secure.SecureEqEuttHalt]
e:304 [in ITree.Eq.Eqit]
E:305 [in ITree.Eq.UpToTaus]
E:307 [in ITree.Extra.IForest]
E:308 [in ITree.Eq.Eqit]
E:309 [in ITree.Extra.ITrace.ITraceBind]
E:31 [in ITree.Eq.UpToTaus]
E:31 [in ITree.Events.FailFacts]
E:31 [in ITree.Events.ExceptionFacts]
E:31 [in ITree.Props.Infinite]
e:31 [in ITree.Extra.ITrace.ITraceDefinition]
e:31 [in ITree.Interp.Handler]
E:31 [in ITree.Extra.ITrace.ITracePrefix]
e:31 [in ITree.Interp.Traces]
e:31 [in ITree.Core.Subevent]
E:31 [in ITree.Interp.RecursionFacts]
E:312 [in ITree.Eq.UpToTaus]
E:313 [in ITree.Eq.Eqit]
E:315 [in ITree.Extra.ITrace.ITraceBind]
E:315 [in ITree.Eq.UpToTaus]
e:316 [in ITree.Extra.IForest]
E:317 [in ITree.Extra.IForest]
E:317 [in ITree.Extra.Secure.SecureEqEuttHalt]
e:32 [in ITree.Extra.Secure.SecureEqProgInsens]
e:32 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:32 [in ITree.Extra.Secure.SecureEqHalt]
E:32 [in ITree.Props.HasPost]
E:32 [in ITree.Extra.IForest]
e:32 [in ITree.Extra.Secure.SecureEqEuttTrans]
E:32 [in ITree.Props.Leaf]
E:32 [in ITree.Interp.Handler]
E:32 [in ITree.Props.EuttNoRet]
E:32 [in ITree.Extra.ITrace.ITraceFacts]
E:32 [in ITree.Core.Subevent]
E:32 [in ITree.Interp.RecursionFacts]
E:32 [in ITree.Simple]
E:32 [in ITree.Extra.Secure.SecureStateHandlerPi]
E:321 [in ITree.Eq.Eqit]
E:322 [in ITree.Extra.ITrace.ITraceBind]
E:322 [in ITree.Extra.IForest]
E:327 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:328 [in ITree.Extra.IForest]
E:33 [in ITree.Events.FailFacts]
E:33 [in ITree.Props.Finite]
E:33 [in ITree.Interp.InterpFacts]
e:33 [in ITree.Events.State]
E:330 [in ITree.Extra.ITrace.ITraceBind]
e:334 [in ITree.Extra.ITrace.ITraceBind]
E:334 [in ITree.Eq.Eqit]
E:335 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:336 [in ITree.Extra.IForest]
E:34 [in ITree.Events.FailFacts]
E:34 [in ITree.Extra.Secure.SecureEqEuttTrans]
E:34 [in ITree.Eq.SimUpToTaus]
e:34 [in ITree.Extra.ITrace.ITraceDefinition]
E:34 [in ITree.Interp.Handler]
E:34 [in ITree.Extra.ITrace.ITracePrefix]
E:34 [in ITree.Extra.ITrace.ITraceFacts]
E:34 [in ITree.Interp.TranslateFacts]
E:34 [in ITree.Extra.Dijkstra.PureITreeBasics]
e:341 [in ITree.Eq.Eqit]
E:343 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:345 [in ITree.Extra.IForest]
E:345 [in ITree.Eq.Eqit]
E:35 [in ITree.Events.ExceptionFacts]
e:35 [in ITree.Events.StateFacts]
E:35 [in ITree.Interp.Traces]
E:35 [in ITree.Core.ITreeDefinition]
E:352 [in ITree.Eq.Eqit]
E:359 [in ITree.Eq.Eqit]
e:36 [in ITree.Interp.Recursion]
e:36 [in ITree.Props.Finite]
E:36 [in ITree.Props.Leaf]
E:36 [in ITree.Extra.ITrace.ITraceDefinition]
E:36 [in ITree.Interp.TranslateFacts]
E:36 [in ITree.Interp.RecursionFacts]
E:36 [in ITree.Extra.ITrace.ITracePreds]
e:36 [in ITree.Simple]
E:367 [in ITree.Eq.Eqit]
E:37 [in ITree.Props.HasPost]
E:37 [in ITree.Interp.Handler]
E:37 [in ITree.Extra.ITrace.ITracePrefix]
E:37 [in ITree.Props.EuttNoRet]
e:37 [in ITree.Extra.Secure.SecureEqBind]
e:37 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:37 [in ITree.Events.State]
E:374 [in ITree.Extra.IForest]
E:378 [in ITree.Eq.Eqit]
e:38 [in ITree.Extra.Secure.SecureEqProgInsens]
E:38 [in ITree.Eq.UpToTaus]
E:38 [in ITree.Extra.IForest]
E:38 [in ITree.Interp.Traces]
E:38 [in ITree.Extra.ITrace.ITraceFacts]
e:38 [in ITree.Interp.InterpFacts]
e:38 [in ITree.Core.Subevent]
E:38 [in ITree.Interp.TranslateFacts]
E:382 [in ITree.Eq.Eqit]
E:384 [in ITree.Extra.IForest]
E:386 [in ITree.Eq.Eqit]
e:39 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:39 [in ITree.Extra.Secure.SecureEqHalt]
E:39 [in ITree.Events.ExceptionFacts]
E:39 [in ITree.Props.Finite]
e:39 [in ITree.Props.Infinite]
e:39 [in ITree.Props.Leaf]
E:39 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:393 [in ITree.Eq.Eqit]
e:394 [in ITree.Basics.CategoryFacts]
E:398 [in ITree.Extra.IForest]
e:4 [in ITree.Interp.Handler]
E:4 [in ITree.Events.Reader]
E:4 [in ITree.Core.ITreeMonad]
E:4 [in ITree.Props.Cofinite]
E:40 [in ITree.Extra.ITrace.ITraceBind]
E:40 [in ITree.Events.FailFacts]
E:40 [in ITree.Events.StateFacts]
E:40 [in ITree.Core.KTreeFacts]
e:40 [in ITree.Eq.SimUpToTaus]
E:40 [in ITree.Interp.Handler]
E:40 [in ITree.Extra.ITrace.ITracePreds]
e:40 [in ITree.Extra.Secure.SecureStateHandlerPi]
e:400 [in ITree.Extra.IForest]
E:400 [in ITree.Eq.Eqit]
E:402 [in ITree.Extra.IForest]
E:403 [in ITree.Eq.Eqit]
E:406 [in ITree.Eq.Eqit]
E:407 [in ITree.Extra.IForest]
E:41 [in ITree.Props.Infinite]
e:41 [in ITree.Extra.ITrace.ITracePrefix]
e:41 [in ITree.Interp.HandlerFacts]
E:41 [in ITree.Extra.Secure.SecureEqBind]
E:41 [in ITree.Extra.Secure.SecureEqWcompat]
E:41 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:41 [in ITree.Interp.InterpFacts]
E:41 [in ITree.Interp.TranslateFacts]
E:41 [in ITree.Interp.RecursionFacts]
E:41 [in ITree.Simple]
E:411 [in ITree.Extra.IForest]
E:42 [in ITree.Props.HasPost]
e:42 [in ITree.Interp.Recursion]
E:42 [in ITree.Props.Finite]
e:42 [in ITree.Extra.ITrace.ITraceDefinition]
E:42 [in ITree.Props.EuttNoRet]
E:42 [in ITree.Events.MapDefaultFacts]
E:420 [in ITree.Extra.IForest]
E:428 [in ITree.Extra.IForest]
E:428 [in ITree.Eq.Eqit]
E:43 [in ITree.Events.ExceptionFacts]
E:43 [in ITree.Interp.Handler]
e:43 [in ITree.Interp.HandlerFacts]
E:43 [in ITree.Interp.Traces]
E:43 [in ITree.Extra.ITrace.ITraceFacts]
E:435 [in ITree.Extra.IForest]
e:437 [in ITree.Basics.CategoryFacts]
e:439 [in ITree.Extra.IForest]
E:44 [in ITree.Interp.Recursion]
E:44 [in ITree.Eq.SimUpToTaus]
E:44 [in ITree.Extra.ITrace.ITraceDefinition]
E:44 [in ITree.Interp.TranslateFacts]
E:44 [in ITree.Extra.ITrace.ITracePreds]
E:44 [in ITree.Core.ITreeDefinition]
E:443 [in ITree.Extra.IForest]
E:445 [in ITree.Eq.Eqit]
e:446 [in ITree.Extra.IForest]
E:45 [in ITree.Eq.UpToTaus]
E:45 [in ITree.Props.HasPost]
E:45 [in ITree.Props.Finite]
E:45 [in ITree.Props.Infinite]
e:45 [in ITree.Interp.HandlerFacts]
e:45 [in ITree.Extra.Secure.SecureStateHandler]
e:45 [in ITree.Interp.InterpFacts]
E:450 [in ITree.Extra.IForest]
E:450 [in ITree.Eq.Eqit]
E:454 [in ITree.Extra.IForest]
E:454 [in ITree.Eq.Eqit]
E:458 [in ITree.Extra.IForest]
E:458 [in ITree.Eq.Eqit]
E:46 [in ITree.Eq.Shallow]
E:46 [in ITree.Interp.InterpFacts]
E:46 [in ITree.Interp.TranslateFacts]
e:46 [in ITree.Events.State]
E:46 [in ITree.Simple]
e:46 [in ITree.Extra.Secure.SecureStateHandlerPi]
E:461 [in ITree.Eq.Eqit]
E:464 [in ITree.Eq.Eqit]
E:466 [in ITree.Extra.IForest]
E:467 [in ITree.Eq.Eqit]
E:47 [in ITree.Events.FailFacts]
e:47 [in ITree.Events.ExceptionFacts]
E:47 [in ITree.Events.StateFacts]
E:47 [in ITree.Props.EuttNoRet]
e:47 [in ITree.Interp.HandlerFacts]
E:47 [in ITree.Interp.Traces]
E:47 [in ITree.Events.MapDefaultFacts]
E:47 [in ITree.Interp.RecursionFacts]
E:476 [in ITree.Extra.IForest]
e:48 [in ITree.Props.Finite]
E:48 [in ITree.Extra.ITrace.ITraceDefinition]
E:48 [in ITree.Extra.ITrace.ITracePrefix]
E:48 [in ITree.Extra.Secure.SecureEqWcompat]
E:48 [in ITree.Extra.Secure.SecureStateHandler]
E:48 [in ITree.Extra.ITrace.ITraceFacts]
E:48 [in ITree.Interp.InterpFacts]
E:48 [in ITree.Interp.TranslateFacts]
E:48 [in ITree.Interp.RecursionFacts]
E:482 [in ITree.Extra.IForest]
E:485 [in ITree.Eq.Eqit]
E:487 [in ITree.Extra.IForest]
E:49 [in ITree.Extra.ITrace.ITraceBind]
E:49 [in ITree.Extra.IForest]
E:49 [in ITree.Events.ExceptionFacts]
E:49 [in ITree.Interp.Recursion]
e:49 [in ITree.Eq.SimUpToTaus]
E:49 [in ITree.Props.Leaf]
e:49 [in ITree.Interp.HandlerFacts]
E:493 [in ITree.Eq.Eqit]
E:5 [in ITree.Events.Map]
E:5 [in ITree.Eq.EuttExtras]
E:5 [in ITree.Events.Exception]
E:5 [in ITree.Interp.Handler]
E:5 [in ITree.Events.Writer]
E:5 [in ITree.Extra.ITrace.ITraceFacts]
E:5 [in ITree.Interp.InterpFacts]
E:5 [in ITree.Extra.Dijkstra.PureITreeBasics]
E:50 [in ITree.Extra.ITrace.ITraceDefinition]
E:50 [in ITree.Core.ITreeDefinition]
E:500 [in ITree.Extra.IForest]
E:508 [in ITree.Extra.IForest]
E:509 [in ITree.Eq.Eqit]
e:51 [in ITree.Events.StateFacts]
E:51 [in ITree.Props.Finite]
e:51 [in ITree.Interp.HandlerFacts]
E:51 [in ITree.Interp.Traces]
E:51 [in ITree.Extra.ITrace.ITraceFacts]
e:51 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:51 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:51 [in ITree.Events.MapDefaultFacts]
e:51 [in ITree.Extra.Secure.SecureStateHandlerPi]
E:512 [in ITree.Extra.IForest]
E:515 [in ITree.Eq.Eqit]
E:517 [in ITree.Extra.IForest]
E:52 [in ITree.Eq.UpToTaus]
E:52 [in ITree.Props.HasPost]
E:52 [in ITree.Props.Infinite]
E:52 [in ITree.Interp.InterpFacts]
E:52 [in ITree.Interp.TranslateFacts]
e:52 [in ITree.Extra.ITrace.ITracePreds]
e:52 [in ITree.Core.ITreeDefinition]
E:520 [in ITree.Extra.IForest]
E:525 [in ITree.Extra.IForest]
E:53 [in ITree.Events.FailFacts]
e:53 [in ITree.Events.ExceptionFacts]
E:53 [in ITree.Interp.Recursion]
E:53 [in ITree.Eq.SimUpToTaus]
E:53 [in ITree.Events.State]
E:531 [in ITree.Extra.IForest]
E:531 [in ITree.Eq.Eqit]
E:537 [in ITree.Eq.Eqit]
E:539 [in ITree.Extra.IForest]
e:54 [in ITree.Extra.Secure.SecureEqProgInsens]
E:54 [in ITree.Props.Finite]
E:54 [in ITree.Props.Infinite]
E:54 [in ITree.Extra.ITrace.ITracePrefix]
E:54 [in ITree.Eq.Shallow]
E:54 [in ITree.Interp.InterpFacts]
e:54 [in ITree.Extra.ITrace.ITracePreds]
E:54 [in ITree.Core.ITreeDefinition]
e:54 [in ITree.Extra.Secure.SecureStateHandlerPi]
E:546 [in ITree.Extra.IForest]
E:55 [in ITree.Extra.ITrace.ITraceBind]
E:55 [in ITree.Events.ExceptionFacts]
E:55 [in ITree.Events.StateFacts]
e:55 [in ITree.Interp.HandlerFacts]
E:55 [in ITree.Interp.Traces]
E:55 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:55 [in ITree.Simple]
E:553 [in ITree.Eq.Eqit]
E:555 [in ITree.Extra.IForest]
E:559 [in ITree.Eq.Eqit]
E:56 [in ITree.Props.Infinite]
E:56 [in ITree.Extra.ITrace.ITraceFacts]
E:56 [in ITree.Interp.InterpFacts]
E:56 [in ITree.Extra.ITrace.ITracePreds]
E:56 [in ITree.Core.ITreeDefinition]
E:562 [in ITree.Extra.IForest]
E:563 [in ITree.Eq.Eqit]
E:565 [in ITree.Eq.Eqit]
E:568 [in ITree.Extra.IForest]
e:57 [in ITree.Props.Finite]
e:57 [in ITree.Extra.Secure.SecureStateHandler]
E:57 [in ITree.Eq.Eqit]
E:572 [in ITree.Eq.Eqit]
E:573 [in ITree.Extra.IForest]
E:576 [in ITree.Extra.IForest]
E:579 [in ITree.Extra.IForest]
E:579 [in ITree.Eq.Eqit]
e:58 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:58 [in ITree.Extra.Secure.SecureEqHalt]
E:58 [in ITree.Events.FailFacts]
E:58 [in ITree.Eq.Shallow]
E:58 [in ITree.Events.MapDefaultFacts]
E:584 [in ITree.Extra.IForest]
E:586 [in ITree.Extra.IForest]
E:587 [in ITree.Eq.Eqit]
e:59 [in ITree.Extra.ITrace.ITraceBind]
e:59 [in ITree.Events.StateFacts]
E:59 [in ITree.Eq.SimUpToTaus]
E:59 [in ITree.Interp.Traces]
E:59 [in ITree.Core.ITreeDefinition]
E:590 [in ITree.Extra.IForest]
E:593 [in ITree.Extra.IForest]
E:598 [in ITree.Extra.IForest]
E:598 [in ITree.Eq.Eqit]
E:6 [in ITree.Eq.EqAxiom]
E:6 [in ITree.Extra.IForest]
E:6 [in ITree.Events.ExceptionFacts]
E:6 [in ITree.Interp.Handler]
E:6 [in ITree.Events.MapDefault]
E:6 [in ITree.Events.Reader]
E:6 [in ITree.Events.Concurrency]
E:60 [in ITree.Extra.IForest]
E:60 [in ITree.Events.ExceptionFacts]
E:60 [in ITree.Extra.Secure.SecureEqBind]
E:60 [in ITree.Extra.Secure.SecureStateHandler]
E:60 [in ITree.Extra.ITrace.ITraceFacts]
E:60 [in ITree.Interp.TranslateFacts]
E:603 [in ITree.Eq.Eqit]
E:608 [in ITree.Eq.Eqit]
e:61 [in ITree.Extra.Secure.SecureEqProgInsens]
E:61 [in ITree.Extra.ITrace.ITraceBind]
e:61 [in ITree.Extra.ITrace.ITracePrefix]
e:61 [in ITree.Interp.HandlerFacts]
E:61 [in ITree.Interp.InterpFacts]
E:61 [in ITree.Extra.ITrace.ITracePreds]
e:612 [in ITree.Eq.Eqit]
E:616 [in ITree.Eq.Eqit]
e:619 [in ITree.Eq.Eqit]
E:62 [in ITree.Events.FailFacts]
E:62 [in ITree.Events.StateFacts]
E:62 [in ITree.Props.EuttNoRet]
E:62 [in ITree.Simple]
e:62 [in ITree.Extra.Secure.SecureStateHandlerPi]
E:622 [in ITree.Eq.Eqit]
E:63 [in ITree.Props.Leaf]
E:630 [in ITree.Eq.Eqit]
E:634 [in ITree.Eq.Eqit]
E:64 [in ITree.Props.HasPost]
E:64 [in ITree.Core.KTreeFacts]
e:64 [in ITree.Props.Infinite]
E:64 [in ITree.Eq.Shallow]
E:64 [in ITree.Extra.ITrace.ITracePreds]
E:64 [in ITree.Extra.Secure.SecureStateHandlerPi]
E:65 [in ITree.Eq.SimUpToTaus]
E:65 [in ITree.Interp.InterpFacts]
E:65 [in ITree.Extra.Secure.SecureEqEuttHalt]
e:65 [in ITree.Interp.TranslateFacts]
e:654 [in ITree.Eq.Eqit]
e:66 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:66 [in ITree.Extra.Secure.SecureEqHalt]
E:66 [in ITree.Props.Finite]
E:66 [in ITree.Extra.ITrace.ITracePrefix]
E:66 [in ITree.Extra.Secure.SecureStateHandler]
E:66 [in ITree.Extra.ITrace.ITraceFacts]
E:67 [in ITree.Extra.ITrace.ITraceBind]
E:67 [in ITree.Events.FailFacts]
E:67 [in ITree.Events.ExceptionFacts]
E:67 [in ITree.Core.KTreeFacts]
E:67 [in ITree.Props.EuttNoRet]
E:67 [in ITree.Extra.Secure.SecureEqWcompat]
E:67 [in ITree.Eq.Shallow]
E:67 [in ITree.Extra.ITrace.ITracePreds]
E:67 [in ITree.Core.ITreeDefinition]
E:68 [in ITree.Props.Infinite]
E:68 [in ITree.Core.ITreeDefinition]
E:68 [in ITree.Simple]
E:69 [in ITree.Props.Finite]
E:69 [in ITree.Interp.Traces]
E:695 [in ITree.Eq.Eqit]
E:699 [in ITree.Eq.Eqit]
E:7 [in ITree.Events.Map]
E:7 [in ITree.Props.HasPost]
E:7 [in ITree.Indexed.Function]
E:7 [in ITree.Interp.Traces]
e:7 [in ITree.Extra.ITrace.ITraceFacts]
E:70 [in ITree.Events.FailFacts]
E:70 [in ITree.Props.Infinite]
E:70 [in ITree.Extra.Secure.SecureStateHandler]
E:703 [in ITree.Eq.Eqit]
E:71 [in ITree.Eq.SimUpToTaus]
E:71 [in ITree.Props.Leaf]
E:71 [in ITree.Extra.ITrace.ITracePrefix]
E:71 [in ITree.Props.EuttNoRet]
E:718 [in ITree.Eq.Eqit]
e:72 [in ITree.Props.Finite]
E:72 [in ITree.Eq.Shallow]
E:72 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:73 [in ITree.Extra.IForest]
E:73 [in ITree.Events.StateFacts]
E:73 [in ITree.Props.Infinite]
E:73 [in ITree.Props.Leaf]
E:73 [in ITree.Extra.Secure.SecureStateHandler]
E:733 [in ITree.Eq.Eqit]
E:738 [in ITree.Eq.Eqit]
e:74 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
E:74 [in ITree.Extra.ITrace.ITraceBind]
e:74 [in ITree.Extra.Secure.SecureEqHalt]
E:74 [in ITree.Events.ExceptionFacts]
E:74 [in ITree.Props.EuttNoRet]
E:74 [in ITree.Core.ITreeDefinition]
E:74 [in ITree.Simple]
E:743 [in ITree.Eq.Eqit]
E:75 [in ITree.Events.FailFacts]
E:75 [in ITree.Core.KTreeFacts]
E:75 [in ITree.Interp.Traces]
E:75 [in ITree.Extra.ITrace.ITraceFacts]
E:758 [in ITree.Eq.Eqit]
E:76 [in ITree.Props.HasPost]
E:76 [in ITree.Interp.InterpFacts]
e:76 [in ITree.Extra.ITrace.ITracePreds]
E:76 [in ITree.Core.ITreeDefinition]
E:763 [in ITree.Eq.Eqit]
E:767 [in ITree.Eq.Eqit]
E:77 [in ITree.Extra.ITrace.ITraceBind]
E:77 [in ITree.Eq.SimUpToTaus]
E:77 [in ITree.Props.Infinite]
E:77 [in ITree.Extra.ITrace.ITracePrefix]
E:77 [in ITree.Props.EuttNoRet]
E:77 [in ITree.Extra.Secure.SecureStateHandler]
E:77 [in ITree.Eq.Shallow]
E:77 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:773 [in ITree.Eq.Eqit]
E:78 [in ITree.Core.KTreeFacts]
E:78 [in ITree.Extra.Secure.SecureEqBind]
E:781 [in ITree.Eq.Eqit]
E:789 [in ITree.Eq.Eqit]
e:79 [in ITree.Events.FailFacts]
E:79 [in ITree.Extra.IForest]
e:79 [in ITree.Events.ExceptionFacts]
E:79 [in ITree.Events.StateFacts]
E:79 [in ITree.Interp.Traces]
E:79 [in ITree.Interp.InterpFacts]
e:79 [in ITree.Simple]
E:797 [in ITree.Eq.Eqit]
E:8 [in ITree.Interp.Recursion]
e:8 [in ITree.Events.Exception]
e:8 [in ITree.Events.Reader]
E:8 [in ITree.Props.EuttNoRet]
E:8 [in ITree.Events.Dependent]
E:8 [in ITree.Indexed.FunctionFacts]
E:8 [in ITree.Indexed.Sum]
e:80 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
e:80 [in ITree.Extra.Secure.SecureEqHalt]
E:80 [in ITree.Props.Leaf]
E:80 [in ITree.Extra.ITrace.ITraceFacts]
e:80 [in ITree.Extra.ITrace.ITracePreds]
E:80 [in ITree.Core.ITreeDefinition]
E:80 [in ITree.Eq.Eqit]
E:805 [in ITree.Eq.Eqit]
E:81 [in ITree.Events.ExceptionFacts]
E:81 [in ITree.Props.Finite]
e:81 [in ITree.Eq.Shallow]
E:810 [in ITree.Eq.Eqit]
E:815 [in ITree.Eq.Eqit]
E:82 [in ITree.Props.HasPost]
E:82 [in ITree.Extra.IForest]
E:82 [in ITree.Extra.ITrace.ITracePrefix]
E:82 [in ITree.Extra.ITrace.ITraceFacts]
E:826 [in ITree.Eq.Eqit]
E:83 [in ITree.Extra.ITrace.ITraceBind]
E:83 [in ITree.Eq.SimUpToTaus]
E:83 [in ITree.Props.Infinite]
E:83 [in ITree.Interp.Traces]
E:83 [in ITree.Extra.ITrace.ITracePreds]
E:83 [in ITree.Simple]
E:833 [in ITree.Eq.Eqit]
E:84 [in ITree.Events.StateFacts]
E:846 [in ITree.Eq.Eqit]
E:85 [in ITree.Events.FailFacts]
E:85 [in ITree.Core.KTreeFacts]
E:85 [in ITree.Extra.ITrace.ITraceFacts]
E:85 [in ITree.Eq.Shallow]
E:85 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
e:853 [in ITree.Eq.Eqit]
E:86 [in ITree.Core.KTreeFacts]
E:86 [in ITree.Extra.Secure.SecureEqWcompat]
E:86 [in ITree.Extra.Secure.SecureStateHandler]
e:86 [in ITree.Interp.InterpFacts]
E:860 [in ITree.Eq.Eqit]
e:864 [in ITree.Eq.Eqit]
e:87 [in ITree.Extra.IForest]
E:87 [in ITree.Core.KTreeFacts]
E:87 [in ITree.Props.Infinite]
E:87 [in ITree.Basics.Basics]
E:87 [in ITree.Interp.Traces]
E:87 [in ITree.Interp.InterpFacts]
e:87 [in ITree.Simple]
E:871 [in ITree.Eq.Eqit]
e:875 [in ITree.Eq.Eqit]
E:88 [in ITree.Extra.IForest]
E:880 [in ITree.Eq.Eqit]
E:89 [in ITree.Extra.ITrace.ITraceBind]
E:89 [in ITree.Events.ExceptionFacts]
E:89 [in ITree.Eq.SimUpToTaus]
e:89 [in ITree.Extra.ITrace.ITracePrefix]
E:89 [in ITree.Extra.ITrace.ITraceFacts]
e:89 [in ITree.Extra.Secure.SecureEqEuttHalt]
E:89 [in ITree.Simple]
E:892 [in ITree.Eq.Eqit]
E:9 [in ITree.Events.Map]
e:9 [in ITree.Props.Infinite]
E:9 [in ITree.Events.MapDefault]
E:9 [in ITree.Events.Nondeterminism]
E:9 [in ITree.Events.Writer]
E:9 [in ITree.Events.Concurrency]
E:9 [in ITree.Interp.InterpFacts]
E:9 [in ITree.Interp.Interp]
E:9 [in ITree.Extra.Dijkstra.PureITreeBasics]
e:9 [in ITree.Core.ITreeDefinition]
E:90 [in ITree.Events.FailFacts]
E:900 [in ITree.Eq.Eqit]
E:908 [in ITree.Eq.Eqit]
E:91 [in ITree.Props.Infinite]
E:91 [in ITree.Interp.Traces]
E:91 [in ITree.Extra.ITrace.ITracePreds]
E:913 [in ITree.Eq.Eqit]
E:918 [in ITree.Eq.Eqit]
E:92 [in ITree.Extra.Secure.SecureEqEuttHalt]
e:923 [in ITree.Eq.Eqit]
E:925 [in ITree.Eq.Eqit]
E:93 [in ITree.Extra.ITrace.ITraceBind]
E:93 [in ITree.Props.Finite]
E:93 [in ITree.Props.Leaf]
E:93 [in ITree.Extra.Secure.SecureStateHandler]
E:93 [in ITree.Extra.ITrace.ITraceFacts]
E:93 [in ITree.Eq.Shallow]
e:930 [in ITree.Eq.Eqit]
E:94 [in ITree.Events.FailFacts]
E:94 [in ITree.Extra.ITrace.ITracePrefix]
e:94 [in ITree.Interp.InterpFacts]
E:95 [in ITree.Eq.SimUpToTaus]
e:95 [in ITree.Extra.Secure.SecureEqBind]
E:95 [in ITree.Interp.InterpFacts]
e:96 [in ITree.Extra.ITrace.ITraceBind]
e:96 [in ITree.Extra.Secure.SecureStateHandler]
e:96 [in ITree.Extra.ITrace.ITraceFacts]
E:96 [in ITree.Extra.ITrace.ITracePreds]
E:97 [in ITree.Extra.Secure.SecureEqProgInsens]
e:97 [in ITree.Events.FailFacts]
E:97 [in ITree.Eq.Shallow]
E:98 [in ITree.Eq.UpToTaus]
E:98 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
E:98 [in ITree.Simple]
E:99 [in ITree.Props.Finite]
e:99 [in ITree.Interp.Traces]

F

fa:166 [in ITree.Basics.CategoryFacts]
fa:18 [in ITree.Basics.Basics]
fb:167 [in ITree.Basics.CategoryFacts]
fb:293 [in ITree.Basics.CategoryFacts]
fc:294 [in ITree.Basics.CategoryFacts]
fg:152 [in ITree.Basics.CategoryTheory]
fg:191 [in ITree.Basics.CategoryTheory]
FINCHECK:148 [in ITree.Extra.Secure.SecureStateHandler]
FINCHECK:160 [in ITree.Extra.Secure.SecureStateHandler]
fmap:32 [in ITree.Basics.CategoryFunctor]
fmap:8 [in ITree.Basics.CategoryFunctor]
FM:17 [in ITree.Interp.Interp]
Fm:2 [in ITree.Events.FailFacts]
Fm:30 [in ITree.Basics.Basics]
FM:36 [in ITree.Events.FailFacts]
Fm:37 [in ITree.Basics.Basics]
FM:4 [in ITree.Events.State]
FromBif:27 [in ITree.Basics.CategorySub]
Fst_C:226 [in ITree.Basics.CategoryFacts]
Fst_C:210 [in ITree.Basics.CategoryTheory]
Fst_C:169 [in ITree.Basics.CategoryTheory]
Functor_id:40 [in ITree.Basics.CategoryFunctor]
f':20 [in ITree.Basics.CategoryFacts]
f':40 [in ITree.Basics.CategoryFacts]
f':53 [in ITree.Basics.CategoryTheory]
f':59 [in ITree.Basics.CategoryTheory]
f':81 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f0:16 [in ITree.Interp.HandlerFacts]
f0:30 [in ITree.Eq.Paco2]
f0:7 [in ITree.Eq.Paco2]
f1:102 [in ITree.Basics.CategoryKleisliFacts]
f1:110 [in ITree.Basics.CategoryTheory]
f1:16 [in ITree.Indexed.Relation]
f1:21 [in ITree.Indexed.Function]
f1:23 [in ITree.Extra.Dijkstra.DijkstraMonad]
f1:32 [in ITree.Eq.Paco2]
f1:7 [in ITree.Indexed.Relation]
f1:752 [in ITree.Eq.Eqit]
f1:9 [in ITree.Eq.Paco2]
f2:110 [in ITree.Basics.CategoryKleisliFacts]
f2:112 [in ITree.Basics.CategoryTheory]
f2:17 [in ITree.Indexed.Relation]
f2:22 [in ITree.Indexed.Function]
f2:24 [in ITree.Extra.Dijkstra.DijkstraMonad]
f2:753 [in ITree.Eq.Eqit]
f2:8 [in ITree.Indexed.Relation]
f:1 [in ITree.Basics.CategoryRelations]
f:10 [in ITree.Basics.CategoryKleisliFacts]
F:10 [in ITree.Interp.InterpFacts]
F:10 [in ITree.Interp.Interp]
f:101 [in ITree.Simple]
F:102 [in ITree.Events.FailFacts]
F:102 [in ITree.Interp.InterpFacts]
f:103 [in ITree.Interp.InterpFacts]
f:104 [in ITree.Extra.Dijkstra.StateDelaySpec]
f:105 [in ITree.Simple]
F:106 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:107 [in ITree.Extra.ITrace.ITracePreds]
F:108 [in ITree.Events.StateFacts]
F:108 [in ITree.Extra.Dijkstra.ITreeDijkstra]
F:108 [in ITree.Interp.InterpFacts]
f:109 [in ITree.Interp.InterpFacts]
F:11 [in ITree.Events.StateFacts]
f:11 [in ITree.Basics.CategoryKleisli]
F:11 [in ITree.Indexed.Function]
f:11 [in ITree.Indexed.FunctionFacts]
f:11 [in ITree.Interp.RecursionFacts]
f:110 [in ITree.Basics.CategoryOps]
F:111 [in ITree.Events.FailFacts]
f:111 [in ITree.Simple]
f:112 [in ITree.Core.KTreeFacts]
f:114 [in ITree.Extra.Dijkstra.StateDelaySpec]
F:114 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:116 [in ITree.Extra.IForest]
F:116 [in ITree.Extra.ITrace.ITracePreds]
f:116 [in ITree.Simple]
F:118 [in ITree.Interp.InterpFacts]
f:119 [in ITree.Interp.InterpFacts]
f:12 [in ITree.Indexed.Function]
F:12 [in ITree.Interp.InterpFacts]
F:12 [in ITree.Events.Dependent]
f:12 [in ITree.Basics.CategorySub]
f:123 [in ITree.Core.KTreeFacts]
F:126 [in ITree.Interp.InterpFacts]
F:127 [in ITree.Extra.IForest]
f:127 [in ITree.Interp.InterpFacts]
f:128 [in ITree.Basics.CategoryFacts]
F:130 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:131 [in ITree.Events.StateFacts]
f:132 [in ITree.Basics.CategoryFacts]
F:135 [in ITree.Extra.IForest]
F:136 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:136 [in ITree.Basics.CategoryTheory]
f:137 [in ITree.Basics.CategoryFacts]
f:138 [in ITree.Basics.CategoryOps]
F:14 [in ITree.Interp.Handler]
F:14 [in ITree.Indexed.Function]
f:14 [in ITree.Interp.InterpFacts]
f:14 [in ITree.Events.Dependent]
f:14 [in ITree.Basics.CategoryTheory]
f:140 [in ITree.Eq.UpToTaus]
F:140 [in ITree.Extra.IForest]
F:141 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:143 [in ITree.Basics.CategoryTheory]
F:146 [in ITree.Simple]
f:147 [in ITree.Basics.CategoryFacts]
f:147 [in ITree.Simple]
F:148 [in ITree.Extra.IForest]
F:148 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:15 [in ITree.Extra.IForest]
f:15 [in ITree.Props.EuttNoRet]
f:150 [in ITree.Basics.CategoryTheory]
F:152 [in ITree.Extra.IForest]
f:153 [in ITree.Basics.CategoryFacts]
F:157 [in ITree.Events.StateFacts]
f:159 [in ITree.Events.StateFacts]
f:159 [in ITree.Basics.CategoryFacts]
f:16 [in ITree.Basics.Function]
f:16 [in ITree.Basics.CategoryKleisli]
f:16 [in ITree.Basics.Basics]
F:16 [in ITree.Interp.Handler]
F:16 [in ITree.Interp.TranslateFacts]
F:161 [in ITree.Extra.IForest]
F:164 [in ITree.Extra.Dijkstra.ITreeDijkstra]
F:167 [in ITree.Extra.IForest]
F:168 [in ITree.Events.StateFacts]
f:17 [in ITree.Basics.Monad]
f:170 [in ITree.Events.StateFacts]
F:171 [in ITree.Extra.Dijkstra.ITreeDijkstra]
f:175 [in ITree.Basics.CategoryTheory]
f:177 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:18 [in ITree.Events.StateFacts]
F:18 [in ITree.Interp.Handler]
F:18 [in ITree.Core.Subevent]
F:181 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:182 [in ITree.Extra.IForest]
f:182 [in ITree.Basics.CategoryTheory]
f:185 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:187 [in ITree.Extra.IForest]
f:189 [in ITree.Basics.CategoryTheory]
F:19 [in ITree.Indexed.Function]
f:19 [in ITree.Basics.CategoryFacts]
F:19 [in ITree.Interp.InterpFacts]
F:19 [in ITree.Extra.ITrace.ITracePreds]
f:190 [in ITree.Basics.CategoryOps]
f:197 [in ITree.Extra.ITrace.ITraceBind]
f:198 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:198 [in ITree.Simple]
f:199 [in ITree.Extra.ITrace.ITraceFacts]
F:2 [in ITree.Events.StateFacts]
F:2 [in ITree.Indexed.Function]
F:2 [in ITree.Interp.InterpFacts]
F:2 [in ITree.Core.Subevent]
F:2 [in ITree.Interp.Interp]
F:2 [in ITree.Events.Dependent]
F:2 [in ITree.Interp.TranslateFacts]
F:2 [in ITree.Indexed.FunctionFacts]
f:20 [in ITree.Interp.Recursion]
f:20 [in ITree.Interp.Handler]
F:200 [in ITree.Extra.IForest]
f:200 [in ITree.Simple]
F:205 [in ITree.Simple]
f:207 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:207 [in ITree.Extra.ITrace.ITraceFacts]
f:207 [in ITree.Simple]
f:208 [in ITree.Extra.ITrace.ITraceBind]
f:21 [in ITree.Basics.CategoryFunctor]
f:21 [in ITree.Interp.HandlerFacts]
f:21 [in ITree.Interp.InterpFacts]
f:21 [in ITree.Basics.CategoryTheory]
F:210 [in ITree.Simple]
f:212 [in ITree.Simple]
F:215 [in ITree.Simple]
f:217 [in ITree.Simple]
f:219 [in ITree.Basics.CategoryTheory]
F:223 [in ITree.Simple]
f:225 [in ITree.Extra.ITrace.ITraceBind]
f:225 [in ITree.Extra.ITrace.ITraceFacts]
f:225 [in ITree.Simple]
F:226 [in ITree.Extra.IForest]
f:227 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:228 [in ITree.Simple]
F:23 [in ITree.Events.StateFacts]
F:23 [in ITree.Core.Subevent]
f:231 [in ITree.Simple]
f:235 [in ITree.Extra.ITrace.ITraceBind]
f:238 [in ITree.Simple]
F:239 [in ITree.Basics.HeterogeneousRelations]
f:24 [in ITree.Basics.Function]
F:24 [in ITree.Interp.InterpFacts]
f:24 [in ITree.Extra.Dijkstra.DelaySpecMonad]
F:241 [in ITree.Extra.IForest]
f:242 [in ITree.Simple]
F:247 [in ITree.Extra.IForest]
f:247 [in ITree.Simple]
F:25 [in ITree.Interp.Handler]
f:25 [in ITree.Basics.MonadState]
f:250 [in ITree.Extra.ITrace.ITraceBind]
f:251 [in ITree.Simple]
F:253 [in ITree.Extra.IForest]
f:255 [in ITree.Extra.ITrace.ITraceBind]
f:255 [in ITree.Basics.CategoryFacts]
f:257 [in ITree.Basics.CategoryTheory]
f:259 [in ITree.Basics.CategoryFacts]
f:26 [in ITree.Interp.InterpFacts]
F:262 [in ITree.Extra.IForest]
f:262 [in ITree.Basics.CategoryTheory]
f:264 [in ITree.Basics.CategoryFacts]
f:27 [in ITree.Events.StateFacts]
F:274 [in ITree.Extra.IForest]
f:274 [in ITree.Basics.CategoryFacts]
F:279 [in ITree.Simple]
f:28 [in ITree.Basics.Monad]
f:28 [in ITree.Interp.Handler]
F:28 [in ITree.Extra.ITrace.ITracePrefix]
f:28 [in ITree.Indexed.Function]
F:28 [in ITree.Core.Subevent]
f:28 [in ITree.Basics.HeterogeneousRelations]
F:28 [in ITree.Interp.TranslateFacts]
f:280 [in ITree.Basics.CategoryFacts]
f:280 [in ITree.Simple]
F:283 [in ITree.Basics.HeterogeneousRelations]
F:286 [in ITree.Extra.Dijkstra.ITreeDijkstra]
f:286 [in ITree.Basics.CategoryFacts]
f:29 [in ITree.Extra.Dijkstra.IterRel]
f:29 [in ITree.Basics.MonadState]
F:29 [in ITree.Interp.InterpFacts]
F:292 [in ITree.Extra.IForest]
f:293 [in ITree.Extra.ITrace.ITraceBind]
F:299 [in ITree.Extra.IForest]
F:3 [in ITree.Extra.Dijkstra.IterRel]
F:3 [in ITree.Extra.ITrace.ITracePreds]
f:306 [in ITree.Extra.IForest]
f:307 [in ITree.Extra.ITrace.ITraceBind]
F:308 [in ITree.Extra.IForest]
F:31 [in ITree.Events.StateFacts]
f:31 [in ITree.Basics.Basics]
F:31 [in ITree.Extra.Dijkstra.ITreeDijkstra]
f:31 [in ITree.Interp.InterpFacts]
f:31 [in ITree.Extra.Dijkstra.DelaySpecMonad]
f:314 [in ITree.Extra.ITrace.ITraceBind]
f:318 [in ITree.Extra.ITrace.ITraceBind]
f:32 [in ITree.Interp.TranslateFacts]
f:32 [in ITree.Basics.CategorySub]
f:327 [in ITree.Extra.ITrace.ITraceBind]
F:33 [in ITree.Props.Infinite]
F:33 [in ITree.Interp.Handler]
F:33 [in ITree.Core.Subevent]
F:34 [in ITree.Interp.Recursion]
f:34 [in ITree.Basics.MonadState]
F:34 [in ITree.Interp.InterpFacts]
f:35 [in ITree.Interp.Recursion]
F:35 [in ITree.Interp.Handler]
F:35 [in ITree.Interp.TranslateFacts]
f:35 [in ITree.Interp.RecursionFacts]
f:354 [in ITree.Basics.CategoryTheory]
f:36 [in ITree.Interp.Handler]
f:36 [in ITree.Extra.Dijkstra.StateSpecT]
f:36 [in ITree.Interp.InterpFacts]
f:360 [in ITree.Basics.CategoryTheory]
f:365 [in ITree.Basics.CategoryFacts]
f:367 [in ITree.Basics.CategoryTheory]
f:37 [in ITree.Basics.Function]
F:37 [in ITree.Interp.TranslateFacts]
f:37 [in ITree.Basics.CategoryTheory]
f:37 [in ITree.Basics.CategorySub]
f:371 [in ITree.Basics.CategoryFacts]
f:373 [in ITree.Basics.CategoryTheory]
f:377 [in ITree.Basics.CategoryFacts]
F:38 [in ITree.Interp.Handler]
f:38 [in ITree.Basics.CategoryFacts]
F:38 [in ITree.Events.State]
f:384 [in ITree.Basics.CategoryFacts]
f:386 [in ITree.Basics.CategoryTheory]
f:389 [in ITree.Basics.CategoryFacts]
f:39 [in ITree.Basics.CategoryKleisliFacts]
f:39 [in ITree.Interp.Handler]
f:39 [in ITree.Basics.MonadState]
F:39 [in ITree.Interp.TranslateFacts]
f:39 [in ITree.Interp.RecursionFacts]
F:4 [in ITree.Extra.ITrace.ITracePrefix]
F:4 [in ITree.Extra.Secure.StrongBisimProper]
F:4 [in ITree.Indexed.Function]
f:4 [in ITree.Extra.Dijkstra.PureITreeBasics]
F:40 [in ITree.Interp.Recursion]
f:40 [in ITree.Core.Subevent]
f:40 [in ITree.Events.State]
f:40 [in ITree.Basics.CategorySub]
F:41 [in ITree.Events.FailFacts]
F:41 [in ITree.Events.StateFacts]
f:41 [in ITree.Interp.Recursion]
F:41 [in ITree.Interp.Handler]
f:412 [in ITree.Basics.CategoryFacts]
f:419 [in ITree.Basics.CategoryFacts]
f:42 [in ITree.Basics.Function]
F:42 [in ITree.Interp.InterpFacts]
F:42 [in ITree.Interp.TranslateFacts]
f:425 [in ITree.Basics.CategoryFacts]
f:43 [in ITree.Events.FailFacts]
f:43 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:43 [in ITree.Extra.Dijkstra.StateSpecT]
f:43 [in ITree.Basics.CategoryTheory]
F:44 [in ITree.Interp.Handler]
f:44 [in ITree.Interp.InterpFacts]
f:44 [in ITree.Interp.RecursionFacts]
f:45 [in ITree.Basics.CategoryFunctor]
F:45 [in ITree.Extra.Dijkstra.ITreeDijkstra]
f:45 [in ITree.Basics.MonadState]
F:45 [in ITree.Interp.TranslateFacts]
f:46 [in ITree.Basics.CategoryKleisliFacts]
f:46 [in ITree.Props.EuttNoRet]
F:47 [in ITree.Interp.InterpFacts]
F:47 [in ITree.Interp.TranslateFacts]
f:47 [in ITree.Core.ITreeDefinition]
F:48 [in ITree.Events.FailFacts]
F:48 [in ITree.Events.StateFacts]
F:48 [in ITree.Extra.ITrace.ITracePreds]
f:49 [in ITree.Extra.Dijkstra.StateSpecT]
F:49 [in ITree.Interp.InterpFacts]
F:49 [in ITree.Interp.TranslateFacts]
f:5 [in ITree.Basics.Function]
f:5 [in ITree.Events.StateFacts]
f:5 [in ITree.Core.KTreeFacts]
F:5 [in ITree.Basics.CategoryFunctor]
F:5 [in ITree.Events.Concurrency]
f:50 [in ITree.Events.FailFacts]
f:50 [in ITree.Basics.MonadState]
f:51 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:51 [in ITree.Extra.Dijkstra.ITreeDijkstra]
F:51 [in ITree.Extra.ITrace.ITracePrefix]
f:51 [in ITree.Interp.InterpFacts]
f:51 [in ITree.Interp.TranslateFacts]
f:515 [in ITree.Extra.IForest]
f:52 [in ITree.Events.StateFacts]
f:52 [in ITree.Basics.CategoryKleisliFacts]
F:52 [in ITree.Extra.Secure.SecureStateHandler]
f:52 [in ITree.Basics.CategoryTheory]
F:53 [in ITree.Interp.InterpFacts]
F:53 [in ITree.Interp.TranslateFacts]
F:54 [in ITree.Events.FailFacts]
F:54 [in ITree.Events.State]
f:55 [in ITree.Extra.Dijkstra.DijkstraMonad]
F:55 [in ITree.Interp.InterpFacts]
F:56 [in ITree.Events.StateFacts]
f:56 [in ITree.Basics.CategoryFacts]
f:56 [in ITree.Interp.TranslateFacts]
F:56 [in ITree.Simple]
f:57 [in ITree.Interp.Recursion]
F:57 [in ITree.Core.KTreeFacts]
F:57 [in ITree.Interp.InterpFacts]
f:58 [in ITree.Basics.MonadState]
f:58 [in ITree.Basics.CategoryTheory]
f:58 [in ITree.Simple]
F:59 [in ITree.Events.FailFacts]
f:59 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
F:59 [in ITree.Extra.ITrace.ITracePreds]
f:6 [in ITree.Basics.CategoryOps]
f:6 [in ITree.Indexed.Function]
F:6 [in ITree.Interp.InterpFacts]
f:6 [in ITree.Extra.Dijkstra.DelaySpecMonad]
f:60 [in ITree.Events.StateFacts]
f:60 [in ITree.Interp.InterpFacts]
f:60 [in ITree.Basics.CategorySub]
F:61 [in ITree.Interp.TranslateFacts]
f:62 [in ITree.Basics.CategoryFacts]
F:62 [in ITree.Interp.InterpFacts]
f:625 [in ITree.Eq.Eqit]
F:63 [in ITree.Events.FailFacts]
F:63 [in ITree.Events.StateFacts]
F:63 [in ITree.Extra.Dijkstra.ITreeDijkstra]
f:63 [in ITree.Basics.MonadState]
F:63 [in ITree.Simple]
F:64 [in ITree.Extra.Secure.SecureStateHandler]
f:64 [in ITree.Interp.InterpFacts]
f:65 [in ITree.Simple]
F:66 [in ITree.Interp.InterpFacts]
f:67 [in ITree.Extra.Dijkstra.IterRel]
F:68 [in ITree.Events.FailFacts]
f:68 [in ITree.Events.StateFacts]
f:69 [in ITree.Interp.InterpFacts]
F:69 [in ITree.Simple]
f:7 [in ITree.Axioms]
f:7 [in ITree.Basics.CategoryKleisli]
F:7 [in ITree.Interp.Handler]
F:7 [in ITree.Events.Dependent]
F:70 [in ITree.Core.KTreeFacts]
F:70 [in ITree.Extra.Dijkstra.ITreeDijkstra]
f:70 [in ITree.Basics.MonadState]
f:70 [in ITree.Core.ITreeDefinition]
F:71 [in ITree.Events.FailFacts]
f:71 [in ITree.Simple]
f:72 [in ITree.Extra.ITrace.ITraceBind]
f:72 [in ITree.Core.ITreeDefinition]
f:73 [in ITree.Events.FailFacts]
f:73 [in ITree.Basics.CategoryTheory]
F:74 [in ITree.Events.StateFacts]
F:75 [in ITree.Simple]
F:76 [in ITree.Events.FailFacts]
F:77 [in ITree.Props.HasPost]
f:77 [in ITree.Simple]
f:770 [in ITree.Eq.Eqit]
f:78 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:785 [in ITree.Eq.Eqit]
f:793 [in ITree.Eq.Eqit]
f:8 [in ITree.Basics.Function]
F:8 [in ITree.Indexed.Function]
F:80 [in ITree.Events.StateFacts]
f:80 [in ITree.Basics.CategoryKleisliFacts]
F:80 [in ITree.Interp.InterpFacts]
f:803 [in ITree.Eq.Eqit]
f:808 [in ITree.Eq.Eqit]
f:81 [in ITree.Core.KTreeFacts]
f:813 [in ITree.Eq.Eqit]
F:83 [in ITree.Extra.IForest]
f:83 [in ITree.Interp.InterpFacts]
f:83 [in ITree.Basics.CategoryTheory]
F:84 [in ITree.Extra.Dijkstra.ITreeDijkstra]
F:84 [in ITree.Simple]
F:85 [in ITree.Events.StateFacts]
F:86 [in ITree.Events.FailFacts]
f:86 [in ITree.Simple]
f:87 [in ITree.Basics.CategoryKleisliFacts]
f:87 [in ITree.Basics.CategoryTheory]
f:88 [in ITree.Eq.Shallow]
F:88 [in ITree.Interp.InterpFacts]
F:89 [in ITree.Extra.IForest]
f:9 [in ITree.Events.FailFacts]
f:9 [in ITree.Interp.Handler]
f:9 [in ITree.Indexed.Function]
f:9 [in ITree.Basics.CategoryTheory]
F:9 [in ITree.Indexed.FunctionFacts]
f:9 [in ITree.Basics.CategorySub]
f:90 [in ITree.Interp.InterpFacts]
F:90 [in ITree.Simple]
F:91 [in ITree.Events.FailFacts]
f:91 [in ITree.Core.KTreeFacts]
F:91 [in ITree.Extra.Dijkstra.ITreeDijkstra]
f:92 [in ITree.Basics.CategoryKleisliFacts]
f:93 [in ITree.Simple]
F:95 [in ITree.Events.FailFacts]
F:95 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
f:96 [in ITree.Basics.CategoryKleisliFacts]
F:96 [in ITree.Interp.InterpFacts]
f:98 [in ITree.Events.FailFacts]
f:98 [in ITree.Interp.InterpFacts]
F:99 [in ITree.Extra.Dijkstra.ITreeDijkstra]

G

ga:168 [in ITree.Basics.CategoryFacts]
gb:169 [in ITree.Basics.CategoryFacts]
gb:295 [in ITree.Basics.CategoryFacts]
gc:296 [in ITree.Basics.CategoryFacts]
gf:25 [in ITree.Eq.Paco2]
gf:4 [in ITree.Eq.Paco2]
gH':131 [in ITree.Eq.UpToTaus]
gH':146 [in ITree.Eq.UpToTaus]
gH:10 [in ITree.Eq.UpToTaus]
gH:102 [in ITree.Eq.UpToTaus]
gH:105 [in ITree.Eq.UpToTaus]
gH:108 [in ITree.Eq.UpToTaus]
gH:113 [in ITree.Eq.UpToTaus]
gH:117 [in ITree.Eq.UpToTaus]
gH:126 [in ITree.Eq.UpToTaus]
gH:138 [in ITree.Eq.UpToTaus]
gH:162 [in ITree.Eq.UpToTaus]
gH:168 [in ITree.Eq.UpToTaus]
gH:174 [in ITree.Eq.UpToTaus]
gH:180 [in ITree.Eq.UpToTaus]
gH:186 [in ITree.Eq.UpToTaus]
gH:192 [in ITree.Eq.UpToTaus]
gH:198 [in ITree.Eq.UpToTaus]
gH:207 [in ITree.Eq.UpToTaus]
gH:218 [in ITree.Eq.UpToTaus]
gH:224 [in ITree.Eq.UpToTaus]
gH:230 [in ITree.Eq.UpToTaus]
gH:236 [in ITree.Eq.UpToTaus]
gH:244 [in ITree.Eq.UpToTaus]
gH:252 [in ITree.Eq.UpToTaus]
gH:28 [in ITree.Eq.UpToTaus]
gH:29 [in ITree.Eq.UpToTaus]
gH:30 [in ITree.Eq.UpToTaus]
gH:35 [in ITree.Eq.UpToTaus]
gH:42 [in ITree.Eq.UpToTaus]
gH:5 [in ITree.Eq.UpToTaus]
gH:63 [in ITree.Eq.UpToTaus]
gH:65 [in ITree.Eq.UpToTaus]
gH:96 [in ITree.Eq.UpToTaus]
gL':128 [in ITree.Eq.UpToTaus]
gL':142 [in ITree.Eq.UpToTaus]
gL:112 [in ITree.Eq.UpToTaus]
gL:116 [in ITree.Eq.UpToTaus]
gL:125 [in ITree.Eq.UpToTaus]
gL:137 [in ITree.Eq.UpToTaus]
gL:161 [in ITree.Eq.UpToTaus]
gL:167 [in ITree.Eq.UpToTaus]
gL:173 [in ITree.Eq.UpToTaus]
gL:179 [in ITree.Eq.UpToTaus]
gL:185 [in ITree.Eq.UpToTaus]
gL:191 [in ITree.Eq.UpToTaus]
gL:197 [in ITree.Eq.UpToTaus]
gL:206 [in ITree.Eq.UpToTaus]
gL:217 [in ITree.Eq.UpToTaus]
gL:223 [in ITree.Eq.UpToTaus]
gL:229 [in ITree.Eq.UpToTaus]
gL:243 [in ITree.Eq.UpToTaus]
gL:251 [in ITree.Eq.UpToTaus]
gL:9 [in ITree.Eq.UpToTaus]
g_spec:312 [in ITree.Extra.IForest]
g_spec:303 [in ITree.Extra.IForest]
g':23 [in ITree.Basics.CategoryFacts]
g':329 [in ITree.Extra.ITrace.ITraceBind]
g':42 [in ITree.Basics.CategoryFacts]
g':67 [in ITree.Extra.Dijkstra.TracesIT]
g0:17 [in ITree.Interp.HandlerFacts]
g1:103 [in ITree.Basics.CategoryKleisliFacts]
g1:111 [in ITree.Basics.CategoryKleisliFacts]
g1:111 [in ITree.Basics.CategoryTheory]
g2:104 [in ITree.Basics.CategoryKleisliFacts]
g2:112 [in ITree.Basics.CategoryKleisliFacts]
g2:113 [in ITree.Basics.CategoryTheory]
g:10 [in ITree.Interp.Handler]
g:111 [in ITree.Basics.CategoryOps]
g:124 [in ITree.Core.KTreeFacts]
g:133 [in ITree.Basics.CategoryFacts]
g:137 [in ITree.Basics.CategoryTheory]
g:138 [in ITree.Basics.CategoryFacts]
g:139 [in ITree.Basics.CategoryOps]
g:141 [in ITree.Eq.UpToTaus]
g:144 [in ITree.Basics.CategoryTheory]
g:148 [in ITree.Basics.CategoryFacts]
g:151 [in ITree.Basics.CategoryTheory]
g:153 [in ITree.Extra.ITrace.ITracePrefix]
g:154 [in ITree.Basics.CategoryFacts]
g:160 [in ITree.Basics.CategoryFacts]
g:17 [in ITree.Basics.Function]
g:17 [in ITree.Extra.Dijkstra.ITreeDijkstra]
g:170 [in ITree.Extra.ITrace.ITracePrefix]
g:176 [in ITree.Basics.CategoryTheory]
g:183 [in ITree.Basics.CategoryTheory]
G:19 [in ITree.Interp.Handler]
g:190 [in ITree.Basics.CategoryTheory]
g:2 [in ITree.Basics.CategoryRelations]
G:20 [in ITree.Indexed.Function]
g:200 [in ITree.Extra.ITrace.ITraceFacts]
g:208 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
g:208 [in ITree.Extra.ITrace.ITraceFacts]
g:21 [in ITree.Interp.Handler]
g:22 [in ITree.Basics.CategoryFunctor]
g:22 [in ITree.Basics.CategoryFacts]
g:22 [in ITree.Basics.CategoryTheory]
g:224 [in ITree.Extra.ITrace.ITraceFacts]
g:24 [in ITree.Interp.HandlerFacts]
g:25 [in ITree.Basics.Function]
G:26 [in ITree.Interp.Handler]
g:260 [in ITree.Basics.CategoryFacts]
g:265 [in ITree.Basics.CategoryFacts]
g:27 [in ITree.Extra.Dijkstra.TracesIT]
g:275 [in ITree.Basics.CategoryFacts]
g:28 [in ITree.Basics.CategoryKleisli]
g:281 [in ITree.Basics.CategoryFacts]
g:287 [in ITree.Basics.CategoryFacts]
g:29 [in ITree.Basics.Monad]
g:29 [in ITree.Interp.Handler]
g:29 [in ITree.Indexed.Function]
G:29 [in ITree.Interp.TranslateFacts]
g:30 [in ITree.Basics.MonadState]
G:300 [in ITree.Extra.IForest]
g:305 [in ITree.Extra.IForest]
g:308 [in ITree.Extra.ITrace.ITraceBind]
G:309 [in ITree.Extra.IForest]
g:31 [in ITree.Interp.TranslateFacts]
g:313 [in ITree.Extra.IForest]
g:33 [in ITree.Basics.CategorySub]
G:34 [in ITree.Core.Subevent]
g:35 [in ITree.Basics.MonadState]
g:36 [in ITree.Extra.Dijkstra.TracesIT]
g:361 [in ITree.Basics.CategoryTheory]
g:366 [in ITree.Basics.CategoryFacts]
g:368 [in ITree.Basics.CategoryTheory]
g:37 [in ITree.Eq.UpToTaus]
g:37 [in ITree.Extra.Dijkstra.StateSpecT]
g:372 [in ITree.Basics.CategoryFacts]
g:378 [in ITree.Basics.CategoryFacts]
g:38 [in ITree.Basics.CategorySub]
g:387 [in ITree.Basics.CategoryTheory]
g:39 [in ITree.Basics.CategoryFacts]
g:40 [in ITree.Basics.CategoryKleisliFacts]
g:40 [in ITree.Basics.MonadState]
g:413 [in ITree.Basics.CategoryFacts]
g:420 [in ITree.Basics.CategoryFacts]
g:426 [in ITree.Basics.CategoryFacts]
g:44 [in ITree.Eq.UpToTaus]
g:44 [in ITree.Extra.Dijkstra.DelaySpecMonad]
g:46 [in ITree.Basics.CategoryFunctor]
g:47 [in ITree.Basics.CategoryKleisliFacts]
g:49 [in ITree.Extra.Dijkstra.DelaySpecMonad]
g:53 [in ITree.Extra.Dijkstra.DelaySpecMonad]
g:55 [in ITree.Extra.Dijkstra.StateSpecT]
g:57 [in ITree.Basics.CategoryFacts]
g:59 [in ITree.Basics.CategoryKleisliFacts]
g:6 [in ITree.Core.KTreeFacts]
g:61 [in ITree.Basics.CategorySub]
G:62 [in ITree.Interp.TranslateFacts]
g:63 [in ITree.Basics.CategoryFacts]
g:64 [in ITree.Basics.MonadState]
g:66 [in ITree.Extra.Dijkstra.StateSpecT]
g:66 [in ITree.Extra.Dijkstra.DelaySpecMonad]
g:7 [in ITree.Basics.CategoryOps]
g:71 [in ITree.Basics.MonadState]
g:71 [in ITree.Extra.Dijkstra.DelaySpecMonad]
g:74 [in ITree.Basics.CategoryTheory]
g:76 [in ITree.Extra.Dijkstra.StateSpecT]
g:786 [in ITree.Eq.Eqit]
G:8 [in ITree.Interp.Handler]
G:81 [in ITree.Interp.InterpFacts]
g:82 [in ITree.Extra.Dijkstra.StateSpecT]
g:84 [in ITree.Interp.InterpFacts]
G:89 [in ITree.Interp.InterpFacts]
g:9 [in ITree.Basics.Function]
g:91 [in ITree.Interp.InterpFacts]
g:92 [in ITree.Core.KTreeFacts]

H

handler:6 [in ITree.Extra.Secure.SecureStateHandler]
handler:6 [in ITree.Extra.Secure.SecureStateHandlerPi]
Hb:122 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hcorec:125 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hcorec:9 [in ITree.Extra.Dijkstra.IterRel]
Hempty:181 [in ITree.Extra.ITrace.ITraceBind]
Hempty:261 [in ITree.Extra.ITrace.ITraceBind]
Hempty:283 [in ITree.Extra.ITrace.ITraceBind]
Hempty:35 [in ITree.Extra.ITrace.ITraceDefinition]
Hempty:8 [in ITree.Extra.ITrace.ITraceDefinition]
HEQP:5 [in ITree.Basics.MonadState]
Hf':83 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hhandler:170 [in ITree.Extra.Secure.SecureStateHandler]
Hhandler:63 [in ITree.Extra.Secure.SecureStateHandlerPi]
HK:114 [in ITree.Extra.IForest]
HK:419 [in ITree.Extra.IForest]
HM:4 [in ITree.Basics.MonadState]
HM:418 [in ITree.Extra.IForest]
Hp':16 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp':25 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp':9 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp0:63 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp0:67 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:105 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:113 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:129 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:135 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:140 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:147 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:15 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:158 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:167 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:172 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:180 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:195 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:214 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
HP:231 [in ITree.Extra.IForest]
Hp:24 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:45 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:53 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hp:60 [in ITree.Extra.Dijkstra.StateSpecT]
Hp:74 [in ITree.Extra.Dijkstra.DelaySpecMonad]
Hp:8 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hq:61 [in ITree.Extra.Dijkstra.StateSpecT]
Hq:76 [in ITree.Extra.Dijkstra.DelaySpecMonad]
Hrel:8 [in ITree.Extra.Dijkstra.IterRel]
Hreta:124 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Hretb:121 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
HRET:553 [in ITree.Extra.IForest]
HRinv:25 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
HRR:568 [in ITree.Eq.Eqit]
HRR:575 [in ITree.Eq.Eqit]
HRR:582 [in ITree.Eq.Eqit]
HRT:569 [in ITree.Eq.Eqit]
HRT:576 [in ITree.Eq.Eqit]
HRT:583 [in ITree.Eq.Eqit]
Hrutt:227 [in ITree.Extra.ITrace.ITraceBind]
Hrutt:73 [in ITree.Extra.ITrace.ITraceBind]
HR:197 [in ITree.Extra.IForest]
Hspin:119 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
HSUB:47 [in ITree.Core.KTreeFacts]
HS:104 [in ITree.Extra.IForest]
HS:159 [in ITree.Extra.IForest]
HS:63 [in ITree.Core.KTreeFacts]
HTA:111 [in ITree.Extra.IForest]
Ht1:148 [in ITree.Extra.ITrace.ITraceFacts]
Ht2:149 [in ITree.Extra.ITrace.ITraceFacts]
Ht:118 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
HT:198 [in ITree.Extra.IForest]
HXY:18 [in ITree.Extra.Dijkstra.StateIOTrace]
h_spec:310 [in ITree.Extra.IForest]
h_spec:275 [in ITree.Extra.IForest]
h_spec:263 [in ITree.Extra.IForest]
h_spec:254 [in ITree.Extra.IForest]
h_spec:248 [in ITree.Extra.IForest]
h_spec:242 [in ITree.Extra.IForest]
h_spec:227 [in ITree.Extra.IForest]
h_spec:201 [in ITree.Extra.IForest]
h_spec:188 [in ITree.Extra.IForest]
h_spec:183 [in ITree.Extra.IForest]
h_spec:168 [in ITree.Extra.IForest]
h_spec:162 [in ITree.Extra.IForest]
h_spec:153 [in ITree.Extra.IForest]
h_spec:149 [in ITree.Extra.IForest]
h_spec:141 [in ITree.Extra.IForest]
h_spec:136 [in ITree.Extra.IForest]
h_spec:128 [in ITree.Extra.IForest]
h_spec:117 [in ITree.Extra.IForest]
h_spec:91 [in ITree.Extra.IForest]
h_spec:84 [in ITree.Extra.IForest]
H0:10 [in ITree.Basics.CategoryFunctor]
H0:113 [in ITree.Basics.HeterogeneousRelations]
H0:120 [in ITree.Basics.HeterogeneousRelations]
H0:141 [in ITree.Extra.ITrace.ITraceFacts]
H0:192 [in ITree.Basics.HeterogeneousRelations]
H0:194 [in ITree.Basics.HeterogeneousRelations]
H0:195 [in ITree.Basics.CategoryOps]
H0:196 [in ITree.Basics.HeterogeneousRelations]
H0:198 [in ITree.Basics.HeterogeneousRelations]
H0:20 [in ITree.Basics.CategoryKleisli]
H0:200 [in ITree.Basics.HeterogeneousRelations]
H0:210 [in ITree.Basics.HeterogeneousRelations]
H0:26 [in ITree.Events.Nondeterminism]
H0:275 [in ITree.Basics.HeterogeneousRelations]
H0:34 [in ITree.Basics.CategoryFunctor]
H0:7 [in ITree.Basics.Monad]
h1_spec:293 [in ITree.Extra.IForest]
H1:11 [in ITree.Basics.CategoryFunctor]
H1:196 [in ITree.Basics.CategoryOps]
h1:295 [in ITree.Extra.IForest]
H1:33 [in ITree.Basics.CategoryKleisli]
H1:35 [in ITree.Basics.CategoryFunctor]
h2_spec:294 [in ITree.Extra.IForest]
H2:12 [in ITree.Basics.CategoryFunctor]
H2:197 [in ITree.Basics.CategoryOps]
h2:296 [in ITree.Extra.IForest]
H2:36 [in ITree.Basics.CategoryFunctor]
H3:13 [in ITree.Basics.CategoryFunctor]
H3:198 [in ITree.Basics.CategoryOps]
H3:37 [in ITree.Basics.CategoryFunctor]
H4:14 [in ITree.Basics.CategoryFunctor]
H4:203 [in ITree.Basics.CategoryOps]
H4:208 [in ITree.Basics.CategoryOps]
H4:213 [in ITree.Basics.CategoryOps]
H4:217 [in ITree.Basics.CategoryOps]
H4:219 [in ITree.Basics.CategoryOps]
H4:38 [in ITree.Basics.CategoryFunctor]
H5:209 [in ITree.Basics.CategoryOps]
H:10 [in ITree.Events.Map]
H:10 [in ITree.Events.Nondeterminism]
H:101 [in ITree.Eq.Eqit]
h:102 [in ITree.Extra.Dijkstra.ITreeDijkstra]
h:104 [in ITree.Extra.Dijkstra.ITreeDijkstra]
h:105 [in ITree.Events.FailFacts]
H:11 [in ITree.Events.MapDefault]
h:11 [in ITree.Interp.Interp]
H:112 [in ITree.Basics.HeterogeneousRelations]
h:114 [in ITree.Events.FailFacts]
h:117 [in ITree.Events.StateFacts]
H:119 [in ITree.Basics.HeterogeneousRelations]
H:12 [in ITree.Events.Map]
H:12 [in ITree.Core.Subevent]
H:12 [in ITree.Events.State]
H:123 [in ITree.Basics.HeterogeneousRelations]
H:13 [in ITree.Basics.CategoryKleisli]
h:137 [in ITree.Events.StateFacts]
h:14 [in ITree.Events.StateFacts]
H:14 [in ITree.Events.MapDefault]
H:14 [in ITree.Events.State]
H:17 [in ITree.Basics.Basics]
H:17 [in ITree.Extra.ITrace.ITracePrefix]
H:186 [in ITree.Basics.HeterogeneousRelations]
h:189 [in ITree.Extra.IForest]
H:19 [in ITree.Basics.CategoryKleisli]
h:19 [in ITree.Interp.TranslateFacts]
H:191 [in ITree.Basics.HeterogeneousRelations]
H:192 [in ITree.Extra.IForest]
H:193 [in ITree.Basics.HeterogeneousRelations]
H:194 [in ITree.Basics.CategoryOps]
H:195 [in ITree.Basics.HeterogeneousRelations]
h:195 [in ITree.Simple]
H:197 [in ITree.Basics.HeterogeneousRelations]
H:199 [in ITree.Basics.HeterogeneousRelations]
H:20 [in ITree.Events.MapDefault]
H:20 [in ITree.Core.Subevent]
h:20 [in ITree.Interp.Interp]
H:209 [in ITree.Basics.HeterogeneousRelations]
h:21 [in ITree.Events.StateFacts]
h:23 [in ITree.Basics.CategoryTheory]
H:24 [in ITree.Core.Subevent]
H:25 [in ITree.Events.Nondeterminism]
H:259 [in ITree.Extra.IForest]
H:27 [in ITree.Eq.SimUpToTaus]
H:27 [in ITree.Interp.Handler]
H:270 [in ITree.Extra.IForest]
H:274 [in ITree.Basics.HeterogeneousRelations]
H:280 [in ITree.Extra.IForest]
H:29 [in ITree.Core.Subevent]
H:3 [in ITree.Core.Subevent]
h:311 [in ITree.Extra.IForest]
H:33 [in ITree.Basics.CategoryFunctor]
h:33 [in ITree.Core.ITreeDefinition]
h:34 [in ITree.Extra.Dijkstra.ITreeDijkstra]
h:37 [in ITree.Events.StateFacts]
H:38 [in ITree.Eq.Shallow]
h:388 [in ITree.Basics.CategoryTheory]
h:39 [in ITree.Events.FailFacts]
H:4 [in ITree.Events.Nondeterminism]
h:4 [in ITree.Interp.Interp]
h:4 [in ITree.Interp.TranslateFacts]
h:41 [in ITree.Extra.Dijkstra.ITreeDijkstra]
h:414 [in ITree.Basics.CategoryFacts]
h:418 [in ITree.Basics.CategoryFacts]
H:42 [in ITree.Eq.Shallow]
h:424 [in ITree.Basics.CategoryFacts]
h:45 [in ITree.Events.StateFacts]
h:48 [in ITree.Extra.Dijkstra.ITreeDijkstra]
H:5 [in ITree.Events.Reader]
h:52 [in ITree.Simple]
H:54 [in ITree.Eq.Paco2]
h:56 [in ITree.Events.FailFacts]
H:57 [in ITree.Eq.Paco2]
h:58 [in ITree.Events.State]
H:6 [in ITree.Events.Map]
H:6 [in ITree.Basics.Monad]
H:6 [in ITree.Events.Exception]
H:6 [in ITree.Events.Writer]
h:60 [in ITree.Events.FailFacts]
H:60 [in ITree.Eq.Paco2]
H:61 [in ITree.Eq.Paco2]
H:63 [in ITree.Interp.Traces]
H:63 [in ITree.Interp.TranslateFacts]
h:65 [in ITree.Events.FailFacts]
h:66 [in ITree.Extra.Dijkstra.ITreeDijkstra]
h:66 [in ITree.Interp.TranslateFacts]
h:69 [in ITree.Events.FailFacts]
H:7 [in ITree.Events.Concurrency]
h:7 [in ITree.Events.State]
H:72 [in ITree.Eq.Eqit]
h:76 [in ITree.Events.StateFacts]
H:76 [in ITree.Eq.Eqit]
h:779 [in ITree.Eq.Eqit]
H:8 [in ITree.Events.Map]
H:8 [in ITree.Events.MapDefault]
h:81 [in ITree.Props.HasPost]
h:81 [in ITree.Events.FailFacts]
h:82 [in ITree.Events.StateFacts]
h:85 [in ITree.Extra.IForest]
h:87 [in ITree.Events.FailFacts]
h:87 [in ITree.Extra.Dijkstra.ITreeDijkstra]
H:9 [in ITree.Basics.CategoryFunctor]
H:9 [in ITree.Events.Dependent]
h:92 [in ITree.Events.FailFacts]
h:94 [in ITree.Events.StateFacts]
H:95 [in ITree.Eq.Eqit]

I

IdC:4 [in ITree.Basics.CategoryFacts]
IdC:4 [in ITree.Basics.CategoryTheory]
IdC:48 [in ITree.Basics.CategoryTheory]
IdC:66 [in ITree.Basics.CategoryTheory]
IdC:78 [in ITree.Basics.CategoryTheory]
Id_C:181 [in ITree.Basics.CategoryOps]
Id_C:95 [in ITree.Basics.CategoryOps]
Id_C:348 [in ITree.Basics.CategoryFacts]
Id_C:221 [in ITree.Basics.CategoryFacts]
Id_C:94 [in ITree.Basics.CategoryFacts]
Id_C:70 [in ITree.Basics.CategoryFacts]
Id_C:50 [in ITree.Basics.CategoryFacts]
Id_C:344 [in ITree.Basics.CategoryTheory]
Id_C:306 [in ITree.Basics.CategoryTheory]
Id_C:232 [in ITree.Basics.CategoryTheory]
Id_C:204 [in ITree.Basics.CategoryTheory]
Id_C:165 [in ITree.Basics.CategoryTheory]
Id_C:126 [in ITree.Basics.CategoryTheory]
Id_C:95 [in ITree.Basics.CategoryTheory]
Id_C:14 [in ITree.Basics.CategorySub]
ID:118 [in ITree.Props.Leaf]
ID:367 [in ITree.Extra.IForest]
ID:683 [in ITree.Eq.Eqit]
IM:13 [in ITree.Basics.MonadState]
IM:19 [in ITree.Interp.Interp]
IM:38 [in ITree.Events.FailFacts]
IM:6 [in ITree.Events.State]
INCH:132 [in ITree.Eq.UpToTaus]
INCH:147 [in ITree.Eq.UpToTaus]
INCL:129 [in ITree.Eq.UpToTaus]
INCL:143 [in ITree.Eq.UpToTaus]
InitialObject_i:381 [in ITree.Basics.CategoryFacts]
InitialObject_i:196 [in ITree.Basics.CategoryFacts]
InitialObject_i:54 [in ITree.Basics.CategoryFacts]
Initial_i:380 [in ITree.Basics.CategoryFacts]
Initial_i:195 [in ITree.Basics.CategoryFacts]
Initial_i:53 [in ITree.Basics.CategoryFacts]
Initial_i:34 [in ITree.Basics.CategoryTheory]
init:190 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
init:94 [in ITree.Events.ExceptionFacts]
Inl_bif:184 [in ITree.Basics.CategoryOps]
Inl_C:353 [in ITree.Basics.CategoryFacts]
Inl_C:99 [in ITree.Basics.CategoryFacts]
Inl_C:348 [in ITree.Basics.CategoryTheory]
Inl_C:130 [in ITree.Basics.CategoryTheory]
Inl_C:35 [in ITree.Basics.CategorySub]
INL:439 [in ITree.Eq.Eqit]
Inr_bif:185 [in ITree.Basics.CategoryOps]
Inr_C:354 [in ITree.Basics.CategoryFacts]
Inr_C:100 [in ITree.Basics.CategoryFacts]
Inr_C:349 [in ITree.Basics.CategoryTheory]
Inr_C:131 [in ITree.Basics.CategoryTheory]
Inr_C:36 [in ITree.Basics.CategorySub]
INR:440 [in ITree.Eq.Eqit]
Inv:69 [in ITree.Props.HasPost]
IN:108 [in ITree.Eq.Rutt]
IN:121 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
IN:121 [in ITree.Extra.Secure.SecureEqHalt]
IN:124 [in ITree.Extra.IForest]
IN:13 [in ITree.Extra.Dijkstra.IterRel]
IN:15 [in ITree.Eq.UpToTaus]
IN:159 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
IN:175 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
IN:175 [in ITree.Extra.Secure.SecureEqHalt]
IN:20 [in ITree.Eq.UpToTaus]
IN:20 [in ITree.Props.Infinite]
IN:217 [in ITree.Extra.IForest]
IN:226 [in ITree.Eq.Eqit]
IN:26 [in ITree.Eq.UpToTaus]
IN:47 [in ITree.Eq.Eqit]
IN:50 [in ITree.Props.Infinite]
IN:51 [in ITree.Eq.UpToTaus]
IN:83 [in ITree.Extra.Secure.SecureEqProgInsens]
io:25 [in ITree.Extra.Dijkstra.StateIOTrace]
ir:472 [in ITree.Extra.IForest]
ir:493 [in ITree.Extra.IForest]
ir:498 [in ITree.Extra.IForest]
IsoBif:30 [in ITree.Basics.CategorySub]
is':59 [in ITree.Basics.Basics]
is:56 [in ITree.Basics.Basics]
Iterative_C:357 [in ITree.Basics.CategoryFacts]
Iterative_C:62 [in ITree.Basics.CategorySub]
Iter_bif:186 [in ITree.Basics.CategoryOps]
Iter_bif:356 [in ITree.Basics.CategoryFacts]
Iter_C:350 [in ITree.Basics.CategoryTheory]
Iter_C:39 [in ITree.Basics.CategorySub]
itree:3 [in ITree.Core.ITreeDefinition]
i':10 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
i':102 [in ITree.Events.StateFacts]
i':102 [in ITree.Basics.Basics]
I':88 [in ITree.Events.StateFacts]
i':98 [in ITree.Events.StateFacts]
I1:11 [in ITree.Core.KTreeFacts]
i1:22 [in ITree.Core.KTreeFacts]
I1:26 [in ITree.Core.KTreeFacts]
i1:37 [in ITree.Core.KTreeFacts]
I1:41 [in ITree.Core.KTreeFacts]
i1:54 [in ITree.Core.KTreeFacts]
I2:12 [in ITree.Core.KTreeFacts]
i2:23 [in ITree.Core.KTreeFacts]
I2:27 [in ITree.Core.KTreeFacts]
i2:38 [in ITree.Core.KTreeFacts]
I2:42 [in ITree.Core.KTreeFacts]
i2:55 [in ITree.Core.KTreeFacts]
I:1 [in ITree.Events.Dependent]
i:10 [in ITree.Events.Dependent]
i:101 [in ITree.Events.StateFacts]
I:11 [in ITree.Events.Dependent]
I:110 [in ITree.Interp.InterpFacts]
i:114 [in ITree.Interp.InterpFacts]
i:116 [in ITree.Interp.InterpFacts]
i:13 [in ITree.Events.Dependent]
I:160 [in ITree.Events.StateFacts]
i:164 [in ITree.Events.StateFacts]
i:166 [in ITree.Events.StateFacts]
i:17 [in ITree.Basics.CategoryOps]
I:171 [in ITree.Events.StateFacts]
i:174 [in ITree.Events.StateFacts]
i:175 [in ITree.Events.StateFacts]
I:18 [in ITree.Events.FailFacts]
i:194 [in ITree.Basics.CategoryFacts]
i:20 [in ITree.Events.FailFacts]
i:21 [in ITree.Events.FailFacts]
i:218 [in ITree.Basics.CategoryOps]
i:249 [in ITree.Basics.CategoryTheory]
i:316 [in ITree.Basics.CategoryTheory]
I:321 [in ITree.Extra.IForest]
i:33 [in ITree.Basics.CategoryTheory]
I:330 [in ITree.Extra.IForest]
i:332 [in ITree.Extra.IForest]
I:37 [in ITree.Core.ITreeDefinition]
i:379 [in ITree.Basics.CategoryFacts]
i:39 [in ITree.Core.ITreeDefinition]
I:47 [in ITree.Basics.Basics]
i:5 [in ITree.Events.Dependent]
I:5 [in ITree.Extra.Dijkstra.DelaySpecMonad]
i:52 [in ITree.Basics.CategoryFacts]
i:54 [in ITree.Basics.Basics]
i:57 [in ITree.Basics.Basics]
i:59 [in ITree.Basics.CategoryOps]
I:6 [in ITree.Events.Dependent]
i:63 [in ITree.Basics.CategoryOps]
i:65 [in ITree.Basics.Basics]
I:66 [in ITree.Props.HasPost]
i:67 [in ITree.Basics.CategoryOps]
i:69 [in ITree.Basics.Basics]
i:71 [in ITree.Props.HasPost]
i:71 [in ITree.Basics.CategoryOps]
i:75 [in ITree.Basics.Basics]
i:77 [in ITree.Basics.Basics]
i:82 [in ITree.Basics.Basics]
i:83 [in ITree.Basics.Basics]
I:87 [in ITree.Events.StateFacts]
i:91 [in ITree.Basics.Basics]
i:92 [in ITree.Basics.Basics]
I:96 [in ITree.Basics.Basics]
i:97 [in ITree.Events.StateFacts]
i:98 [in ITree.Basics.Basics]

J

j1:19 [in ITree.Core.KTreeFacts]
j1:34 [in ITree.Core.KTreeFacts]
j1:51 [in ITree.Core.KTreeFacts]
j2:20 [in ITree.Core.KTreeFacts]
j2:35 [in ITree.Core.KTreeFacts]
j2:52 [in ITree.Core.KTreeFacts]
j:335 [in ITree.Extra.IForest]

K

kab:852 [in ITree.Eq.Eqit]
kab:863 [in ITree.Eq.Eqit]
kab:874 [in ITree.Eq.Eqit]
kab:888 [in ITree.Eq.Eqit]
kab:896 [in ITree.Eq.Eqit]
kab:904 [in ITree.Eq.Eqit]
KBP:606 [in ITree.Extra.IForest]
kb:218 [in ITree.Extra.ITrace.ITraceBind]
KB:603 [in ITree.Extra.IForest]
kb:823 [in ITree.Eq.Eqit]
kb:830 [in ITree.Eq.Eqit]
kb:837 [in ITree.Eq.Eqit]
kcatch:10 [in ITree.Events.ExceptionFacts]
kcatch:15 [in ITree.Events.Exception]
kcatch:16 [in ITree.Events.ExceptionFacts]
kcatch:23 [in ITree.Events.ExceptionFacts]
kcatch:5 [in ITree.Events.ExceptionFacts]
kcatch:58 [in ITree.Events.ExceptionFacts]
kcatch:71 [in ITree.Events.ExceptionFacts]
kcatch:78 [in ITree.Events.ExceptionFacts]
kca:866 [in ITree.Eq.Eqit]
kca:877 [in ITree.Eq.Eqit]
KCP:607 [in ITree.Extra.IForest]
KC:604 [in ITree.Extra.IForest]
KdecOk:7 [in ITree.Events.MapDefaultFacts]
Kdec:6 [in ITree.Events.MapDefaultFacts]
kr:18 [in ITree.Extra.ITrace.ITracePrefix]
kr:23 [in ITree.Extra.ITrace.ITracePrefix]
ks:19 [in ITree.Extra.ITrace.ITracePrefix]
ks:24 [in ITree.Extra.ITrace.ITracePrefix]
ks:272 [in ITree.Extra.IForest]
kts:126 [in ITree.Interp.Traces]
kt:219 [in ITree.Extra.ITrace.ITraceBind]
kxa:855 [in ITree.Eq.Eqit]
kxb:865 [in ITree.Eq.Eqit]
kxb:876 [in ITree.Eq.Eqit]
kxc:854 [in ITree.Eq.Eqit]
k':12 [in ITree.Events.MapDefaultFacts]
k':18 [in ITree.Events.MapDefaultFacts]
k':199 [in ITree.Extra.ITrace.ITraceBind]
k':210 [in ITree.Extra.ITrace.ITraceBind]
k':248 [in ITree.Extra.ITrace.ITraceBind]
k':267 [in ITree.Extra.ITrace.ITraceBind]
k':295 [in ITree.Extra.ITrace.ITraceBind]
k':299 [in ITree.Extra.ITrace.ITraceBind]
k':306 [in ITree.Eq.Eqit]
k':338 [in ITree.Extra.ITrace.ITraceBind]
k':45 [in ITree.Extra.ITrace.ITracePrefix]
k':46 [in ITree.Extra.ITrace.ITracePrefix]
k':47 [in ITree.Extra.ITrace.ITracePrefix]
k':49 [in ITree.Events.State]
k0:10 [in ITree.Extra.ITrace.ITraceBind]
k0:147 [in ITree.Extra.ITrace.ITraceFacts]
k0:164 [in ITree.Extra.ITrace.ITraceFacts]
k0:167 [in ITree.Extra.ITrace.ITraceFacts]
k0:170 [in ITree.Extra.ITrace.ITraceFacts]
k0:179 [in ITree.Extra.ITrace.ITraceFacts]
k0:18 [in ITree.Extra.Secure.SecureEqBind]
k0:183 [in ITree.Extra.ITrace.ITraceBind]
k0:36 [in ITree.Extra.ITrace.ITraceBind]
k0:38 [in ITree.Extra.Secure.SecureEqBind]
k1:106 [in ITree.Props.Leaf]
k1:107 [in ITree.Extra.IForest]
k1:108 [in ITree.Props.HasPost]
k1:114 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:115 [in ITree.Extra.ITrace.ITracePrefix]
k1:117 [in ITree.Eq.Eqit]
k1:12 [in ITree.Extra.ITrace.ITraceBind]
k1:12 [in ITree.Eq.SimUpToTaus]
k1:121 [in ITree.Extra.ITrace.ITraceBind]
k1:13 [in ITree.Simple]
k1:132 [in ITree.Eq.Eqit]
k1:136 [in ITree.Props.Leaf]
k1:138 [in ITree.Extra.ITrace.ITracePrefix]
k1:14 [in ITree.Extra.Secure.SecureEqBind]
k1:14 [in ITree.Eq.Shallow]
k1:151 [in ITree.Props.Leaf]
k1:157 [in ITree.Simple]
k1:160 [in ITree.Extra.ITrace.ITraceBind]
k1:163 [in ITree.Props.Leaf]
k1:164 [in ITree.Simple]
k1:169 [in ITree.Extra.ITrace.ITraceBind]
k1:183 [in ITree.Extra.Secure.SecureEqEuttHalt]
k1:201 [in ITree.Eq.UpToTaus]
k1:21 [in ITree.Extra.Secure.SecureEqWcompat]
k1:21 [in ITree.Eq.Eqit]
k1:212 [in ITree.Eq.UpToTaus]
k1:22 [in ITree.Simple]
k1:23 [in ITree.Eq.Rutt]
k1:24 [in ITree.Eq.Shallow]
k1:27 [in ITree.Extra.Secure.SecureEqProgInsens]
k1:27 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:27 [in ITree.Extra.Secure.SecureEqHalt]
k1:271 [in ITree.Extra.Secure.SecureEqProgInsens]
k1:275 [in ITree.Eq.UpToTaus]
k1:30 [in ITree.Interp.HandlerFacts]
k1:33 [in ITree.Extra.Secure.SecureEqProgInsens]
k1:33 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:33 [in ITree.Extra.Secure.SecureEqHalt]
k1:331 [in ITree.Eq.Eqit]
k1:34 [in ITree.Extra.Secure.SecureEqBind]
k1:34 [in ITree.Eq.Shallow]
k1:342 [in ITree.Extra.IForest]
k1:342 [in ITree.Eq.Eqit]
k1:35 [in ITree.Interp.HandlerFacts]
k1:356 [in ITree.Extra.IForest]
k1:38 [in ITree.Extra.ITrace.ITraceBind]
k1:381 [in ITree.Extra.IForest]
k1:393 [in ITree.Extra.IForest]
k1:41 [in ITree.Eq.SimUpToTaus]
k1:462 [in ITree.Extra.IForest]
k1:47 [in ITree.Extra.Secure.SecureEqProgInsens]
k1:49 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:49 [in ITree.Extra.Secure.SecureEqHalt]
k1:50 [in ITree.Eq.SimUpToTaus]
k1:52 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:55 [in ITree.Extra.Secure.SecureEqProgInsens]
k1:551 [in ITree.Extra.IForest]
k1:56 [in ITree.Extra.Secure.SecureEqBind]
k1:59 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:59 [in ITree.Extra.Secure.SecureEqHalt]
k1:649 [in ITree.Eq.Eqit]
k1:655 [in ITree.Eq.Eqit]
k1:672 [in ITree.Eq.Eqit]
k1:68 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:689 [in ITree.Eq.Eqit]
k1:69 [in ITree.Eq.Eqit]
k1:714 [in ITree.Eq.Eqit]
k1:727 [in ITree.Eq.Eqit]
k1:74 [in ITree.Extra.Secure.SecureEqBind]
k1:75 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:75 [in ITree.Extra.Secure.SecureEqHalt]
k1:82 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k1:89 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:89 [in ITree.Extra.Secure.SecureEqHalt]
k1:90 [in ITree.Eq.Eqit]
k1:92 [in ITree.Props.HasPost]
k1:96 [in ITree.Extra.Secure.SecureEqBind]
k1:99 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k1:99 [in ITree.Extra.Secure.SecureEqHalt]
k2:100 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:100 [in ITree.Extra.Secure.SecureEqHalt]
k2:107 [in ITree.Props.Leaf]
k2:109 [in ITree.Props.HasPost]
k2:110 [in ITree.Extra.IForest]
k2:115 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k2:116 [in ITree.Extra.ITrace.ITracePrefix]
k2:118 [in ITree.Eq.Eqit]
k2:119 [in ITree.Extra.Secure.SecureEqEuttHalt]
k2:122 [in ITree.Extra.ITrace.ITraceBind]
k2:122 [in ITree.Extra.Secure.SecureEqBind]
k2:13 [in ITree.Eq.SimUpToTaus]
k2:134 [in ITree.Eq.Eqit]
k2:137 [in ITree.Props.Leaf]
k2:137 [in ITree.Extra.Secure.SecureEqEuttHalt]
k2:139 [in ITree.Extra.ITrace.ITracePrefix]
k2:14 [in ITree.Simple]
k2:15 [in ITree.Extra.Secure.SecureEqBind]
k2:15 [in ITree.Eq.Shallow]
k2:152 [in ITree.Props.Leaf]
k2:154 [in ITree.Extra.Secure.SecureEqEuttHalt]
k2:158 [in ITree.Simple]
k2:161 [in ITree.Extra.ITrace.ITraceBind]
k2:164 [in ITree.Props.Leaf]
k2:165 [in ITree.Simple]
k2:168 [in ITree.Extra.Secure.SecureEqEuttHalt]
k2:170 [in ITree.Extra.ITrace.ITraceBind]
k2:184 [in ITree.Extra.Secure.SecureEqEuttHalt]
k2:202 [in ITree.Eq.UpToTaus]
k2:213 [in ITree.Eq.UpToTaus]
k2:22 [in ITree.Extra.Secure.SecureEqWcompat]
k2:22 [in ITree.Eq.Eqit]
k2:23 [in ITree.Simple]
k2:24 [in ITree.Eq.Rutt]
k2:25 [in ITree.Eq.Shallow]
k2:272 [in ITree.Extra.Secure.SecureEqProgInsens]
k2:276 [in ITree.Eq.UpToTaus]
k2:28 [in ITree.Extra.Secure.SecureEqProgInsens]
k2:28 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:28 [in ITree.Extra.Secure.SecureEqHalt]
k2:31 [in ITree.Interp.HandlerFacts]
k2:332 [in ITree.Eq.Eqit]
k2:343 [in ITree.Extra.IForest]
k2:343 [in ITree.Eq.Eqit]
k2:35 [in ITree.Extra.Secure.SecureEqBind]
k2:35 [in ITree.Eq.Shallow]
k2:357 [in ITree.Extra.IForest]
k2:36 [in ITree.Interp.HandlerFacts]
k2:382 [in ITree.Extra.IForest]
k2:394 [in ITree.Extra.IForest]
k2:40 [in ITree.Extra.Secure.SecureEqProgInsens]
k2:41 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:41 [in ITree.Extra.Secure.SecureEqHalt]
k2:42 [in ITree.Eq.SimUpToTaus]
k2:463 [in ITree.Extra.IForest]
k2:48 [in ITree.Extra.Secure.SecureEqProgInsens]
k2:50 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:50 [in ITree.Extra.Secure.SecureEqHalt]
k2:51 [in ITree.Eq.SimUpToTaus]
k2:53 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k2:552 [in ITree.Extra.IForest]
k2:57 [in ITree.Extra.Secure.SecureEqBind]
k2:63 [in ITree.Extra.Secure.SecureEqProgInsens]
k2:650 [in ITree.Eq.Eqit]
k2:656 [in ITree.Eq.Eqit]
k2:673 [in ITree.Eq.Eqit]
k2:68 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:68 [in ITree.Extra.Secure.SecureEqHalt]
k2:68 [in ITree.Eq.Eqit]
k2:69 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k2:690 [in ITree.Eq.Eqit]
k2:715 [in ITree.Eq.Eqit]
k2:728 [in ITree.Eq.Eqit]
k2:75 [in ITree.Extra.Secure.SecureEqBind]
k2:82 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:82 [in ITree.Extra.Secure.SecureEqHalt]
k2:90 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
k2:90 [in ITree.Extra.Secure.SecureEqHalt]
k2:93 [in ITree.Eq.Eqit]
k2:94 [in ITree.Props.HasPost]
k2:96 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
k3:162 [in ITree.Extra.ITrace.ITraceBind]
k:10 [in ITree.Core.ITreeDefinition]
k:101 [in ITree.Interp.Traces]
k:104 [in ITree.Events.FailFacts]
k:105 [in ITree.Extra.Secure.SecureStateHandler]
k:105 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:106 [in ITree.Extra.ITrace.ITraceFacts]
k:11 [in ITree.Events.MapDefaultFacts]
k:113 [in ITree.Events.FailFacts]
k:113 [in ITree.Extra.Secure.SecureStateHandler]
k:115 [in ITree.Extra.ITrace.ITracePreds]
k:12 [in ITree.Props.Finite]
k:12 [in ITree.Props.Leaf]
k:122 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:127 [in ITree.Props.Finite]
k:13 [in ITree.Events.Map]
k:13 [in ITree.Interp.TranslateFacts]
k:13 [in ITree.Extra.ITrace.ITracePreds]
k:130 [in ITree.Extra.ITrace.ITraceBind]
k:133 [in ITree.Props.Finite]
k:139 [in ITree.Props.Finite]
k:14 [in ITree.Events.FailFacts]
k:140 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:143 [in ITree.Props.Finite]
k:146 [in ITree.Extra.ITrace.ITraceFacts]
k:147 [in ITree.Props.Finite]
k:15 [in ITree.Events.ExceptionFacts]
k:15 [in ITree.Events.MapDefaultFacts]
k:150 [in ITree.Extra.Secure.SecureEqProgInsens]
k:153 [in ITree.Props.Finite]
k:158 [in ITree.Props.Finite]
k:161 [in ITree.Extra.ITrace.ITraceFacts]
k:164 [in ITree.Props.Finite]
K:17 [in ITree.Events.MapDefault]
k:17 [in ITree.Events.MapDefaultFacts]
k:171 [in ITree.Simple]
k:176 [in ITree.Extra.ITrace.ITraceBind]
k:176 [in ITree.Props.Finite]
k:176 [in ITree.Extra.ITrace.ITraceFacts]
k:176 [in ITree.Simple]
k:18 [in ITree.Interp.RecursionFacts]
k:182 [in ITree.Props.Finite]
k:183 [in ITree.Simple]
k:188 [in ITree.Extra.ITrace.ITraceBind]
k:19 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:19 [in ITree.Core.ITreeDefinition]
k:194 [in ITree.Simple]
k:198 [in ITree.Extra.ITrace.ITraceBind]
k:209 [in ITree.Extra.ITrace.ITraceBind]
k:209 [in ITree.Extra.IForest]
k:21 [in ITree.Events.MapDefault]
k:21 [in ITree.Interp.TranslateFacts]
k:215 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:22 [in ITree.Events.ExceptionFacts]
k:220 [in ITree.Simple]
k:233 [in ITree.Simple]
k:235 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:247 [in ITree.Extra.ITrace.ITraceBind]
k:25 [in ITree.Props.Finite]
k:25 [in ITree.Props.Leaf]
k:250 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:263 [in ITree.Extra.ITrace.ITraceBind]
k:268 [in ITree.Extra.IForest]
k:27 [in ITree.Core.ITreeDefinition]
k:275 [in ITree.Extra.ITrace.ITraceBind]
k:280 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:281 [in ITree.Extra.Dijkstra.ITreeDijkstra]
k:285 [in ITree.Extra.ITrace.ITraceBind]
k:29 [in ITree.Interp.Traces]
k:29 [in ITree.Extra.ITrace.ITraceFacts]
k:294 [in ITree.Extra.Dijkstra.ITreeDijkstra]
k:30 [in ITree.Simple]
k:305 [in ITree.Eq.Eqit]
k:31 [in ITree.Extra.IForest]
k:32 [in ITree.Core.ITreeDefinition]
k:33 [in ITree.Extra.Secure.SecureEqEuttTrans]
k:33 [in ITree.Interp.Traces]
k:335 [in ITree.Extra.ITrace.ITraceBind]
k:34 [in ITree.Events.MapDefault]
k:34 [in ITree.Events.State]
k:35 [in ITree.Events.MapDefaultFacts]
k:36 [in ITree.Events.StateFacts]
k:37 [in ITree.Extra.IForest]
k:37 [in ITree.Props.Finite]
k:38 [in ITree.Props.Infinite]
k:38 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:38 [in ITree.Simple]
k:39 [in ITree.Interp.InterpFacts]
K:4 [in ITree.Basics.MonadProp]
k:40 [in ITree.Props.Leaf]
k:40 [in ITree.Events.MapDefaultFacts]
k:401 [in ITree.Extra.IForest]
k:41 [in ITree.Basics.CategoryKleisliFacts]
k:41 [in ITree.Basics.Basics]
k:417 [in ITree.Extra.IForest]
k:425 [in ITree.Extra.IForest]
k:43 [in ITree.Extra.ITrace.ITracePrefix]
k:432 [in ITree.Extra.IForest]
K:44 [in ITree.Extra.IForest]
k:440 [in ITree.Extra.IForest]
k:447 [in ITree.Extra.IForest]
k:45 [in ITree.Extra.Dijkstra.StateIOTrace]
k:453 [in ITree.Extra.IForest]
k:46 [in ITree.Events.ExceptionFacts]
k:46 [in ITree.Extra.Secure.SecureStateHandler]
k:469 [in ITree.Extra.IForest]
k:47 [in ITree.Extra.IForest]
k:477 [in ITree.Extra.IForest]
k:48 [in ITree.Basics.CategoryKleisliFacts]
k:48 [in ITree.Events.State]
k:49 [in ITree.Props.HasPost]
k:49 [in ITree.Props.Finite]
k:490 [in ITree.Extra.IForest]
k:495 [in ITree.Extra.IForest]
k:51 [in ITree.Simple]
k:52 [in ITree.Events.ExceptionFacts]
K:524 [in ITree.Extra.IForest]
k:53 [in ITree.Extra.ITrace.ITracePreds]
K:535 [in ITree.Extra.IForest]
k:538 [in ITree.Extra.IForest]
K:543 [in ITree.Extra.IForest]
k:544 [in ITree.Extra.IForest]
K:55 [in ITree.Extra.IForest]
k:55 [in ITree.Extra.ITrace.ITracePreds]
k:56 [in ITree.Props.HasPost]
k:560 [in ITree.Extra.IForest]
k:58 [in ITree.Extra.IForest]
k:58 [in ITree.Props.Finite]
k:58 [in ITree.Extra.Secure.SecureStateHandler]
k:591 [in ITree.Eq.Eqit]
k:60 [in ITree.Extra.ITrace.ITraceBind]
k:602 [in ITree.Eq.Eqit]
k:607 [in ITree.Eq.Eqit]
k:614 [in ITree.Eq.Eqit]
k:62 [in ITree.Extra.ITrace.ITracePrefix]
k:62 [in ITree.Eq.Shallow]
k:620 [in ITree.Eq.Eqit]
k:65 [in ITree.Props.Infinite]
K:66 [in ITree.Extra.IForest]
k:69 [in ITree.Extra.IForest]
k:69 [in ITree.Extra.Secure.SecureStateHandlerPi]
k:70 [in ITree.Events.StateFacts]
k:71 [in ITree.Extra.IForest]
k:71 [in ITree.Eq.Shallow]
k:71 [in ITree.Interp.InterpFacts]
k:73 [in ITree.Props.Finite]
k:76 [in ITree.Eq.Shallow]
K:77 [in ITree.Extra.IForest]
k:77 [in ITree.Props.Leaf]
k:778 [in ITree.Eq.Eqit]
k:794 [in ITree.Eq.Eqit]
k:8 [in ITree.Props.Infinite]
k:8 [in ITree.Events.MapDefaultFacts]
k:80 [in ITree.Events.FailFacts]
k:80 [in ITree.Simple]
k:802 [in ITree.Eq.Eqit]
k:81 [in ITree.Extra.ITrace.ITracePreds]
k:83 [in ITree.Eq.Shallow]
k:84 [in ITree.Props.Leaf]
k:86 [in ITree.Events.ExceptionFacts]
k:90 [in ITree.Extra.ITrace.ITracePrefix]
k:90 [in ITree.Extra.Secure.SecureEqEuttHalt]
k:91 [in ITree.Extra.Secure.SecureStateHandler]
k:924 [in ITree.Eq.Eqit]
k:931 [in ITree.Eq.Eqit]
k:95 [in ITree.Simple]
k:97 [in ITree.Extra.ITrace.ITraceBind]
k:97 [in ITree.Extra.Secure.SecureStateHandler]
k:99 [in ITree.Extra.ITrace.ITraceFacts]

L

Label:10 [in ITree.Extra.Secure.SecureEqBind]
Label:101 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:107 [in ITree.Extra.Secure.SecureEqWcompat]
Label:107 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:109 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:112 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:112 [in ITree.Extra.Secure.SecureEqBind]
Label:126 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:127 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:136 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:137 [in ITree.Extra.Secure.SecureEqBind]
Label:139 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:139 [in ITree.Extra.Secure.SecureEqHalt]
Label:14 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:145 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:145 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:157 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:159 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:16 [in ITree.Extra.Secure.SecureEqWcompat]
Label:16 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:161 [in ITree.Extra.Secure.SecureEqBind]
Label:171 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:171 [in ITree.Extra.Secure.SecureEqBind]
Label:174 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:18 [in ITree.Extra.Secure.SecureEqEuttTrans]
Label:183 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:183 [in ITree.Extra.Secure.SecureEqHalt]
Label:184 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:189 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:197 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:197 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:197 [in ITree.Extra.Secure.SecureEqHalt]
Label:201 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:204 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:220 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:222 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:231 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:238 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:240 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:249 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:25 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:260 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:260 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:266 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:282 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:286 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:30 [in ITree.Extra.Secure.SecureEqBind]
Label:304 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:31 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:310 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:321 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:330 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:340 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:348 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:35 [in ITree.Extra.Secure.SecureEqEuttTrans]
Label:4 [in ITree.Extra.Secure.SecureEqProgInsens]
Label:4 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
Label:4 [in ITree.Extra.Secure.SecureEqHalt]
Label:4 [in ITree.Extra.Secure.SecureEqEuttTrans]
Label:4 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:42 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:45 [in ITree.Extra.Secure.SecureEqWcompat]
Label:45 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:49 [in ITree.Extra.Secure.SecureEqWcompat]
Label:50 [in ITree.Extra.Secure.SecureEqBind]
Label:52 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:59 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:67 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:68 [in ITree.Extra.Secure.SecureEqWcompat]
Label:69 [in ITree.Extra.Secure.SecureEqBind]
Label:7 [in ITree.Extra.Secure.SecureEqWcompat]
Label:7 [in ITree.Extra.Secure.SecureStateHandler]
Label:7 [in ITree.Extra.Secure.SecureStateHandlerPi]
Label:76 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:79 [in ITree.Extra.Secure.SecureEqEuttHalt]
Label:87 [in ITree.Extra.Secure.SecureEqBind]
Label:87 [in ITree.Extra.Secure.SecureEqWcompat]
Label:89 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Label:94 [in ITree.Extra.Secure.SecureEqEuttHalt]
LEb1:187 [in ITree.Eq.Eqit]
LEb2:188 [in ITree.Eq.Eqit]
LEc:123 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
LEc:123 [in ITree.Extra.Secure.SecureEqHalt]
LEc:49 [in ITree.Eq.Eqit]
LEc:85 [in ITree.Extra.Secure.SecureEqProgInsens]
LERR1:139 [in ITree.Eq.Rutt]
LERR1:162 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
LERR1:162 [in ITree.Extra.Secure.SecureEqHalt]
LERR1:162 [in ITree.Eq.Rutt]
LERR1:213 [in ITree.Eq.Eqit]
LERR1:480 [in ITree.Eq.Eqit]
LERR1:504 [in ITree.Eq.Eqit]
LERR1:526 [in ITree.Eq.Eqit]
LERR1:548 [in ITree.Eq.Eqit]
LERR1:99 [in ITree.Eq.Rutt]
LERR2:103 [in ITree.Eq.Rutt]
LERR2:143 [in ITree.Eq.Rutt]
LERR2:166 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
LERR2:166 [in ITree.Extra.Secure.SecureEqHalt]
LERR2:166 [in ITree.Eq.Rutt]
LERR2:217 [in ITree.Eq.Eqit]
LERR2:484 [in ITree.Eq.Eqit]
LERR2:508 [in ITree.Eq.Eqit]
LERR2:530 [in ITree.Eq.Eqit]
LERR2:552 [in ITree.Eq.Eqit]
LERR:189 [in ITree.Eq.Eqit]
LERR:85 [in ITree.Eq.UpToTaus]
LE:109 [in ITree.Eq.Rutt]
LE:124 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
LE:124 [in ITree.Extra.Secure.SecureEqHalt]
LE:125 [in ITree.Extra.IForest]
LE:14 [in ITree.Extra.Dijkstra.IterRel]
LE:160 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
LE:176 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
LE:176 [in ITree.Extra.Secure.SecureEqHalt]
LE:21 [in ITree.Eq.UpToTaus]
LE:21 [in ITree.Props.Infinite]
LE:227 [in ITree.Eq.Eqit]
LE:27 [in ITree.Eq.UpToTaus]
LE:50 [in ITree.Eq.Eqit]
LE:51 [in ITree.Props.Infinite]
LE:86 [in ITree.Extra.Secure.SecureEqProgInsens]
log':233 [in ITree.Extra.ITrace.ITraceFacts]
log':32 [in ITree.Extra.Dijkstra.TracesIT]
log':41 [in ITree.Extra.Dijkstra.TracesIT]
log':55 [in ITree.Extra.ITrace.ITraceFacts]
log1:64 [in ITree.Extra.ITrace.ITraceFacts]
log2:65 [in ITree.Extra.ITrace.ITraceFacts]
log:13 [in ITree.Extra.Dijkstra.TracesIT]
log:13 [in ITree.Extra.Dijkstra.StateIOTrace]
log:18 [in ITree.Extra.Dijkstra.TracesIT]
log:22 [in ITree.Extra.Dijkstra.TracesIT]
log:230 [in ITree.Extra.ITrace.ITraceFacts]
log:236 [in ITree.Extra.ITrace.ITraceFacts]
log:28 [in ITree.Extra.Dijkstra.TracesIT]
log:36 [in ITree.Extra.ITrace.ITraceFacts]
log:37 [in ITree.Extra.Dijkstra.TracesIT]
log:42 [in ITree.Extra.ITrace.ITraceFacts]
log:42 [in ITree.Extra.Dijkstra.StateIOTrace]
log:44 [in ITree.Extra.Dijkstra.TracesIT]
log:47 [in ITree.Extra.ITrace.ITraceFacts]
log:54 [in ITree.Extra.ITrace.ITraceFacts]
log:58 [in ITree.Extra.Dijkstra.TracesIT]
log:59 [in ITree.Extra.ITrace.ITraceFacts]
log:63 [in ITree.Extra.Dijkstra.TracesIT]
log:72 [in ITree.Extra.Dijkstra.TracesIT]
log:78 [in ITree.Extra.Dijkstra.TracesIT]
log:84 [in ITree.Extra.Dijkstra.TracesIT]
log:90 [in ITree.Extra.Dijkstra.TracesIT]
lr:101 [in ITree.Extra.Secure.SecureEqBind]
lr:124 [in ITree.Extra.Secure.SecureEqBind]
lr:126 [in ITree.Extra.Secure.SecureEqBind]
lr:148 [in ITree.Extra.Secure.SecureEqBind]
lr:150 [in ITree.Extra.Secure.SecureEqBind]
lr:297 [in ITree.Extra.Secure.SecureEqProgInsens]
lr:299 [in ITree.Extra.Secure.SecureEqProgInsens]
lr:325 [in ITree.Extra.IForest]
lr:41 [in ITree.Core.ITreeDefinition]
lr:627 [in ITree.Eq.Eqit]
lr:90 [in ITree.Eq.Shallow]
lr:98 [in ITree.Extra.Secure.SecureEqBind]
l:10 [in ITree.Extra.Secure.SecureEqProgInsens]
l:10 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:10 [in ITree.Extra.Secure.SecureEqHalt]
l:103 [in ITree.Extra.Secure.SecureEqProgInsens]
l:107 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:107 [in ITree.Extra.Secure.SecureEqHalt]
l:109 [in ITree.Extra.Secure.SecureEqWcompat]
l:11 [in ITree.Basics.CategoryRelations]
l:110 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:112 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:114 [in ITree.Extra.Secure.SecureEqProgInsens]
l:114 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:114 [in ITree.Extra.Secure.SecureEqHalt]
l:115 [in ITree.Extra.Secure.SecureEqBind]
l:12 [in ITree.Extra.Secure.SecureStateHandler]
l:12 [in ITree.Extra.Secure.SecureStateHandlerPi]
l:127 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:127 [in ITree.Extra.Secure.SecureEqHalt]
l:128 [in ITree.Extra.Secure.SecureEqProgInsens]
l:13 [in ITree.Extra.Secure.SecureEqBind]
l:130 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:132 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:132 [in ITree.Extra.Secure.SecureEqHalt]
l:138 [in ITree.Extra.Secure.SecureEqProgInsens]
l:140 [in ITree.Extra.Secure.SecureEqBind]
l:142 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:142 [in ITree.Extra.Secure.SecureEqHalt]
l:147 [in ITree.Extra.Secure.SecureEqProgInsens]
l:148 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:16 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:160 [in ITree.Extra.Secure.SecureEqProgInsens]
l:162 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:163 [in ITree.Extra.Secure.SecureEqBind]
l:173 [in ITree.Extra.Secure.SecureEqProgInsens]
l:173 [in ITree.Extra.Secure.SecureEqBind]
l:177 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:18 [in ITree.Extra.ITrace.ITraceDefinition]
l:18 [in ITree.Extra.Secure.SecureEqWcompat]
l:18 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:185 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:185 [in ITree.Extra.Secure.SecureEqHalt]
l:186 [in ITree.Extra.Secure.SecureEqProgInsens]
l:192 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:199 [in ITree.Extra.Secure.SecureEqProgInsens]
l:199 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
l:199 [in ITree.Extra.Secure.SecureEqHalt]
l:203 [in ITree.Extra.Secure.SecureEqProgInsens]
l:207 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:21 [in ITree.Extra.Secure.SecureEqEuttTrans]
l:22 [in ITree.Extra.ITrace.ITraceFacts]
l:222 [in ITree.Extra.Secure.SecureEqProgInsens]
l:224 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:233 [in ITree.Extra.Secure.SecureEqProgInsens]
l:240 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:242 [in ITree.Extra.Secure.SecureEqProgInsens]
l:25 [in ITree.Extra.ITrace.ITraceFacts]
l:251 [in ITree.Extra.Secure.SecureEqProgInsens]
l:262 [in ITree.Extra.Secure.SecureEqProgInsens]
l:262 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:268 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:28 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:284 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:289 [in ITree.Extra.Secure.SecureEqProgInsens]
l:291 [in ITree.Eq.Eqit]
l:306 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:31 [in ITree.Basics.Function]
l:31 [in ITree.Basics.CategoryKleisli]
l:312 [in ITree.Extra.Secure.SecureEqProgInsens]
l:323 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:326 [in ITree.Extra.IForest]
l:327 [in ITree.Extra.IForest]
l:33 [in ITree.Extra.Secure.SecureEqBind]
l:33 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:332 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:342 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:350 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:37 [in ITree.Extra.Secure.SecureEqEuttTrans]
l:4 [in ITree.Basics.CategoryRelations]
l:42 [in ITree.Core.ITreeDefinition]
l:43 [in ITree.Core.ITreeDefinition]
l:45 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:47 [in ITree.Extra.Secure.SecureEqWcompat]
l:47 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:51 [in ITree.Extra.Secure.SecureEqWcompat]
l:52 [in ITree.Extra.Secure.SecureEqBind]
l:54 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:6 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:61 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:628 [in ITree.Eq.Eqit]
l:629 [in ITree.Eq.Eqit]
l:69 [in ITree.Extra.Secure.SecureEqProgInsens]
l:7 [in ITree.Extra.Secure.SecureEqEuttTrans]
l:70 [in ITree.Extra.Secure.SecureEqWcompat]
l:70 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:71 [in ITree.Extra.Secure.SecureEqBind]
l:76 [in ITree.Extra.Secure.SecureEqProgInsens]
l:78 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:82 [in ITree.Extra.Secure.SecureEqEuttHalt]
l:89 [in ITree.Extra.Secure.SecureEqProgInsens]
l:89 [in ITree.Extra.Secure.SecureEqWcompat]
l:9 [in ITree.Extra.Secure.SecureEqWcompat]
l:90 [in ITree.Extra.Secure.SecureEqBind]
l:91 [in ITree.Eq.Shallow]
l:91 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
l:92 [in ITree.Eq.Shallow]
l:94 [in ITree.Extra.Secure.SecureEqProgInsens]
l:97 [in ITree.Extra.Secure.SecureEqEuttHalt]

M

map:15 [in ITree.Events.MapDefault]
map:17 [in ITree.Events.Map]
map:3 [in ITree.Events.MapDefaultFacts]
ma':47 [in ITree.Basics.CategoryRelations]
ma':51 [in ITree.Basics.CategoryRelations]
ma':890 [in ITree.Eq.Eqit]
ma':898 [in ITree.Eq.Eqit]
ma':906 [in ITree.Eq.Eqit]
ma:38 [in ITree.Basics.CategoryRelations]
ma:416 [in ITree.Extra.IForest]
ma:42 [in ITree.Basics.CategoryRelations]
ma:550 [in ITree.Extra.IForest]
ma:822 [in ITree.Eq.Eqit]
ma:829 [in ITree.Eq.Eqit]
ma:836 [in ITree.Eq.Eqit]
ma:851 [in ITree.Eq.Eqit]
ma:862 [in ITree.Eq.Eqit]
ma:873 [in ITree.Eq.Eqit]
ma:887 [in ITree.Eq.Eqit]
ma:895 [in ITree.Eq.Eqit]
ma:903 [in ITree.Eq.Eqit]
MIm:4 [in ITree.Events.FailFacts]
ML:5 [in ITree.Basics.CategoryKleisliFacts]
ML:6 [in ITree.Basics.MonadState]
MMonad:41 [in ITree.Extra.Dijkstra.DijkstraMonad]
MMonad:60 [in ITree.Extra.Dijkstra.DijkstraMonad]
MM:18 [in ITree.Interp.Interp]
Mm:3 [in ITree.Events.FailFacts]
Mm:3 [in ITree.Basics.CategoryKleisliFacts]
MM:37 [in ITree.Events.FailFacts]
MM:5 [in ITree.Events.State]
MM:51 [in ITree.Basics.Basics]
MM:62 [in ITree.Basics.Basics]
MM:79 [in ITree.Basics.Basics]
MM:88 [in ITree.Basics.Basics]
MOk:5 [in ITree.Events.MapDefaultFacts]
MonadLawsW:44 [in ITree.Extra.Dijkstra.DijkstraMonad]
MonadLawsW:63 [in ITree.Extra.Dijkstra.DijkstraMonad]
MonadLawsW:8 [in ITree.Extra.Dijkstra.DijkstraMonad]
MonadLawsW:9 [in ITree.Extra.Dijkstra.StateSpecT]
MonadMorphismMW:21 [in ITree.Extra.Dijkstra.StateSpecT]
MonadM:19 [in ITree.Extra.Dijkstra.StateSpecT]
MonadW:28 [in ITree.Extra.Dijkstra.DijkstraMonad]
MonadW:3 [in ITree.Extra.Dijkstra.StateSpecT]
MonadW:7 [in ITree.Extra.Dijkstra.DijkstraMonad]
Monad:13 [in ITree.Basics.Monad]
Monoid_W:27 [in ITree.Events.Writer]
Monoid_W:21 [in ITree.Events.Writer]
MON:116 [in ITree.Props.Leaf]
MON:122 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
MON:122 [in ITree.Extra.Secure.SecureEqHalt]
MON:129 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
MON:129 [in ITree.Extra.Secure.SecureEqHalt]
MON:231 [in ITree.Eq.Eqit]
MON:242 [in ITree.Eq.Eqit]
MON:365 [in ITree.Extra.IForest]
MON:48 [in ITree.Eq.Eqit]
MON:54 [in ITree.Eq.Eqit]
MON:59 [in ITree.Eq.UpToTaus]
MON:681 [in ITree.Eq.Eqit]
MON:84 [in ITree.Extra.Secure.SecureEqProgInsens]
MON:89 [in ITree.Eq.UpToTaus]
MON:91 [in ITree.Extra.Secure.SecureEqProgInsens]
ms:271 [in ITree.Extra.IForest]
mx:106 [in ITree.Events.FailFacts]
mx:322 [in ITree.Basics.HeterogeneousRelations]
mx:82 [in ITree.Events.FailFacts]
my:323 [in ITree.Basics.HeterogeneousRelations]
m1:12 [in ITree.Extra.Secure.SecureEqEuttTrans]
m1:16 [in ITree.Eq.Eqit]
m1:17 [in ITree.Eq.Rutt]
m1:18 [in ITree.Extra.Secure.SecureStateHandler]
m1:18 [in ITree.Extra.Secure.SecureStateHandlerPi]
m1:26 [in ITree.Extra.Secure.SecureEqEuttTrans]
m1:31 [in ITree.Extra.Secure.SecureEqEuttHalt]
m1:32 [in ITree.Events.MapDefault]
m1:48 [in ITree.Extra.Secure.SecureEqEuttHalt]
m1:69 [in ITree.Extra.ITrace.ITracePrefix]
m1:85 [in ITree.Extra.ITrace.ITracePrefix]
m2:13 [in ITree.Extra.Secure.SecureEqEuttTrans]
m2:17 [in ITree.Eq.Eqit]
m2:18 [in ITree.Eq.Rutt]
m2:19 [in ITree.Extra.Secure.SecureStateHandler]
m2:19 [in ITree.Extra.Secure.SecureStateHandlerPi]
m2:27 [in ITree.Extra.Secure.SecureEqEuttTrans]
m2:32 [in ITree.Extra.Secure.SecureEqEuttHalt]
m2:33 [in ITree.Events.MapDefault]
m2:49 [in ITree.Extra.Secure.SecureEqEuttHalt]
m2:86 [in ITree.Extra.ITrace.ITracePrefix]
m3:441 [in ITree.Eq.Eqit]
m3:442 [in ITree.Eq.Eqit]
m3:443 [in ITree.Eq.Eqit]
m3:444 [in ITree.Eq.Eqit]
m3:46 [in ITree.Extra.Secure.SecureEqEuttTrans]
m3:47 [in ITree.Extra.Secure.SecureEqEuttTrans]
m3:48 [in ITree.Extra.Secure.SecureEqEuttTrans]
m3:49 [in ITree.Extra.Secure.SecureEqEuttTrans]
m3:61 [in ITree.Extra.Secure.SecureEqEuttHalt]
m3:62 [in ITree.Extra.Secure.SecureEqEuttHalt]
m3:63 [in ITree.Extra.Secure.SecureEqEuttHalt]
m3:64 [in ITree.Extra.Secure.SecureEqEuttHalt]
m3:71 [in ITree.Extra.ITrace.ITraceFacts]
m3:72 [in ITree.Extra.ITrace.ITraceFacts]
m3:73 [in ITree.Extra.ITrace.ITraceFacts]
m3:74 [in ITree.Extra.ITrace.ITraceFacts]
m:1 [in ITree.Events.FailFacts]
M:1 [in ITree.Basics.Monad]
m:1 [in ITree.Basics.CategoryKleisliFacts]
m:1 [in ITree.Basics.CategoryKleisli]
M:1 [in ITree.Extra.Dijkstra.DijkstraMonad]
m:103 [in ITree.Extra.Dijkstra.StateDelaySpec]
M:11 [in ITree.Basics.Monad]
m:11 [in ITree.Basics.Basics]
m:113 [in ITree.Extra.Dijkstra.StateDelaySpec]
m:12 [in ITree.Basics.CategoryKleisli]
m:12 [in ITree.Interp.RecursionFacts]
m:134 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
m:134 [in ITree.Extra.Secure.SecureEqHalt]
m:136 [in ITree.Extra.Secure.SecureStateHandler]
M:16 [in ITree.Events.MapDefault]
M:16 [in ITree.Interp.Interp]
M:18 [in ITree.Events.Map]
m:18 [in ITree.Basics.CategoryKleisli]
m:18 [in ITree.Extra.Dijkstra.StateDelaySpec]
M:18 [in ITree.Extra.Dijkstra.StateSpecT]
M:2 [in ITree.Events.State]
m:21 [in ITree.Basics.Basics]
m:22 [in ITree.Extra.Dijkstra.StateDelaySpec]
m:22 [in ITree.Extra.Dijkstra.StateSpecT]
m:223 [in ITree.Extra.ITrace.ITraceFacts]
m:23 [in ITree.Events.MapDefault]
m:26 [in ITree.Basics.Basics]
m:27 [in ITree.Extra.Secure.SecureStateHandler]
m:27 [in ITree.Extra.Secure.SecureStateHandlerPi]
m:28 [in ITree.Basics.Basics]
m:3 [in ITree.Interp.Handler]
m:30 [in ITree.Extra.Secure.SecureStateHandler]
m:30 [in ITree.Extra.Secure.SecureStateHandlerPi]
M:35 [in ITree.Events.FailFacts]
m:35 [in ITree.Basics.Basics]
m:35 [in ITree.Extra.Dijkstra.IterRel]
M:35 [in ITree.Extra.Dijkstra.DijkstraMonad]
m:37 [in ITree.Extra.Dijkstra.StateDelaySpec]
m:37 [in ITree.Extra.Dijkstra.StateIOTrace]
M:39 [in ITree.Extra.Dijkstra.DijkstraMonad]
m:4 [in ITree.Basics.CategoryKleisli]
m:4 [in ITree.Extra.Dijkstra.StateDelaySpec]
M:4 [in ITree.Events.MapDefaultFacts]
m:42 [in ITree.Extra.Dijkstra.StateDelaySpec]
M:44 [in ITree.Basics.Basics]
m:46 [in ITree.Events.MapDefaultFacts]
m:48 [in ITree.Extra.Secure.SecureStateHandlerPi]
M:49 [in ITree.Basics.Basics]
m:5 [in ITree.Events.FailFacts]
M:5 [in ITree.Basics.Monad]
m:54 [in ITree.Extra.Dijkstra.DijkstraMonad]
m:57 [in ITree.Extra.Dijkstra.StateDelaySpec]
M:58 [in ITree.Extra.Dijkstra.DijkstraMonad]
m:6 [in ITree.Basics.Basics]
M:60 [in ITree.Basics.Basics]
m:62 [in ITree.Extra.Dijkstra.StateDelaySpec]
m:69 [in ITree.Extra.Dijkstra.DijkstraMonad]
M:71 [in ITree.Basics.Basics]
m:72 [in ITree.Extra.Dijkstra.DijkstraMonad]
m:76 [in ITree.Extra.Dijkstra.StateDelaySpec]
M:78 [in ITree.Basics.Basics]
m:8 [in ITree.Basics.CategoryKleisli]
m:80 [in ITree.Extra.Dijkstra.StateDelaySpec]
M:86 [in ITree.Basics.Basics]
m:92 [in ITree.Extra.Dijkstra.StateDelaySpec]

N

NEQ:554 [in ITree.Extra.IForest]
next:23 [in ITree.Extra.Dijkstra.StateIOTrace]
n':55 [in ITree.Extra.Dijkstra.IterRel]
n':58 [in ITree.Extra.Dijkstra.IterRel]
n0:53 [in ITree.Extra.Dijkstra.IterRel]
n0:56 [in ITree.Extra.Dijkstra.IterRel]
n0:59 [in ITree.Extra.Dijkstra.IterRel]
n1:54 [in ITree.Extra.Dijkstra.IterRel]
n1:57 [in ITree.Extra.Dijkstra.IterRel]
n1:60 [in ITree.Extra.Dijkstra.IterRel]
n1:63 [in ITree.Extra.Dijkstra.IterRel]
n2:64 [in ITree.Extra.Dijkstra.IterRel]
n:133 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
n:133 [in ITree.Extra.Secure.SecureEqHalt]
n:19 [in ITree.Extra.Dijkstra.StateIOTrace]
n:28 [in ITree.Extra.Dijkstra.StateIOTrace]
n:33 [in ITree.Extra.Dijkstra.StateIOTrace]
n:36 [in ITree.Extra.Dijkstra.StateIOTrace]
n:39 [in ITree.Extra.Dijkstra.PureITreeBasics]
n:40 [in ITree.Extra.Dijkstra.StateIOTrace]
n:44 [in ITree.Extra.Dijkstra.StateIOTrace]
n:52 [in ITree.Extra.Dijkstra.IterRel]
n:62 [in ITree.Extra.Dijkstra.IterRel]
n:79 [in ITree.Core.ITreeDefinition]

O

OBG:134 [in ITree.Eq.UpToTaus]
OBG:38 [in ITree.Eq.Paco2]
obj1:1 [in ITree.Basics.CategoryFunctor]
obj2:2 [in ITree.Basics.CategoryFunctor]
obj:1 [in ITree.Basics.CategoryOps]
obj:1 [in ITree.Basics.CategoryFacts]
obj:1 [in ITree.Basics.CategoryTheory]
obj:1 [in ITree.Basics.CategorySub]
obj:123 [in ITree.Basics.CategoryTheory]
obj:127 [in ITree.Basics.CategoryOps]
OBJ:151 [in ITree.Eq.UpToTaus]
obj:155 [in ITree.Basics.CategoryOps]
obj:162 [in ITree.Basics.CategoryTheory]
obj:168 [in ITree.Basics.CategoryOps]
obj:174 [in ITree.Basics.CategoryOps]
obj:191 [in ITree.Basics.CategoryOps]
obj:201 [in ITree.Basics.CategoryTheory]
obj:215 [in ITree.Basics.CategoryFacts]
obj:229 [in ITree.Basics.CategoryTheory]
obj:27 [in ITree.Basics.CategoryOps]
obj:27 [in ITree.Basics.CategoryFunctor]
obj:303 [in ITree.Basics.CategoryTheory]
obj:341 [in ITree.Basics.CategoryTheory]
obj:342 [in ITree.Basics.CategoryFacts]
obj:44 [in ITree.Basics.CategoryFacts]
obj:45 [in ITree.Basics.CategoryTheory]
obj:63 [in ITree.Basics.CategoryTheory]
obj:64 [in ITree.Basics.CategoryFacts]
obj:75 [in ITree.Basics.CategoryTheory]
obj:88 [in ITree.Basics.CategoryFacts]
obj:92 [in ITree.Basics.CategoryOps]
obj:92 [in ITree.Basics.CategoryTheory]
obj:99 [in ITree.Basics.CategoryOps]
obr:13 [in ITree.Extra.ITrace.ITracePrefix]
obs:12 [in ITree.Extra.ITrace.ITracePrefix]
Obs:47 [in ITree.Extra.Dijkstra.DijkstraMonad]
Obs:66 [in ITree.Extra.Dijkstra.DijkstraMonad]
ob:17 [in ITree.Extra.ITrace.ITraceBind]
ob:43 [in ITree.Extra.ITrace.ITraceBind]
ob:52 [in ITree.Extra.ITrace.ITracePrefix]
oi:84 [in ITree.Basics.Basics]
ONE:206 [in ITree.Basics.CategoryTheory]
OrderedMonadW:30 [in ITree.Extra.Dijkstra.DijkstraMonad]
OrderedMonadW:5 [in ITree.Extra.Dijkstra.StateSpecT]
OrderW:29 [in ITree.Extra.Dijkstra.DijkstraMonad]
OrderW:4 [in ITree.Extra.Dijkstra.StateSpecT]
OrderW:9 [in ITree.Extra.Dijkstra.DijkstraMonad]
osl:56 [in ITree.Extra.Dijkstra.ITreeDijkstra]
ot1:101 [in ITree.Eq.Shallow]
ot1:109 [in ITree.Eq.Shallow]
ot1:139 [in ITree.Extra.Dijkstra.ITreeDijkstra]
ot1:143 [in ITree.Eq.Eqit]
ot1:16 [in ITree.Eq.SimUpToTaus]
ot1:22 [in ITree.Extra.Secure.SecureEqHalt]
ot1:29 [in ITree.Eq.Rutt]
ot1:29 [in ITree.Eq.Eqit]
ot2:102 [in ITree.Eq.Shallow]
ot2:110 [in ITree.Eq.Shallow]
ot2:138 [in ITree.Extra.Dijkstra.ITreeDijkstra]
ot2:144 [in ITree.Eq.Eqit]
ot2:20 [in ITree.Extra.Secure.SecureEqHalt]
ot2:20 [in ITree.Eq.SimUpToTaus]
ot2:26 [in ITree.Eq.Eqit]
ot2:28 [in ITree.Eq.Rutt]
ot2:76 [in ITree.Eq.SimUpToTaus]
ot:109 [in ITree.Extra.ITrace.ITraceBind]
ot:116 [in ITree.Extra.ITrace.ITraceFacts]
ot:15 [in ITree.Interp.InterpFacts]
ot:18 [in ITree.Extra.ITrace.ITraceBind]
ot:201 [in ITree.Simple]
ot:295 [in ITree.Eq.Eqit]
ot:408 [in ITree.Eq.Eqit]
ot:44 [in ITree.Extra.ITrace.ITraceBind]
ot:44 [in ITree.Events.FailFacts]
ot:5 [in ITree.Interp.RecursionFacts]
ot:59 [in ITree.Simple]
ot:6 [in ITree.Events.StateFacts]
ov:15 [in ITree.Events.Map]

P

Pair_C:209 [in ITree.Basics.CategoryTheory]
Pair_C:168 [in ITree.Basics.CategoryTheory]
pat:119 [in ITree.Basics.Basics]
pat:32 [in ITree.Extra.Dijkstra.StateSpecT]
pat:38 [in ITree.Basics.Function]
pat:46 [in ITree.Extra.Dijkstra.StateSpecT]
pat:471 [in ITree.Extra.IForest]
pat:479 [in ITree.Extra.IForest]
pat:492 [in ITree.Extra.IForest]
pat:497 [in ITree.Extra.IForest]
pat:52 [in ITree.Extra.Dijkstra.StateSpecT]
pat:63 [in ITree.Events.State]
pat:66 [in ITree.Basics.CategoryRelations]
pat:66 [in ITree.Events.State]
pat:69 [in ITree.Extra.Dijkstra.StateSpecT]
pat:70 [in ITree.Basics.CategoryRelations]
pat:72 [in ITree.Extra.Dijkstra.StateSpecT]
pat:77 [in ITree.Basics.CategoryRelations]
pat:81 [in ITree.Basics.CategoryRelations]
pat:83 [in ITree.Basics.CategoryRelations]
pat:86 [in ITree.Basics.CategoryRelations]
pat:90 [in ITree.Basics.CategoryRelations]
pat:93 [in ITree.Basics.CategoryRelations]
PA':503 [in ITree.Extra.IForest]
PA':511 [in ITree.Extra.IForest]
PA':9 [in ITree.Extra.IForest]
PA:109 [in ITree.Basics.Basics]
PA:115 [in ITree.Basics.Basics]
PA:16 [in ITree.Extra.IForest]
Pa:3 [in ITree.Basics.MonadProp]
PA:502 [in ITree.Extra.IForest]
PA:510 [in ITree.Extra.IForest]
PA:523 [in ITree.Extra.IForest]
PA:534 [in ITree.Extra.IForest]
PA:54 [in ITree.Extra.IForest]
PA:564 [in ITree.Extra.IForest]
PA:602 [in ITree.Extra.IForest]
PA:65 [in ITree.Extra.IForest]
PA:76 [in ITree.Extra.IForest]
PA:8 [in ITree.Extra.IForest]
PB:110 [in ITree.Basics.Basics]
PB:116 [in ITree.Basics.Basics]
peel:13 [in ITree.Extra.ITrace.ITraceBind]
peel:39 [in ITree.Extra.ITrace.ITraceBind]
PEF:70 [in ITree.Extra.ITrace.ITracePreds]
PEF:86 [in ITree.Extra.ITrace.ITracePreds]
PEF:93 [in ITree.Extra.ITrace.ITracePreds]
PEL:72 [in ITree.Extra.ITrace.ITracePreds]
PEL:87 [in ITree.Extra.ITrace.ITracePreds]
PEL:94 [in ITree.Extra.ITrace.ITracePreds]
PEv:104 [in ITree.Extra.ITrace.ITracePreds]
PEv:117 [in ITree.Extra.ITrace.ITracePreds]
PEv:120 [in ITree.Extra.ITrace.ITracePreds]
PEv:123 [in ITree.Extra.ITrace.ITracePreds]
PEv:127 [in ITree.Extra.ITrace.ITracePreds]
PE:17 [in ITree.Extra.ITrace.ITracePreds]
PE:23 [in ITree.Extra.ITrace.ITracePreds]
PE:27 [in ITree.Extra.ITrace.ITracePreds]
PE:32 [in ITree.Extra.ITrace.ITracePreds]
PE:38 [in ITree.Extra.ITrace.ITracePreds]
PE:42 [in ITree.Extra.ITrace.ITracePreds]
PE:47 [in ITree.Extra.ITrace.ITracePreds]
PE:5 [in ITree.Extra.ITrace.ITracePreds]
PE:58 [in ITree.Extra.ITrace.ITracePreds]
PE:63 [in ITree.Extra.ITrace.ITracePreds]
PE:66 [in ITree.Extra.ITrace.ITracePreds]
pf:16 [in ITree.Events.Concurrency]
PF:304 [in ITree.Extra.IForest]
post0:35 [in ITree.Extra.Dijkstra.StateDelaySpec]
post1:101 [in ITree.Extra.Dijkstra.StateDelaySpec]
post1:111 [in ITree.Extra.Dijkstra.StateDelaySpec]
post1:36 [in ITree.Extra.Dijkstra.StateDelaySpec]
post2:102 [in ITree.Extra.Dijkstra.StateDelaySpec]
post2:112 [in ITree.Extra.Dijkstra.StateDelaySpec]
post:11 [in ITree.Extra.Dijkstra.StateIOTrace]
post:17 [in ITree.Extra.Dijkstra.StateDelaySpec]
post:45 [in ITree.Extra.Dijkstra.StateDelaySpec]
post:52 [in ITree.Extra.Dijkstra.StateDelaySpec]
post:64 [in ITree.Extra.Dijkstra.StateDelaySpec]
post:69 [in ITree.Extra.Dijkstra.StateDelaySpec]
post:75 [in ITree.Extra.Dijkstra.StateDelaySpec]
post:76 [in ITree.Extra.Dijkstra.TracesIT]
post:82 [in ITree.Extra.Dijkstra.TracesIT]
post:88 [in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:41 [in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:48 [in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:56 [in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:79 [in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:83 [in ITree.Extra.Dijkstra.StateDelaySpec]
ppl:91 [in ITree.Extra.Dijkstra.StateDelaySpec]
pppp:21 [in ITree.Extra.Dijkstra.StateDelaySpec]
pppp:26 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:38 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:44 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:5 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:51 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:58 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:61 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:67 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:81 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:86 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:9 [in ITree.Extra.Dijkstra.StateDelaySpec]
pp:93 [in ITree.Extra.Dijkstra.StateDelaySpec]
PQOK:605 [in ITree.Extra.IForest]
prefix_body:29 [in ITree.Events.Exception]
PRet:105 [in ITree.Extra.ITrace.ITracePreds]
PRet:118 [in ITree.Extra.ITrace.ITracePreds]
PRet:121 [in ITree.Extra.ITrace.ITracePreds]
PRet:124 [in ITree.Extra.ITrace.ITracePreds]
PRet:128 [in ITree.Extra.ITrace.ITracePreds]
pre0:33 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre1:109 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre1:34 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre1:99 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre2:100 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre2:110 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre:10 [in ITree.Extra.Dijkstra.StateIOTrace]
pre:16 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre:17 [in ITree.Events.Nondeterminism]
pre:46 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre:53 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre:63 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre:68 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre:74 [in ITree.Extra.Dijkstra.StateDelaySpec]
pre:77 [in ITree.Extra.Dijkstra.TracesIT]
pre:83 [in ITree.Extra.Dijkstra.TracesIT]
pre:87 [in ITree.Extra.Dijkstra.StateDelaySpec]
priv1:9 [in ITree.Extra.Secure.SecureStateHandler]
priv1:9 [in ITree.Extra.Secure.SecureStateHandlerPi]
priv2:11 [in ITree.Extra.Secure.SecureStateHandler]
priv2:11 [in ITree.Extra.Secure.SecureStateHandlerPi]
priv:102 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:108 [in ITree.Extra.Secure.SecureEqWcompat]
priv:109 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:111 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:113 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:114 [in ITree.Extra.Secure.SecureEqBind]
priv:12 [in ITree.Extra.Secure.SecureEqBind]
priv:127 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:129 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:137 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:139 [in ITree.Extra.Secure.SecureEqBind]
priv:141 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:141 [in ITree.Extra.Secure.SecureEqHalt]
priv:146 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:147 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:15 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:159 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:161 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:162 [in ITree.Extra.Secure.SecureEqBind]
priv:17 [in ITree.Extra.Secure.SecureEqWcompat]
priv:17 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:172 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:172 [in ITree.Extra.Secure.SecureEqBind]
priv:176 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:184 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:184 [in ITree.Extra.Secure.SecureEqHalt]
priv:185 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:191 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:198 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:198 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:198 [in ITree.Extra.Secure.SecureEqHalt]
priv:20 [in ITree.Extra.Secure.SecureEqEuttTrans]
priv:202 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:206 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:221 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:223 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:232 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:239 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:241 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:250 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:261 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:261 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:267 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:27 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:283 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:288 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:305 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:311 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:32 [in ITree.Extra.Secure.SecureEqBind]
priv:32 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:322 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:331 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:341 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:349 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:36 [in ITree.Extra.Secure.SecureEqEuttTrans]
priv:44 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:46 [in ITree.Extra.Secure.SecureEqWcompat]
priv:46 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:5 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:50 [in ITree.Extra.Secure.SecureEqWcompat]
priv:51 [in ITree.Extra.Secure.SecureEqBind]
priv:53 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:6 [in ITree.Extra.Secure.SecureEqProgInsens]
priv:6 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
priv:6 [in ITree.Extra.Secure.SecureEqHalt]
priv:6 [in ITree.Extra.Secure.SecureEqEuttTrans]
priv:60 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:69 [in ITree.Extra.Secure.SecureEqWcompat]
priv:69 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:70 [in ITree.Extra.Secure.SecureEqBind]
priv:77 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:8 [in ITree.Extra.Secure.SecureEqWcompat]
priv:81 [in ITree.Extra.Secure.SecureEqEuttHalt]
priv:88 [in ITree.Extra.Secure.SecureEqWcompat]
priv:89 [in ITree.Extra.Secure.SecureEqBind]
priv:90 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
priv:96 [in ITree.Extra.Secure.SecureEqEuttHalt]
Product_C:228 [in ITree.Basics.CategoryFacts]
Prod_C:225 [in ITree.Basics.CategoryFacts]
PROD:157 [in ITree.Basics.CategoryOps]
PROD:208 [in ITree.Basics.CategoryTheory]
Proper_Bimap_bif:33 [in ITree.Basics.CategoryFacts]
Proper_Cat_C:15 [in ITree.Basics.CategoryFacts]
PR:18 [in ITree.Extra.ITrace.ITracePreds]
PR:24 [in ITree.Extra.ITrace.ITracePreds]
PR:28 [in ITree.Extra.ITrace.ITracePreds]
PR:33 [in ITree.Extra.ITrace.ITracePreds]
PR:39 [in ITree.Extra.ITrace.ITracePreds]
PR:43 [in ITree.Extra.ITrace.ITracePreds]
PR:6 [in ITree.Extra.ITrace.ITracePreds]
PR:73 [in ITree.Extra.ITrace.ITracePreds]
PR:88 [in ITree.Extra.ITrace.ITracePreds]
PR:95 [in ITree.Extra.ITrace.ITracePreds]
p':100 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':14 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':16 [in ITree.Extra.Dijkstra.DelaySpecMonad]
p':23 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':46 [in ITree.Extra.Dijkstra.TracesIT]
p':7 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p':7 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p':9 [in ITree.Extra.Dijkstra.TracesIT]
p0:62 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p0:66 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p1:49 [in ITree.Basics.HeterogeneousRelations]
p2:50 [in ITree.Basics.HeterogeneousRelations]
P:1 [in ITree.Extra.ITrace.ITraceBind]
p:104 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:107 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:11 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:11 [in ITree.Extra.Dijkstra.PureITreeBasics]
P:111 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:112 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:112 [in ITree.Extra.ITrace.ITraceFacts]
P:113 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:115 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:118 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:118 [in ITree.Extra.Secure.SecureStateHandler]
p:12 [in ITree.Extra.Dijkstra.StateDelaySpec]
p:12 [in ITree.Eq.Shallow]
p:12 [in ITree.Extra.Dijkstra.DelaySpecMonad]
p:128 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:13 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:13 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:130 [in ITree.Eq.Eqit]
p:134 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:139 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:14 [in ITree.Extra.Dijkstra.TracesIT]
P:14 [in ITree.Axioms]
p:14 [in ITree.Extra.Dijkstra.StateIOTrace]
p:146 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:15 [in ITree.Axioms]
p:15 [in ITree.Extra.Dijkstra.DelaySpecMonad]
p:157 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:16 [in ITree.Axioms]
p:166 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:171 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:173 [in ITree.Extra.IForest]
p:174 [in ITree.Extra.IForest]
p:179 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:18 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:19 [in ITree.Extra.Dijkstra.TracesIT]
P:19 [in ITree.Axioms]
p:194 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:2 [in ITree.Eq.Shallow]
p:20 [in ITree.Extra.Dijkstra.DelaySpecMonad]
p:213 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:214 [in ITree.Eq.UpToTaus]
p:217 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:22 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:23 [in ITree.Extra.Dijkstra.TracesIT]
p:23 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:23 [in ITree.Eq.Shallow]
P:25 [in ITree.Props.HasPost]
p:25 [in ITree.Extra.Dijkstra.DelaySpecMonad]
P:28 [in ITree.Extra.Dijkstra.IterRel]
p:29 [in ITree.Extra.Dijkstra.TracesIT]
p:29 [in ITree.Extra.Dijkstra.StateDelaySpec]
p:3 [in ITree.Extra.Dijkstra.TracesIT]
P:3 [in ITree.Axioms]
p:3 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:3 [in ITree.Props.Infinite]
p:3 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:30 [in ITree.Props.HasPost]
p:30 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:302 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:303 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:311 [in ITree.Basics.HeterogeneousRelations]
P:315 [in ITree.Basics.HeterogeneousRelations]
P:317 [in ITree.Basics.HeterogeneousRelations]
P:319 [in ITree.Basics.HeterogeneousRelations]
p:333 [in ITree.Eq.Eqit]
P:34 [in ITree.Extra.Dijkstra.IterRel]
P:34 [in ITree.Extra.Secure.SecureStateHandler]
p:34 [in ITree.Extra.Dijkstra.DelaySpecMonad]
P:34 [in ITree.Extra.Secure.SecureStateHandlerPi]
P:35 [in ITree.Props.HasPost]
p:36 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:36 [in ITree.Eq.Shallow]
p:375 [in ITree.Eq.Eqit]
p:38 [in ITree.Extra.Dijkstra.TracesIT]
p:38 [in ITree.Extra.Dijkstra.DelaySpecMonad]
P:40 [in ITree.Props.HasPost]
p:41 [in ITree.Extra.Dijkstra.DelaySpecMonad]
p:44 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:45 [in ITree.Extra.Dijkstra.TracesIT]
P:47 [in ITree.Eq.Paco2]
p:5 [in ITree.Extra.Dijkstra.TracesIT]
P:5 [in ITree.Extra.IForest]
p:5 [in ITree.Eq.Shallow]
p:50 [in ITree.Extra.Dijkstra.StateDelaySpec]
P:50 [in ITree.Extra.Secure.SecureStateHandler]
p:52 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:53 [in ITree.Eq.Paco2]
p:530 [in ITree.Extra.IForest]
p:56 [in ITree.Eq.Paco2]
p:58 [in ITree.Extra.Dijkstra.StateSpecT]
p:59 [in ITree.Extra.Dijkstra.TracesIT]
p:59 [in ITree.Eq.Paco2]
p:6 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:6 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:61 [in ITree.Extra.Dijkstra.DelaySpecMonad]
P:62 [in ITree.Extra.Secure.SecureStateHandler]
p:64 [in ITree.Extra.Dijkstra.TracesIT]
p:646 [in ITree.Eq.Eqit]
p:66 [in ITree.Interp.Traces]
p:67 [in ITree.Interp.Traces]
P:67 [in ITree.Extra.Secure.SecureStateHandlerPi]
P:68 [in ITree.Extra.Dijkstra.IterRel]
P:68 [in ITree.Extra.Secure.SecureStateHandler]
P:7 [in ITree.Extra.Dijkstra.PureITreeBasics]
p:71 [in ITree.Extra.Dijkstra.StateDelaySpec]
P:71 [in ITree.Extra.Secure.SecureStateHandler]
p:73 [in ITree.Extra.Dijkstra.TracesIT]
p:73 [in ITree.Extra.Dijkstra.DelaySpecMonad]
P:76 [in ITree.Extra.Secure.SecureStateHandler]
P:77 [in ITree.Core.ITreeDefinition]
p:79 [in ITree.Extra.Dijkstra.TracesIT]
p:8 [in ITree.Extra.Dijkstra.TracesIT]
P:81 [in ITree.Extra.Secure.SecureStateHandler]
P:83 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:85 [in ITree.Extra.Dijkstra.TracesIT]
p:85 [in ITree.Extra.Dijkstra.StateDelaySpec]
P:85 [in ITree.Extra.Secure.SecureStateHandler]
p:86 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
p:88 [in ITree.Extra.Dijkstra.StateSpecT]
P:88 [in ITree.Extra.Secure.SecureStateHandler]
p:9 [in ITree.Extra.Dijkstra.DelaySpecMonad]
p:90 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:90 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:94 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:94 [in ITree.Eq.Eqit]
P:96 [in ITree.Extra.Dijkstra.ITreeDijkstra]
P:98 [in ITree.Extra.Dijkstra.ITreeDijkstra]
p:99 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
P:99 [in ITree.Extra.Secure.SecureStateHandler]

Q

Q1:89 [in ITree.Props.HasPost]
Q2:90 [in ITree.Props.HasPost]
Q:10 [in ITree.Props.HasPost]
Q:106 [in ITree.Props.HasPost]
q:11 [in ITree.Events.Concurrency]
Q:126 [in ITree.Props.HasPost]
Q:132 [in ITree.Props.HasPost]
Q:17 [in ITree.Props.HasPost]
q:20 [in ITree.Events.Concurrency]
Q:26 [in ITree.Props.HasPost]
Q:31 [in ITree.Props.HasPost]
Q:36 [in ITree.Props.HasPost]
Q:4 [in ITree.Props.HasPost]
Q:41 [in ITree.Props.HasPost]
Q:50 [in ITree.Props.HasPost]
Q:50 [in ITree.Eq.Paco2]
Q:58 [in ITree.Props.HasPost]
q:59 [in ITree.Extra.Dijkstra.StateSpecT]
q:60 [in ITree.Extra.Dijkstra.DelaySpecMonad]
Q:70 [in ITree.Props.HasPost]
q:75 [in ITree.Extra.Dijkstra.DelaySpecMonad]
Q:78 [in ITree.Core.ITreeDefinition]
Q:80 [in ITree.Props.HasPost]

R

RAns:10 [in ITree.Eq.Rutt]
RAns:119 [in ITree.Eq.Rutt]
RAns:130 [in ITree.Eq.Rutt]
RAns:153 [in ITree.Eq.Rutt]
RAns:39 [in ITree.Eq.Rutt]
RAns:48 [in ITree.Eq.Rutt]
RAns:57 [in ITree.Eq.Rutt]
RAns:66 [in ITree.Eq.Rutt]
RAns:75 [in ITree.Eq.Rutt]
RA:108 [in ITree.Extra.Secure.SecureEqBind]
RA:114 [in ITree.Events.StateFacts]
RA:133 [in ITree.Extra.Secure.SecureEqBind]
RA:157 [in ITree.Extra.Secure.SecureEqBind]
RA:282 [in ITree.Extra.Secure.SecureEqProgInsens]
RA:306 [in ITree.Extra.Secure.SecureEqProgInsens]
RA:35 [in ITree.Basics.HeterogeneousRelations]
RA:4 [in ITree.Indexed.Relation]
RA:47 [in ITree.Basics.HeterogeneousRelations]
RA:83 [in ITree.Extra.Secure.SecureEqBind]
RA:91 [in ITree.Events.StateFacts]
RB:109 [in ITree.Extra.Secure.SecureEqBind]
RB:115 [in ITree.Events.StateFacts]
RB:134 [in ITree.Extra.Secure.SecureEqBind]
RB:15 [in ITree.Indexed.Relation]
RB:158 [in ITree.Extra.Secure.SecureEqBind]
RB:23 [in ITree.Indexed.Relation]
RB:283 [in ITree.Extra.Secure.SecureEqProgInsens]
RB:29 [in ITree.Indexed.Relation]
RB:307 [in ITree.Extra.Secure.SecureEqProgInsens]
RB:35 [in ITree.Indexed.Relation]
RB:36 [in ITree.Basics.HeterogeneousRelations]
RB:41 [in ITree.Indexed.Relation]
RB:47 [in ITree.Indexed.Relation]
RB:48 [in ITree.Basics.HeterogeneousRelations]
RB:52 [in ITree.Indexed.Relation]
RB:6 [in ITree.Indexed.Relation]
RB:84 [in ITree.Extra.Secure.SecureEqBind]
rec:5 [in ITree.Interp.Interp]
Reflexive_R:25 [in ITree.Indexed.Relation]
REL1:421 [in ITree.Eq.Eqit]
REL2:422 [in ITree.Eq.Eqit]
REL:111 [in ITree.Props.Leaf]
REL:15 [in ITree.Eq.Eqit]
REL:158 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
REL:158 [in ITree.Extra.Secure.SecureEqHalt]
REL:18 [in ITree.Eq.Eqit]
REL:209 [in ITree.Eq.Eqit]
REL:24 [in ITree.Eq.Eqit]
REL:28 [in ITree.Eq.Eqit]
REL:32 [in ITree.Eq.Eqit]
REL:360 [in ITree.Extra.IForest]
REL:677 [in ITree.Eq.Eqit]
REL:95 [in ITree.Eq.Rutt]
REL:99 [in ITree.Extra.IForest]
remove_from_:21 [in ITree.Events.Nondeterminism]
RESCHECK:150 [in ITree.Extra.Secure.SecureStateHandler]
RESCHECK:167 [in ITree.Extra.Secure.SecureStateHandler]
RESCHECK:58 [in ITree.Extra.Secure.SecureStateHandlerPi]
RESCHECK:60 [in ITree.Extra.Secure.SecureStateHandlerPi]
res:36 [in ITree.Events.State]
RetTrans:102 [in ITree.Extra.ITrace.ITracePreds]
REv:116 [in ITree.Eq.Rutt]
REv:127 [in ITree.Eq.Rutt]
REv:150 [in ITree.Eq.Rutt]
REv:38 [in ITree.Eq.Rutt]
REv:47 [in ITree.Eq.Rutt]
REv:56 [in ITree.Eq.Rutt]
REv:65 [in ITree.Eq.Rutt]
REv:7 [in ITree.Eq.Rutt]
REv:74 [in ITree.Eq.Rutt]
RE:264 [in ITree.Basics.HeterogeneousRelations]
RE:5 [in ITree.Indexed.FunctionFacts]
RF:7 [in ITree.Indexed.FunctionFacts]
rg:115 [in ITree.Extra.Secure.SecureEqWcompat]
rg:135 [in ITree.Eq.Rutt]
rg:158 [in ITree.Eq.Rutt]
rg:212 [in ITree.Extra.Secure.SecureEqProgInsens]
rg:229 [in ITree.Extra.Secure.SecureEqProgInsens]
rg:260 [in ITree.Eq.Eqit]
rg:279 [in ITree.Eq.Eqit]
rg:28 [in ITree.Eq.Paco2]
rg:476 [in ITree.Eq.Eqit]
rg:492 [in ITree.Eq.Eqit]
rg:500 [in ITree.Eq.Eqit]
rg:514 [in ITree.Eq.Eqit]
rg:522 [in ITree.Eq.Eqit]
rg:536 [in ITree.Eq.Eqit]
rg:60 [in ITree.Extra.Secure.SecureEqWcompat]
rg:79 [in ITree.Extra.Secure.SecureEqWcompat]
rg:99 [in ITree.Extra.Secure.SecureEqWcompat]
rH:110 [in ITree.Eq.UpToTaus]
rH:114 [in ITree.Eq.UpToTaus]
rH:123 [in ITree.Eq.UpToTaus]
rH:135 [in ITree.Eq.UpToTaus]
rH:159 [in ITree.Eq.UpToTaus]
rH:165 [in ITree.Eq.UpToTaus]
rH:171 [in ITree.Eq.UpToTaus]
rH:177 [in ITree.Eq.UpToTaus]
rH:183 [in ITree.Eq.UpToTaus]
rH:189 [in ITree.Eq.UpToTaus]
rH:195 [in ITree.Eq.UpToTaus]
rH:204 [in ITree.Eq.UpToTaus]
rH:215 [in ITree.Eq.UpToTaus]
rH:221 [in ITree.Eq.UpToTaus]
rH:227 [in ITree.Eq.UpToTaus]
rH:235 [in ITree.Eq.UpToTaus]
rH:241 [in ITree.Eq.UpToTaus]
rH:249 [in ITree.Eq.UpToTaus]
rH:7 [in ITree.Eq.UpToTaus]
Rinv:22 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RI_i:56 [in ITree.Core.KTreeFacts]
RI_i:39 [in ITree.Core.KTreeFacts]
RI_i:24 [in ITree.Core.KTreeFacts]
RI1:45 [in ITree.Core.KTreeFacts]
RI2:46 [in ITree.Core.KTreeFacts]
RI:15 [in ITree.Core.KTreeFacts]
RI:30 [in ITree.Core.KTreeFacts]
RI:92 [in ITree.Events.StateFacts]
rL:111 [in ITree.Eq.UpToTaus]
rL:115 [in ITree.Eq.UpToTaus]
rL:124 [in ITree.Eq.UpToTaus]
rL:136 [in ITree.Eq.UpToTaus]
rL:160 [in ITree.Eq.UpToTaus]
rL:166 [in ITree.Eq.UpToTaus]
rL:172 [in ITree.Eq.UpToTaus]
rL:178 [in ITree.Eq.UpToTaus]
rL:184 [in ITree.Eq.UpToTaus]
rL:190 [in ITree.Eq.UpToTaus]
rL:196 [in ITree.Eq.UpToTaus]
rL:205 [in ITree.Eq.UpToTaus]
rL:216 [in ITree.Eq.UpToTaus]
rL:222 [in ITree.Eq.UpToTaus]
rL:228 [in ITree.Eq.UpToTaus]
rL:242 [in ITree.Eq.UpToTaus]
rL:250 [in ITree.Eq.UpToTaus]
rL:8 [in ITree.Eq.UpToTaus]
RR':182 [in ITree.Eq.Eqit]
RR1:124 [in ITree.Extra.Secure.SecureEqProgInsens]
RR1:131 [in ITree.Eq.Rutt]
RR1:154 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR1:154 [in ITree.Extra.Secure.SecureEqHalt]
RR1:154 [in ITree.Eq.Rutt]
RR1:156 [in ITree.Extra.Secure.SecureEqProgInsens]
RR1:169 [in ITree.Extra.Secure.SecureEqProgInsens]
RR1:182 [in ITree.Extra.Secure.SecureEqProgInsens]
RR1:19 [in ITree.Eq.Shallow]
RR1:195 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR1:195 [in ITree.Extra.Secure.SecureEqHalt]
RR1:195 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:205 [in ITree.Eq.Eqit]
RR1:206 [in ITree.Extra.Secure.SecureEqProgInsens]
RR1:210 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:23 [in ITree.Extra.Secure.SecureEqEuttTrans]
RR1:231 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:247 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:258 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:275 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:290 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR1:36 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR1:41 [in ITree.Extra.Secure.SecureEqEuttTrans]
RR1:414 [in ITree.Eq.Eqit]
RR1:432 [in ITree.Eq.Eqit]
RR1:470 [in ITree.Eq.Eqit]
RR1:496 [in ITree.Eq.Eqit]
RR1:518 [in ITree.Eq.Eqit]
RR1:54 [in ITree.Extra.Secure.SecureEqWcompat]
RR1:540 [in ITree.Eq.Eqit]
RR1:73 [in ITree.Extra.Secure.SecureEqWcompat]
RR1:79 [in ITree.Eq.UpToTaus]
RR1:9 [in ITree.Extra.Secure.SecureEqEuttTrans]
RR1:91 [in ITree.Eq.Rutt]
RR1:94 [in ITree.Extra.Secure.SecureEqWcompat]
RR2:10 [in ITree.Extra.Secure.SecureEqEuttTrans]
RR2:101 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:116 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:125 [in ITree.Extra.Secure.SecureEqProgInsens]
RR2:132 [in ITree.Eq.Rutt]
RR2:134 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:151 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:155 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR2:155 [in ITree.Extra.Secure.SecureEqHalt]
RR2:155 [in ITree.Eq.Rutt]
RR2:165 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:170 [in ITree.Extra.Secure.SecureEqProgInsens]
RR2:183 [in ITree.Extra.Secure.SecureEqProgInsens]
RR2:196 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR2:196 [in ITree.Extra.Secure.SecureEqHalt]
RR2:196 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:20 [in ITree.Eq.Shallow]
RR2:206 [in ITree.Eq.Eqit]
RR2:207 [in ITree.Extra.Secure.SecureEqProgInsens]
RR2:211 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:232 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:24 [in ITree.Extra.Secure.SecureEqEuttTrans]
RR2:248 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:259 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:276 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:291 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:37 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR2:415 [in ITree.Eq.Eqit]
RR2:42 [in ITree.Extra.Secure.SecureEqEuttTrans]
RR2:433 [in ITree.Eq.Eqit]
RR2:471 [in ITree.Eq.Eqit]
RR2:497 [in ITree.Eq.Eqit]
RR2:519 [in ITree.Eq.Eqit]
RR2:541 [in ITree.Eq.Eqit]
RR2:55 [in ITree.Extra.Secure.SecureEqWcompat]
RR2:74 [in ITree.Extra.Secure.SecureEqWcompat]
RR2:74 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:86 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR2:92 [in ITree.Eq.Rutt]
RR2:95 [in ITree.Extra.Secure.SecureEqWcompat]
rr:10 [in ITree.Events.Concurrency]
rr:10 [in ITree.Eq.Paco2]
RR:100 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:100 [in ITree.Eq.SimUpToTaus]
RR:101 [in ITree.Eq.UpToTaus]
RR:103 [in ITree.Extra.Secure.SecureStateHandler]
RR:103 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:104 [in ITree.Props.HasPost]
RR:11 [in ITree.Eq.Rutt]
RR:110 [in ITree.Eq.Eqit]
RR:111 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:111 [in ITree.Extra.Secure.SecureStateHandler]
RR:119 [in ITree.Extra.IForest]
RR:120 [in ITree.Eq.Rutt]
RR:121 [in ITree.Extra.Secure.SecureStateHandler]
RR:122 [in ITree.Eq.UpToTaus]
RR:123 [in ITree.Eq.Eqit]
RR:128 [in ITree.Props.Leaf]
RR:129 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:130 [in ITree.Extra.IForest]
RR:132 [in ITree.Extra.Secure.SecureStateHandler]
RR:135 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:138 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR:138 [in ITree.Extra.Secure.SecureEqHalt]
RR:138 [in ITree.Extra.IForest]
RR:138 [in ITree.Eq.Eqit]
RR:143 [in ITree.Extra.IForest]
RR:144 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:145 [in ITree.Extra.IForest]
RR:145 [in ITree.Props.Leaf]
RR:145 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:15 [in ITree.Extra.Secure.SecureEqWcompat]
RR:152 [in ITree.Basics.HeterogeneousRelations]
RR:153 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:155 [in ITree.Extra.IForest]
RR:158 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:16 [in ITree.Core.KTreeFacts]
RR:164 [in ITree.Extra.IForest]
RR:165 [in ITree.Eq.Eqit]
RR:17 [in ITree.Extra.Secure.SecureStateHandler]
RR:17 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:17 [in ITree.Extra.Secure.SecureStateHandlerPi]
RR:170 [in ITree.Extra.IForest]
RR:173 [in ITree.Eq.Eqit]
RR:178 [in ITree.Extra.Secure.SecureEqBind]
RR:178 [in ITree.Extra.Secure.SecureStateHandler]
RR:180 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:181 [in ITree.Eq.Eqit]
RR:182 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR:182 [in ITree.Extra.Secure.SecureEqHalt]
RR:184 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:185 [in ITree.Extra.IForest]
RR:189 [in ITree.Basics.HeterogeneousRelations]
RR:191 [in ITree.Extra.IForest]
RR:193 [in ITree.Eq.Eqit]
RR:195 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:196 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:196 [in ITree.Extra.IForest]
RR:202 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:209 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:214 [in ITree.Extra.IForest]
RR:234 [in ITree.Eq.UpToTaus]
RR:238 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:240 [in ITree.Eq.UpToTaus]
RR:244 [in ITree.Extra.IForest]
RR:246 [in ITree.Eq.Eqit]
RR:248 [in ITree.Eq.UpToTaus]
RR:250 [in ITree.Extra.IForest]
RR:252 [in ITree.Extra.Dijkstra.ITreeDijkstra]
RR:256 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:256 [in ITree.Eq.UpToTaus]
RR:256 [in ITree.Extra.IForest]
RR:258 [in ITree.Basics.HeterogeneousRelations]
RR:26 [in ITree.Eq.SimUpToTaus]
RR:26 [in ITree.Extra.Secure.SecureEqBind]
RR:260 [in ITree.Eq.UpToTaus]
RR:264 [in ITree.Eq.UpToTaus]
RR:265 [in ITree.Extra.IForest]
RR:268 [in ITree.Eq.UpToTaus]
RR:269 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:272 [in ITree.Eq.UpToTaus]
RR:277 [in ITree.Extra.IForest]
RR:281 [in ITree.Eq.UpToTaus]
RR:29 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:309 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:31 [in ITree.Core.KTreeFacts]
RR:316 [in ITree.Eq.Eqit]
RR:324 [in ITree.Eq.Eqit]
RR:33 [in ITree.Eq.SimUpToTaus]
rr:33 [in ITree.Eq.Paco2]
RR:337 [in ITree.Eq.Eqit]
RR:339 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:34 [in ITree.Eq.UpToTaus]
RR:347 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:348 [in ITree.Eq.Eqit]
RR:355 [in ITree.Eq.Eqit]
RR:362 [in ITree.Eq.Eqit]
RR:37 [in ITree.Eq.SimUpToTaus]
RR:37 [in ITree.Extra.Secure.SecureStateHandlerPi]
RR:370 [in ITree.Eq.Eqit]
RR:389 [in ITree.Eq.Eqit]
RR:396 [in ITree.Eq.Eqit]
RR:4 [in ITree.Eq.UpToTaus]
RR:4 [in ITree.Eq.SimUpToTaus]
RR:40 [in ITree.Eq.Rutt]
RR:41 [in ITree.Eq.UpToTaus]
RR:424 [in ITree.Eq.Eqit]
RR:43 [in ITree.Extra.Secure.SecureStateHandlerPi]
RR:44 [in ITree.Extra.Secure.SecureEqWcompat]
RR:44 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:447 [in ITree.Eq.Eqit]
RR:456 [in ITree.Eq.Eqit]
RR:46 [in ITree.Extra.Secure.SecureEqBind]
RR:46 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:463 [in ITree.Eq.Eqit]
RR:466 [in ITree.Eq.Eqit]
RR:47 [in ITree.Eq.SimUpToTaus]
RR:48 [in ITree.Eq.UpToTaus]
RR:48 [in ITree.Core.KTreeFacts]
RR:49 [in ITree.Eq.Rutt]
RR:55 [in ITree.Eq.UpToTaus]
RR:56 [in ITree.Eq.SimUpToTaus]
RR:567 [in ITree.Eq.Eqit]
RR:57 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:57 [in ITree.Interp.TranslateFacts]
RR:574 [in ITree.Eq.Eqit]
RR:58 [in ITree.Eq.Rutt]
RR:58 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:581 [in ITree.Eq.Eqit]
RR:59 [in ITree.Interp.InterpFacts]
RR:6 [in ITree.Extra.Secure.SecureEqBind]
RR:6 [in ITree.Extra.Secure.SecureEqWcompat]
RR:6 [in ITree.Eq.Eqit]
RR:60 [in ITree.Events.MapDefaultFacts]
RR:60 [in ITree.Eq.Eqit]
RR:62 [in ITree.Eq.SimUpToTaus]
RR:637 [in ITree.Eq.Eqit]
RR:65 [in ITree.Extra.Secure.SecureEqBind]
RR:67 [in ITree.Eq.Rutt]
RR:68 [in ITree.Eq.SimUpToTaus]
RR:7 [in ITree.Extra.Secure.SecureEqProgInsens]
RR:7 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
RR:7 [in ITree.Extra.Secure.SecureEqHalt]
RR:7 [in ITree.Extra.Secure.SecureEqEuttHalt]
RR:708 [in ITree.Eq.Eqit]
RR:72 [in ITree.Extra.Secure.SecureStateHandlerPi]
RR:721 [in ITree.Eq.Eqit]
RR:74 [in ITree.Eq.SimUpToTaus]
RR:748 [in ITree.Eq.Eqit]
RR:75 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:76 [in ITree.Eq.Rutt]
RR:78 [in ITree.Events.StateFacts]
RR:80 [in ITree.Eq.SimUpToTaus]
RR:819 [in ITree.Eq.Eqit]
RR:83 [in ITree.Eq.Rutt]
RR:83 [in ITree.Eq.Eqit]
RR:848 [in ITree.Eq.Eqit]
RR:85 [in ITree.Props.HasPost]
RR:86 [in ITree.Eq.SimUpToTaus]
RR:88 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RR:884 [in ITree.Eq.Eqit]
RR:9 [in ITree.Eq.Shallow]
RR:911 [in ITree.Eq.Eqit]
RR:916 [in ITree.Eq.Eqit]
RR:92 [in ITree.Eq.SimUpToTaus]
RR:921 [in ITree.Eq.Eqit]
RR:928 [in ITree.Eq.Eqit]
RR:93 [in ITree.Extra.IForest]
RS_Eq:3 [in ITree.Extra.Secure.SecureStateHandler]
RS_Eq:3 [in ITree.Extra.Secure.SecureStateHandlerPi]
RS':288 [in ITree.Eq.UpToTaus]
RS':295 [in ITree.Eq.UpToTaus]
RS':302 [in ITree.Eq.UpToTaus]
RS':309 [in ITree.Eq.UpToTaus]
RS:104 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RS:112 [in ITree.Props.Leaf]
RS:116 [in ITree.Events.StateFacts]
RS:116 [in ITree.Extra.Secure.SecureEqWcompat]
RS:133 [in ITree.Eq.Rutt]
RS:136 [in ITree.Events.StateFacts]
RS:155 [in ITree.Basics.HeterogeneousRelations]
RS:156 [in ITree.Eq.Rutt]
RS:161 [in ITree.Props.Leaf]
RS:162 [in ITree.Basics.HeterogeneousRelations]
RS:181 [in ITree.Basics.HeterogeneousRelations]
RS:2 [in ITree.Extra.Secure.SecureStateHandler]
RS:2 [in ITree.Extra.Secure.SecureStateHandlerPi]
RS:208 [in ITree.Extra.Secure.SecureEqProgInsens]
RS:225 [in ITree.Extra.Secure.SecureEqProgInsens]
RS:23 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
RS:236 [in ITree.Extra.Secure.SecureEqProgInsens]
RS:245 [in ITree.Extra.Secure.SecureEqProgInsens]
RS:260 [in ITree.Basics.HeterogeneousRelations]
RS:27 [in ITree.Extra.Secure.SecureEqBind]
RS:270 [in ITree.Extra.Secure.SecureEqProgInsens]
RS:287 [in ITree.Eq.UpToTaus]
RS:294 [in ITree.Eq.UpToTaus]
RS:300 [in ITree.Basics.HeterogeneousRelations]
RS:301 [in ITree.Eq.UpToTaus]
RS:306 [in ITree.Basics.HeterogeneousRelations]
RS:308 [in ITree.Eq.UpToTaus]
RS:340 [in ITree.Extra.IForest]
RS:361 [in ITree.Extra.IForest]
RS:388 [in ITree.Extra.IForest]
RS:47 [in ITree.Extra.Secure.SecureEqBind]
RS:472 [in ITree.Eq.Eqit]
RS:488 [in ITree.Eq.Eqit]
RS:498 [in ITree.Eq.Eqit]
RS:512 [in ITree.Eq.Eqit]
RS:520 [in ITree.Eq.Eqit]
RS:534 [in ITree.Eq.Eqit]
RS:542 [in ITree.Eq.Eqit]
RS:556 [in ITree.Eq.Eqit]
RS:56 [in ITree.Extra.Secure.SecureEqWcompat]
RS:561 [in ITree.Eq.Eqit]
RS:66 [in ITree.Extra.Secure.SecureEqBind]
RS:7 [in ITree.Extra.Secure.SecureEqBind]
RS:711 [in ITree.Eq.Eqit]
RS:75 [in ITree.Extra.Secure.SecureEqWcompat]
RS:751 [in ITree.Eq.Eqit]
RS:93 [in ITree.Events.StateFacts]
RS:96 [in ITree.Extra.Secure.SecureEqWcompat]
RT:158 [in ITree.Basics.HeterogeneousRelations]
RT:262 [in ITree.Basics.HeterogeneousRelations]
RT:301 [in ITree.Basics.HeterogeneousRelations]
RT:307 [in ITree.Basics.HeterogeneousRelations]
run:32 [in ITree.Basics.Basics]
RU:103 [in ITree.Props.Leaf]
RU:669 [in ITree.Eq.Eqit]
r':140 [in ITree.Extra.Secure.SecureStateHandler]
R':206 [in ITree.Basics.HeterogeneousRelations]
r':24 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R':271 [in ITree.Basics.HeterogeneousRelations]
r':28 [in ITree.Extra.Secure.SecureStateHandler]
r':28 [in ITree.Extra.Secure.SecureStateHandlerPi]
r':52 [in ITree.Extra.Secure.SecureStateHandlerPi]
R':66 [in ITree.Props.EuttNoRet]
R':83 [in ITree.Props.EuttNoRet]
r0:14 [in ITree.Extra.Secure.SecureEqEuttTrans]
r0:198 [in ITree.Extra.Secure.SecureEqEuttHalt]
r0:236 [in ITree.Extra.ITrace.ITraceBind]
r0:319 [in ITree.Extra.ITrace.ITraceBind]
r0:49 [in ITree.Extra.Dijkstra.IterRel]
r0:50 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:101 [in ITree.Extra.Secure.SecureStateHandler]
R1:102 [in ITree.Props.HasPost]
r1:104 [in ITree.Eq.Rutt]
r1:106 [in ITree.Eq.SimUpToTaus]
R1:106 [in ITree.Eq.Shallow]
R1:108 [in ITree.Eq.Eqit]
R1:109 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:109 [in ITree.Eq.SimUpToTaus]
R1:109 [in ITree.Extra.Secure.SecureStateHandler]
R1:11 [in ITree.Extra.Secure.SecureEqWcompat]
R1:112 [in ITree.Extra.Secure.SecureEqWcompat]
R1:112 [in ITree.Eq.Rutt]
r1:116 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:12 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:120 [in ITree.Eq.UpToTaus]
R1:121 [in ITree.Eq.Rutt]
R1:121 [in ITree.Eq.Eqit]
R1:122 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:126 [in ITree.Props.Leaf]
R1:127 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:13 [in ITree.Core.KTreeFacts]
R1:13 [in ITree.Extra.Secure.SecureStateHandler]
r1:13 [in ITree.Eq.Eqit]
R1:13 [in ITree.Extra.Secure.SecureStateHandlerPi]
R1:133 [in ITree.Extra.Secure.SecureEqProgInsens]
r1:133 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:136 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:136 [in ITree.Extra.Secure.SecureEqHalt]
R1:136 [in ITree.Eq.Eqit]
R1:142 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:143 [in ITree.Props.Leaf]
R1:143 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:144 [in ITree.Eq.Rutt]
R1:146 [in ITree.Eq.Eqit]
R1:149 [in ITree.Eq.Eqit]
r1:15 [in ITree.Extra.Secure.SecureEqProgInsens]
r1:15 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
r1:15 [in ITree.Extra.Secure.SecureEqHalt]
r1:15 [in ITree.Eq.Rutt]
R1:151 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:152 [in ITree.Eq.Eqit]
R1:153 [in ITree.Extra.Secure.SecureEqProgInsens]
r1:153 [in ITree.Simple]
R1:155 [in ITree.Eq.Eqit]
R1:156 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:16 [in ITree.Eq.UpToTaus]
r1:160 [in ITree.Simple]
R1:163 [in ITree.Eq.Eqit]
R1:166 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:17 [in ITree.Extra.Secure.SecureEqEuttTrans]
R1:17 [in ITree.Eq.Shallow]
r1:17 [in ITree.Simple]
r1:171 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
r1:171 [in ITree.Extra.Secure.SecureEqHalt]
R1:171 [in ITree.Eq.Eqit]
R1:172 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:175 [in ITree.Basics.HeterogeneousRelations]
R1:176 [in ITree.Extra.Secure.SecureEqBind]
R1:176 [in ITree.Extra.Secure.SecureStateHandler]
r1:179 [in ITree.Extra.Secure.SecureEqBind]
R1:179 [in ITree.Eq.Eqit]
r1:18 [in ITree.Extra.ITrace.ITraceFacts]
R1:180 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:180 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:180 [in ITree.Extra.Secure.SecureEqHalt]
R1:182 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:187 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:188 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:191 [in ITree.Eq.Eqit]
R1:193 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:193 [in ITree.Extra.Secure.SecureEqHalt]
R1:193 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:194 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:2 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:2 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R1:2 [in ITree.Extra.Secure.SecureEqHalt]
R1:2 [in ITree.Eq.UpToTaus]
R1:2 [in ITree.Eq.SimUpToTaus]
R1:2 [in ITree.Extra.Secure.StrongBisimProper]
R1:2 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:200 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:203 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:204 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:207 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:22 [in ITree.Eq.UpToTaus]
R1:22 [in ITree.Extra.Secure.SecureStateHandler]
R1:22 [in ITree.Extra.Secure.SecureStateHandlerPi]
r1:222 [in ITree.Eq.Eqit]
R1:223 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:227 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:23 [in ITree.Events.MapDefaultFacts]
R1:232 [in ITree.Eq.UpToTaus]
R1:234 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:236 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r1:237 [in ITree.Eq.Eqit]
R1:238 [in ITree.Eq.UpToTaus]
R1:24 [in ITree.Extra.Secure.SecureEqBind]
r1:24 [in ITree.Extra.Secure.SecureStateHandler]
R1:24 [in ITree.Extra.Secure.SecureEqEuttHalt]
r1:24 [in ITree.Extra.Secure.SecureStateHandlerPi]
R1:243 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:243 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:246 [in ITree.Eq.UpToTaus]
R1:250 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R1:254 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:254 [in ITree.Eq.UpToTaus]
R1:256 [in ITree.Extra.Secure.SecureEqEuttHalt]
r1:257 [in ITree.Extra.Secure.SecureEqProgInsens]
r1:257 [in ITree.Extra.IForest]
R1:258 [in ITree.Eq.UpToTaus]
r1:26 [in ITree.Eq.Shallow]
R1:262 [in ITree.Eq.UpToTaus]
R1:265 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:266 [in ITree.Eq.UpToTaus]
R1:270 [in ITree.Eq.UpToTaus]
R1:271 [in ITree.Extra.Secure.SecureEqEuttHalt]
r1:275 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:279 [in ITree.Eq.UpToTaus]
R1:28 [in ITree.Core.KTreeFacts]
R1:28 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
r1:282 [in ITree.Eq.UpToTaus]
R1:287 [in ITree.Extra.Secure.SecureEqEuttHalt]
r1:29 [in ITree.Eq.SimUpToTaus]
R1:3 [in ITree.Extra.Secure.SecureEqEuttTrans]
R1:3 [in ITree.Eq.Rutt]
R1:307 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:31 [in ITree.Eq.SimUpToTaus]
R1:313 [in ITree.Eq.UpToTaus]
R1:314 [in ITree.Eq.Eqit]
R1:316 [in ITree.Eq.UpToTaus]
r1:319 [in ITree.Eq.Eqit]
R1:32 [in ITree.Eq.UpToTaus]
R1:322 [in ITree.Eq.Eqit]
R1:328 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:335 [in ITree.Eq.Eqit]
R1:336 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:345 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:346 [in ITree.Eq.Eqit]
R1:35 [in ITree.Eq.SimUpToTaus]
R1:353 [in ITree.Eq.Eqit]
R1:36 [in ITree.Eq.Rutt]
R1:360 [in ITree.Eq.Eqit]
R1:368 [in ITree.Eq.Eqit]
R1:38 [in ITree.Extra.Secure.SecureEqEuttTrans]
r1:380 [in ITree.Eq.Eqit]
r1:384 [in ITree.Eq.Eqit]
R1:387 [in ITree.Eq.Eqit]
R1:39 [in ITree.Eq.UpToTaus]
R1:394 [in ITree.Eq.Eqit]
R1:4 [in ITree.Extra.Secure.SecureEqBind]
R1:4 [in ITree.Extra.Secure.SecureEqWcompat]
R1:4 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:4 [in ITree.Eq.Eqit]
R1:41 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:411 [in ITree.Eq.Eqit]
r1:416 [in ITree.Eq.Eqit]
R1:42 [in ITree.Extra.Secure.SecureEqBind]
R1:42 [in ITree.Extra.Secure.SecureEqWcompat]
R1:42 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:429 [in ITree.Eq.Eqit]
R1:43 [in ITree.Core.KTreeFacts]
R1:45 [in ITree.Eq.SimUpToTaus]
R1:45 [in ITree.Eq.Rutt]
R1:46 [in ITree.Eq.UpToTaus]
R1:468 [in ITree.Eq.Eqit]
R1:47 [in ITree.Eq.Shallow]
R1:486 [in ITree.Eq.Eqit]
R1:494 [in ITree.Eq.Eqit]
r1:50 [in ITree.Extra.Dijkstra.IterRel]
R1:510 [in ITree.Eq.Eqit]
R1:516 [in ITree.Eq.Eqit]
R1:52 [in ITree.Extra.Secure.SecureEqWcompat]
R1:53 [in ITree.Eq.UpToTaus]
R1:532 [in ITree.Eq.Eqit]
R1:538 [in ITree.Eq.Eqit]
R1:54 [in ITree.Eq.SimUpToTaus]
R1:54 [in ITree.Eq.Rutt]
R1:55 [in ITree.Extra.Secure.SecureEqEuttHalt]
R1:554 [in ITree.Eq.Eqit]
R1:56 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
r1:58 [in ITree.Extra.Secure.SecureEqBind]
R1:58 [in ITree.Eq.Eqit]
R1:60 [in ITree.Core.KTreeFacts]
R1:60 [in ITree.Eq.SimUpToTaus]
R1:61 [in ITree.Extra.Secure.SecureEqBind]
r1:62 [in ITree.Extra.ITrace.ITraceFacts]
R1:63 [in ITree.Eq.Rutt]
R1:635 [in ITree.Eq.Eqit]
R1:66 [in ITree.Eq.SimUpToTaus]
r1:660 [in ITree.Eq.Eqit]
r1:67 [in ITree.Eq.UpToTaus]
r1:69 [in ITree.Eq.UpToTaus]
R1:7 [in ITree.Eq.Shallow]
R1:70 [in ITree.Extra.Secure.SecureStateHandlerPi]
R1:704 [in ITree.Eq.Eqit]
r1:71 [in ITree.Eq.UpToTaus]
R1:71 [in ITree.Extra.Secure.SecureEqWcompat]
r1:716 [in ITree.Eq.Eqit]
R1:719 [in ITree.Eq.Eqit]
R1:72 [in ITree.Eq.SimUpToTaus]
R1:72 [in ITree.Eq.Rutt]
R1:73 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:744 [in ITree.Eq.Eqit]
R1:75 [in ITree.Props.EuttNoRet]
r1:756 [in ITree.Eq.Eqit]
r1:76 [in ITree.Extra.Secure.SecureEqBind]
R1:78 [in ITree.Eq.SimUpToTaus]
R1:8 [in ITree.Eq.EuttExtras]
r1:8 [in ITree.Eq.SimUpToTaus]
r1:8 [in ITree.Simple]
R1:81 [in ITree.Eq.Rutt]
R1:81 [in ITree.Eq.Eqit]
R1:817 [in ITree.Eq.Eqit]
R1:83 [in ITree.Props.HasPost]
R1:84 [in ITree.Eq.SimUpToTaus]
R1:86 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R1:90 [in ITree.Eq.SimUpToTaus]
R1:909 [in ITree.Eq.Eqit]
R1:914 [in ITree.Eq.Eqit]
R1:919 [in ITree.Eq.Eqit]
R1:92 [in ITree.Extra.Secure.SecureEqWcompat]
R1:926 [in ITree.Eq.Eqit]
R1:96 [in ITree.Eq.SimUpToTaus]
r1:97 [in ITree.Extra.IForest]
R1:98 [in ITree.Extra.Secure.SecureEqProgInsens]
R1:98 [in ITree.Eq.Shallow]
R1:99 [in ITree.Eq.UpToTaus]
R1:99 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:100 [in ITree.Eq.UpToTaus]
R2:100 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:100 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:102 [in ITree.Extra.Secure.SecureStateHandler]
R2:103 [in ITree.Props.HasPost]
r2:105 [in ITree.Eq.Rutt]
r2:107 [in ITree.Eq.SimUpToTaus]
R2:107 [in ITree.Eq.Shallow]
R2:109 [in ITree.Eq.Eqit]
R2:110 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:110 [in ITree.Eq.SimUpToTaus]
R2:110 [in ITree.Extra.Secure.SecureStateHandler]
R2:113 [in ITree.Extra.Secure.SecureEqWcompat]
R2:113 [in ITree.Eq.Rutt]
R2:115 [in ITree.Extra.Secure.SecureEqEuttHalt]
r2:117 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:12 [in ITree.Extra.Secure.SecureEqWcompat]
R2:121 [in ITree.Eq.UpToTaus]
R2:122 [in ITree.Eq.Rutt]
R2:122 [in ITree.Eq.Eqit]
R2:123 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:127 [in ITree.Props.Leaf]
R2:128 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:13 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:133 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:134 [in ITree.Extra.Secure.SecureEqProgInsens]
r2:134 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:137 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:137 [in ITree.Extra.Secure.SecureEqHalt]
R2:137 [in ITree.Eq.Eqit]
R2:14 [in ITree.Core.KTreeFacts]
R2:14 [in ITree.Extra.Secure.SecureStateHandler]
r2:14 [in ITree.Eq.Eqit]
R2:14 [in ITree.Extra.Secure.SecureStateHandlerPi]
R2:143 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:144 [in ITree.Props.Leaf]
R2:144 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:145 [in ITree.Eq.Rutt]
R2:147 [in ITree.Eq.Eqit]
R2:150 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:150 [in ITree.Eq.Eqit]
R2:152 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:153 [in ITree.Eq.Eqit]
r2:154 [in ITree.Simple]
R2:155 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:156 [in ITree.Eq.Eqit]
R2:157 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r2:16 [in ITree.Extra.Secure.SecureEqProgInsens]
r2:16 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
r2:16 [in ITree.Extra.Secure.SecureEqHalt]
r2:16 [in ITree.Eq.Rutt]
r2:161 [in ITree.Simple]
R2:164 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:164 [in ITree.Eq.Eqit]
R2:167 [in ITree.Extra.Secure.SecureEqProgInsens]
r2:17 [in ITree.Eq.UpToTaus]
r2:172 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
r2:172 [in ITree.Extra.Secure.SecureEqHalt]
R2:172 [in ITree.Eq.Eqit]
R2:173 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:176 [in ITree.Basics.HeterogeneousRelations]
R2:177 [in ITree.Extra.Secure.SecureEqBind]
R2:177 [in ITree.Extra.Secure.SecureStateHandler]
R2:18 [in ITree.Eq.Shallow]
r2:18 [in ITree.Simple]
r2:180 [in ITree.Extra.Secure.SecureEqBind]
R2:180 [in ITree.Eq.Eqit]
R2:181 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:181 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:181 [in ITree.Extra.Secure.SecureEqHalt]
R2:183 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r2:188 [in ITree.Extra.Secure.SecureEqProgInsens]
r2:19 [in ITree.Extra.ITrace.ITraceFacts]
R2:192 [in ITree.Eq.Eqit]
R2:194 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:194 [in ITree.Extra.Secure.SecureEqHalt]
R2:194 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:194 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:195 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:201 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:205 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:208 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:209 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:22 [in ITree.Extra.Secure.SecureEqEuttTrans]
r2:223 [in ITree.Eq.Eqit]
R2:224 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:228 [in ITree.Extra.Secure.SecureEqEuttHalt]
r2:23 [in ITree.Eq.UpToTaus]
R2:23 [in ITree.Extra.Secure.SecureStateHandler]
R2:23 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:23 [in ITree.Extra.Secure.SecureStateHandlerPi]
R2:233 [in ITree.Eq.UpToTaus]
R2:235 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:237 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r2:238 [in ITree.Eq.Eqit]
R2:239 [in ITree.Eq.UpToTaus]
R2:24 [in ITree.Events.MapDefaultFacts]
R2:244 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:244 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:247 [in ITree.Eq.UpToTaus]
R2:25 [in ITree.Extra.Secure.SecureEqBind]
r2:25 [in ITree.Extra.Secure.SecureStateHandler]
r2:25 [in ITree.Extra.Secure.SecureStateHandlerPi]
R2:251 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R2:255 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:255 [in ITree.Eq.UpToTaus]
R2:257 [in ITree.Extra.Secure.SecureEqEuttHalt]
r2:258 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:259 [in ITree.Eq.UpToTaus]
r2:260 [in ITree.Extra.IForest]
R2:263 [in ITree.Eq.UpToTaus]
R2:266 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:267 [in ITree.Eq.UpToTaus]
r2:27 [in ITree.Eq.Shallow]
R2:271 [in ITree.Eq.UpToTaus]
R2:272 [in ITree.Extra.Secure.SecureEqEuttHalt]
r2:276 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:280 [in ITree.Eq.UpToTaus]
r2:283 [in ITree.Eq.UpToTaus]
R2:288 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:29 [in ITree.Core.KTreeFacts]
R2:29 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:3 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:3 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
R2:3 [in ITree.Extra.Secure.SecureEqHalt]
R2:3 [in ITree.Eq.UpToTaus]
R2:3 [in ITree.Eq.SimUpToTaus]
R2:3 [in ITree.Extra.Secure.StrongBisimProper]
R2:3 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:308 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:314 [in ITree.Eq.UpToTaus]
R2:315 [in ITree.Eq.Eqit]
R2:317 [in ITree.Eq.UpToTaus]
R2:32 [in ITree.Eq.SimUpToTaus]
r2:320 [in ITree.Eq.Eqit]
R2:323 [in ITree.Eq.Eqit]
R2:33 [in ITree.Eq.UpToTaus]
R2:336 [in ITree.Eq.Eqit]
R2:337 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:346 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:347 [in ITree.Eq.Eqit]
R2:354 [in ITree.Eq.Eqit]
R2:36 [in ITree.Eq.SimUpToTaus]
R2:361 [in ITree.Eq.Eqit]
R2:369 [in ITree.Eq.Eqit]
R2:37 [in ITree.Eq.Rutt]
r2:381 [in ITree.Eq.Eqit]
r2:385 [in ITree.Eq.Eqit]
R2:388 [in ITree.Eq.Eqit]
R2:39 [in ITree.Extra.Secure.SecureEqEuttTrans]
R2:395 [in ITree.Eq.Eqit]
R2:4 [in ITree.Eq.Rutt]
R2:40 [in ITree.Eq.UpToTaus]
R2:40 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:412 [in ITree.Eq.Eqit]
r2:420 [in ITree.Eq.Eqit]
R2:43 [in ITree.Extra.Secure.SecureEqBind]
R2:43 [in ITree.Extra.Secure.SecureEqWcompat]
R2:43 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:430 [in ITree.Eq.Eqit]
R2:44 [in ITree.Core.KTreeFacts]
R2:46 [in ITree.Eq.SimUpToTaus]
R2:46 [in ITree.Eq.Rutt]
R2:469 [in ITree.Eq.Eqit]
R2:47 [in ITree.Eq.UpToTaus]
R2:48 [in ITree.Eq.Shallow]
R2:487 [in ITree.Eq.Eqit]
R2:495 [in ITree.Eq.Eqit]
R2:5 [in ITree.Extra.Secure.SecureEqBind]
R2:5 [in ITree.Extra.Secure.SecureEqWcompat]
R2:5 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:5 [in ITree.Eq.Eqit]
R2:511 [in ITree.Eq.Eqit]
R2:517 [in ITree.Eq.Eqit]
R2:53 [in ITree.Extra.Secure.SecureEqWcompat]
R2:533 [in ITree.Eq.Eqit]
R2:539 [in ITree.Eq.Eqit]
R2:54 [in ITree.Eq.UpToTaus]
R2:55 [in ITree.Eq.SimUpToTaus]
R2:55 [in ITree.Eq.Rutt]
R2:555 [in ITree.Eq.Eqit]
R2:56 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:57 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
r2:59 [in ITree.Extra.Secure.SecureEqBind]
R2:59 [in ITree.Eq.Eqit]
R2:61 [in ITree.Core.KTreeFacts]
R2:61 [in ITree.Eq.SimUpToTaus]
R2:62 [in ITree.Extra.Secure.SecureEqBind]
r2:63 [in ITree.Extra.ITrace.ITraceFacts]
R2:636 [in ITree.Eq.Eqit]
R2:64 [in ITree.Eq.Rutt]
r2:661 [in ITree.Eq.Eqit]
R2:67 [in ITree.Eq.SimUpToTaus]
r2:68 [in ITree.Eq.UpToTaus]
r2:70 [in ITree.Eq.UpToTaus]
R2:705 [in ITree.Eq.Eqit]
R2:71 [in ITree.Extra.Secure.SecureStateHandlerPi]
r2:717 [in ITree.Eq.Eqit]
r2:72 [in ITree.Eq.UpToTaus]
R2:72 [in ITree.Extra.Secure.SecureEqWcompat]
R2:720 [in ITree.Eq.Eqit]
R2:73 [in ITree.Eq.SimUpToTaus]
R2:73 [in ITree.Eq.Rutt]
R2:73 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:74 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:745 [in ITree.Eq.Eqit]
r2:757 [in ITree.Eq.Eqit]
R2:76 [in ITree.Props.EuttNoRet]
r2:77 [in ITree.Extra.Secure.SecureEqBind]
R2:79 [in ITree.Eq.SimUpToTaus]
R2:8 [in ITree.Extra.Secure.SecureEqEuttTrans]
R2:8 [in ITree.Eq.Shallow]
R2:818 [in ITree.Eq.Eqit]
R2:82 [in ITree.Eq.Rutt]
R2:82 [in ITree.Eq.Eqit]
R2:84 [in ITree.Props.HasPost]
R2:85 [in ITree.Eq.SimUpToTaus]
R2:85 [in ITree.Extra.Secure.SecureEqEuttHalt]
R2:87 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R2:9 [in ITree.Eq.EuttExtras]
r2:9 [in ITree.Eq.SimUpToTaus]
r2:9 [in ITree.Simple]
R2:91 [in ITree.Eq.SimUpToTaus]
R2:910 [in ITree.Eq.Eqit]
R2:915 [in ITree.Eq.Eqit]
R2:920 [in ITree.Eq.Eqit]
R2:927 [in ITree.Eq.Eqit]
R2:93 [in ITree.Extra.Secure.SecureEqWcompat]
R2:97 [in ITree.Eq.SimUpToTaus]
r2:98 [in ITree.Extra.IForest]
R2:99 [in ITree.Extra.Secure.SecureEqProgInsens]
R2:99 [in ITree.Eq.Shallow]
R3:108 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:126 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:144 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:158 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:16 [in ITree.Extra.Secure.SecureEqEuttTrans]
R3:168 [in ITree.Extra.Secure.SecureEqProgInsens]
R3:187 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:2 [in ITree.Extra.Secure.SecureEqEuttTrans]
R3:202 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:229 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:245 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:273 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:289 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:30 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R3:40 [in ITree.Extra.Secure.SecureEqEuttTrans]
R3:413 [in ITree.Eq.Eqit]
r3:417 [in ITree.Eq.Eqit]
R3:431 [in ITree.Eq.Eqit]
R3:66 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:78 [in ITree.Extra.Secure.SecureEqEuttHalt]
R3:93 [in ITree.Extra.Secure.SecureEqEuttHalt]
R:10 [in ITree.Interp.Recursion]
R:100 [in ITree.Extra.ITrace.ITraceBind]
r:100 [in ITree.Eq.Shallow]
R:100 [in ITree.Basics.HeterogeneousRelations]
r:101 [in ITree.Extra.ITrace.ITraceBind]
R:101 [in ITree.Props.Finite]
R:101 [in ITree.Extra.ITrace.ITracePrefix]
R:101 [in ITree.Extra.ITrace.ITraceFacts]
R:102 [in ITree.Basics.HeterogeneousRelations]
r:103 [in ITree.Eq.UpToTaus]
R:103 [in ITree.Interp.Traces]
R:104 [in ITree.Basics.Basics]
R:104 [in ITree.Extra.ITrace.ITracePrefix]
R:104 [in ITree.Interp.InterpFacts]
R:104 [in ITree.Basics.HeterogeneousRelations]
R:105 [in ITree.Props.Finite]
r:106 [in ITree.Eq.UpToTaus]
R:107 [in ITree.Extra.ITrace.ITraceBind]
R:107 [in ITree.Basics.HeterogeneousRelations]
r:108 [in ITree.Extra.ITrace.ITraceBind]
r:108 [in ITree.Extra.ITrace.ITracePrefix]
R:108 [in ITree.Interp.Traces]
R:108 [in ITree.Extra.ITrace.ITraceFacts]
r:109 [in ITree.Eq.UpToTaus]
r:11 [in ITree.Extra.Secure.SecureEqEuttTrans]
R:11 [in ITree.Extra.ITrace.ITraceDefinition]
R:11 [in ITree.Interp.Handler]
r:11 [in ITree.Events.Reader]
R:110 [in ITree.Basics.HeterogeneousRelations]
r:110 [in ITree.Extra.ITrace.ITracePreds]
R:111 [in ITree.Extra.ITrace.ITraceBind]
r:111 [in ITree.Eq.SimUpToTaus]
r:111 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
r:112 [in ITree.Extra.ITrace.ITraceBind]
R:112 [in ITree.Eq.Shallow]
r:114 [in ITree.Extra.Secure.SecureEqWcompat]
r:115 [in ITree.Core.KTreeFacts]
R:115 [in ITree.Extra.ITrace.ITraceFacts]
R:116 [in ITree.Extra.ITrace.ITraceBind]
R:116 [in ITree.Basics.HeterogeneousRelations]
R:117 [in ITree.Props.HasPost]
R:117 [in ITree.Props.Finite]
R:117 [in ITree.Interp.Traces]
R:118 [in ITree.Extra.IForest]
r:118 [in ITree.Extra.Secure.SecureEqBind]
R:12 [in ITree.Events.Exception]
R:12 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r:12 [in ITree.Basics.CategoryRelations]
R:12 [in ITree.Interp.Interp]
R:121 [in ITree.Extra.ITrace.ITracePrefix]
R:121 [in ITree.Interp.Traces]
R:122 [in ITree.Props.Finite]
R:122 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:122 [in ITree.Basics.HeterogeneousRelations]
R:123 [in ITree.Interp.Traces]
r:124 [in ITree.Extra.ITrace.ITraceBind]
R:124 [in ITree.Props.Finite]
R:125 [in ITree.Extra.ITrace.ITraceFacts]
R:128 [in ITree.Extra.ITrace.ITracePrefix]
R:128 [in ITree.Extra.ITrace.ITraceFacts]
R:129 [in ITree.Extra.IForest]
R:13 [in ITree.Events.ExceptionFacts]
R:13 [in ITree.Events.StateFacts]
r:13 [in ITree.Extra.Dijkstra.StateDelaySpec]
R:13 [in ITree.Extra.ITrace.ITraceDefinition]
R:13 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R:13 [in ITree.Interp.InterpFacts]
R:13 [in ITree.Basics.HeterogeneousRelations]
R:130 [in ITree.Props.Finite]
r:130 [in ITree.Interp.Traces]
R:130 [in ITree.Simple]
R:132 [in ITree.Extra.ITrace.ITraceBind]
r:132 [in ITree.Extra.ITrace.ITracePrefix]
R:132 [in ITree.Extra.ITrace.ITraceFacts]
R:132 [in ITree.Simple]
r:133 [in ITree.Extra.ITrace.ITraceFacts]
R:134 [in ITree.Interp.Traces]
r:134 [in ITree.Eq.Rutt]
R:134 [in ITree.Simple]
r:135 [in ITree.Interp.Traces]
R:135 [in ITree.Extra.Secure.SecureStateHandler]
R:136 [in ITree.Props.Finite]
R:136 [in ITree.Basics.HeterogeneousRelations]
R:136 [in ITree.Simple]
R:137 [in ITree.Extra.IForest]
R:139 [in ITree.Extra.ITrace.ITraceBind]
R:139 [in ITree.Basics.HeterogeneousRelations]
R:14 [in ITree.Interp.RecursionFacts]
R:14 [in ITree.Core.ITreeDefinition]
R:140 [in ITree.Simple]
R:142 [in ITree.Extra.IForest]
R:143 [in ITree.Extra.ITrace.ITracePrefix]
r:143 [in ITree.Extra.Secure.SecureEqBind]
R:143 [in ITree.Simple]
R:144 [in ITree.Extra.IForest]
R:144 [in ITree.Basics.HeterogeneousRelations]
R:145 [in ITree.Extra.ITrace.ITraceBind]
R:146 [in ITree.Extra.IForest]
r:147 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
r:147 [in ITree.Extra.Secure.SecureEqHalt]
R:148 [in ITree.Simple]
R:149 [in ITree.Extra.ITrace.ITracePrefix]
R:15 [in ITree.Extra.Dijkstra.TracesIT]
R:15 [in ITree.Extra.ITrace.ITraceBind]
R:15 [in ITree.Props.Leaf]
R:15 [in ITree.Interp.Traces]
r:150 [in ITree.Extra.IForest]
R:150 [in ITree.Props.Finite]
R:150 [in ITree.Simple]
R:151 [in ITree.Basics.HeterogeneousRelations]
R:152 [in ITree.Extra.ITrace.ITraceBind]
R:154 [in ITree.Extra.IForest]
R:154 [in ITree.Basics.HeterogeneousRelations]
R:155 [in ITree.Extra.ITrace.ITraceBind]
R:155 [in ITree.Props.Finite]
R:155 [in ITree.Extra.ITrace.ITracePrefix]
r:157 [in ITree.Eq.Rutt]
R:157 [in ITree.Extra.ITrace.ITraceFacts]
R:157 [in ITree.Basics.HeterogeneousRelations]
R:158 [in ITree.Props.Leaf]
r:159 [in ITree.Extra.ITrace.ITracePrefix]
R:16 [in ITree.Extra.ITrace.ITraceFacts]
R:16 [in ITree.Extra.ITrace.ITracePreds]
R:161 [in ITree.Props.Finite]
R:161 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:161 [in ITree.Extra.ITrace.ITracePrefix]
R:161 [in ITree.Basics.HeterogeneousRelations]
r:161 [in ITree.Eq.Eqit]
R:163 [in ITree.Extra.IForest]
R:163 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:164 [in ITree.Extra.ITrace.ITraceBind]
R:166 [in ITree.Extra.ITrace.ITracePrefix]
R:166 [in ITree.Basics.HeterogeneousRelations]
r:167 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:168 [in ITree.Simple]
R:169 [in ITree.Extra.IForest]
r:169 [in ITree.Eq.Eqit]
R:17 [in ITree.Eq.EuttExtras]
R:17 [in ITree.Interp.TranslateFacts]
R:170 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r:170 [in ITree.Simple]
R:171 [in ITree.Extra.Secure.SecureStateHandler]
R:172 [in ITree.Extra.ITrace.ITraceFacts]
R:172 [in ITree.Basics.HeterogeneousRelations]
R:173 [in ITree.Extra.ITrace.ITraceBind]
R:173 [in ITree.Props.Finite]
R:173 [in ITree.Simple]
R:174 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:176 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:177 [in ITree.Extra.ITrace.ITraceBind]
R:178 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:178 [in ITree.Simple]
R:179 [in ITree.Props.Finite]
R:18 [in ITree.Props.Leaf]
R:18 [in ITree.Interp.HandlerFacts]
R:180 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:180 [in ITree.Basics.HeterogeneousRelations]
R:181 [in ITree.Extra.ITrace.ITraceFacts]
r:183 [in ITree.Extra.ITrace.ITraceFacts]
R:184 [in ITree.Extra.IForest]
R:184 [in ITree.Props.Finite]
R:184 [in ITree.Basics.HeterogeneousRelations]
R:186 [in ITree.Extra.ITrace.ITraceFacts]
R:186 [in ITree.Simple]
R:187 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:187 [in ITree.Basics.HeterogeneousRelations]
R:188 [in ITree.Props.Finite]
r:188 [in ITree.Extra.ITrace.ITraceFacts]
R:189 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:19 [in ITree.Props.EuttNoRet]
R:19 [in ITree.Core.Subevent]
R:19 [in ITree.Basics.HeterogeneousRelations]
R:190 [in ITree.Extra.ITrace.ITraceBind]
R:190 [in ITree.Extra.IForest]
R:190 [in ITree.Simple]
r:191 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:191 [in ITree.Extra.ITrace.ITraceFacts]
R:195 [in ITree.Extra.IForest]
R:195 [in ITree.Extra.ITrace.ITraceFacts]
r:196 [in ITree.Simple]
r:197 [in ITree.Extra.Secure.SecureEqEuttHalt]
r:198 [in ITree.Eq.Eqit]
R:199 [in ITree.Simple]
R:2 [in ITree.Eq.EqAxiom]
R:2 [in ITree.Eq.EuttExtras]
R:2 [in ITree.Extra.ITrace.ITracePrefix]
r:2 [in ITree.Extra.Dijkstra.IterRel]
R:2 [in ITree.Interp.Traces]
R:2 [in ITree.Extra.ITrace.ITracePreds]
R:2 [in ITree.Core.ITreeDefinition]
R:2 [in ITree.Simple]
R:20 [in ITree.Events.ExceptionFacts]
R:20 [in ITree.Events.StateFacts]
r:20 [in ITree.Basics.Basics]
R:20 [in ITree.Interp.Traces]
R:20 [in ITree.Interp.InterpFacts]
R:201 [in ITree.Extra.ITrace.ITraceBind]
r:201 [in ITree.Extra.ITrace.ITraceFacts]
R:203 [in ITree.Extra.ITrace.ITraceFacts]
R:205 [in ITree.Basics.HeterogeneousRelations]
R:206 [in ITree.Extra.IForest]
R:206 [in ITree.Simple]
R:21 [in ITree.Interp.Interp]
R:210 [in ITree.Extra.ITrace.ITraceFacts]
r:211 [in ITree.Extra.Secure.SecureEqProgInsens]
R:211 [in ITree.Extra.ITrace.ITraceBind]
R:211 [in ITree.Simple]
r:212 [in ITree.Extra.ITrace.ITraceBind]
r:212 [in ITree.Extra.Secure.SecureEqEuttHalt]
R:213 [in ITree.Extra.IForest]
R:213 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:215 [in ITree.Extra.ITrace.ITraceFacts]
R:215 [in ITree.Basics.HeterogeneousRelations]
R:216 [in ITree.Simple]
R:22 [in ITree.Events.Exception]
R:22 [in ITree.Extra.ITrace.ITraceDefinition]
R:22 [in ITree.Basics.CategoryRelations]
R:22 [in ITree.Extra.ITrace.ITracePreds]
R:220 [in ITree.Extra.ITrace.ITraceFacts]
R:221 [in ITree.Extra.ITrace.ITraceBind]
R:221 [in ITree.Extra.IForest]
R:222 [in ITree.Basics.HeterogeneousRelations]
R:224 [in ITree.Simple]
r:226 [in ITree.Extra.ITrace.ITraceBind]
R:226 [in ITree.Eq.UpToTaus]
r:226 [in ITree.Extra.ITrace.ITraceFacts]
r:228 [in ITree.Extra.Secure.SecureEqProgInsens]
r:228 [in ITree.Extra.ITrace.ITraceBind]
R:228 [in ITree.Extra.IForest]
R:229 [in ITree.Basics.HeterogeneousRelations]
R:229 [in ITree.Simple]
r:23 [in ITree.Basics.Basics]
R:23 [in ITree.Indexed.Function]
R:23 [in ITree.Basics.HeterogeneousRelations]
R:230 [in ITree.Extra.ITrace.ITraceBind]
r:232 [in ITree.Extra.ITrace.ITraceBind]
r:234 [in ITree.Simple]
R:24 [in ITree.Events.StateFacts]
r:24 [in ITree.Interp.Traces]
R:240 [in ITree.Basics.HeterogeneousRelations]
R:241 [in ITree.Extra.ITrace.ITraceBind]
r:243 [in ITree.Extra.ITrace.ITraceBind]
R:243 [in ITree.Extra.IForest]
R:243 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:245 [in ITree.Eq.Eqit]
R:249 [in ITree.Extra.IForest]
R:25 [in ITree.Extra.ITrace.ITraceBind]
r:25 [in ITree.Extra.Secure.SecureEqEuttTrans]
R:25 [in ITree.Eq.SimUpToTaus]
R:25 [in ITree.Interp.InterpFacts]
R:25 [in ITree.Interp.TranslateFacts]
R:252 [in ITree.Basics.HeterogeneousRelations]
R:255 [in ITree.Extra.IForest]
R:256 [in ITree.Basics.HeterogeneousRelations]
R:257 [in ITree.Extra.ITrace.ITraceBind]
R:258 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r:259 [in ITree.Extra.ITrace.ITraceBind]
r:259 [in ITree.Eq.Eqit]
R:26 [in ITree.Extra.ITrace.ITracePrefix]
R:26 [in ITree.Extra.Secure.SecureStateHandler]
r:26 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
R:26 [in ITree.Extra.ITrace.ITracePreds]
R:26 [in ITree.Extra.Secure.SecureStateHandlerPi]
R:263 [in ITree.Simple]
R:264 [in ITree.Extra.IForest]
R:264 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:265 [in ITree.Eq.Eqit]
R:265 [in ITree.Simple]
R:267 [in ITree.Simple]
R:269 [in ITree.Extra.ITrace.ITraceBind]
R:269 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:269 [in ITree.Simple]
R:27 [in ITree.Events.ExceptionFacts]
r:27 [in ITree.Interp.HandlerFacts]
R:27 [in ITree.Extra.ITrace.ITraceFacts]
r:27 [in ITree.Eq.Paco2]
R:27 [in ITree.Simple]
R:270 [in ITree.Basics.HeterogeneousRelations]
r:271 [in ITree.Extra.ITrace.ITraceBind]
R:272 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:273 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:273 [in ITree.Simple]
R:276 [in ITree.Extra.IForest]
R:276 [in ITree.Simple]
r:278 [in ITree.Eq.Eqit]
R:279 [in ITree.Extra.ITrace.ITraceBind]
R:28 [in ITree.Props.Finite]
R:28 [in ITree.Props.Infinite]
r:281 [in ITree.Extra.ITrace.ITraceBind]
R:281 [in ITree.Simple]
R:284 [in ITree.Basics.HeterogeneousRelations]
R:285 [in ITree.Eq.UpToTaus]
R:285 [in ITree.Extra.Dijkstra.ITreeDijkstra]
r:29 [in ITree.Events.StateFacts]
R:29 [in ITree.Props.Leaf]
R:29 [in ITree.Props.EuttNoRet]
R:29 [in ITree.Extra.Secure.SecureStateHandler]
R:29 [in ITree.Eq.Shallow]
r:29 [in ITree.Simple]
R:29 [in ITree.Extra.Secure.SecureStateHandlerPi]
R:290 [in ITree.Extra.ITrace.ITraceBind]
r:292 [in ITree.Extra.Secure.SecureEqProgInsens]
R:292 [in ITree.Eq.UpToTaus]
r:292 [in ITree.Eq.Eqit]
R:296 [in ITree.Basics.HeterogeneousRelations]
R:297 [in ITree.Eq.Eqit]
R:298 [in ITree.Extra.Dijkstra.ITreeDijkstra]
R:299 [in ITree.Eq.UpToTaus]
R:299 [in ITree.Basics.HeterogeneousRelations]
r:299 [in ITree.Eq.Eqit]
R:3 [in ITree.Events.ExceptionFacts]
r:3 [in ITree.Eq.EuttExtras]
R:3 [in ITree.Interp.InterpFacts]
R:3 [in ITree.Interp.Interp]
R:3 [in ITree.Interp.TranslateFacts]
R:30 [in ITree.Extra.ITrace.ITraceBind]
R:30 [in ITree.Events.ExceptionFacts]
r:30 [in ITree.Extra.Dijkstra.StateDelaySpec]
R:30 [in ITree.Interp.InterpFacts]
r:30 [in ITree.Extra.Secure.SecureEqEuttHalt]
R:30 [in ITree.Interp.TranslateFacts]
R:30 [in ITree.Extra.ITrace.ITracePreds]
R:301 [in ITree.Eq.Eqit]
R:304 [in ITree.Extra.ITrace.ITraceBind]
R:305 [in ITree.Basics.HeterogeneousRelations]
R:306 [in ITree.Eq.UpToTaus]
R:309 [in ITree.Eq.Eqit]
R:31 [in ITree.Props.Finite]
r:31 [in ITree.Extra.Dijkstra.StateDelaySpec]
R:310 [in ITree.Extra.ITrace.ITraceBind]
R:317 [in ITree.Extra.ITrace.ITraceBind]
R:318 [in ITree.Extra.IForest]
R:318 [in ITree.Extra.Secure.SecureEqEuttHalt]
r:32 [in ITree.Basics.Function]
r:32 [in ITree.Basics.CategoryKleisli]
R:32 [in ITree.Extra.ITrace.ITracePrefix]
R:32 [in ITree.Extra.Dijkstra.StateIOTrace]
r:321 [in ITree.Extra.ITrace.ITraceBind]
R:321 [in ITree.Basics.HeterogeneousRelations]
R:323 [in ITree.Extra.ITrace.ITraceBind]
R:323 [in ITree.Extra.IForest]
R:329 [in ITree.Extra.IForest]
R:33 [in ITree.Events.ExceptionFacts]
R:33 [in ITree.Props.Leaf]
R:33 [in ITree.Extra.ITrace.ITraceFacts]
R:33 [in ITree.Simple]
R:332 [in ITree.Extra.ITrace.ITraceBind]
r:333 [in ITree.Extra.IForest]
R:337 [in ITree.Extra.IForest]
r:344 [in ITree.Extra.IForest]
R:346 [in ITree.Extra.IForest]
R:35 [in ITree.Props.Finite]
R:35 [in ITree.Extra.ITrace.ITracePrefix]
R:35 [in ITree.Extra.ITrace.ITraceFacts]
R:35 [in ITree.Extra.Dijkstra.StateIOTrace]
R:35 [in ITree.Interp.InterpFacts]
r:350 [in ITree.Extra.IForest]
r:36 [in ITree.Eq.UpToTaus]
R:36 [in ITree.Interp.Traces]
R:36 [in ITree.Core.ITreeDefinition]
R:37 [in ITree.Events.ExceptionFacts]
r:37 [in ITree.Extra.ITrace.ITraceFacts]
R:37 [in ITree.Extra.ITrace.ITracePreds]
R:375 [in ITree.Extra.IForest]
R:379 [in ITree.Eq.Eqit]
r:38 [in ITree.Events.ExceptionFacts]
R:38 [in ITree.Extra.ITrace.ITracePrefix]
R:38 [in ITree.Extra.Secure.SecureStateHandler]
r:383 [in ITree.Extra.IForest]
R:383 [in ITree.Eq.Eqit]
R:385 [in ITree.Extra.IForest]
R:39 [in ITree.Interp.Traces]
r:39 [in ITree.Extra.Secure.SecureStateHandler]
R:39 [in ITree.Extra.ITrace.ITraceFacts]
R:39 [in ITree.Extra.Dijkstra.StateIOTrace]
r:39 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
r:395 [in ITree.Extra.IForest]
R:4 [in ITree.Extra.ITrace.ITraceBind]
r:4 [in ITree.Events.ExceptionFacts]
R:4 [in ITree.Axioms]
R:4 [in ITree.Events.StateFacts]
R:4 [in ITree.Interp.Recursion]
R:4 [in ITree.Interp.InterpFacts]
R:4 [in ITree.Extra.Dijkstra.DelaySpecMonad]
R:4 [in ITree.Interp.RecursionFacts]
R:40 [in ITree.Props.Finite]
R:401 [in ITree.Eq.Eqit]
R:404 [in ITree.Eq.Eqit]
R:407 [in ITree.Eq.Eqit]
R:41 [in ITree.Extra.ITrace.ITraceBind]
R:41 [in ITree.Events.ExceptionFacts]
r:41 [in ITree.Extra.ITrace.ITraceFacts]
R:41 [in ITree.Extra.ITrace.ITracePreds]
R:41 [in ITree.Events.State]
R:42 [in ITree.Events.FailFacts]
R:42 [in ITree.Interp.Handler]
r:42 [in ITree.Extra.Dijkstra.IterRel]
R:42 [in ITree.Simple]
R:423 [in ITree.Eq.Eqit]
r:43 [in ITree.Eq.UpToTaus]
R:43 [in ITree.Props.Finite]
R:43 [in ITree.Props.EuttNoRet]
R:43 [in ITree.Interp.InterpFacts]
R:44 [in ITree.Interp.Traces]
R:44 [in ITree.Extra.Secure.SecureStateHandler]
R:44 [in ITree.Extra.ITrace.ITraceFacts]
R:446 [in ITree.Eq.Eqit]
R:45 [in ITree.Events.ExceptionFacts]
R:45 [in ITree.Extra.ITrace.ITraceDefinition]
R:45 [in ITree.Interp.Handler]
R:45 [in ITree.Extra.ITrace.ITracePreds]
R:45 [in ITree.Core.ITreeDefinition]
R:451 [in ITree.Eq.Eqit]
R:455 [in ITree.Eq.Eqit]
R:459 [in ITree.Eq.Eqit]
R:46 [in ITree.Basics.Basics]
r:46 [in ITree.Extra.Dijkstra.IterRel]
r:46 [in ITree.Extra.ITrace.ITraceFacts]
R:462 [in ITree.Eq.Eqit]
R:465 [in ITree.Eq.Eqit]
R:47 [in ITree.Props.Finite]
r:47 [in ITree.Extra.Secure.SecureEqEuttHalt]
R:47 [in ITree.Simple]
R:47 [in ITree.Extra.Secure.SecureStateHandlerPi]
r:475 [in ITree.Eq.Eqit]
R:48 [in ITree.Interp.Traces]
R:48 [in ITree.Events.MapDefaultFacts]
R:49 [in ITree.Events.FailFacts]
R:49 [in ITree.Events.StateFacts]
R:49 [in ITree.Extra.ITrace.ITracePrefix]
R:49 [in ITree.Extra.ITrace.ITraceFacts]
r:491 [in ITree.Eq.Eqit]
r:499 [in ITree.Eq.Eqit]
r:5 [in ITree.Extra.Secure.StrongBisimProper]
R:5 [in ITree.Events.Nondeterminism]
r:5 [in ITree.Basics.CategoryRelations]
r:5 [in ITree.Eq.Paco2]
R:50 [in ITree.Extra.ITrace.ITraceBind]
R:50 [in ITree.Interp.InterpFacts]
R:50 [in ITree.Interp.TranslateFacts]
R:50 [in ITree.Interp.RecursionFacts]
R:51 [in ITree.Events.ExceptionFacts]
R:51 [in ITree.Core.ITreeDefinition]
r:513 [in ITree.Eq.Eqit]
R:52 [in ITree.Props.Finite]
R:52 [in ITree.Props.Leaf]
R:52 [in ITree.Interp.Traces]
R:52 [in ITree.Extra.ITrace.ITraceFacts]
r:521 [in ITree.Eq.Eqit]
r:53 [in ITree.Extra.ITrace.ITracePrefix]
r:53 [in ITree.Extra.Secure.SecureEqBind]
r:53 [in ITree.Simple]
r:535 [in ITree.Eq.Eqit]
r:54 [in ITree.Extra.Dijkstra.StateDelaySpec]
R:55 [in ITree.Events.FailFacts]
R:55 [in ITree.Eq.Shallow]
R:55 [in ITree.Core.ITreeDefinition]
R:56 [in ITree.Extra.ITrace.ITraceBind]
r:56 [in ITree.Eq.UpToTaus]
R:56 [in ITree.Props.Finite]
R:56 [in ITree.Extra.ITrace.ITracePrefix]
R:56 [in ITree.Interp.Traces]
R:560 [in ITree.Eq.Eqit]
R:564 [in ITree.Eq.Eqit]
R:566 [in ITree.Eq.Eqit]
R:57 [in ITree.Events.ExceptionFacts]
R:57 [in ITree.Events.StateFacts]
R:57 [in ITree.Extra.ITrace.ITraceFacts]
R:57 [in ITree.Events.MapDefaultFacts]
R:57 [in ITree.Extra.ITrace.ITracePreds]
R:57 [in ITree.Core.ITreeDefinition]
R:57 [in ITree.Simple]
R:573 [in ITree.Eq.Eqit]
r:58 [in ITree.Extra.ITrace.ITraceBind]
r:58 [in ITree.Eq.UpToTaus]
R:58 [in ITree.Interp.InterpFacts]
R:58 [in ITree.Basics.CategoryRelations]
R:58 [in ITree.Basics.HeterogeneousRelations]
R:580 [in ITree.Eq.Eqit]
R:582 [in ITree.Extra.IForest]
R:588 [in ITree.Eq.Eqit]
R:589 [in ITree.Extra.IForest]
r:59 [in ITree.Extra.ITrace.ITracePrefix]
r:59 [in ITree.Extra.Secure.SecureEqWcompat]
R:59 [in ITree.Eq.Shallow]
R:59 [in ITree.Events.State]
R:599 [in ITree.Eq.Eqit]
r:6 [in ITree.Eq.UpToTaus]
r:6 [in ITree.Core.ITreeDefinition]
R:60 [in ITree.Interp.Traces]
R:60 [in ITree.Basics.HeterogeneousRelations]
R:60 [in ITree.Core.ITreeDefinition]
r:601 [in ITree.Eq.Eqit]
R:604 [in ITree.Eq.Eqit]
R:609 [in ITree.Eq.Eqit]
r:61 [in ITree.Eq.UpToTaus]
r:61 [in ITree.Extra.Dijkstra.IterRel]
R:61 [in ITree.Extra.ITrace.ITraceFacts]
R:617 [in ITree.Eq.Eqit]
R:62 [in ITree.Extra.ITrace.ITraceBind]
r:62 [in ITree.Eq.UpToTaus]
R:62 [in ITree.Events.ExceptionFacts]
R:62 [in ITree.Extra.ITrace.ITracePreds]
R:63 [in ITree.Interp.InterpFacts]
r:631 [in ITree.Extra.IForest]
R:631 [in ITree.Eq.Eqit]
r:635 [in ITree.Extra.IForest]
r:636 [in ITree.Extra.IForest]
r:64 [in ITree.Eq.UpToTaus]
R:64 [in ITree.Events.FailFacts]
r:64 [in ITree.Events.ExceptionFacts]
R:64 [in ITree.Simple]
r:640 [in ITree.Extra.IForest]
R:65 [in ITree.Props.HasPost]
R:65 [in ITree.Props.EuttNoRet]
R:65 [in ITree.Eq.Shallow]
R:65 [in ITree.Basics.HeterogeneousRelations]
R:65 [in ITree.Extra.ITrace.ITracePreds]
R:65 [in ITree.Extra.Secure.SecureStateHandlerPi]
r:66 [in ITree.Extra.ITrace.ITraceBind]
r:66 [in ITree.Eq.UpToTaus]
R:66 [in ITree.Props.Leaf]
r:66 [in ITree.Extra.Dijkstra.IterRel]
r:664 [in ITree.Eq.Eqit]
R:67 [in ITree.Props.Finite]
R:67 [in ITree.Extra.ITrace.ITraceFacts]
R:67 [in ITree.Interp.InterpFacts]
r:68 [in ITree.Extra.Dijkstra.TracesIT]
R:68 [in ITree.Extra.ITrace.ITraceBind]
R:68 [in ITree.Extra.ITrace.ITracePrefix]
R:68 [in ITree.Eq.Shallow]
R:68 [in ITree.Extra.ITrace.ITracePreds]
r:69 [in ITree.Extra.Dijkstra.TracesIT]
R:69 [in ITree.Events.ExceptionFacts]
R:696 [in ITree.Eq.Eqit]
R:7 [in ITree.Eq.EqAxiom]
r:7 [in ITree.Extra.ITrace.ITracePrefix]
r:7 [in ITree.Events.Reader]
R:7 [in ITree.Interp.InterpFacts]
R:7 [in ITree.Basics.HeterogeneousRelations]
R:70 [in ITree.Interp.Traces]
r:70 [in ITree.Eq.Shallow]
R:70 [in ITree.Simple]
R:700 [in ITree.Eq.Eqit]
R:71 [in ITree.Props.Finite]
R:71 [in ITree.Basics.HeterogeneousRelations]
R:72 [in ITree.Events.FailFacts]
r:72 [in ITree.Events.ExceptionFacts]
r:72 [in ITree.Extra.Dijkstra.StateDelaySpec]
R:72 [in ITree.Props.Infinite]
R:72 [in ITree.Extra.ITrace.ITracePrefix]
r:72 [in ITree.Interp.InterpFacts]
r:73 [in ITree.Eq.UpToTaus]
R:73 [in ITree.Core.KTreeFacts]
R:73 [in ITree.Eq.Shallow]
R:734 [in ITree.Eq.Eqit]
R:739 [in ITree.Eq.Eqit]
R:74 [in ITree.Props.Leaf]
R:74 [in ITree.Interp.InterpFacts]
R:75 [in ITree.Extra.ITrace.ITraceBind]
R:759 [in ITree.Eq.Eqit]
r:76 [in ITree.Extra.ITrace.ITraceBind]
R:76 [in ITree.Events.ExceptionFacts]
R:76 [in ITree.Interp.Traces]
R:76 [in ITree.Extra.ITrace.ITraceFacts]
R:76 [in ITree.Simple]
R:764 [in ITree.Eq.Eqit]
R:768 [in ITree.Eq.Eqit]
R:77 [in ITree.Events.StateFacts]
R:77 [in ITree.Interp.InterpFacts]
r:77 [in ITree.Extra.ITrace.ITracePreds]
r:772 [in ITree.Eq.Eqit]
R:774 [in ITree.Eq.Eqit]
R:78 [in ITree.Extra.ITrace.ITraceBind]
r:78 [in ITree.Extra.Secure.SecureEqWcompat]
R:78 [in ITree.Eq.Shallow]
R:78 [in ITree.Basics.HeterogeneousRelations]
r:780 [in ITree.Eq.Eqit]
R:782 [in ITree.Eq.Eqit]
R:79 [in ITree.Extra.ITrace.ITracePrefix]
r:79 [in ITree.Extra.Secure.SecureStateHandler]
R:790 [in ITree.Eq.Eqit]
R:8 [in ITree.Events.ExceptionFacts]
R:8 [in ITree.Interp.Traces]
R:8 [in ITree.Interp.InterpFacts]
r:80 [in ITree.Events.ExceptionFacts]
R:80 [in ITree.Interp.Traces]
R:81 [in ITree.Props.Leaf]
R:81 [in ITree.Extra.ITrace.ITraceFacts]
R:81 [in ITree.Core.ITreeDefinition]
R:82 [in ITree.Props.EuttNoRet]
R:82 [in ITree.Extra.Secure.SecureStateHandler]
R:82 [in ITree.Interp.InterpFacts]
R:83 [in ITree.Events.ExceptionFacts]
R:83 [in ITree.Events.StateFacts]
R:83 [in ITree.Extra.ITrace.ITraceFacts]
R:83 [in ITree.Basics.HeterogeneousRelations]
R:84 [in ITree.Extra.ITrace.ITraceBind]
R:84 [in ITree.Props.Finite]
R:84 [in ITree.Props.Infinite]
R:84 [in ITree.Extra.ITrace.ITracePrefix]
R:84 [in ITree.Interp.Traces]
r:84 [in ITree.Eq.Rutt]
r:84 [in ITree.Extra.ITrace.ITraceFacts]
R:84 [in ITree.Extra.ITrace.ITracePreds]
R:85 [in ITree.Simple]
r:86 [in ITree.Eq.UpToTaus]
r:86 [in ITree.Props.Infinite]
R:86 [in ITree.Extra.ITrace.ITraceFacts]
r:87 [in ITree.Events.ExceptionFacts]
r:87 [in ITree.Extra.ITrace.ITracePrefix]
r:87 [in ITree.Extra.ITrace.ITraceFacts]
r:88 [in ITree.Eq.UpToTaus]
R:88 [in ITree.Basics.HeterogeneousRelations]
r:89 [in ITree.Extra.Dijkstra.StateDelaySpec]
r:9 [in ITree.Interp.TranslateFacts]
R:9 [in ITree.Interp.RecursionFacts]
r:9 [in ITree.Extra.ITrace.ITracePreds]
R:90 [in ITree.Extra.ITrace.ITraceBind]
R:90 [in ITree.Extra.ITrace.ITraceFacts]
r:91 [in ITree.Eq.UpToTaus]
r:91 [in ITree.Extra.ITrace.ITraceFacts]
R:91 [in ITree.Simple]
R:92 [in ITree.Extra.ITrace.ITraceBind]
R:92 [in ITree.Extra.IForest]
R:92 [in ITree.Interp.Traces]
R:92 [in ITree.Interp.InterpFacts]
R:92 [in ITree.Extra.ITrace.ITracePreds]
r:93 [in ITree.Extra.Secure.SecureEqBind]
R:94 [in ITree.Props.Leaf]
R:94 [in ITree.Extra.ITrace.ITraceFacts]
R:94 [in ITree.Eq.Shallow]
R:95 [in ITree.Basics.Basics]
R:95 [in ITree.Extra.ITrace.ITracePrefix]
R:96 [in ITree.Events.FailFacts]
r:96 [in ITree.Events.ExceptionFacts]
R:96 [in ITree.Props.Finite]
R:96 [in ITree.Basics.CategoryRelations]
r:96 [in ITree.Simple]
r:97 [in ITree.Eq.UpToTaus]
R:97 [in ITree.Interp.InterpFacts]
R:97 [in ITree.Extra.ITrace.ITracePreds]
r:98 [in ITree.Extra.ITrace.ITraceBind]
r:98 [in ITree.Props.Leaf]
r:98 [in ITree.Extra.Secure.SecureEqWcompat]
r:99 [in ITree.Basics.Basics]

S

sab:17 [in ITree.Basics.MonadState]
sab:21 [in ITree.Basics.MonadState]
sa:10 [in ITree.Basics.MonadState]
sa:11 [in ITree.Basics.MonadState]
sa:12 [in ITree.Basics.MonadState]
sa:26 [in ITree.Basics.MonadState]
sa:34 [in ITree.Basics.Basics]
sa:43 [in ITree.Basics.Basics]
sa:59 [in ITree.Basics.MonadState]
sa:9 [in ITree.Basics.MonadState]
sbc:60 [in ITree.Basics.MonadState]
sbif:17 [in ITree.Basics.CategorySub]
SECCHECK1:101 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK1:101 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK1:49 [in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK1:51 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK1:51 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK1:91 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK1:91 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK2:102 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK2:102 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK2:50 [in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK2:52 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK2:52 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK2:92 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK2:92 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:145 [in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:149 [in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:155 [in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:161 [in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:166 [in ITree.Extra.Secure.SecureStateHandler]
SECCHECK:29 [in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:29 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:29 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:35 [in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:35 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:35 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:41 [in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:42 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:42 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:57 [in ITree.Extra.Secure.SecureStateHandlerPi]
SECCHECK:58 [in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:59 [in ITree.Extra.Secure.SecureStateHandlerPi]
SECCHECK:62 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:62 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:65 [in ITree.Extra.Secure.SecureEqProgInsens]
SECCHECK:70 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:70 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:77 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:77 [in ITree.Extra.Secure.SecureEqHalt]
SECCHECK:83 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SECCHECK:83 [in ITree.Extra.Secure.SecureEqHalt]
SEF:35 [in ITree.Core.Subevent]
SemiIso_g:43 [in ITree.Basics.CategoryFacts]
SemiIso_f:41 [in ITree.Basics.CategoryFacts]
SemiIso_g:24 [in ITree.Basics.CategoryFacts]
SemiIso_f:21 [in ITree.Basics.CategoryFacts]
SE:265 [in ITree.Basics.HeterogeneousRelations]
SFG:36 [in ITree.Core.Subevent]
sim':11 [in ITree.Extra.Dijkstra.IterRel]
sim':120 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim':120 [in ITree.Extra.Secure.SecureEqHalt]
sim':123 [in ITree.Extra.IForest]
sim':155 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim':18 [in ITree.Props.Infinite]
sim':46 [in ITree.Eq.Eqit]
sim':48 [in ITree.Props.Infinite]
sim':82 [in ITree.Extra.Secure.SecureEqProgInsens]
sim:10 [in ITree.Extra.Dijkstra.IterRel]
sim:10 [in ITree.Eq.Eqit]
sim:109 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim:109 [in ITree.Extra.Secure.SecureEqHalt]
sim:114 [in ITree.Eq.Eqit]
sim:119 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim:119 [in ITree.Extra.Secure.SecureEqHalt]
sim:12 [in ITree.Extra.Secure.SecureEqProgInsens]
sim:12 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
sim:12 [in ITree.Extra.Secure.SecureEqHalt]
sim:12 [in ITree.Eq.Rutt]
sim:122 [in ITree.Extra.IForest]
sim:127 [in ITree.Eq.Eqit]
sim:13 [in ITree.Props.Infinite]
sim:130 [in ITree.Extra.Dijkstra.ITreeDijkstra]
sim:131 [in ITree.Extra.IForest]
sim:146 [in ITree.Extra.Dijkstra.ITreeDijkstra]
sim:154 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim:157 [in ITree.Extra.IForest]
sim:163 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim:17 [in ITree.Props.Infinite]
sim:173 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
sim:249 [in ITree.Eq.Eqit]
sim:251 [in ITree.Eq.Eqit]
sim:254 [in ITree.Eq.Eqit]
sim:256 [in ITree.Eq.Eqit]
sim:268 [in ITree.Eq.Eqit]
sim:270 [in ITree.Eq.Eqit]
sim:273 [in ITree.Eq.Eqit]
sim:275 [in ITree.Eq.Eqit]
sim:31 [in ITree.Eq.Rutt]
sim:36 [in ITree.Eq.Eqit]
sim:374 [in ITree.Eq.Eqit]
sim:43 [in ITree.Props.Infinite]
sim:45 [in ITree.Eq.Eqit]
sim:47 [in ITree.Props.Infinite]
sim:64 [in ITree.Eq.Eqit]
sim:71 [in ITree.Extra.Secure.SecureEqProgInsens]
sim:81 [in ITree.Extra.Secure.SecureEqProgInsens]
sim:87 [in ITree.Eq.Eqit]
sim:94 [in ITree.Extra.IForest]
SIZECHECK1:53 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK1:53 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK2:54 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK2:54 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:103 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:103 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:156 [in ITree.Extra.Secure.SecureStateHandler]
SIZECHECK:162 [in ITree.Extra.Secure.SecureStateHandler]
SIZECHECK:36 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:36 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:43 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:43 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:63 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:63 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:71 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:71 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:78 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:78 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:84 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:84 [in ITree.Extra.Secure.SecureEqHalt]
SIZECHECK:93 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SIZECHECK:93 [in ITree.Extra.Secure.SecureEqHalt]
si':70 [in ITree.Basics.Basics]
si:67 [in ITree.Basics.Basics]
sl:61 [in ITree.Extra.Dijkstra.ITreeDijkstra]
Snd_C:227 [in ITree.Basics.CategoryFacts]
Snd_C:211 [in ITree.Basics.CategoryTheory]
Snd_C:170 [in ITree.Basics.CategoryTheory]
sobj:3 [in ITree.Basics.CategorySub]
specA:43 [in ITree.Extra.IForest]
SR:259 [in ITree.Basics.HeterogeneousRelations]
sr:57 [in ITree.Extra.Dijkstra.ITreeDijkstra]
SS:101 [in ITree.Eq.SimUpToTaus]
SS:190 [in ITree.Basics.HeterogeneousRelations]
SS:261 [in ITree.Basics.HeterogeneousRelations]
SS:88 [in ITree.Props.HasPost]
step':324 [in ITree.Extra.IForest]
step':334 [in ITree.Extra.IForest]
step:331 [in ITree.Extra.IForest]
step:38 [in ITree.Core.ITreeDefinition]
step:53 [in ITree.Basics.Basics]
step:64 [in ITree.Basics.Basics]
step:74 [in ITree.Basics.Basics]
step:81 [in ITree.Basics.Basics]
step:90 [in ITree.Basics.Basics]
step:97 [in ITree.Basics.Basics]
St:1 [in ITree.Extra.Dijkstra.StateDelaySpec]
ST:263 [in ITree.Basics.HeterogeneousRelations]
st:72 [in ITree.Events.StateFacts]
SUTTK:15 [in ITree.Eq.SimUpToTaus]
sutt:28 [in ITree.Eq.SimUpToTaus]
sutt:38 [in ITree.Eq.SimUpToTaus]
sutt:5 [in ITree.Eq.SimUpToTaus]
SwapInvolutive_C:313 [in ITree.Basics.CategoryTheory]
Swap_bif:310 [in ITree.Basics.CategoryTheory]
sx:39 [in ITree.Events.StateFacts]
sx:9 [in ITree.Events.StateFacts]
Symmetric_R:31 [in ITree.Indexed.Relation]
S':208 [in ITree.Basics.HeterogeneousRelations]
S':273 [in ITree.Basics.HeterogeneousRelations]
s0:68 [in ITree.Extra.Dijkstra.StateSpecT]
s1:1 [in ITree.Extra.Dijkstra.StateIOTrace]
S1:101 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
s1:103 [in ITree.Events.StateFacts]
s1:104 [in ITree.Eq.SimUpToTaus]
s1:122 [in ITree.Events.StateFacts]
s1:126 [in ITree.Events.StateFacts]
S1:14 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
s1:141 [in ITree.Events.StateFacts]
s1:146 [in ITree.Events.StateFacts]
s1:20 [in ITree.Extra.Secure.SecureStateHandler]
s1:20 [in ITree.Extra.Secure.SecureStateHandlerPi]
S1:23 [in ITree.Extra.Secure.SecureEqBind]
S1:267 [in ITree.Extra.Secure.SecureEqProgInsens]
S1:3 [in ITree.Extra.Secure.SecureEqBind]
s1:30 [in ITree.Events.MapDefaultFacts]
s1:32 [in ITree.Extra.Secure.SecureStateHandler]
s1:33 [in ITree.Events.MapDefaultFacts]
s1:38 [in ITree.Events.MapDefaultFacts]
S1:44 [in ITree.Extra.Secure.SecureEqBind]
s1:44 [in ITree.Events.MapDefaultFacts]
S1:63 [in ITree.Extra.Secure.SecureEqBind]
s1:67 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S1:706 [in ITree.Eq.Eqit]
s1:71 [in ITree.Extra.Dijkstra.ITreeDijkstra]
s1:71 [in ITree.Extra.Dijkstra.StateSpecT]
S1:746 [in ITree.Eq.Eqit]
s1:80 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S1:86 [in ITree.Props.HasPost]
S1:98 [in ITree.Eq.SimUpToTaus]
s1:99 [in ITree.Events.StateFacts]
s2:100 [in ITree.Events.StateFacts]
S2:102 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
s2:104 [in ITree.Events.StateFacts]
s2:105 [in ITree.Eq.SimUpToTaus]
s2:123 [in ITree.Events.StateFacts]
s2:127 [in ITree.Events.StateFacts]
s2:142 [in ITree.Events.StateFacts]
s2:147 [in ITree.Events.StateFacts]
S2:15 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
S2:2 [in ITree.Extra.Secure.SecureEqBind]
s2:2 [in ITree.Extra.Dijkstra.StateIOTrace]
s2:21 [in ITree.Extra.Secure.SecureStateHandler]
s2:21 [in ITree.Extra.Secure.SecureStateHandlerPi]
S2:22 [in ITree.Extra.Secure.SecureEqBind]
S2:268 [in ITree.Extra.Secure.SecureEqProgInsens]
s2:31 [in ITree.Events.MapDefaultFacts]
s2:34 [in ITree.Events.MapDefaultFacts]
s2:39 [in ITree.Events.MapDefaultFacts]
s2:40 [in ITree.Extra.Secure.SecureStateHandler]
S2:45 [in ITree.Extra.Secure.SecureEqBind]
s2:45 [in ITree.Events.MapDefaultFacts]
S2:64 [in ITree.Extra.Secure.SecureEqBind]
s2:68 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S2:707 [in ITree.Eq.Eqit]
s2:72 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S2:747 [in ITree.Eq.Eqit]
s2:81 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S2:87 [in ITree.Props.HasPost]
S2:99 [in ITree.Eq.SimUpToTaus]
S:1 [in ITree.Extra.Dijkstra.StateSpecT]
S:1 [in ITree.Extra.Secure.SecureStateHandler]
S:1 [in ITree.Extra.Secure.SecureStateHandlerPi]
s:10 [in ITree.Basics.Basics]
s:10 [in ITree.Events.MapDefaultFacts]
S:102 [in ITree.Extra.ITrace.ITracePrefix]
S:103 [in ITree.Extra.ITrace.ITraceBind]
S:105 [in ITree.Basics.Basics]
S:105 [in ITree.Extra.ITrace.ITracePrefix]
S:105 [in ITree.Interp.InterpFacts]
s:106 [in ITree.Extra.Dijkstra.StateDelaySpec]
S:109 [in ITree.Events.StateFacts]
s:109 [in ITree.Extra.Dijkstra.ITreeDijkstra]
s:11 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:11 [in ITree.Events.Writer]
S:111 [in ITree.Basics.HeterogeneousRelations]
s:116 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:116 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S:117 [in ITree.Extra.ITrace.ITraceBind]
S:117 [in ITree.Basics.HeterogeneousRelations]
s:119 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S:12 [in ITree.Events.StateFacts]
s:12 [in ITree.Extra.Dijkstra.StateIOTrace]
S:122 [in ITree.Extra.ITrace.ITracePrefix]
S:124 [in ITree.Interp.Traces]
S:125 [in ITree.Props.Finite]
S:129 [in ITree.Extra.ITrace.ITracePrefix]
S:131 [in ITree.Props.Finite]
S:132 [in ITree.Events.StateFacts]
S:133 [in ITree.Extra.ITrace.ITraceBind]
s:137 [in ITree.Extra.ITrace.ITraceBind]
S:137 [in ITree.Props.Finite]
s:137 [in ITree.Extra.Secure.SecureStateHandler]
s:14 [in ITree.Basics.Basics]
s:14 [in ITree.Extra.Dijkstra.StateSpecT]
S:14 [in ITree.Basics.HeterogeneousRelations]
s:14 [in ITree.Events.MapDefaultFacts]
S:140 [in ITree.Extra.ITrace.ITraceBind]
S:141 [in ITree.Simple]
s:143 [in ITree.Extra.ITrace.ITraceBind]
S:144 [in ITree.Extra.ITrace.ITracePrefix]
S:144 [in ITree.Simple]
S:145 [in ITree.Basics.HeterogeneousRelations]
S:146 [in ITree.Extra.ITrace.ITraceBind]
s:146 [in ITree.Extra.Secure.SecureStateHandler]
s:150 [in ITree.Extra.ITrace.ITraceBind]
S:150 [in ITree.Extra.ITrace.ITracePrefix]
S:151 [in ITree.Events.StateFacts]
S:151 [in ITree.Props.Finite]
S:153 [in ITree.Extra.ITrace.ITraceBind]
s:155 [in ITree.Events.StateFacts]
S:156 [in ITree.Extra.ITrace.ITraceBind]
S:156 [in ITree.Props.Finite]
S:156 [in ITree.Extra.ITrace.ITracePrefix]
s:157 [in ITree.Extra.Secure.SecureStateHandler]
S:158 [in ITree.Events.StateFacts]
S:159 [in ITree.Props.Leaf]
S:16 [in ITree.Extra.ITrace.ITraceBind]
s:16 [in ITree.Events.StateFacts]
s:16 [in ITree.Events.MapDefaultFacts]
S:162 [in ITree.Props.Finite]
S:162 [in ITree.Extra.ITrace.ITracePrefix]
s:163 [in ITree.Extra.Secure.SecureStateHandler]
S:165 [in ITree.Extra.ITrace.ITraceBind]
S:167 [in ITree.Extra.ITrace.ITracePrefix]
S:167 [in ITree.Basics.HeterogeneousRelations]
S:169 [in ITree.Events.StateFacts]
S:169 [in ITree.Simple]
s:17 [in ITree.Extra.Dijkstra.StateSpecT]
s:17 [in ITree.Events.State]
S:174 [in ITree.Props.Finite]
s:174 [in ITree.Extra.Secure.SecureStateHandler]
S:179 [in ITree.Extra.ITrace.ITraceBind]
S:18 [in ITree.Interp.TranslateFacts]
S:180 [in ITree.Props.Finite]
S:185 [in ITree.Basics.HeterogeneousRelations]
s:187 [in ITree.Simple]
S:188 [in ITree.Basics.HeterogeneousRelations]
S:19 [in ITree.Events.StateFacts]
s:19 [in ITree.Basics.Basics]
s:19 [in ITree.Events.MapDefaultFacts]
S:19 [in ITree.Events.State]
S:191 [in ITree.Extra.ITrace.ITraceBind]
S:191 [in ITree.Simple]
s:193 [in ITree.Simple]
S:196 [in ITree.Extra.ITrace.ITraceFacts]
s:20 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
S:20 [in ITree.Basics.HeterogeneousRelations]
S:202 [in ITree.Extra.ITrace.ITraceBind]
S:204 [in ITree.Extra.ITrace.ITraceFacts]
S:207 [in ITree.Basics.HeterogeneousRelations]
S:214 [in ITree.Extra.ITrace.ITraceBind]
s:22 [in ITree.Events.State]
S:221 [in ITree.Extra.ITrace.ITraceFacts]
S:222 [in ITree.Extra.ITrace.ITraceBind]
s:23 [in ITree.Extra.ITrace.ITraceDefinition]
s:23 [in ITree.Extra.Dijkstra.StateSpecT]
s:23 [in ITree.Events.Writer]
S:23 [in ITree.Basics.CategoryRelations]
S:230 [in ITree.Simple]
S:231 [in ITree.Extra.ITrace.ITraceBind]
s:238 [in ITree.Extra.ITrace.ITraceBind]
s:239 [in ITree.Extra.ITrace.ITraceBind]
s:24 [in ITree.Extra.Dijkstra.StateDelaySpec]
S:24 [in ITree.Extra.Dijkstra.StateSpecT]
s:24 [in ITree.Extra.ITrace.ITraceFacts]
S:241 [in ITree.Basics.HeterogeneousRelations]
S:242 [in ITree.Extra.ITrace.ITraceBind]
S:25 [in ITree.Events.StateFacts]
S:253 [in ITree.Basics.HeterogeneousRelations]
S:257 [in ITree.Basics.HeterogeneousRelations]
S:258 [in ITree.Extra.ITrace.ITraceBind]
S:26 [in ITree.Extra.ITrace.ITraceBind]
S:266 [in ITree.Extra.IForest]
S:27 [in ITree.Extra.ITrace.ITracePrefix]
S:270 [in ITree.Extra.ITrace.ITraceBind]
S:272 [in ITree.Basics.HeterogeneousRelations]
S:274 [in ITree.Simple]
s:277 [in ITree.Extra.ITrace.ITraceBind]
S:277 [in ITree.Simple]
s:278 [in ITree.Extra.IForest]
s:28 [in ITree.Events.StateFacts]
s:28 [in ITree.Extra.Dijkstra.StateDelaySpec]
S:28 [in ITree.Simple]
S:280 [in ITree.Extra.ITrace.ITraceBind]
s:283 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S:285 [in ITree.Basics.HeterogeneousRelations]
S:286 [in ITree.Eq.UpToTaus]
s:287 [in ITree.Extra.ITrace.ITraceBind]
S:289 [in ITree.Extra.ITrace.ITraceBind]
s:29 [in ITree.Basics.Basics]
s:290 [in ITree.Eq.UpToTaus]
S:293 [in ITree.Eq.UpToTaus]
s:296 [in ITree.Extra.Dijkstra.ITreeDijkstra]
s:297 [in ITree.Extra.ITrace.ITraceBind]
s:297 [in ITree.Eq.UpToTaus]
S:297 [in ITree.Basics.HeterogeneousRelations]
S:3 [in ITree.Events.StateFacts]
S:3 [in ITree.Extra.ITrace.ITracePrefix]
S:3 [in ITree.Events.State]
S:300 [in ITree.Eq.UpToTaus]
s:301 [in ITree.Extra.ITrace.ITraceBind]
S:303 [in ITree.Extra.ITrace.ITraceBind]
s:304 [in ITree.Eq.UpToTaus]
S:307 [in ITree.Eq.UpToTaus]
S:31 [in ITree.Extra.ITrace.ITraceBind]
s:31 [in ITree.Extra.Dijkstra.StateSpecT]
s:31 [in ITree.Extra.Secure.SecureStateHandler]
s:31 [in ITree.Extra.Secure.SecureStateHandlerPi]
S:311 [in ITree.Extra.ITrace.ITraceBind]
s:311 [in ITree.Eq.UpToTaus]
S:316 [in ITree.Extra.ITrace.ITraceBind]
S:32 [in ITree.Events.StateFacts]
S:324 [in ITree.Extra.ITrace.ITraceBind]
s:33 [in ITree.Basics.Basics]
S:33 [in ITree.Extra.ITrace.ITracePrefix]
S:338 [in ITree.Extra.IForest]
S:347 [in ITree.Extra.IForest]
s:36 [in ITree.Basics.Basics]
S:36 [in ITree.Extra.ITrace.ITracePrefix]
s:38 [in ITree.Events.StateFacts]
S:386 [in ITree.Extra.IForest]
s:39 [in ITree.Basics.Basics]
S:39 [in ITree.Extra.ITrace.ITracePrefix]
s:39 [in ITree.Extra.Dijkstra.StateSpecT]
s:41 [in ITree.Extra.Dijkstra.StateIOTrace]
S:42 [in ITree.Extra.ITrace.ITraceBind]
S:42 [in ITree.Events.StateFacts]
s:42 [in ITree.Basics.Basics]
s:42 [in ITree.Basics.MonadState]
s:43 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:43 [in ITree.Simple]
s:46 [in ITree.Events.StateFacts]
S:46 [in ITree.Core.ITreeDefinition]
s:47 [in ITree.Basics.MonadState]
S:48 [in ITree.Simple]
s:49 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:49 [in ITree.Extra.ITrace.ITraceDefinition]
s:49 [in ITree.Extra.Secure.SecureStateHandlerPi]
S:5 [in ITree.Extra.ITrace.ITraceBind]
s:5 [in ITree.Basics.Basics]
S:50 [in ITree.Events.StateFacts]
S:50 [in ITree.Basics.Basics]
S:50 [in ITree.Extra.ITrace.ITracePrefix]
s:50 [in ITree.Simple]
S:51 [in ITree.Extra.ITrace.ITraceBind]
s:51 [in ITree.Extra.Dijkstra.StateSpecT]
s:51 [in ITree.Extra.Dijkstra.StateIOTrace]
s:52 [in ITree.Extra.Dijkstra.ITreeDijkstra]
s:52 [in ITree.Basics.MonadState]
s:53 [in ITree.Events.StateFacts]
s:54 [in ITree.Extra.ITrace.ITraceBind]
s:54 [in ITree.Extra.Dijkstra.StateIOTrace]
s:55 [in ITree.Basics.Basics]
S:55 [in ITree.Extra.ITrace.ITracePrefix]
S:57 [in ITree.Props.HasPost]
s:57 [in ITree.Extra.Dijkstra.StateSpecT]
s:571 [in ITree.Eq.Eqit]
s:578 [in ITree.Eq.Eqit]
S:58 [in ITree.Events.StateFacts]
s:58 [in ITree.Basics.Basics]
s:58 [in ITree.Extra.Dijkstra.StateIOTrace]
S:583 [in ITree.Extra.IForest]
s:585 [in ITree.Eq.Eqit]
S:589 [in ITree.Eq.Eqit]
S:59 [in ITree.Basics.CategoryRelations]
s:59 [in ITree.Interp.TranslateFacts]
S:6 [in ITree.Basics.HeterogeneousRelations]
S:60 [in ITree.Eq.Shallow]
S:600 [in ITree.Eq.Eqit]
s:61 [in ITree.Events.StateFacts]
S:61 [in ITree.Basics.Basics]
S:61 [in ITree.Core.ITreeDefinition]
S:62 [in ITree.Core.KTreeFacts]
s:62 [in ITree.Events.State]
S:63 [in ITree.Extra.ITrace.ITraceBind]
s:63 [in ITree.Extra.Dijkstra.StateIOTrace]
S:632 [in ITree.Eq.Eqit]
s:65 [in ITree.Extra.Dijkstra.StateDelaySpec]
S:65 [in ITree.Extra.Dijkstra.StateSpecT]
s:65 [in ITree.Extra.Dijkstra.StateIOTrace]
s:65 [in ITree.Events.State]
S:66 [in ITree.Events.StateFacts]
s:66 [in ITree.Basics.Basics]
s:66 [in ITree.Basics.MonadState]
S:66 [in ITree.Eq.Shallow]
S:66 [in ITree.Extra.Secure.SecureStateHandlerPi]
S:67 [in ITree.Extra.ITrace.ITracePrefix]
s:68 [in ITree.Basics.Basics]
S:68 [in ITree.Interp.InterpFacts]
S:69 [in ITree.Extra.ITrace.ITraceBind]
S:69 [in ITree.Eq.Shallow]
s:7 [in ITree.Events.StateFacts]
s:7 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:70 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:71 [in ITree.Events.StateFacts]
S:72 [in ITree.Basics.Basics]
S:73 [in ITree.Extra.ITrace.ITracePrefix]
s:73 [in ITree.Basics.MonadState]
S:735 [in ITree.Eq.Eqit]
S:74 [in ITree.Core.KTreeFacts]
S:740 [in ITree.Eq.Eqit]
S:75 [in ITree.Events.StateFacts]
S:75 [in ITree.Props.Leaf]
s:75 [in ITree.Basics.MonadState]
S:75 [in ITree.Extra.Dijkstra.StateSpecT]
s:76 [in ITree.Basics.Basics]
S:760 [in ITree.Eq.Eqit]
s:765 [in ITree.Eq.Eqit]
s:77 [in ITree.Extra.Dijkstra.StateDelaySpec]
S:775 [in ITree.Eq.Eqit]
s:777 [in ITree.Eq.Eqit]
S:78 [in ITree.Extra.ITrace.ITracePrefix]
s:78 [in ITree.Extra.Dijkstra.StateSpecT]
S:783 [in ITree.Eq.Eqit]
S:79 [in ITree.Extra.ITrace.ITraceBind]
S:791 [in ITree.Eq.Eqit]
s:8 [in ITree.Basics.Basics]
S:81 [in ITree.Events.StateFacts]
S:81 [in ITree.Extra.Dijkstra.StateSpecT]
S:82 [in ITree.Props.Leaf]
S:83 [in ITree.Extra.ITrace.ITracePrefix]
s:83 [in ITree.Extra.Secure.SecureStateHandler]
S:84 [in ITree.Events.ExceptionFacts]
s:84 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:84 [in ITree.Extra.Dijkstra.StateSpecT]
S:85 [in ITree.Extra.ITrace.ITraceBind]
S:86 [in ITree.Events.StateFacts]
s:86 [in ITree.Extra.Dijkstra.StateSpecT]
S:9 [in ITree.Interp.Traces]
S:91 [in ITree.Extra.ITrace.ITraceBind]
s:92 [in ITree.Extra.Dijkstra.ITreeDijkstra]
S:92 [in ITree.Simple]
S:94 [in ITree.Extra.ITrace.ITraceBind]
s:94 [in ITree.Extra.Dijkstra.StateDelaySpec]
s:95 [in ITree.Extra.Dijkstra.StateDelaySpec]
S:95 [in ITree.Props.Leaf]
S:95 [in ITree.Eq.Shallow]
s:96 [in ITree.Extra.Dijkstra.StateDelaySpec]
S:96 [in ITree.Extra.ITrace.ITracePrefix]

T

ta1:527 [in ITree.Extra.IForest]
ta2:528 [in ITree.Extra.IForest]
ta:10 [in ITree.Eq.EuttExtras]
ta:109 [in ITree.Extra.IForest]
ta:18 [in ITree.Eq.EuttExtras]
ta:20 [in ITree.Props.EuttNoRet]
ta:215 [in ITree.Extra.IForest]
ta:222 [in ITree.Extra.IForest]
ta:30 [in ITree.Props.EuttNoRet]
ta:35 [in ITree.Extra.IForest]
ta:4 [in ITree.Props.EuttNoRet]
ta:452 [in ITree.Extra.IForest]
ta:456 [in ITree.Extra.IForest]
ta:46 [in ITree.Extra.IForest]
ta:461 [in ITree.Extra.IForest]
ta:537 [in ITree.Extra.IForest]
ta:542 [in ITree.Extra.IForest]
ta:558 [in ITree.Extra.IForest]
ta:57 [in ITree.Extra.IForest]
ta:570 [in ITree.Extra.IForest]
ta:575 [in ITree.Extra.IForest]
ta:578 [in ITree.Extra.IForest]
ta:588 [in ITree.Extra.IForest]
ta:592 [in ITree.Extra.IForest]
ta:595 [in ITree.Extra.IForest]
ta:614 [in ITree.Extra.IForest]
ta:68 [in ITree.Extra.IForest]
tb:11 [in ITree.Eq.EuttExtras]
tb:19 [in ITree.Eq.EuttExtras]
tb:21 [in ITree.Props.EuttNoRet]
tb:31 [in ITree.Props.EuttNoRet]
tb:36 [in ITree.Extra.IForest]
tb:45 [in ITree.Extra.IForest]
tb:5 [in ITree.Props.EuttNoRet]
tb:536 [in ITree.Extra.IForest]
tb:559 [in ITree.Extra.IForest]
tb:56 [in ITree.Extra.IForest]
tb:67 [in ITree.Extra.IForest]
tb:78 [in ITree.Extra.IForest]
tc:617 [in ITree.Extra.IForest]
tc:618 [in ITree.Extra.IForest]
tc:889 [in ITree.Eq.Eqit]
TerminalObject_t:323 [in ITree.Basics.CategoryFacts]
TerminalObject_t:60 [in ITree.Basics.CategoryFacts]
Terminal_t:322 [in ITree.Basics.CategoryFacts]
Terminal_t:59 [in ITree.Basics.CategoryFacts]
Terminal_t:40 [in ITree.Basics.CategoryTheory]
Term_C:207 [in ITree.Basics.CategoryTheory]
TMP:62 [in ITree.Eq.Paco2]
ToBif:26 [in ITree.Basics.CategorySub]
Transitive_R:37 [in ITree.Indexed.Relation]
TRANS:425 [in ITree.Eq.Eqit]
TRANS:562 [in ITree.Eq.Eqit]
tr1:10 [in ITree.Interp.Traces]
tr1:131 [in ITree.Interp.Traces]
tr2:11 [in ITree.Interp.Traces]
tr2:132 [in ITree.Interp.Traces]
tr:119 [in ITree.Extra.ITrace.ITracePreds]
tr:122 [in ITree.Extra.ITrace.ITracePreds]
tr:127 [in ITree.Interp.Traces]
tr:136 [in ITree.Interp.Traces]
tr:15 [in ITree.Extra.Dijkstra.StateIOTrace]
tr:16 [in ITree.Interp.Traces]
tr:26 [in ITree.Interp.Traces]
tr:30 [in ITree.Events.State]
tr:34 [in ITree.Interp.Traces]
tr:34 [in ITree.Extra.Dijkstra.StateIOTrace]
tr:42 [in ITree.Interp.Traces]
tr:43 [in ITree.Extra.Dijkstra.StateIOTrace]
tr:50 [in ITree.Interp.Traces]
tr:73 [in ITree.Interp.Traces]
tr:74 [in ITree.Interp.Traces]
ts:125 [in ITree.Interp.Traces]
ttry:14 [in ITree.Events.Exception]
ttry:59 [in ITree.Events.ExceptionFacts]
ttry:70 [in ITree.Events.ExceptionFacts]
ttry:77 [in ITree.Events.ExceptionFacts]
TT:302 [in ITree.Extra.IForest]
TT:315 [in ITree.Extra.IForest]
t_spec:251 [in ITree.Extra.IForest]
t':106 [in ITree.Interp.Traces]
t':113 [in ITree.Interp.InterpFacts]
t':149 [in ITree.Extra.ITrace.ITraceBind]
t':163 [in ITree.Events.StateFacts]
t':194 [in ITree.Extra.IForest]
t':25 [in ITree.Events.Exception]
t':28 [in ITree.Events.Exception]
t':311 [in ITree.Eq.Eqit]
t':320 [in ITree.Extra.IForest]
t':38 [in ITree.Extra.Dijkstra.PureITreeBasics]
t':78 [in ITree.Eq.UpToTaus]
t':88 [in ITree.Extra.ITrace.ITraceBind]
t':94 [in ITree.Interp.Traces]
T0:1 [in ITree.Eq.Paco2]
t0:114 [in ITree.Extra.ITrace.ITraceBind]
t0:120 [in ITree.Extra.IForest]
t0:121 [in ITree.Extra.Secure.SecureEqBind]
t0:132 [in ITree.Extra.IForest]
t0:184 [in ITree.Extra.ITrace.ITraceBind]
T0:22 [in ITree.Eq.Paco2]
t0:237 [in ITree.Extra.ITrace.ITraceBind]
t0:249 [in ITree.Extra.ITrace.ITraceBind]
t0:266 [in ITree.Extra.ITrace.ITraceBind]
t0:276 [in ITree.Extra.ITrace.ITraceBind]
t0:286 [in ITree.Extra.ITrace.ITraceBind]
t0:312 [in ITree.Eq.Eqit]
t0:320 [in ITree.Extra.ITrace.ITraceBind]
t0:75 [in ITree.Extra.Secure.SecureEqEuttHalt]
t0:97 [in ITree.Extra.Secure.SecureEqBind]
t1':114 [in ITree.Interp.Traces]
t1':152 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1':152 [in ITree.Extra.Secure.SecureEqHalt]
t1':203 [in ITree.Eq.Eqit]
t1':311 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1':34 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1':59 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1':71 [in ITree.Eq.Eqit]
t1':89 [in ITree.Eq.Rutt]
t1:102 [in ITree.Extra.IForest]
t1:102 [in ITree.Eq.SimUpToTaus]
t1:104 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:104 [in ITree.Props.Leaf]
t1:106 [in ITree.Eq.Rutt]
t1:11 [in ITree.Eq.UpToTaus]
t1:110 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:110 [in ITree.Extra.Secure.SecureEqHalt]
t1:111 [in ITree.Interp.Traces]
t1:112 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
t1:113 [in ITree.Extra.ITrace.ITraceBind]
t1:115 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:118 [in ITree.Events.StateFacts]
t1:118 [in ITree.Interp.Traces]
t1:12 [in ITree.Extra.Dijkstra.PureITreeBasics]
t1:121 [in ITree.Extra.IForest]
t1:122 [in ITree.Extra.Secure.SecureStateHandler]
t1:123 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:125 [in ITree.Extra.ITrace.ITracePreds]
t1:129 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:133 [in ITree.Extra.IForest]
t1:134 [in ITree.Props.Leaf]
t1:134 [in ITree.Extra.ITrace.ITraceFacts]
t1:135 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:137 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:138 [in ITree.Events.StateFacts]
t1:138 [in ITree.Extra.ITrace.ITraceFacts]
t1:139 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:14 [in ITree.Props.Infinite]
t1:141 [in ITree.Eq.Eqit]
t1:144 [in ITree.Extra.Secure.SecureEqBind]
t1:147 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:149 [in ITree.Props.Leaf]
t1:150 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:150 [in ITree.Extra.Secure.SecureEqHalt]
t1:151 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:153 [in ITree.Events.StateFacts]
t1:161 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:169 [in ITree.Eq.UpToTaus]
t1:17 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:17 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:17 [in ITree.Extra.Secure.SecureEqHalt]
t1:173 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:173 [in ITree.Extra.Secure.SecureEqHalt]
t1:174 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:175 [in ITree.Eq.UpToTaus]
t1:179 [in ITree.Extra.Secure.SecureStateHandler]
t1:18 [in ITree.Eq.UpToTaus]
t1:181 [in ITree.Eq.UpToTaus]
t1:185 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:186 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:186 [in ITree.Extra.Secure.SecureEqHalt]
t1:187 [in ITree.Eq.UpToTaus]
t1:189 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:19 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:19 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:19 [in ITree.Extra.Secure.SecureEqHalt]
t1:19 [in ITree.Eq.SimUpToTaus]
t1:193 [in ITree.Eq.UpToTaus]
t1:196 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:20 [in ITree.Extra.Secure.SecureEqBind]
t1:200 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:200 [in ITree.Extra.Secure.SecureEqHalt]
t1:201 [in ITree.Eq.Eqit]
t1:203 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:210 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:211 [in ITree.Extra.ITrace.ITraceFacts]
t1:216 [in ITree.Extra.ITrace.ITraceFacts]
t1:217 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:219 [in ITree.Eq.UpToTaus]
t1:22 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:22 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:22 [in ITree.Eq.SimUpToTaus]
t1:224 [in ITree.Eq.Eqit]
t1:230 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t1:233 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:239 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:24 [in ITree.Eq.UpToTaus]
T1:24 [in ITree.Eq.Paco2]
t1:244 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:25 [in ITree.Eq.Eqit]
t1:253 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:259 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:263 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:265 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t1:27 [in ITree.Eq.Rutt]
t1:273 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:277 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:28 [in ITree.Extra.Secure.SecureEqEuttTrans]
t1:28 [in ITree.Events.MapDefaultFacts]
t1:292 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:295 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:3 [in ITree.Eq.EqAxiom]
T1:3 [in ITree.Eq.Paco2]
t1:310 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:32 [in ITree.Eq.Rutt]
t1:324 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:33 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:333 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:35 [in ITree.Props.EuttNoRet]
t1:350 [in ITree.Eq.Eqit]
t1:354 [in ITree.Extra.IForest]
t1:357 [in ITree.Eq.Eqit]
t1:365 [in ITree.Eq.Eqit]
t1:37 [in ITree.Eq.Eqit]
t1:376 [in ITree.Eq.Eqit]
t1:379 [in ITree.Extra.IForest]
t1:38 [in ITree.Interp.HandlerFacts]
t1:38 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
t1:38 [in ITree.Extra.Secure.SecureStateHandlerPi]
t1:39 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:39 [in ITree.Extra.Secure.SecureEqBind]
t1:391 [in ITree.Extra.IForest]
t1:391 [in ITree.Eq.Eqit]
t1:398 [in ITree.Eq.Eqit]
t1:40 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:40 [in ITree.Extra.Secure.SecureEqHalt]
t1:40 [in ITree.Props.EuttNoRet]
t1:40 [in ITree.Interp.Traces]
t1:41 [in ITree.Eq.Rutt]
t1:43 [in ITree.Extra.Secure.SecureEqEuttTrans]
t1:436 [in ITree.Eq.Eqit]
t1:44 [in ITree.Extra.Secure.SecureStateHandlerPi]
t1:45 [in ITree.Interp.Traces]
t1:50 [in ITree.Eq.Rutt]
t1:50 [in ITree.Eq.Shallow]
t1:51 [in ITree.Props.EuttNoRet]
t1:53 [in ITree.Interp.Traces]
t1:54 [in ITree.Extra.Secure.SecureEqBind]
t1:57 [in ITree.Eq.SimUpToTaus]
t1:57 [in ITree.Extra.ITrace.ITracePrefix]
t1:57 [in ITree.Interp.Traces]
t1:58 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:59 [in ITree.Eq.Rutt]
t1:6 [in ITree.Events.Nondeterminism]
t1:61 [in ITree.Interp.Traces]
t1:62 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:63 [in ITree.Eq.SimUpToTaus]
t1:640 [in ITree.Eq.Eqit]
t1:65 [in ITree.Eq.Eqit]
t1:67 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:67 [in ITree.Extra.Secure.SecureEqHalt]
t1:670 [in ITree.Eq.Eqit]
t1:68 [in ITree.Eq.Rutt]
t1:687 [in ITree.Eq.Eqit]
t1:69 [in ITree.Eq.SimUpToTaus]
t1:697 [in ITree.Eq.Eqit]
t1:701 [in ITree.Eq.Eqit]
t1:71 [in ITree.Interp.Traces]
t1:712 [in ITree.Eq.Eqit]
t1:72 [in ITree.Extra.Secure.SecureEqProgInsens]
t1:72 [in ITree.Extra.Secure.SecureEqBind]
t1:725 [in ITree.Eq.Eqit]
t1:73 [in ITree.Extra.Secure.SecureStateHandlerPi]
t1:74 [in ITree.Eq.UpToTaus]
t1:75 [in ITree.Eq.SimUpToTaus]
t1:754 [in ITree.Eq.Eqit]
t1:77 [in ITree.Interp.Traces]
t1:77 [in ITree.Eq.Rutt]
t1:78 [in ITree.Extra.ITrace.ITraceFacts]
t1:8 [in ITree.Extra.Secure.SecureEqEuttHalt]
t1:80 [in ITree.Extra.ITrace.ITracePrefix]
t1:80 [in ITree.Props.EuttNoRet]
t1:81 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t1:81 [in ITree.Extra.Secure.SecureEqHalt]
t1:81 [in ITree.Eq.SimUpToTaus]
t1:81 [in ITree.Interp.Traces]
t1:85 [in ITree.Interp.Traces]
t1:87 [in ITree.Eq.SimUpToTaus]
t1:87 [in ITree.Eq.Rutt]
t1:91 [in ITree.Props.HasPost]
t1:93 [in ITree.Eq.SimUpToTaus]
t1:95 [in ITree.Events.StateFacts]
t1:95 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
t1:99 [in ITree.Extra.ITrace.ITraceBind]
t2':115 [in ITree.Interp.Traces]
t2':153 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2':153 [in ITree.Extra.Secure.SecureEqHalt]
t2':204 [in ITree.Eq.Eqit]
t2':90 [in ITree.Eq.Rutt]
t2:100 [in ITree.Extra.IForest]
t2:103 [in ITree.Extra.IForest]
t2:103 [in ITree.Eq.SimUpToTaus]
t2:105 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:105 [in ITree.Props.Leaf]
t2:107 [in ITree.Eq.Rutt]
t2:108 [in ITree.Extra.IForest]
t2:111 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:111 [in ITree.Extra.Secure.SecureEqHalt]
t2:112 [in ITree.Interp.Traces]
t2:113 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
t2:116 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:119 [in ITree.Events.StateFacts]
t2:119 [in ITree.Interp.Traces]
t2:12 [in ITree.Eq.UpToTaus]
t2:123 [in ITree.Extra.Secure.SecureStateHandler]
t2:124 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:126 [in ITree.Extra.ITrace.ITracePreds]
t2:13 [in ITree.Extra.Dijkstra.PureITreeBasics]
t2:130 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:135 [in ITree.Props.Leaf]
t2:135 [in ITree.Extra.ITrace.ITraceFacts]
t2:136 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:139 [in ITree.Events.StateFacts]
t2:139 [in ITree.Extra.ITrace.ITraceFacts]
t2:140 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:142 [in ITree.Eq.Eqit]
t2:145 [in ITree.Extra.Secure.SecureEqBind]
t2:148 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:150 [in ITree.Props.Leaf]
t2:151 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:151 [in ITree.Extra.Secure.SecureEqHalt]
t2:154 [in ITree.Events.StateFacts]
t2:162 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:17 [in ITree.Eq.SimUpToTaus]
t2:170 [in ITree.Eq.UpToTaus]
t2:174 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:174 [in ITree.Extra.Secure.SecureEqHalt]
t2:175 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:176 [in ITree.Eq.UpToTaus]
t2:18 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:18 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:18 [in ITree.Extra.Secure.SecureEqHalt]
t2:180 [in ITree.Extra.Secure.SecureStateHandler]
t2:182 [in ITree.Eq.UpToTaus]
t2:186 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:187 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:187 [in ITree.Extra.Secure.SecureEqHalt]
t2:188 [in ITree.Eq.UpToTaus]
t2:19 [in ITree.Eq.UpToTaus]
t2:19 [in ITree.Extra.Secure.SecureEqBind]
t2:190 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:194 [in ITree.Eq.UpToTaus]
t2:197 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:20 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:20 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:201 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:201 [in ITree.Extra.Secure.SecureEqHalt]
t2:202 [in ITree.Eq.Eqit]
t2:204 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:211 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:212 [in ITree.Extra.ITrace.ITraceFacts]
t2:217 [in ITree.Extra.ITrace.ITraceFacts]
t2:218 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:220 [in ITree.Eq.UpToTaus]
t2:225 [in ITree.Eq.Eqit]
t2:23 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:23 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:23 [in ITree.Extra.Secure.SecureEqHalt]
t2:23 [in ITree.Eq.SimUpToTaus]
t2:231 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t2:240 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:245 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:25 [in ITree.Eq.UpToTaus]
t2:251 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:254 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:260 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:264 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:266 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t2:274 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:278 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:29 [in ITree.Extra.Secure.SecureEqEuttTrans]
t2:29 [in ITree.Events.MapDefaultFacts]
t2:293 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:296 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:30 [in ITree.Eq.Rutt]
t2:30 [in ITree.Eq.Eqit]
t2:312 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:325 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:33 [in ITree.Eq.Rutt]
t2:334 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:34 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:34 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:34 [in ITree.Extra.Secure.SecureEqHalt]
t2:35 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:351 [in ITree.Eq.Eqit]
t2:355 [in ITree.Extra.IForest]
t2:358 [in ITree.Eq.Eqit]
t2:36 [in ITree.Props.EuttNoRet]
t2:366 [in ITree.Eq.Eqit]
t2:377 [in ITree.Eq.Eqit]
t2:38 [in ITree.Eq.Eqit]
t2:380 [in ITree.Extra.IForest]
t2:39 [in ITree.Interp.HandlerFacts]
t2:39 [in ITree.Extra.Secure.SecureStateHandlerPi]
t2:392 [in ITree.Extra.IForest]
t2:392 [in ITree.Eq.Eqit]
t2:399 [in ITree.Eq.Eqit]
t2:4 [in ITree.Eq.EqAxiom]
t2:40 [in ITree.Extra.Secure.SecureEqBind]
t2:41 [in ITree.Props.EuttNoRet]
t2:41 [in ITree.Interp.Traces]
t2:42 [in ITree.Eq.Rutt]
t2:437 [in ITree.Eq.Eqit]
t2:44 [in ITree.Extra.Secure.SecureEqEuttTrans]
t2:45 [in ITree.Extra.Secure.SecureStateHandlerPi]
t2:46 [in ITree.Interp.Traces]
t2:51 [in ITree.Eq.Rutt]
t2:51 [in ITree.Eq.Shallow]
t2:52 [in ITree.Props.EuttNoRet]
t2:54 [in ITree.Interp.Traces]
t2:55 [in ITree.Extra.Secure.SecureEqBind]
t2:56 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:58 [in ITree.Eq.SimUpToTaus]
t2:58 [in ITree.Interp.Traces]
t2:60 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:60 [in ITree.Extra.Secure.SecureEqHalt]
t2:60 [in ITree.Eq.Rutt]
t2:60 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:62 [in ITree.Interp.Traces]
t2:64 [in ITree.Eq.SimUpToTaus]
t2:641 [in ITree.Eq.Eqit]
t2:671 [in ITree.Eq.Eqit]
t2:688 [in ITree.Eq.Eqit]
t2:69 [in ITree.Eq.Rutt]
t2:698 [in ITree.Eq.Eqit]
t2:7 [in ITree.Events.Nondeterminism]
t2:70 [in ITree.Eq.SimUpToTaus]
t2:702 [in ITree.Eq.Eqit]
t2:713 [in ITree.Eq.Eqit]
t2:72 [in ITree.Interp.Traces]
t2:726 [in ITree.Eq.Eqit]
t2:73 [in ITree.Extra.Secure.SecureEqProgInsens]
t2:73 [in ITree.Extra.Secure.SecureEqBind]
t2:74 [in ITree.Extra.Secure.SecureStateHandlerPi]
t2:75 [in ITree.Eq.UpToTaus]
t2:755 [in ITree.Eq.Eqit]
t2:76 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
t2:76 [in ITree.Extra.Secure.SecureEqHalt]
t2:78 [in ITree.Interp.Traces]
t2:78 [in ITree.Eq.Rutt]
t2:79 [in ITree.Extra.ITrace.ITraceFacts]
t2:81 [in ITree.Props.EuttNoRet]
t2:82 [in ITree.Eq.SimUpToTaus]
t2:82 [in ITree.Interp.Traces]
t2:83 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
t2:86 [in ITree.Interp.Traces]
t2:88 [in ITree.Eq.SimUpToTaus]
t2:88 [in ITree.Eq.Rutt]
t2:9 [in ITree.Extra.Secure.SecureEqEuttHalt]
t2:93 [in ITree.Props.HasPost]
t2:94 [in ITree.Eq.SimUpToTaus]
t2:96 [in ITree.Events.StateFacts]
t3:102 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:176 [in ITree.Extra.Secure.SecureEqProgInsens]
t3:219 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:236 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:252 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:261 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t3:294 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:30 [in ITree.Extra.Secure.SecureEqEuttTrans]
t3:313 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:314 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:315 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:316 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:326 [in ITree.Extra.Secure.SecureEqEuttHalt]
t3:40 [in ITree.Extra.Secure.SecureEqProgInsensFacts]
t3:438 [in ITree.Eq.Eqit]
t3:45 [in ITree.Extra.Secure.SecureEqEuttTrans]
t3:53 [in ITree.Props.EuttNoRet]
t3:87 [in ITree.Extra.Secure.SecureEqEuttHalt]
t4:199 [in ITree.Extra.Secure.SecureEqEuttHalt]
t4:216 [in ITree.Extra.Secure.SecureEqEuttHalt]
t4:299 [in ITree.Extra.Secure.SecureEqEuttHalt]
t4:300 [in ITree.Extra.Secure.SecureEqEuttHalt]
t4:301 [in ITree.Extra.Secure.SecureEqEuttHalt]
t4:302 [in ITree.Extra.Secure.SecureEqEuttHalt]
t4:76 [in ITree.Extra.Secure.SecureEqEuttHalt]
t5:295 [in ITree.Extra.Secure.SecureEqEuttHalt]
t5:296 [in ITree.Extra.Secure.SecureEqEuttHalt]
t5:297 [in ITree.Extra.Secure.SecureEqEuttHalt]
t5:298 [in ITree.Extra.Secure.SecureEqEuttHalt]
T:1 [in ITree.Basics.Basics]
t:10 [in ITree.Interp.TranslateFacts]
T:10 [in ITree.Indexed.FunctionFacts]
t:10 [in ITree.Interp.RecursionFacts]
T:10 [in ITree.Indexed.Sum]
t:101 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:103 [in ITree.Events.FailFacts]
t:103 [in ITree.Core.KTreeFacts]
t:103 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:105 [in ITree.Extra.ITrace.ITraceBind]
t:105 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:105 [in ITree.Interp.Traces]
t:106 [in ITree.Core.KTreeFacts]
t:106 [in ITree.Props.Finite]
t:106 [in ITree.Extra.Secure.SecureStateHandler]
t:106 [in ITree.Interp.InterpFacts]
t:107 [in ITree.Props.HasPost]
t:107 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:11 [in ITree.Props.Finite]
t:11 [in ITree.Props.Leaf]
T:11 [in ITree.Interp.HandlerFacts]
t:11 [in ITree.Extra.Dijkstra.DelaySpecMonad]
t:111 [in ITree.Extra.ITrace.ITracePreds]
t:112 [in ITree.Events.FailFacts]
t:112 [in ITree.Interp.InterpFacts]
t:114 [in ITree.Extra.Secure.SecureStateHandler]
t:115 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:118 [in ITree.Props.HasPost]
t:118 [in ITree.Props.Finite]
T:118 [in ITree.Basics.HeterogeneousRelations]
t:119 [in ITree.Props.HasPost]
T:119 [in ITree.Simple]
t:12 [in ITree.Indexed.FunctionFacts]
t:121 [in ITree.Props.HasPost]
t:122 [in ITree.Interp.InterpFacts]
t:125 [in ITree.Props.HasPost]
T:125 [in ITree.Simple]
t:126 [in ITree.Props.Finite]
t:126 [in ITree.Extra.ITrace.ITraceFacts]
t:127 [in ITree.Extra.ITrace.ITraceBind]
t:129 [in ITree.Extra.ITrace.ITraceFacts]
t:13 [in ITree.Interp.Interp]
t:131 [in ITree.Props.HasPost]
t:131 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:131 [in ITree.Interp.InterpFacts]
t:132 [in ITree.Props.Finite]
t:133 [in ITree.Extra.Secure.SecureStateHandler]
t:136 [in ITree.Extra.ITrace.ITraceBind]
t:138 [in ITree.Props.Finite]
t:14 [in ITree.Props.EuttNoRet]
T:14 [in ITree.Indexed.Relation]
t:142 [in ITree.Extra.ITrace.ITraceBind]
t:142 [in ITree.Props.Finite]
t:146 [in ITree.Props.Finite]
T:146 [in ITree.Basics.HeterogeneousRelations]
t:148 [in ITree.Extra.ITrace.ITraceBind]
t:15 [in ITree.Events.StateFacts]
T:15 [in ITree.Indexed.Function]
t:15 [in ITree.Extra.Dijkstra.PureITreeBasics]
t:15 [in ITree.Core.ITreeDefinition]
t:151 [in ITree.Simple]
t:152 [in ITree.Props.Finite]
t:152 [in ITree.Simple]
t:155 [in ITree.Extra.Secure.SecureEqEuttHalt]
t:156 [in ITree.Extra.IForest]
t:157 [in ITree.Props.Finite]
t:158 [in ITree.Extra.IForest]
t:16 [in ITree.Props.HasPost]
t:16 [in ITree.Events.Exception]
T:16 [in ITree.Interp.RecursionFacts]
T:160 [in ITree.Props.Leaf]
t:162 [in ITree.Events.StateFacts]
t:162 [in ITree.Props.Leaf]
t:163 [in ITree.Props.Finite]
t:165 [in ITree.Extra.IForest]
t:168 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:169 [in ITree.Extra.Secure.SecureEqEuttHalt]
t:17 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:17 [in ITree.Events.Writer]
T:17 [in ITree.Events.Concurrency]
t:17 [in ITree.Extra.Dijkstra.DelaySpecMonad]
t:17 [in ITree.Extra.Dijkstra.PureITreeBasics]
t:17 [in ITree.Interp.RecursionFacts]
T:17 [in ITree.Core.ITreeDefinition]
t:171 [in ITree.Extra.ITrace.ITraceBind]
t:171 [in ITree.Extra.IForest]
t:172 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:172 [in ITree.Extra.Secure.SecureStateHandler]
t:173 [in ITree.Events.StateFacts]
t:174 [in ITree.Extra.ITrace.ITraceFacts]
t:175 [in ITree.Props.Finite]
t:175 [in ITree.Simple]
T:18 [in ITree.Indexed.Relation]
t:181 [in ITree.Props.Finite]
t:182 [in ITree.Extra.ITrace.ITraceFacts]
t:185 [in ITree.Props.Finite]
t:187 [in ITree.Extra.ITrace.ITraceFacts]
t:188 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:189 [in ITree.Props.Finite]
T:19 [in ITree.Interp.Recursion]
t:19 [in ITree.Props.Finite]
t:19 [in ITree.Events.Exception]
t:19 [in ITree.Extra.Dijkstra.ITreeDijkstra]
T:19 [in ITree.Interp.HandlerFacts]
t:190 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:192 [in ITree.Props.Finite]
t:192 [in ITree.Extra.ITrace.ITraceFacts]
T:192 [in ITree.Simple]
t:193 [in ITree.Extra.IForest]
t:194 [in ITree.Props.Finite]
t:196 [in ITree.Extra.ITrace.ITraceBind]
t:197 [in ITree.Props.Finite]
t:198 [in ITree.Extra.ITrace.ITraceFacts]
t:20 [in ITree.Props.Finite]
t:20 [in ITree.Props.Leaf]
t:20 [in ITree.Extra.Secure.SecureEqEuttHalt]
t:20 [in ITree.Interp.TranslateFacts]
t:20 [in ITree.Extra.Dijkstra.PureITreeBasics]
t:200 [in ITree.Extra.Secure.SecureEqEuttHalt]
t:206 [in ITree.Extra.ITrace.ITraceFacts]
t:207 [in ITree.Extra.ITrace.ITraceBind]
t:208 [in ITree.Simple]
t:21 [in ITree.Basics.CategoryOps]
T:21 [in ITree.Interp.Recursion]
t:216 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:217 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:219 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
T:22 [in ITree.Interp.HandlerFacts]
T:22 [in ITree.Indexed.Relation]
t:22 [in ITree.Interp.InterpFacts]
t:22 [in ITree.Interp.Interp]
T:22 [in ITree.Interp.RecursionFacts]
t:220 [in ITree.Extra.Secure.SecureEqEuttHalt]
t:221 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:223 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:224 [in ITree.Extra.ITrace.ITraceBind]
t:226 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:227 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:23 [in ITree.Interp.Traces]
t:23 [in ITree.Events.Concurrency]
T:230 [in ITree.Extra.IForest]
t:231 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:232 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:232 [in ITree.Simple]
t:233 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:234 [in ITree.Extra.ITrace.ITraceBind]
t:24 [in ITree.Props.HasPost]
t:24 [in ITree.Extra.IForest]
t:24 [in ITree.Props.Finite]
t:24 [in ITree.Events.Exception]
T:24 [in ITree.Indexed.Relation]
T:24 [in ITree.Interp.RecursionFacts]
T:24 [in ITree.Core.ITreeDefinition]
T:242 [in ITree.Basics.HeterogeneousRelations]
t:245 [in ITree.Extra.IForest]
t:25 [in ITree.Extra.IForest]
t:25 [in ITree.Interp.Traces]
T:25 [in ITree.Core.Subevent]
t:254 [in ITree.Extra.ITrace.ITraceBind]
T:254 [in ITree.Simple]
t:258 [in ITree.Extra.IForest]
T:259 [in ITree.Simple]
T:26 [in ITree.Events.FailFacts]
T:26 [in ITree.Events.StateFacts]
t:26 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:26 [in ITree.Interp.TranslateFacts]
t:26 [in ITree.Extra.Dijkstra.DelaySpecMonad]
T:26 [in ITree.Interp.RecursionFacts]
t:26 [in ITree.Events.State]
t:269 [in ITree.Extra.IForest]
t:274 [in ITree.Eq.UpToTaus]
t:276 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:279 [in ITree.Extra.IForest]
t:28 [in ITree.Extra.ITrace.ITraceBind]
T:28 [in ITree.Events.FailFacts]
T:28 [in ITree.Indexed.Relation]
t:28 [in ITree.Events.Writer]
T:28 [in ITree.Interp.RecursionFacts]
t:282 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:285 [in ITree.Extra.IForest]
T:286 [in ITree.Basics.HeterogeneousRelations]
t:289 [in ITree.Eq.UpToTaus]
t:289 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:29 [in ITree.Props.HasPost]
T:29 [in ITree.Interp.Recursion]
t:29 [in ITree.Interp.HandlerFacts]
t:29 [in ITree.Extra.Dijkstra.StateSpecT]
t:29 [in ITree.Interp.RecursionFacts]
T:29 [in ITree.Core.ITreeDefinition]
t:292 [in ITree.Extra.ITrace.ITraceBind]
t:293 [in ITree.Eq.Eqit]
t:294 [in ITree.Eq.Eqit]
t:295 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:296 [in ITree.Eq.UpToTaus]
t:298 [in ITree.Eq.Eqit]
t:3 [in ITree.Props.HasPost]
T:3 [in ITree.Indexed.Relation]
t:3 [in ITree.Props.Cofinite]
T:3 [in ITree.Indexed.FunctionFacts]
T:30 [in ITree.Events.FailFacts]
t:30 [in ITree.Extra.IForest]
T:30 [in ITree.Indexed.Relation]
T:301 [in ITree.Extra.IForest]
t:301 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:303 [in ITree.Eq.UpToTaus]
t:303 [in ITree.Eq.Eqit]
t:306 [in ITree.Extra.ITrace.ITraceBind]
t:310 [in ITree.Eq.UpToTaus]
t:310 [in ITree.Eq.Eqit]
t:313 [in ITree.Extra.ITrace.ITraceBind]
T:314 [in ITree.Extra.IForest]
t:319 [in ITree.Extra.IForest]
T:32 [in ITree.Events.FailFacts]
t:32 [in ITree.Props.Finite]
t:32 [in ITree.Interp.InterpFacts]
t:321 [in ITree.Basics.CategoryFacts]
t:326 [in ITree.Extra.ITrace.ITraceBind]
T:33 [in ITree.Events.StateFacts]
t:33 [in ITree.Interp.TranslateFacts]
t:33 [in ITree.Extra.Dijkstra.PureITreeBasics]
T:339 [in ITree.Extra.IForest]
t:34 [in ITree.Props.HasPost]
t:34 [in ITree.Interp.HandlerFacts]
T:34 [in ITree.Indexed.Relation]
t:34 [in ITree.Core.ITreeDefinition]
t:341 [in ITree.Extra.IForest]
t:35 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:36 [in ITree.Props.Infinite]
T:36 [in ITree.Indexed.Relation]
t:37 [in ITree.Interp.Traces]
T:37 [in ITree.Core.Subevent]
t:37 [in ITree.Extra.Dijkstra.PureITreeBasics]
T:376 [in ITree.Extra.IForest]
T:387 [in ITree.Extra.IForest]
t:39 [in ITree.Props.HasPost]
t:39 [in ITree.Basics.CategoryTheory]
t:39 [in ITree.Events.State]
t:4 [in ITree.Eq.EuttExtras]
t:4 [in ITree.Events.Concurrency]
T:4 [in ITree.Indexed.FunctionFacts]
t:4 [in ITree.Simple]
t:40 [in ITree.Basics.Basics]
T:40 [in ITree.Interp.HandlerFacts]
T:40 [in ITree.Indexed.Relation]
T:40 [in ITree.Interp.TranslateFacts]
t:40 [in ITree.Extra.Dijkstra.DelaySpecMonad]
t:402 [in ITree.Eq.Eqit]
t:405 [in ITree.Eq.Eqit]
t:406 [in ITree.Extra.IForest]
t:409 [in ITree.Eq.Eqit]
t:42 [in ITree.Events.ExceptionFacts]
t:42 [in ITree.Extra.Dijkstra.ITreeDijkstra]
T:42 [in ITree.Interp.HandlerFacts]
T:42 [in ITree.Indexed.Relation]
t:42 [in ITree.Extra.Secure.SecureStateHandler]
t:424 [in ITree.Extra.IForest]
T:43 [in ITree.Events.StateFacts]
T:43 [in ITree.Interp.TranslateFacts]
t:431 [in ITree.Extra.IForest]
t:44 [in ITree.Props.HasPost]
t:44 [in ITree.Events.StateFacts]
t:44 [in ITree.Props.Finite]
t:44 [in ITree.Props.Infinite]
t:44 [in ITree.Extra.ITrace.ITracePrefix]
T:44 [in ITree.Interp.HandlerFacts]
t:45 [in ITree.Props.EuttNoRet]
T:45 [in ITree.Events.State]
t:46 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:46 [in ITree.Extra.ITrace.ITraceDefinition]
T:46 [in ITree.Interp.HandlerFacts]
T:46 [in ITree.Indexed.Relation]
t:48 [in ITree.Props.HasPost]
T:48 [in ITree.Interp.HandlerFacts]
T:48 [in ITree.Indexed.Relation]
t:48 [in ITree.Core.ITreeDefinition]
t:49 [in ITree.Eq.UpToTaus]
t:49 [in ITree.Props.Infinite]
t:49 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:49 [in ITree.Interp.Traces]
T:49 [in ITree.Simple]
t:5 [in ITree.Interp.Recursion]
T:5 [in ITree.Indexed.Function]
T:5 [in ITree.Indexed.Relation]
t:5 [in ITree.Interp.TranslateFacts]
T:50 [in ITree.Interp.HandlerFacts]
t:51 [in ITree.Events.FailFacts]
T:51 [in ITree.Indexed.Relation]
t:53 [in ITree.Extra.ITrace.ITraceBind]
t:53 [in ITree.Props.Finite]
t:53 [in ITree.Props.Leaf]
T:53 [in ITree.Indexed.Relation]
t:53 [in ITree.Events.MapDefaultFacts]
t:54 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:55 [in ITree.Props.HasPost]
t:55 [in ITree.Extra.Secure.SecureStateHandler]
t:56 [in ITree.Events.State]
t:57 [in ITree.Extra.Dijkstra.TracesIT]
t:570 [in ITree.Eq.Eqit]
t:577 [in ITree.Eq.Eqit]
t:58 [in ITree.Basics.CategoryFacts]
t:58 [in ITree.Interp.TranslateFacts]
t:584 [in ITree.Eq.Eqit]
t:590 [in ITree.Eq.Eqit]
t:592 [in ITree.Eq.Eqit]
t:593 [in ITree.Eq.Eqit]
t:594 [in ITree.Eq.Eqit]
t:595 [in ITree.Eq.Eqit]
t:596 [in ITree.Eq.Eqit]
t:597 [in ITree.Eq.Eqit]
t:6 [in ITree.Props.Finite]
t:6 [in ITree.Props.Infinite]
t:6 [in ITree.Props.Leaf]
t:6 [in ITree.Props.Cofinite]
t:6 [in ITree.Interp.Interp]
t:6 [in ITree.Interp.TranslateFacts]
T:6 [in ITree.Indexed.FunctionFacts]
t:6 [in ITree.Simple]
t:60 [in ITree.Events.State]
t:606 [in ITree.Eq.Eqit]
t:608 [in ITree.Extra.IForest]
t:61 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:61 [in ITree.Props.Infinite]
t:61 [in ITree.Eq.Shallow]
t:61 [in ITree.Events.State]
t:62 [in ITree.Props.Infinite]
t:62 [in ITree.Extra.Dijkstra.StateSpecT]
t:62 [in ITree.Extra.Dijkstra.DelaySpecMonad]
t:62 [in ITree.Core.ITreeDefinition]
t:63 [in ITree.Events.ExceptionFacts]
t:633 [in ITree.Eq.Eqit]
t:641 [in ITree.Extra.IForest]
t:65 [in ITree.Extra.ITrace.ITraceBind]
t:65 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:65 [in ITree.Extra.Secure.SecureStateHandler]
t:66 [in ITree.Simple]
T:67 [in ITree.Events.StateFacts]
t:67 [in ITree.Props.Leaf]
t:68 [in ITree.Props.Finite]
t:68 [in ITree.Extra.Secure.SecureStateHandlerPi]
t:69 [in ITree.Events.StateFacts]
t:69 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:7 [in ITree.Props.Finite]
t:7 [in ITree.Props.Leaf]
t:7 [in ITree.Interp.TranslateFacts]
t:7 [in ITree.Core.ITreeDefinition]
t:70 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:70 [in ITree.Extra.ITrace.ITracePrefix]
t:70 [in ITree.Props.EuttNoRet]
t:70 [in ITree.Extra.ITrace.ITraceFacts]
t:70 [in ITree.Interp.InterpFacts]
t:71 [in ITree.Extra.ITrace.ITraceBind]
t:71 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:72 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:73 [in ITree.Props.EuttNoRet]
t:74 [in ITree.Events.FailFacts]
t:75 [in ITree.Props.Infinite]
t:75 [in ITree.Eq.Shallow]
t:75 [in ITree.Interp.InterpFacts]
t:76 [in ITree.Props.Leaf]
T:77 [in ITree.Events.FailFacts]
t:77 [in ITree.Extra.Dijkstra.DelaySpecMonad]
T:776 [in ITree.Eq.Eqit]
t:78 [in ITree.Interp.InterpFacts]
T:784 [in ITree.Eq.Eqit]
t:787 [in ITree.Eq.Eqit]
t:79 [in ITree.Props.HasPost]
t:79 [in ITree.Props.Infinite]
T:792 [in ITree.Eq.Eqit]
t:795 [in ITree.Eq.Eqit]
t:8 [in ITree.Eq.EqAxiom]
t:8 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:8 [in ITree.Events.Concurrency]
t:8 [in ITree.Interp.TranslateFacts]
t:8 [in ITree.Extra.Dijkstra.PureITreeBasics]
t:801 [in ITree.Eq.Eqit]
t:814 [in ITree.Eq.Eqit]
t:82 [in ITree.Extra.ITrace.ITraceBind]
t:82 [in ITree.Core.ITreeDefinition]
t:83 [in ITree.Props.Leaf]
t:85 [in ITree.Events.ExceptionFacts]
t:85 [in ITree.Props.Finite]
t:85 [in ITree.Props.Infinite]
t:85 [in ITree.Interp.InterpFacts]
T:86 [in ITree.Extra.IForest]
t:87 [in ITree.Extra.ITrace.ITraceBind]
t:87 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:88 [in ITree.Extra.Dijkstra.ITreeDijkstra]
t:88 [in ITree.Extra.ITrace.ITraceFacts]
t:897 [in ITree.Eq.Eqit]
t:9 [in ITree.Props.HasPost]
t:9 [in ITree.Events.ExceptionFacts]
T:9 [in ITree.Interp.HandlerFacts]
T:9 [in ITree.Indexed.Relation]
T:9 [in ITree.Indexed.Sum]
T:90 [in ITree.Extra.IForest]
t:905 [in ITree.Eq.Eqit]
t:91 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:92 [in ITree.Extra.Secure.SecureStateHandler]
t:93 [in ITree.Props.Infinite]
t:93 [in ITree.Interp.InterpFacts]
t:94 [in ITree.Simple]
t:96 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
t:96 [in ITree.Eq.Shallow]
t:97 [in ITree.Props.Finite]
t:97 [in ITree.Interp.Traces]
t:99 [in ITree.Interp.InterpFacts]

U

UnitLIso_C:267 [in ITree.Basics.CategoryTheory]
UnitLIso_C:265 [in ITree.Basics.CategoryTheory]
UnitL_i:317 [in ITree.Basics.CategoryTheory]
UnitL_bif:250 [in ITree.Basics.CategoryTheory]
UnitL'_i:318 [in ITree.Basics.CategoryTheory]
UnitL'_bif:251 [in ITree.Basics.CategoryTheory]
UnitRIso_C:272 [in ITree.Basics.CategoryTheory]
UnitRIso_C:270 [in ITree.Basics.CategoryTheory]
UnitR_i:319 [in ITree.Basics.CategoryTheory]
UnitR_bif:252 [in ITree.Basics.CategoryTheory]
UnitR'_i:320 [in ITree.Basics.CategoryTheory]
UnitR'_bif:253 [in ITree.Basics.CategoryTheory]
UU:131 [in ITree.Props.Leaf]
UU:148 [in ITree.Props.Leaf]
UU:686 [in ITree.Eq.Eqit]
UU:724 [in ITree.Eq.Eqit]
U1:101 [in ITree.Props.Leaf]
u1:109 [in ITree.Props.Leaf]
U1:129 [in ITree.Props.Leaf]
u1:138 [in ITree.Props.Leaf]
U1:146 [in ITree.Props.Leaf]
u1:153 [in ITree.Props.Leaf]
u1:208 [in ITree.Eq.UpToTaus]
u1:218 [in ITree.Extra.IForest]
u1:223 [in ITree.Extra.IForest]
u1:234 [in ITree.Extra.IForest]
u1:236 [in ITree.Extra.IForest]
u1:327 [in ITree.Eq.Eqit]
U1:644 [in ITree.Eq.Eqit]
U1:667 [in ITree.Eq.Eqit]
u1:675 [in ITree.Eq.Eqit]
U1:684 [in ITree.Eq.Eqit]
u1:692 [in ITree.Eq.Eqit]
U1:722 [in ITree.Eq.Eqit]
u1:730 [in ITree.Eq.Eqit]
u1:95 [in ITree.Props.HasPost]
U2:102 [in ITree.Props.Leaf]
u2:110 [in ITree.Props.Leaf]
U2:130 [in ITree.Props.Leaf]
u2:139 [in ITree.Props.Leaf]
U2:147 [in ITree.Props.Leaf]
u2:154 [in ITree.Props.Leaf]
u2:210 [in ITree.Eq.UpToTaus]
u2:219 [in ITree.Extra.IForest]
u2:224 [in ITree.Extra.IForest]
u2:235 [in ITree.Extra.IForest]
u2:237 [in ITree.Extra.IForest]
u2:328 [in ITree.Eq.Eqit]
U2:645 [in ITree.Eq.Eqit]
U2:668 [in ITree.Eq.Eqit]
u2:676 [in ITree.Eq.Eqit]
U2:685 [in ITree.Eq.Eqit]
u2:693 [in ITree.Eq.Eqit]
U2:723 [in ITree.Eq.Eqit]
u2:731 [in ITree.Eq.Eqit]
u2:96 [in ITree.Props.HasPost]
u:10 [in ITree.Eq.SimUpToTaus]
U:105 [in ITree.Props.HasPost]
u:107 [in ITree.Props.Finite]
U:11 [in ITree.Simple]
u:110 [in ITree.Props.HasPost]
u:119 [in ITree.Props.Finite]
u:120 [in ITree.Props.HasPost]
u:122 [in ITree.Props.HasPost]
u:141 [in ITree.Props.Finite]
u:145 [in ITree.Props.Finite]
u:15 [in ITree.Core.Subevent]
U:15 [in ITree.Interp.RecursionFacts]
u:15 [in ITree.Simple]
U:155 [in ITree.Simple]
u:159 [in ITree.Simple]
U:162 [in ITree.Simple]
u:165 [in ITree.Props.Leaf]
u:166 [in ITree.Simple]
U:172 [in ITree.Extra.IForest]
U:174 [in ITree.Simple]
u:176 [in ITree.Eq.Eqit]
U:179 [in ITree.Simple]
U:18 [in ITree.Core.ITreeDefinition]
u:19 [in ITree.Eq.Eqit]
u:199 [in ITree.Eq.UpToTaus]
U:20 [in ITree.Interp.RecursionFacts]
u:20 [in ITree.Core.ITreeDefinition]
U:20 [in ITree.Simple]
u:21 [in ITree.Props.Finite]
u:21 [in ITree.Basics.CategoryKleisli]
u:210 [in ITree.Extra.IForest]
U:218 [in ITree.Simple]
u:24 [in ITree.Simple]
U:243 [in ITree.Basics.HeterogeneousRelations]
U:25 [in ITree.Core.ITreeDefinition]
u:26 [in ITree.Extra.IForest]
u:26 [in ITree.Core.ITreeDefinition]
U:273 [in ITree.Eq.UpToTaus]
u:277 [in ITree.Eq.UpToTaus]
U:28 [in ITree.Interp.HandlerFacts]
U:287 [in ITree.Basics.HeterogeneousRelations]
u:289 [in ITree.Eq.Eqit]
U:30 [in ITree.Core.ITreeDefinition]
U:302 [in ITree.Eq.Eqit]
u:307 [in ITree.Eq.Eqit]
u:32 [in ITree.Events.State]
U:33 [in ITree.Interp.HandlerFacts]
U:34 [in ITree.Events.StateFacts]
u:34 [in ITree.Props.Leaf]
U:34 [in ITree.Simple]
U:340 [in ITree.Eq.Eqit]
u:344 [in ITree.Eq.Eqit]
U:353 [in ITree.Extra.IForest]
u:359 [in ITree.Extra.IForest]
U:37 [in ITree.Interp.InterpFacts]
U:4 [in ITree.Core.Subevent]
u:423 [in ITree.Extra.IForest]
u:438 [in ITree.Extra.IForest]
U:44 [in ITree.Props.EuttNoRet]
u:54 [in ITree.Props.Leaf]
U:605 [in ITree.Eq.Eqit]
U:610 [in ITree.Eq.Eqit]
U:618 [in ITree.Eq.Eqit]
U:653 [in ITree.Eq.Eqit]
u:657 [in ITree.Eq.Eqit]
u:68 [in ITree.Props.Leaf]
U:74 [in ITree.Eq.Shallow]
u:769 [in ITree.Eq.Eqit]
U:78 [in ITree.Events.FailFacts]
U:78 [in ITree.Simple]
U:79 [in ITree.Eq.Shallow]
u:79 [in ITree.Extra.ITrace.ITracePreds]
u:8 [in ITree.Props.Finite]
u:8 [in ITree.Props.Leaf]
u:86 [in ITree.Props.Finite]
U:9 [in ITree.Core.Subevent]
u:98 [in ITree.Props.Finite]

V

vclo':118 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo':118 [in ITree.Extra.Secure.SecureEqHalt]
vclo':44 [in ITree.Eq.Eqit]
vclo':80 [in ITree.Extra.Secure.SecureEqProgInsens]
vclo:108 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:108 [in ITree.Extra.Secure.SecureEqHalt]
vclo:11 [in ITree.Extra.Secure.SecureEqProgInsens]
vclo:11 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:11 [in ITree.Extra.Secure.SecureEqHalt]
vclo:113 [in ITree.Eq.Eqit]
vclo:115 [in ITree.Props.Leaf]
vclo:117 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:117 [in ITree.Extra.Secure.SecureEqHalt]
vclo:126 [in ITree.Eq.Eqit]
vclo:128 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
vclo:128 [in ITree.Extra.Secure.SecureEqHalt]
vclo:168 [in ITree.Eq.Eqit]
vclo:230 [in ITree.Eq.Eqit]
vclo:241 [in ITree.Eq.Eqit]
vclo:35 [in ITree.Eq.Eqit]
vclo:364 [in ITree.Extra.IForest]
vclo:373 [in ITree.Eq.Eqit]
vclo:43 [in ITree.Eq.Eqit]
vclo:53 [in ITree.Eq.Eqit]
vclo:63 [in ITree.Eq.Eqit]
vclo:680 [in ITree.Eq.Eqit]
vclo:70 [in ITree.Extra.Secure.SecureEqProgInsens]
vclo:79 [in ITree.Extra.Secure.SecureEqProgInsens]
vclo:86 [in ITree.Eq.Eqit]
vclo:87 [in ITree.Eq.UpToTaus]
vclo:9 [in ITree.Eq.Eqit]
vclo:90 [in ITree.Extra.Secure.SecureEqProgInsens]
v':70 [in ITree.Extra.Dijkstra.StateIOTrace]
v':71 [in ITree.Extra.Dijkstra.StateIOTrace]
v':72 [in ITree.Extra.Dijkstra.StateIOTrace]
v':73 [in ITree.Extra.Dijkstra.StateIOTrace]
v':74 [in ITree.Extra.Dijkstra.StateIOTrace]
v':75 [in ITree.Extra.Dijkstra.StateIOTrace]
v1:163 [in ITree.Eq.UpToTaus]
v2:164 [in ITree.Eq.UpToTaus]
V:10 [in ITree.Core.Subevent]
v:11 [in ITree.Indexed.Sum]
v:119 [in ITree.Extra.ITrace.ITraceFacts]
v:122 [in ITree.Extra.ITrace.ITraceFacts]
v:123 [in ITree.Extra.ITrace.ITraceBind]
v:13 [in ITree.Events.MapDefaultFacts]
v:14 [in ITree.Events.Map]
v:152 [in ITree.Extra.ITrace.ITraceFacts]
v:154 [in ITree.Extra.ITrace.ITraceFacts]
v:177 [in ITree.Eq.Eqit]
V:18 [in ITree.Events.MapDefault]
V:180 [in ITree.Simple]
v:19 [in ITree.Basics.Function]
v:203 [in ITree.Eq.UpToTaus]
v:22 [in ITree.Extra.ITrace.ITraceBind]
v:22 [in ITree.Basics.CategoryKleisli]
v:23 [in ITree.Eq.Eqit]
v:3 [in ITree.Basics.CategoryRelations]
v:30 [in ITree.Basics.CategoryKleisli]
V:31 [in ITree.Core.ITreeDefinition]
V:35 [in ITree.Simple]
v:36 [in ITree.Events.MapDefaultFacts]
v:47 [in ITree.Extra.Secure.SecureStateHandler]
V:49 [in ITree.Extra.Dijkstra.StateIOTrace]
V:5 [in ITree.Core.Subevent]
v:50 [in ITree.Eq.UpToTaus]
v:50 [in ITree.Extra.Dijkstra.StateIOTrace]
v:60 [in ITree.Extra.Dijkstra.StateIOTrace]
V:611 [in ITree.Eq.Eqit]
v:64 [in ITree.Extra.Dijkstra.StateIOTrace]
v:66 [in ITree.Events.ExceptionFacts]
v:68 [in ITree.Extra.Dijkstra.StateIOTrace]
v:70 [in ITree.Eq.Eqit]
v:8 [in ITree.Basics.FunctionFacts]
V:80 [in ITree.Eq.Shallow]
v:9 [in ITree.Events.Exception]
v:9 [in ITree.Events.MapDefaultFacts]
v:912 [in ITree.Eq.Eqit]
v:917 [in ITree.Eq.Eqit]

W

WMonad:42 [in ITree.Extra.Dijkstra.DijkstraMonad]
WMonad:61 [in ITree.Extra.Dijkstra.DijkstraMonad]
WOrderLaws:46 [in ITree.Extra.Dijkstra.DijkstraMonad]
WOrderLaws:65 [in ITree.Extra.Dijkstra.DijkstraMonad]
WOrder:45 [in ITree.Extra.Dijkstra.DijkstraMonad]
WOrder:64 [in ITree.Extra.Dijkstra.DijkstraMonad]
wsx:18 [in ITree.Events.Writer]
w1:11 [in ITree.Extra.Dijkstra.TracesIT]
w1:12 [in ITree.Extra.Dijkstra.StateSpecT]
w1:15 [in ITree.Extra.Dijkstra.DijkstraMonad]
w1:15 [in ITree.Extra.Dijkstra.StateSpecT]
w1:192 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w1:21 [in ITree.Extra.Dijkstra.ITreeDijkstra]
w1:21 [in ITree.Extra.Dijkstra.DijkstraMonad]
w1:211 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w1:32 [in ITree.Extra.Dijkstra.DelaySpecMonad]
w1:36 [in ITree.Extra.Dijkstra.DelaySpecMonad]
w1:70 [in ITree.Extra.Dijkstra.TracesIT]
w2:12 [in ITree.Extra.Dijkstra.TracesIT]
w2:13 [in ITree.Extra.Dijkstra.StateSpecT]
w2:16 [in ITree.Extra.Dijkstra.DijkstraMonad]
w2:16 [in ITree.Extra.Dijkstra.StateSpecT]
w2:193 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w2:212 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w2:22 [in ITree.Extra.Dijkstra.ITreeDijkstra]
w2:22 [in ITree.Extra.Dijkstra.DijkstraMonad]
w2:33 [in ITree.Extra.Dijkstra.DelaySpecMonad]
w2:37 [in ITree.Extra.Dijkstra.DelaySpecMonad]
w2:71 [in ITree.Extra.Dijkstra.TracesIT]
w3:17 [in ITree.Extra.Dijkstra.DijkstraMonad]
W:1 [in ITree.Events.Writer]
w:12 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:12 [in ITree.Extra.Dijkstra.DijkstraMonad]
W:13 [in ITree.Events.Writer]
w:14 [in ITree.Extra.Dijkstra.DelaySpecMonad]
W:15 [in ITree.Events.Writer]
w:16 [in ITree.Extra.Dijkstra.ITreeDijkstra]
w:19 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
W:19 [in ITree.Events.Writer]
W:2 [in ITree.Extra.Dijkstra.StateSpecT]
w:201 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:206 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:21 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:23 [in ITree.Extra.Dijkstra.DelaySpecMonad]
w:25 [in ITree.Basics.Basics]
W:25 [in ITree.Events.Writer]
w:26 [in ITree.Extra.Dijkstra.TracesIT]
W:27 [in ITree.Extra.Dijkstra.DijkstraMonad]
w:28 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:30 [in ITree.Extra.Dijkstra.DelaySpecMonad]
w:35 [in ITree.Extra.Dijkstra.TracesIT]
W:36 [in ITree.Extra.Dijkstra.DijkstraMonad]
W:4 [in ITree.Events.Writer]
W:40 [in ITree.Extra.Dijkstra.DijkstraMonad]
w:43 [in ITree.Extra.Dijkstra.TracesIT]
w:5 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:5 [in ITree.Extra.Dijkstra.ITreeDijkstra]
W:5 [in ITree.Extra.Dijkstra.DijkstraMonad]
w:50 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
w:58 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
W:59 [in ITree.Extra.Dijkstra.DijkstraMonad]
w:68 [in ITree.Extra.Dijkstra.DijkstraMonad]
w:7 [in ITree.Extra.Dijkstra.TracesIT]
w:7 [in ITree.Events.Writer]
w:71 [in ITree.Extra.Dijkstra.DijkstraMonad]
w:77 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
W:8 [in ITree.Events.Writer]

X

xs:13 [in ITree.Events.Nondeterminism]
xs:18 [in ITree.Events.Nondeterminism]
xs:28 [in ITree.Events.Nondeterminism]
x_:65 [in ITree.Core.ITreeDefinition]
x':101 [in ITree.Extra.Secure.SecureEqWcompat]
x':137 [in ITree.Eq.Rutt]
x':160 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
x':160 [in ITree.Extra.Secure.SecureEqHalt]
x':160 [in ITree.Eq.Rutt]
x':211 [in ITree.Eq.Eqit]
x':214 [in ITree.Extra.Secure.SecureEqProgInsens]
x':478 [in ITree.Eq.Eqit]
x':496 [in ITree.Extra.IForest]
x':502 [in ITree.Eq.Eqit]
x':524 [in ITree.Eq.Eqit]
x':546 [in ITree.Eq.Eqit]
x':62 [in ITree.Extra.Secure.SecureEqWcompat]
x':81 [in ITree.Extra.Secure.SecureEqWcompat]
x':83 [in ITree.Eq.UpToTaus]
x':97 [in ITree.Eq.Rutt]
x0:115 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
x0:115 [in ITree.Extra.Secure.SecureEqHalt]
x0:19 [in ITree.Props.Infinite]
x0:41 [in ITree.Eq.Eqit]
x0:467 [in ITree.Extra.IForest]
x0:483 [in ITree.Extra.IForest]
x0:488 [in ITree.Extra.IForest]
x0:77 [in ITree.Extra.Secure.SecureEqProgInsens]
X1:10 [in ITree.Eq.Shallow]
x1:116 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
x1:116 [in ITree.Extra.Secure.SecureEqHalt]
X1:128 [in ITree.Eq.Eqit]
X1:21 [in ITree.Eq.Shallow]
x1:230 [in ITree.Basics.HeterogeneousRelations]
X1:30 [in ITree.Eq.Shallow]
x1:42 [in ITree.Eq.Eqit]
x1:78 [in ITree.Extra.Secure.SecureEqProgInsens]
X1:88 [in ITree.Eq.Eqit]
X2:11 [in ITree.Eq.Shallow]
X2:129 [in ITree.Eq.Eqit]
X2:22 [in ITree.Eq.Shallow]
x2:231 [in ITree.Basics.HeterogeneousRelations]
X2:31 [in ITree.Eq.Shallow]
X2:66 [in ITree.Eq.Eqit]
X2:91 [in ITree.Eq.Eqit]
X:1 [in ITree.Basics.Tacs]
x:1 [in ITree.Basics.MonadProp]
x:10 [in ITree.Events.FailFacts]
x:10 [in ITree.Extra.IForest]
x:100 [in ITree.Interp.Traces]
x:100 [in ITree.Extra.Secure.SecureEqBind]
x:100 [in ITree.Extra.Secure.SecureEqWcompat]
x:100 [in ITree.Eq.Rutt]
x:103 [in ITree.Extra.Secure.SecureEqWcompat]
X:103 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:104 [in ITree.Core.KTreeFacts]
x:107 [in ITree.Core.KTreeFacts]
X:108 [in ITree.Events.FailFacts]
x:11 [in ITree.Props.HasPost]
x:11 [in ITree.Basics.CategoryKleisliFacts]
X:11 [in ITree.Events.Nondeterminism]
X:11 [in ITree.Interp.TranslateFacts]
x:110 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:111 [in ITree.Props.HasPost]
x:111 [in ITree.Basics.Basics]
x:112 [in ITree.Simple]
x:113 [in ITree.Props.HasPost]
x:115 [in ITree.Events.FailFacts]
X:115 [in ITree.Eq.Eqit]
X:116 [in ITree.Props.HasPost]
x:118 [in ITree.Eq.UpToTaus]
x:118 [in ITree.Extra.ITrace.ITraceFacts]
x:119 [in ITree.Props.Leaf]
x:119 [in ITree.Eq.Eqit]
x:12 [in ITree.Props.HasPost]
x:12 [in ITree.Events.FailFacts]
X:12 [in ITree.Props.Infinite]
x:12 [in ITree.Events.Nondeterminism]
x:120 [in ITree.Props.Leaf]
X:120 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:121 [in ITree.Props.Leaf]
x:121 [in ITree.Extra.ITrace.ITraceFacts]
x:122 [in ITree.Props.Leaf]
x:123 [in ITree.Props.Leaf]
x:123 [in ITree.Extra.Secure.SecureEqBind]
X:124 [in ITree.Props.HasPost]
x:124 [in ITree.Props.Leaf]
x:126 [in ITree.Extra.ITrace.ITracePrefix]
x:127 [in ITree.Eq.UpToTaus]
x:127 [in ITree.Props.HasPost]
X:128 [in ITree.Extra.ITrace.ITraceBind]
x:128 [in ITree.Props.Finite]
X:128 [in ITree.Interp.Traces]
x:128 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:13 [in ITree.Props.Finite]
x:13 [in ITree.Props.Leaf]
x:13 [in ITree.Basics.Basics]
x:13 [in ITree.Eq.Paco2]
X:130 [in ITree.Props.HasPost]
x:133 [in ITree.Props.HasPost]
x:134 [in ITree.Props.Finite]
x:136 [in ITree.Eq.Rutt]
X:137 [in ITree.Simple]
X:138 [in ITree.Extra.Secure.SecureEqEuttHalt]
X:139 [in ITree.Eq.UpToTaus]
x:14 [in ITree.Basics.CategoryKleisliFacts]
x:14 [in ITree.Eq.SimUpToTaus]
x:14 [in ITree.Basics.CategoryRelations]
x:14 [in ITree.Interp.TranslateFacts]
x:14 [in ITree.Eq.Paco2]
x:140 [in ITree.Props.Finite]
x:140 [in ITree.Props.Leaf]
x:140 [in ITree.Eq.Rutt]
x:141 [in ITree.Props.Leaf]
x:144 [in ITree.Eq.UpToTaus]
x:144 [in ITree.Props.Finite]
x:146 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:148 [in ITree.Eq.UpToTaus]
x:148 [in ITree.Props.Finite]
X:15 [in ITree.Props.HasPost]
x:15 [in ITree.Events.FailFacts]
x:15 [in ITree.Basics.HeterogeneousRelations]
x:15 [in ITree.Eq.Paco2]
x:150 [in ITree.Eq.UpToTaus]
x:152 [in ITree.Eq.UpToTaus]
X:152 [in ITree.Events.StateFacts]
x:155 [in ITree.Eq.UpToTaus]
x:155 [in ITree.Props.Leaf]
x:156 [in ITree.Props.Leaf]
x:158 [in ITree.Eq.UpToTaus]
x:159 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
x:159 [in ITree.Extra.Secure.SecureEqHalt]
x:159 [in ITree.Props.Finite]
x:159 [in ITree.Eq.Rutt]
X:16 [in ITree.Props.Infinite]
X:16 [in ITree.Events.Nondeterminism]
x:16 [in ITree.Eq.Shallow]
x:16 [in ITree.Basics.CategoryRelations]
x:160 [in ITree.Extra.Secure.SecureEqEuttHalt]
X:162 [in ITree.Extra.ITrace.ITraceFacts]
x:163 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
x:163 [in ITree.Extra.Secure.SecureEqHalt]
x:163 [in ITree.Eq.Rutt]
x:165 [in ITree.Props.Finite]
X:165 [in ITree.Extra.ITrace.ITraceFacts]
X:168 [in ITree.Extra.ITrace.ITraceFacts]
x:17 [in ITree.Basics.CategoryKleisli]
x:17 [in ITree.Interp.InterpFacts]
x:175 [in ITree.Extra.IForest]
x:175 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:177 [in ITree.Props.Finite]
X:177 [in ITree.Extra.ITrace.ITraceFacts]
x:18 [in ITree.Basics.Monad]
x:18 [in ITree.Events.Exception]
x:18 [in ITree.Events.Concurrency]
x:18 [in ITree.Eq.Paco2]
x:184 [in ITree.Simple]
x:186 [in ITree.Props.Finite]
x:188 [in ITree.Simple]
X:19 [in ITree.Props.HasPost]
x:19 [in ITree.Interp.RecursionFacts]
x:190 [in ITree.Props.Finite]
x:190 [in ITree.Extra.Secure.SecureEqEuttHalt]
X:191 [in ITree.Props.Finite]
X:193 [in ITree.Props.Finite]
x:195 [in ITree.Props.Finite]
X:196 [in ITree.Props.Finite]
X:2 [in ITree.Basics.Tacs]
X:2 [in ITree.Props.HasPost]
X:2 [in ITree.Extra.IForest]
X:2 [in ITree.Props.Infinite]
x:20 [in ITree.Basics.Function]
X:201 [in ITree.Props.Finite]
x:202 [in ITree.Extra.Dijkstra.PureITreeDijkstra]
X:203 [in ITree.Props.Finite]
x:203 [in ITree.Simple]
X:205 [in ITree.Props.Finite]
x:205 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:206 [in ITree.Props.Finite]
X:207 [in ITree.Extra.IForest]
X:209 [in ITree.Props.Finite]
X:21 [in ITree.Props.HasPost]
x:21 [in ITree.Basics.Monad]
x:21 [in ITree.Eq.Paco2]
x:210 [in ITree.Eq.Eqit]
x:211 [in ITree.Extra.IForest]
x:213 [in ITree.Extra.Secure.SecureEqProgInsens]
X:213 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:213 [in ITree.Simple]
x:214 [in ITree.Eq.Eqit]
x:216 [in ITree.Extra.Secure.SecureEqProgInsens]
x:216 [in ITree.Basics.HeterogeneousRelations]
x:22 [in ITree.Events.FailFacts]
X:22 [in ITree.Props.Finite]
X:22 [in ITree.Props.Leaf]
x:22 [in ITree.Interp.TranslateFacts]
x:22 [in ITree.Core.ITreeDefinition]
x:221 [in ITree.Simple]
x:223 [in ITree.Basics.HeterogeneousRelations]
X:23 [in ITree.Props.HasPost]
x:23 [in ITree.Basics.CategoryKleisli]
X:23 [in ITree.Props.Infinite]
x:23 [in ITree.Interp.Interp]
x:23 [in ITree.Interp.TranslateFacts]
x:23 [in ITree.Events.State]
x:232 [in ITree.Extra.IForest]
x:233 [in ITree.Extra.IForest]
x:238 [in ITree.Extra.IForest]
x:239 [in ITree.Extra.IForest]
x:24 [in ITree.Events.ExceptionFacts]
x:24 [in ITree.Basics.HeterogeneousRelations]
x:248 [in ITree.Simple]
x:26 [in ITree.Basics.Function]
x:26 [in ITree.Props.Finite]
X:27 [in ITree.Extra.IForest]
x:27 [in ITree.Basics.Monad]
x:27 [in ITree.Events.Exception]
X:27 [in ITree.Props.Infinite]
x:27 [in ITree.Props.Leaf]
X:27 [in ITree.Events.Nondeterminism]
X:27 [in ITree.Interp.Traces]
x:27 [in ITree.Interp.InterpFacts]
X:270 [in ITree.Simple]
X:28 [in ITree.Props.HasPost]
x:29 [in ITree.Extra.IForest]
x:29 [in ITree.Basics.HeterogeneousRelations]
x:29 [in ITree.Events.State]
X:29 [in ITree.Eq.Paco2]
X:3 [in ITree.Indexed.Sum]
X:30 [in ITree.Interp.Traces]
X:30 [in ITree.Core.Subevent]
X:31 [in ITree.Extra.Secure.SecureEqEuttTrans]
x:31 [in ITree.Events.State]
x:31 [in ITree.Eq.Paco2]
x:312 [in ITree.Basics.HeterogeneousRelations]
x:32 [in ITree.Interp.HandlerFacts]
x:32 [in ITree.Interp.Traces]
X:320 [in ITree.Basics.HeterogeneousRelations]
X:33 [in ITree.Props.HasPost]
X:34 [in ITree.Props.Finite]
x:34 [in ITree.Eq.Paco2]
x:35 [in ITree.Events.State]
X:36 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:36 [in ITree.Eq.Paco2]
x:368 [in ITree.Extra.IForest]
x:369 [in ITree.Extra.IForest]
X:37 [in ITree.Props.Leaf]
x:37 [in ITree.Interp.HandlerFacts]
X:37 [in ITree.Eq.Shallow]
x:37 [in ITree.Eq.Paco2]
x:370 [in ITree.Extra.IForest]
x:371 [in ITree.Extra.IForest]
x:372 [in ITree.Extra.IForest]
x:373 [in ITree.Extra.IForest]
X:38 [in ITree.Props.HasPost]
x:38 [in ITree.Props.Finite]
X:39 [in ITree.Eq.SimUpToTaus]
x:39 [in ITree.Basics.CategoryFunctor]
x:39 [in ITree.Core.Subevent]
x:39 [in ITree.Eq.Paco2]
x:39 [in ITree.Simple]
X:396 [in ITree.Extra.IForest]
x:399 [in ITree.Extra.IForest]
X:4 [in ITree.Extra.IForest]
x:40 [in ITree.Interp.InterpFacts]
x:40 [in ITree.Interp.RecursionFacts]
x:405 [in ITree.Extra.IForest]
x:410 [in ITree.Extra.IForest]
x:42 [in ITree.Props.Leaf]
x:42 [in ITree.Eq.Paco2]
x:426 [in ITree.Eq.Eqit]
X:43 [in ITree.Props.HasPost]
x:43 [in ITree.Eq.SimUpToTaus]
X:43 [in ITree.Events.MapDefaultFacts]
x:44 [in ITree.Events.State]
x:44 [in ITree.Simple]
x:45 [in ITree.Interp.RecursionFacts]
x:45 [in ITree.Eq.Paco2]
X:46 [in ITree.Props.HasPost]
x:46 [in ITree.Events.FailFacts]
X:46 [in ITree.Props.Finite]
x:46 [in ITree.Basics.MonadState]
x:46 [in ITree.Extra.Dijkstra.StateIOTrace]
x:470 [in ITree.Extra.IForest]
x:477 [in ITree.Eq.Eqit]
x:478 [in ITree.Extra.IForest]
X:48 [in ITree.Events.ExceptionFacts]
X:48 [in ITree.Eq.SimUpToTaus]
x:48 [in ITree.Extra.Dijkstra.StateIOTrace]
x:481 [in ITree.Eq.Eqit]
x:49 [in ITree.Core.ITreeDefinition]
x:491 [in ITree.Extra.IForest]
x:5 [in ITree.Props.HasPost]
x:5 [in ITree.Axioms]
X:5 [in ITree.Interp.Traces]
x:50 [in ITree.Props.Finite]
x:50 [in ITree.Events.State]
x:501 [in ITree.Eq.Eqit]
x:504 [in ITree.Extra.IForest]
x:505 [in ITree.Eq.Eqit]
x:507 [in ITree.Extra.IForest]
x:51 [in ITree.Props.HasPost]
x:51 [in ITree.Basics.MonadState]
x:51 [in ITree.Eq.Paco2]
x:516 [in ITree.Extra.IForest]
X:52 [in ITree.Events.FailFacts]
x:52 [in ITree.Eq.SimUpToTaus]
X:52 [in ITree.Events.MapDefaultFacts]
x:523 [in ITree.Eq.Eqit]
x:527 [in ITree.Eq.Eqit]
X:53 [in ITree.Props.HasPost]
x:53 [in ITree.Core.ITreeDefinition]
x:54 [in ITree.Events.ExceptionFacts]
x:54 [in ITree.Events.StateFacts]
X:54 [in ITree.Interp.TranslateFacts]
x:54 [in ITree.Events.MapDefaultFacts]
x:545 [in ITree.Eq.Eqit]
x:549 [in ITree.Eq.Eqit]
X:55 [in ITree.Props.Finite]
x:55 [in ITree.Basics.HeterogeneousRelations]
x:55 [in ITree.Events.MapDefaultFacts]
x:56 [in ITree.Events.MapDefaultFacts]
x:565 [in ITree.Extra.IForest]
x:566 [in ITree.Extra.IForest]
x:567 [in ITree.Extra.IForest]
X:57 [in ITree.Events.FailFacts]
x:57 [in ITree.Extra.Dijkstra.StateIOTrace]
x:586 [in ITree.Eq.Eqit]
x:59 [in ITree.Props.HasPost]
x:59 [in ITree.Props.Finite]
x:59 [in ITree.Extra.Dijkstra.StateIOTrace]
x:596 [in ITree.Extra.IForest]
x:6 [in ITree.Props.HasPost]
x:6 [in ITree.Interp.Recursion]
X:6 [in ITree.Interp.Traces]
X:6 [in ITree.Eq.Paco2]
x:60 [in ITree.Eq.UpToTaus]
x:60 [in ITree.Props.HasPost]
X:60 [in ITree.Extra.ITrace.ITracePrefix]
X:61 [in ITree.Events.FailFacts]
x:61 [in ITree.Extra.Secure.SecureEqWcompat]
x:61 [in ITree.Simple]
x:615 [in ITree.Eq.Eqit]
x:62 [in ITree.Props.HasPost]
x:62 [in ITree.Extra.Dijkstra.StateIOTrace]
x:620 [in ITree.Extra.IForest]
x:621 [in ITree.Extra.IForest]
x:621 [in ITree.Eq.Eqit]
x:624 [in ITree.Extra.IForest]
x:625 [in ITree.Extra.IForest]
x:626 [in ITree.Eq.Eqit]
x:627 [in ITree.Extra.IForest]
x:628 [in ITree.Extra.IForest]
x:629 [in ITree.Extra.IForest]
x:63 [in ITree.Eq.Shallow]
x:630 [in ITree.Extra.IForest]
x:633 [in ITree.Extra.IForest]
x:634 [in ITree.Extra.IForest]
x:638 [in ITree.Extra.IForest]
x:639 [in ITree.Extra.IForest]
x:64 [in ITree.Extra.Secure.SecureEqWcompat]
X:64 [in ITree.Interp.TranslateFacts]
x:64 [in ITree.Events.State]
x:64 [in ITree.Core.ITreeDefinition]
x:65 [in ITree.Basics.MonadState]
X:66 [in ITree.Events.FailFacts]
x:66 [in ITree.Extra.Dijkstra.StateIOTrace]
x:67 [in ITree.Basics.HeterogeneousRelations]
x:67 [in ITree.Extra.Dijkstra.DelaySpecMonad]
X:68 [in ITree.Interp.Traces]
x:68 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:69 [in ITree.Core.ITreeDefinition]
x:7 [in ITree.Events.FailFacts]
x:7 [in ITree.Core.KTreeFacts]
X:7 [in ITree.Events.Exception]
X:70 [in ITree.Props.Finite]
x:71 [in ITree.Core.ITreeDefinition]
x:72 [in ITree.Props.HasPost]
x:72 [in ITree.Basics.MonadState]
x:72 [in ITree.Simple]
x:73 [in ITree.Basics.HeterogeneousRelations]
x:73 [in ITree.Core.ITreeDefinition]
x:74 [in ITree.Props.HasPost]
x:74 [in ITree.Props.Finite]
x:74 [in ITree.Basics.MonadState]
x:75 [in ITree.Core.ITreeDefinition]
x:766 [in ITree.Eq.Eqit]
x:771 [in ITree.Eq.Eqit]
X:78 [in ITree.Props.HasPost]
x:788 [in ITree.Eq.Eqit]
x:796 [in ITree.Eq.Eqit]
X:798 [in ITree.Eq.Eqit]
X:8 [in ITree.Props.HasPost]
x:8 [in ITree.Axioms]
x:8 [in ITree.Basics.HeterogeneousRelations]
x:8 [in ITree.Interp.Interp]
x:8 [in ITree.Interp.RecursionFacts]
X:8 [in ITree.Core.ITreeDefinition]
x:8 [in ITree.Eq.Paco2]
x:80 [in ITree.Extra.IForest]
x:80 [in ITree.Extra.Secure.SecureEqWcompat]
x:80 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:804 [in ITree.Eq.Eqit]
x:81 [in ITree.Simple]
X:816 [in ITree.Eq.Eqit]
x:82 [in ITree.Eq.UpToTaus]
x:83 [in ITree.Extra.Secure.SecureEqWcompat]
X:84 [in ITree.Events.FailFacts]
x:84 [in ITree.Eq.Shallow]
X:847 [in ITree.Eq.Eqit]
x:856 [in ITree.Eq.Eqit]
X:861 [in ITree.Eq.Eqit]
x:867 [in ITree.Eq.Eqit]
X:872 [in ITree.Eq.Eqit]
x:878 [in ITree.Eq.Eqit]
x:88 [in ITree.Events.FailFacts]
X:88 [in ITree.Extra.ITrace.ITracePrefix]
X:88 [in ITree.Extra.Secure.SecureEqEuttHalt]
X:89 [in ITree.Events.FailFacts]
x:89 [in ITree.Eq.Shallow]
X:9 [in ITree.Props.Finite]
X:9 [in ITree.Props.Leaf]
X:90 [in ITree.Interp.Traces]
X:922 [in ITree.Eq.Eqit]
X:929 [in ITree.Eq.Eqit]
x:93 [in ITree.Events.FailFacts]
X:95 [in ITree.Extra.ITrace.ITraceBind]
x:95 [in ITree.Extra.Secure.SecureEqEuttHalt]
x:96 [in ITree.Eq.Rutt]
x:97 [in ITree.Props.HasPost]
x:97 [in ITree.Extra.Secure.SecureEqWcompat]
X:98 [in ITree.Interp.Traces]
x:99 [in ITree.Props.HasPost]
X:99 [in ITree.Events.FailFacts]

Y

y':102 [in ITree.Eq.Rutt]
y':105 [in ITree.Extra.Secure.SecureEqWcompat]
y':142 [in ITree.Eq.Rutt]
y':165 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
y':165 [in ITree.Extra.Secure.SecureEqHalt]
y':165 [in ITree.Eq.Rutt]
y':216 [in ITree.Eq.Eqit]
y':218 [in ITree.Extra.Secure.SecureEqProgInsens]
y':483 [in ITree.Eq.Eqit]
y':507 [in ITree.Eq.Eqit]
y':529 [in ITree.Eq.Eqit]
y':551 [in ITree.Eq.Eqit]
y':66 [in ITree.Extra.Secure.SecureEqWcompat]
y':85 [in ITree.Extra.Secure.SecureEqWcompat]
y1:232 [in ITree.Basics.HeterogeneousRelations]
y2:233 [in ITree.Basics.HeterogeneousRelations]
y:100 [in ITree.Props.HasPost]
Y:100 [in ITree.Events.FailFacts]
y:101 [in ITree.Eq.Rutt]
y:102 [in ITree.Extra.Secure.SecureEqWcompat]
y:104 [in ITree.Extra.Secure.SecureEqWcompat]
Y:109 [in ITree.Events.FailFacts]
y:11 [in ITree.Extra.IForest]
y:112 [in ITree.Props.HasPost]
y:114 [in ITree.Props.HasPost]
y:128 [in ITree.Props.HasPost]
y:13 [in ITree.Props.HasPost]
y:134 [in ITree.Props.HasPost]
y:138 [in ITree.Eq.Rutt]
y:141 [in ITree.Eq.Rutt]
y:16 [in ITree.Basics.HeterogeneousRelations]
y:161 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
y:161 [in ITree.Extra.Secure.SecureEqHalt]
y:161 [in ITree.Eq.Rutt]
y:164 [in ITree.Extra.Secure.SecureEqHaltProgInsens]
y:164 [in ITree.Extra.Secure.SecureEqHalt]
y:164 [in ITree.Eq.Rutt]
y:176 [in ITree.Extra.IForest]
y:2 [in ITree.Basics.MonadProp]
y:212 [in ITree.Eq.Eqit]
y:215 [in ITree.Extra.Secure.SecureEqProgInsens]
y:215 [in ITree.Eq.Eqit]
y:217 [in ITree.Extra.Secure.SecureEqProgInsens]
y:217 [in ITree.Basics.HeterogeneousRelations]
y:22 [in ITree.Basics.Monad]
y:224 [in ITree.Basics.HeterogeneousRelations]
Y:23 [in ITree.Props.Leaf]
y:24 [in ITree.Basics.CategoryKleisli]
y:25 [in ITree.Basics.HeterogeneousRelations]
y:30 [in ITree.Basics.Monad]
y:30 [in ITree.Basics.HeterogeneousRelations]
y:313 [in ITree.Basics.HeterogeneousRelations]
y:35 [in ITree.Eq.Paco2]
Y:38 [in ITree.Props.Leaf]
Y:397 [in ITree.Extra.IForest]
y:427 [in ITree.Eq.Eqit]
Y:47 [in ITree.Props.HasPost]
y:47 [in ITree.Extra.Dijkstra.StateIOTrace]
y:479 [in ITree.Eq.Eqit]
y:482 [in ITree.Eq.Eqit]
y:503 [in ITree.Eq.Eqit]
y:505 [in ITree.Extra.IForest]
y:506 [in ITree.Extra.IForest]
y:506 [in ITree.Eq.Eqit]
y:525 [in ITree.Eq.Eqit]
y:528 [in ITree.Eq.Eqit]
Y:54 [in ITree.Props.HasPost]
y:547 [in ITree.Eq.Eqit]
Y:55 [in ITree.Interp.TranslateFacts]
y:550 [in ITree.Eq.Eqit]
y:56 [in ITree.Basics.HeterogeneousRelations]
y:597 [in ITree.Extra.IForest]
y:6 [in ITree.Axioms]
y:61 [in ITree.Props.HasPost]
y:63 [in ITree.Props.HasPost]
y:63 [in ITree.Extra.Secure.SecureEqWcompat]
y:65 [in ITree.Extra.Secure.SecureEqWcompat]
y:67 [in ITree.Extra.Dijkstra.StateIOTrace]
y:68 [in ITree.Basics.HeterogeneousRelations]
y:73 [in ITree.Props.HasPost]
y:74 [in ITree.Basics.HeterogeneousRelations]
y:75 [in ITree.Props.HasPost]
Y:799 [in ITree.Eq.Eqit]
y:8 [in ITree.Events.FailFacts]
y:81 [in ITree.Extra.IForest]
y:82 [in ITree.Extra.Secure.SecureEqWcompat]
y:84 [in ITree.Eq.UpToTaus]
y:84 [in ITree.Extra.Secure.SecureEqWcompat]
y:9 [in ITree.Basics.HeterogeneousRelations]
y:98 [in ITree.Props.HasPost]
y:98 [in ITree.Eq.Rutt]

Z

z:75 [in ITree.Basics.HeterogeneousRelations]
Z:800 [in ITree.Eq.Eqit]

---

Module Index

B

BIND_BIND_COUNTEREXAMPLE [in ITree.Extra.IForest]

C

Carrier [in ITree.Basics.CategoryOps]
CatNotations [in ITree.Basics.CategoryOps]
Counterexamples [in ITree.Props.Finite]

H

Handler [in ITree.Interp.Handler]
HasPostNotations [in ITree.Props.HasPost]

I

ITree [in ITree.Core.ITreeDefinition]
ITreeNotations [in ITree.Core.ITreeDefinition]

L

LeafNotations [in ITree.Props.Leaf]

M

Monads [in ITree.Basics.Basics]

R

RelNotations [in ITree.Basics.HeterogeneousRelations]

S

Simple [in ITree.Simple]
SimpleTheory [in ITree.Simple]
SumNotations [in ITree.Core.Subevent]

---

Variable Index

C

CartesianConstruct.Fst_PROD [in ITree.Basics.CategoryOps]
CartesianConstruct.Id_C [in ITree.Basics.CategoryOps]
CartesianConstruct.PROD [in ITree.Basics.CategoryOps]
CartesianConstruct.Prod_PROD [in ITree.Basics.CategoryOps]
CartesianConstruct.Snd_PROD [in ITree.Basics.CategoryOps]
CartesianConstruct.T [in ITree.Basics.CategoryOps]
CartesianConstruct.Terminal_T [in ITree.Basics.CategoryOps]
CocartesianConstruct.Coprod_SUM [in ITree.Basics.CategoryOps]
CocartesianConstruct.I [in ITree.Basics.CategoryOps]
CocartesianConstruct.Id_C [in ITree.Basics.CategoryOps]
CocartesianConstruct.Initial_I [in ITree.Basics.CategoryOps]
CocartesianConstruct.Inl_SUM [in ITree.Basics.CategoryOps]
CocartesianConstruct.Inr_SUM [in ITree.Basics.CategoryOps]
CocartesianConstruct.SUM [in ITree.Basics.CategoryOps]

G

going_relations.eq_ [in ITree.Eq.Shallow]

H

HandlerCategory.DinatSimulation.hf [in ITree.Interp.HandlerFacts]
HandlerCategory.DinatSimulation.hg [in ITree.Interp.HandlerFacts]

I

Iteration.bif [in ITree.Basics.CategoryOps]

M

MapFacts.K [in ITree.Events.MapDefaultFacts]
MapFacts.Relations.RR [in ITree.Events.MapDefaultFacts]
MapFacts.V [in ITree.Events.MapDefaultFacts]
Map.K [in ITree.Events.Map]
Map.K [in ITree.Events.MapDefault]
Map.V [in ITree.Events.Map]
Map.V [in ITree.Events.MapDefault]

O

observing_relations.eq_ [in ITree.Eq.Shallow]

P

PrintMults.X [in ITree.Extra.Dijkstra.StateIOTrace]
PrintMults.Y [in ITree.Extra.Dijkstra.StateIOTrace]

R

Reader.Env [in ITree.Events.Reader]

S

State.M [in ITree.Basics.MonadState]
State.S [in ITree.Basics.MonadState]
State.S [in ITree.Events.State]

---

Library Index

A

Axioms

B

Basics

C

Category
CategoryFacts
CategoryFunctor
CategoryKleisli
CategoryKleisliFacts
CategoryOps
CategoryRelations
CategorySub
CategoryTheory
Cofinite
Concurrency

D

DelaySpecMonad
Dependent
DijkstraMonad

E

Eq
EqAxiom
Eqit
EuttExtras
EuttNoRet
Events
Exception
ExceptionFacts

F

FailFacts
Finite
Function
Function
FunctionFacts
FunctionFacts

H

Handler
HandlerFacts
HasPost
HeterogeneousRelations

I

IForest
Infinite
Interp
InterpFacts
IterRel
ITraceBind
ITraceDefinition
ITraceFacts
ITracePreds
ITracePrefix
ITree
ITreeDefinition
ITreeDijkstra
ITreeFacts
ITreeMonad

K

KTree
KTreeFacts

L

Labels
Leaf

M

Map
MapDefault
MapDefaultFacts
Monad
MonadProp
MonadState

N

Nondeterminism

P

Paco2
PureITreeBasics
PureITreeDijkstra

R

Reader
Recursion
RecursionFacts
Relation
Rutt

S

SecureEqBind
SecureEqEuttHalt
SecureEqEuttTrans
SecureEqHalt
SecureEqHaltProgInsens
SecureEqProgInsens
SecureEqProgInsensFacts
SecureEqWcompat
SecureStateHandler
SecureStateHandlerPi
Shallow
Simple
SimUpToTaus
State
StateDelaySpec
StateFacts
StateIOTrace
StateSpecT
StrongBisimProper
Subevent
Sum

T

Tacs
Traces
TracesIT
TranslateFacts

U

UpToTaus

W

Writer

---

Lemma Index

A

agree_itree_Returns [in ITree.Extra.IForest]
all_finite_bind_inv_left [in ITree.Props.Finite]
all_finite_bind_inv [in ITree.Props.Finite]
all_finite_bind_weak [in ITree.Props.Finite]
all_finite_bind [in ITree.Props.Finite]
all_finite_eutt_r [in ITree.Props.Finite]
all_finite_eutt_l [in ITree.Props.Finite]
all_finite_Vis_inv [in ITree.Props.Finite]
all_finite_Tau_inv [in ITree.Props.Finite]
all_finite_Vis [in ITree.Props.Finite]
all_finite_Tau [in ITree.Props.Finite]
all_finite_Ret [in ITree.Props.Finite]
all_infinite_not_converge [in ITree.Props.Infinite]
all_infiniteF_mono' [in ITree.Props.Infinite]
all_infiniteF_mono [in ITree.Props.Infinite]
all_infinite_bind [in ITree.Props.EuttNoRet]
all_infinite_euttNoRet [in ITree.Props.EuttNoRet]
all_infinite_bind_append [in ITree.Extra.ITrace.ITraceFacts]
any_finite_bind_inv_left [in ITree.Props.Finite]
any_finite_bind_inv_weak [in ITree.Props.Finite]
any_finite_bind_inv [in ITree.Props.Finite]
any_finite_bind [in ITree.Props.Finite]
any_finite_eutt_r [in ITree.Props.Finite]
any_finite_eutt_l [in ITree.Props.Finite]
any_finite_Vis_inv [in ITree.Props.Finite]
any_finite_Tau_inv [in ITree.Props.Finite]
any_finite_Vis [in ITree.Props.Finite]
any_finite_Tau [in ITree.Props.Finite]
any_finite_Ret [in ITree.Props.Finite]
any_infiniteF__mono [in ITree.Props.Infinite]
any_infiniteF_mono [in ITree.Props.Infinite]
append_div [in ITree.Extra.ITrace.ITraceFacts]
append_assoc [in ITree.Extra.ITrace.ITraceFacts]
append_nil [in ITree.Extra.ITrace.ITraceFacts]
append_vis [in ITree.Extra.ITrace.ITraceFacts]
apply_monot [in ITree.Extra.Dijkstra.TracesIT]
app_inf [in ITree.Extra.Dijkstra.ITreeDijkstra]
assoc_r_snd [in ITree.Basics.CategoryFacts]
assoc_l_fst [in ITree.Basics.CategoryFacts]
assoc_l_snd [in ITree.Basics.CategoryFacts]
assoc_r_fst [in ITree.Basics.CategoryFacts]
assoc_l_mono [in ITree.Basics.CategoryTheory]
assoc_r_mono [in ITree.Basics.CategoryTheory]

B

bimap_pure_id [in ITree.Basics.CategoryKleisliFacts]
bimap_id_pure [in ITree.Basics.CategoryKleisliFacts]
bimap_snd [in ITree.Basics.CategoryFacts]
bimap_fst [in ITree.Basics.CategoryFacts]
bimap_pair_unfold [in ITree.Basics.CategoryFacts]
bimap_case [in ITree.Basics.CategoryFacts]
bimap_case_unfold [in ITree.Basics.CategoryFacts]
bimap_slide' [in ITree.Basics.CategoryFacts]
bimap_slide [in ITree.Basics.CategoryFacts]
bimap_sub_unfold [in ITree.Basics.CategorySub]
bindpi_bindpi [in ITree.Extra.Dijkstra.PureITreeDijkstra]
bindpi_retpi [in ITree.Extra.Dijkstra.PureITreeDijkstra]
bindpi_monot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
bind_split_diverge [in ITree.Extra.Dijkstra.TracesIT]
bind_trigger_refine [in ITree.Extra.ITrace.ITraceBind]
bind_peel_ret_tau_aux [in ITree.Extra.ITrace.ITraceBind]
BIND_BIND_COUNTEREXAMPLE.bind_bind_counterexample [in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.not_bind_left_assoc [in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.bind_right_assoc [in ITree.Extra.IForest]
bind_bind_iforest [in ITree.Extra.IForest]
bind_ret [in ITree.Extra.IForest]
bind_iforest_bind_iforest' [in ITree.Extra.IForest]
bind_iter [in ITree.Core.KTreeFacts]
bind_pred_resp_eutt [in ITree.Extra.Dijkstra.PureITreeDijkstra]
bind_ret_failure [in ITree.Extra.Dijkstra.ITreeDijkstra]
bind_vis_ [in ITree.Eq.Shallow]
bind_tau_ [in ITree.Eq.Shallow]
bind_ret_ [in ITree.Eq.Shallow]
bind_map [in ITree.Eq.Eqit]
bind_bind [in ITree.Eq.Eqit]
bind_ret_r' [in ITree.Eq.Eqit]
bind_ret_r [in ITree.Eq.Eqit]
bind_trigger [in ITree.Eq.Eqit]
bind_vis [in ITree.Eq.Eqit]
bind_tau [in ITree.Eq.Eqit]
bind_ret_l [in ITree.Eq.Eqit]
bisim_monot [in ITree.Extra.Dijkstra.ITreeDijkstra]
burn_eutt_r [in ITree.Extra.Dijkstra.PureITreeBasics]

C

case_iforest_handler_correct [in ITree.Extra.IForest]
case_r' [in ITree.Basics.CategoryKleisliFacts]
case_r [in ITree.Basics.CategoryKleisliFacts]
case_l' [in ITree.Basics.CategoryKleisliFacts]
case_l [in ITree.Basics.CategoryKleisliFacts]
case_pure [in ITree.Basics.CategoryKleisliFacts]
case_eta' [in ITree.Basics.CategoryFacts]
case_eta [in ITree.Basics.CategoryFacts]
case_inr' [in ITree.Basics.CategoryFacts]
case_inl' [in ITree.Basics.CategoryFacts]
cat_iter [in ITree.Core.KTreeFacts]
cat_pure [in ITree.Basics.CategoryKleisliFacts]
cat_eq2_r [in ITree.Basics.CategoryFacts]
cat_eq2_l [in ITree.Basics.CategoryFacts]
cat_from_loop [in ITree.Basics.CategoryFacts]
cat_case [in ITree.Basics.CategoryFacts]
classicT_inhabited [in ITree.Axioms]
classic_converge [in ITree.Props.Infinite]
classic_wf [in ITree.Extra.Dijkstra.IterRel]
classic_converge_itrace [in ITree.Extra.ITrace.ITraceFacts]
classic_empty [in ITree.Extra.ITrace.ITraceFacts]
classic_empty [in ITree.Extra.Secure.Labels]
combine_prepost [in ITree.Extra.Dijkstra.StateDelaySpec]
combine_prepost_aux [in ITree.Extra.Dijkstra.StateDelaySpec]
compose_pure_r [in ITree.Basics.CategoryKleisliFacts]
compose_pure_l [in ITree.Basics.CategoryKleisliFacts]
compose_pure [in ITree.Basics.CategoryKleisliFacts]
compose_assoc [in ITree.Basics.HeterogeneousRelations]
cont_a_pred_resp_eutt [in ITree.Extra.Dijkstra.PureITreeDijkstra]
converge_trace_prefix [in ITree.Extra.ITrace.ITracePrefix]
converge_itrace_ev_list [in ITree.Extra.ITrace.ITraceFacts]
coprod_split [in ITree.Basics.CategoryFacts]
Counterexamples.DFk [in ITree.Props.Finite]
Counterexamples.DFt [in ITree.Props.Finite]
Counterexamples.fail_not_any_finite [in ITree.Props.Finite]
Counterexamples.fail_all_finite [in ITree.Props.Finite]
Counterexamples.NotDFtk [in ITree.Props.Finite]
Counterexamples.spin_not_any_finite [in ITree.Props.Finite]
curry_sig [in ITree.Eq.Paco2]

D

decide_ex_satisfies_spec [in ITree.Extra.Dijkstra.TracesIT]
decompose_trace_refine_bind [in ITree.Extra.ITrace.ITraceBind]
delay_eventless [in ITree.Extra.Dijkstra.ITreeDijkstra]
diagonal_prop_PER [in ITree.Basics.HeterogeneousRelations]
diagonal_prop_TransitiveH [in ITree.Basics.HeterogeneousRelations]
diagonal_prop_SymmetricH [in ITree.Basics.HeterogeneousRelations]
distinguish_bind [in ITree.Extra.IForest]
diverges_with_spin [in ITree.Extra.Secure.SecureStateHandler]
diverges_secure_equiv_halt_l [in ITree.Extra.Secure.SecureStateHandler]
diverges_secure_equiv_halt_r [in ITree.Extra.Secure.SecureStateHandler]
diverges_with_halt [in ITree.Extra.Secure.SecureStateHandler]
diverges_with_bind [in ITree.Extra.Secure.SecureStateHandler]
diverges_with_bind [in ITree.Extra.Secure.SecureStateHandlerPi]
diverges_with_spin [in ITree.Extra.Secure.SecureStateHandlerPi]
diverge_with_respectful_handler [in ITree.Extra.Secure.SecureStateHandler]
div_spec_amonot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
div_spec_monot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
div_spin_eutt [in ITree.Extra.Dijkstra.PureITreeBasics]

E

encode_dyn_correct [in ITree.Extra.Dijkstra.StateDelaySpec]
encode_pair_correct [in ITree.Extra.Dijkstra.StateDelaySpec]
encode_correct [in ITree.Extra.Dijkstra.StateDelaySpec]
enocde_list_dyn_correct [in ITree.Extra.Dijkstra.StateDelaySpec]
enocde_list_correct [in ITree.Extra.Dijkstra.StateDelaySpec]
eqitC_dist [in ITree.Eq.Eqit]
eqitC_wcompat [in ITree.Eq.Eqit]
eqitC_mon [in ITree.Eq.Eqit]
eqitE_trans [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_inv_Tau [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_imp_eventlessr [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_imp_eventlessl [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_imp_eutt [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_monot [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitF_observe_peel_cont_vis [in ITree.Extra.ITrace.ITraceBind]
eqitF_mon [in ITree.Extra.ITrace.ITraceBind]
eqitF_r_refl [in ITree.Extra.ITrace.ITraceBind]
eqitF_flip [in ITree.Eq.Eqit]
eqitF_VisF_gen [in ITree.Eq.Eqit]
eqitF_inv_VisF [in ITree.Eq.Eqit]
eqitF_inv_VisF_weak [in ITree.Eq.Eqit]
eqitF_inv_VisF_r [in ITree.Eq.Eqit]
eqitF_mono [in ITree.Eq.Eqit]
eqitree_inv_bind_tau [in ITree.Eq.Eqit]
eqitree_inv_bind_vis [in ITree.Eq.Eqit]
eqitree_inv_bind_ret [in ITree.Eq.Eqit]
eqitree_Tau [in ITree.Eq.Eqit]
eqitree_inv_Ret [in ITree.Eq.Eqit]
eqitree_inv_Tau_r [in ITree.Eq.Eqit]
eqitree_inv_Vis_r [in ITree.Eq.Eqit]
eqitree_inv_Ret_r [in ITree.Eq.Eqit]
eqit_secure_imp_pi_eqit_scure [in ITree.Extra.Secure.SecureEqProgInsens]
eqit_secure_sym [in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secureC_mon [in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure_sym [in ITree.Extra.Secure.SecureEqHalt]
eqit_secureC_mon [in ITree.Extra.Secure.SecureEqHalt]
eqit_ret_gen [in ITree.Eq.UpToTaus]
eqit_Returns_bind'' [in ITree.Extra.IForest]
eqit_Returns_bind' [in ITree.Extra.IForest]
eqit_Returns_clo_bind [in ITree.Extra.IForest]
eqit_bind_Returns_inv [in ITree.Extra.IForest]
eqit_clo_bind_gen [in ITree.Props.Leaf]
eqit_Leaf_clo_bind [in ITree.Props.Leaf]
eqit_bind_shalt_aux2 [in ITree.Extra.Secure.SecureEqBind]
eqit_bind_shalt_aux1 [in ITree.Extra.Secure.SecureEqBind]
eqit_secureC_wcompat_id' [in ITree.Extra.Secure.SecureEqWcompat]
eqit_secure_shalt_refl [in ITree.Extra.Secure.SecureEqWcompat]
eqit_secureC_wcompat_id [in ITree.Extra.Secure.SecureEqWcompat]
eqit_secure_silent_diverge [in ITree.Extra.Secure.SecureStateHandler]
eqit_secure_anything [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_eq_trans [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_itree_eqit_secure [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_trans [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_RR_imp [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_trans_aux2 [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_trans_aux1 [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_public_Vis [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_private_VisR [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_private_VisL [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_private_VisLR [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_VisLR [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_TauRVisL [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_TauLVisR [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_secure_TauLR [in ITree.Extra.Secure.SecureEqEuttHalt]
eqit_inv_bind_tau [in ITree.Eq.Eqit]
eqit_inv_bind_vis [in ITree.Eq.Eqit]
eqit_inv_bind_ret [in ITree.Eq.Eqit]
eqit_map [in ITree.Eq.Eqit]
eqit_bind' [in ITree.Eq.Eqit]
eqit_clo_bind [in ITree.Eq.Eqit]
eqit_Ret [in ITree.Eq.Eqit]
eqit_Vis [in ITree.Eq.Eqit]
eqit_Vis_gen [in ITree.Eq.Eqit]
eqit_Tau [in ITree.Eq.Eqit]
eqit_trans [in ITree.Eq.Eqit]
eqit_Tau_r [in ITree.Eq.Eqit]
eqit_Tau_l [in ITree.Eq.Eqit]
eqit_inv [in ITree.Eq.Eqit]
eqit_inv_Tau [in ITree.Eq.Eqit]
eqit_inv_Tau_r [in ITree.Eq.Eqit]
eqit_inv_Tau_l [in ITree.Eq.Eqit]
eqit_inv_Vis [in ITree.Eq.Eqit]
eqit_inv_Vis_weak [in ITree.Eq.Eqit]
eqit_inv_Ret [in ITree.Eq.Eqit]
eqit_clo_trans [in ITree.Eq.Eqit]
eqit_idclo_compat [in ITree.Eq.Eqit]
eqit_mon [in ITree.Eq.Eqit]
eqit_flip [in ITree.Eq.Eqit]
eqit_idclo_mono [in ITree.Eq.Eqit]
eqit__mono [in ITree.Eq.Eqit]
equivE_sym [in ITree.Extra.Dijkstra.ITreeDijkstra]
eq_itree_iter' [in ITree.Core.KTreeFacts]
eq_trace_inv [in ITree.Interp.Traces]
eq_inv_VisF_weak [in ITree.Eq.Shallow]
eq_id_l [in ITree.Basics.HeterogeneousRelations]
eq_id_r [in ITree.Basics.HeterogeneousRelations]
eq_map_remove [in ITree.Events.MapDefaultFacts]
eq_map_add [in ITree.Events.MapDefaultFacts]
eq_itree_clo_bind [in ITree.Eq.Eqit]
Eq1_iforest'_Eq1_iforest [in ITree.Extra.IForest]
eq2_to_eq1 [in ITree.Basics.MonadState]
eses_aux4 [in ITree.Extra.Secure.SecureEqEuttTrans]
eses_aux3 [in ITree.Extra.Secure.SecureEqEuttTrans]
eses_aux2 [in ITree.Extra.Secure.SecureEqEuttHalt]
eses_aux1 [in ITree.Extra.Secure.SecureEqEuttHalt]
euttge_trans_clo_wcompat [in ITree.Eq.Rutt]
euttge_trans_clo_mon [in ITree.Eq.Rutt]
euttG_le_eutt [in ITree.Eq.UpToTaus]
euttG_base [in ITree.Eq.UpToTaus]
euttG_vis_gen [in ITree.Eq.UpToTaus]
euttG_vis [in ITree.Eq.UpToTaus]
euttG_tau [in ITree.Eq.UpToTaus]
euttG_drop [in ITree.Eq.UpToTaus]
euttG_transU [in ITree.Eq.UpToTaus]
euttG_transD [in ITree.Eq.UpToTaus]
euttG_bind [in ITree.Eq.UpToTaus]
euttG_ret [in ITree.Eq.UpToTaus]
euttG_accF [in ITree.Eq.UpToTaus]
euttG_cofix [in ITree.Eq.UpToTaus]
euttG_cofix_aux [in ITree.Eq.UpToTaus]
euttG_gen [in ITree.Eq.UpToTaus]
euttG_transU_aux [in ITree.Eq.UpToTaus]
euttG_flip [in ITree.Eq.UpToTaus]
euttNoRet_trans [in ITree.Props.EuttNoRet]
euttNoRet_sym [in ITree.Props.EuttNoRet]
euttNoRet_all_infinite [in ITree.Props.EuttNoRet]
euttNoRet_subrel [in ITree.Props.EuttNoRet]
euttNoRet_spin [in ITree.Props.EuttNoRet]
euttVC_gen [in ITree.Eq.UpToTaus]
euttVC_transU [in ITree.Eq.UpToTaus]
euttVC_transL [in ITree.Eq.UpToTaus]
euttVC_flip [in ITree.Eq.UpToTaus]
euttVC_id [in ITree.Eq.UpToTaus]
euttVC_compat [in ITree.Eq.UpToTaus]
euttVC_mon [in ITree.Eq.UpToTaus]
eutt_equiv [in ITree.Eq.UpToTaus]
eutt_disj_r [in ITree.Eq.UpToTaus]
eutt_disj_l [in ITree.Eq.UpToTaus]
eutt_conj [in ITree.Eq.UpToTaus]
eutt_Ret [in ITree.Eq.UpToTaus]
eutt_eq_bind [in ITree.Eq.UpToTaus]
eutt_le_euttG [in ITree.Eq.UpToTaus]
eutt_eq_itree [in ITree.Props.HasPost]
eutt_post_bind_eq [in ITree.Props.HasPost]
eutt_post_bind [in ITree.Props.HasPost]
eutt_EQ_REL_Reflexive [in ITree.Extra.IForest]
eutt_EQ_REL_Reflexive_ [in ITree.Extra.IForest]
eutt_ret_vis_abs [in ITree.Extra.IForest]
eutt_Returns [in ITree.Extra.IForest]
eutt_Returns_ [in ITree.Extra.IForest]
eutt_flip [in ITree.Eq.EuttExtras]
eutt_subrel [in ITree.Eq.EuttExtras]
eutt_secure_eqit_secure [in ITree.Extra.Secure.SecureEqEuttTrans]
eutt_interp_state_loop [in ITree.Events.StateFacts]
eutt_interp_state_iter [in ITree.Events.StateFacts]
eutt_interp_state_aloop [in ITree.Events.StateFacts]
eutt_iter'' [in ITree.Core.KTreeFacts]
eutt_iter' [in ITree.Core.KTreeFacts]
eutt_sutt [in ITree.Eq.SimUpToTaus]
eutt_eq_bind_gen [in ITree.Props.Leaf]
eutt_clo_bind_gen [in ITree.Props.Leaf]
eutt_eventless [in ITree.Extra.Dijkstra.ITreeDijkstra]
eutt_trace_eq [in ITree.Interp.Traces]
eutt_secure_eqit_secure [in ITree.Extra.Secure.SecureEqEuttHalt]
eutt_translate_gen [in ITree.Interp.TranslateFacts]
eutt_ret_euttge [in ITree.Extra.Dijkstra.PureITreeBasics]
eutt_reta_or_div [in ITree.Extra.Dijkstra.PureITreeBasics]
eutt_reta_or_div_aux [in ITree.Extra.Dijkstra.PureITreeBasics]
eutt_spin_Vis_abs [in ITree.Eq.Eqit]
eutt_Vis_spin_abs [in ITree.Eq.Eqit]
eutt_spin_Ret_abs [in ITree.Eq.Eqit]
eutt_Ret_spin_abs [in ITree.Eq.Eqit]
eutt_inv_bind_tau [in ITree.Eq.Eqit]
eutt_inv_bind_vis [in ITree.Eq.Eqit]
eutt_inv_bind_ret [in ITree.Eq.Eqit]
eutt_Tau [in ITree.Eq.Eqit]
eutt_clo_bind [in ITree.Eq.Eqit]
eutt_inv_Ret [in ITree.Eq.Eqit]
eventless_spin [in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_ret [in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_div [in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_monot [in ITree.Extra.Dijkstra.ITreeDijkstra]
event_ans_constr [in ITree.Extra.ITrace.ITraceFacts]

F

fal_proper_aux [in ITree.Extra.ITrace.ITracePreds]
finite_leaf_non_interactive [in ITree.Props.Finite]
finite_non_interactive [in ITree.Props.Finite]
finite_Leaf [in ITree.Props.Finite]
finite_stream_list [in ITree.Extra.ITrace.ITraceFacts]
finite_list_to_stream [in ITree.Extra.ITrace.ITraceFacts]
finite_nil [in ITree.Extra.ITrace.ITraceFacts]
fmap_cat0 [in ITree.Basics.CategoryFunctor]
fmap_id0 [in ITree.Basics.CategoryFunctor]
fold_Kleisli [in ITree.Basics.CategoryKleisliFacts]
fold_apply_IFun [in ITree.Indexed.FunctionFacts]
fold_eqitF [in ITree.Eq.Eqit]
forall_stream_monot [in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_spin [in ITree.Extra.ITrace.ITracePreds]
fwd_eqn [in ITree.Basics.CategoryFacts]

G

gpaco2_accF [in ITree.Eq.Paco2]

H

handle_map_eq [in ITree.Events.MapDefaultFacts]
has_post_to_eq_itree [in ITree.Props.HasPost]
has_post_strong_to_eq_itree [in ITree.Props.HasPost]
has_post_translate [in ITree.Props.HasPost]
has_post_iter_strong [in ITree.Props.HasPost]
has_post_bind [in ITree.Props.HasPost]
has_post_bind_weak [in ITree.Props.HasPost]
has_post_True [in ITree.Props.HasPost]
has_post_weaken [in ITree.Props.HasPost]
has_post_disj_r [in ITree.Props.HasPost]
has_post_disj_l [in ITree.Props.HasPost]
has_post_conj [in ITree.Props.HasPost]
has_post_post_strong [in ITree.Props.HasPost]
hexploit_mp [in ITree.Core.ITreeDefinition]

I

ind_comb_bind [in ITree.Extra.ITrace.ITracePrefix]
inf_tree_pred_resp_eutt [in ITree.Extra.Dijkstra.PureITreeDijkstra]
inf_and_forall [in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_many_inf [in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_many_monot [in ITree.Extra.Dijkstra.ITreeDijkstra]
initial_unique [in ITree.Basics.CategoryFacts]
inj_pair2 [in ITree.Extra.IForest]
inl_unit_r [in ITree.Basics.CategoryFacts]
inl_assoc_l [in ITree.Basics.CategoryFacts]
inl_assoc_r [in ITree.Basics.CategoryFacts]
inl_bimap [in ITree.Basics.CategoryFacts]
inl_swap [in ITree.Basics.CategoryFacts]
inr_unit_l [in ITree.Basics.CategoryFacts]
inr_assoc_r [in ITree.Basics.CategoryFacts]
inr_assoc_l [in ITree.Basics.CategoryFacts]
inr_bimap [in ITree.Basics.CategoryFacts]
inr_swap [in ITree.Basics.CategoryFacts]
interleaved_mrec [in ITree.Interp.HandlerFacts]
internalize_pure_iso [in ITree.Basics.MonadState]
internalize_pure [in ITree.Basics.MonadState]
internalize_cat [in ITree.Basics.MonadState]
internalize_eq [in ITree.Basics.MonadState]
interp_failure_bind' [in ITree.Events.FailFacts]
interp_fail_bind [in ITree.Events.FailFacts]
interp_fail_trigger [in ITree.Events.FailFacts]
interp_fail_ret [in ITree.Events.FailFacts]
interp_fail_Ret [in ITree.Events.FailFacts]
interp_fail_vis [in ITree.Events.FailFacts]
interp_fail_tau [in ITree.Events.FailFacts]
interp_iforest_tau_inv [in ITree.Extra.IForest]
interp_iforest_vis_inv [in ITree.Extra.IForest]
interp_iforest_ret_inv [in ITree.Extra.IForest]
interp_iforest_tau [in ITree.Extra.IForest]
interp_iforest_spin_accepts_anything [in ITree.Extra.IForest]
interp_iforest_trigger [in ITree.Extra.IForest]
interp_iforest_correct_exec [in ITree.Extra.IForest]
interp_iforest_ret [in ITree.Extra.IForest]
interp_iforest__mono [in ITree.Extra.IForest]
interp_iforestF_mono [in ITree.Extra.IForest]
interp_state_iter' [in ITree.Events.StateFacts]
interp_state_iter [in ITree.Events.StateFacts]
interp_state_bind [in ITree.Events.StateFacts]
interp_state_trigger [in ITree.Events.StateFacts]
interp_state_trigger_eqit [in ITree.Events.StateFacts]
interp_state_tau [in ITree.Events.StateFacts]
interp_state_vis [in ITree.Events.StateFacts]
interp_state_ret [in ITree.Events.StateFacts]
interp_eqit_secure_state [in ITree.Extra.Secure.SecureStateHandler]
interp_loop [in ITree.Interp.InterpFacts]
interp_iter [in ITree.Interp.InterpFacts]
interp_iter' [in ITree.Interp.InterpFacts]
interp_forever [in ITree.Interp.InterpFacts]
interp_translate [in ITree.Interp.InterpFacts]
interp_interp [in ITree.Interp.InterpFacts]
interp_trigger_h [in ITree.Interp.InterpFacts]
interp_id_h [in ITree.Interp.InterpFacts]
interp_bind [in ITree.Interp.InterpFacts]
interp_trigger [in ITree.Interp.InterpFacts]
interp_vis [in ITree.Interp.InterpFacts]
interp_tau [in ITree.Interp.InterpFacts]
interp_ret [in ITree.Interp.InterpFacts]
interp_map_id [in ITree.Events.MapDefaultFacts]
interp_recursive_call [in ITree.Interp.RecursionFacts]
interp_mrecursive [in ITree.Interp.RecursionFacts]
interp_mrec_as_interp [in ITree.Interp.RecursionFacts]
interp_mrec_trigger [in ITree.Interp.RecursionFacts]
interp_mrec_bind [in ITree.Interp.RecursionFacts]
interp_pi_eqit_secure_state [in ITree.Extra.Secure.SecureStateHandlerPi]
intro_wf [in ITree.Extra.Dijkstra.IterRel]
intro_not_wf [in ITree.Extra.Dijkstra.IterRel]
inv_remove_events [in ITree.Extra.Dijkstra.ITreeDijkstra]
inv_append_eutt [in ITree.Extra.ITrace.ITraceFacts]
is_inf_monot [in ITree.Extra.Dijkstra.ITreeDijkstra]
is_traceF_tau [in ITree.Interp.Traces]
iterF_monotone' [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_monotone [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body_resp_eutt [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body'_resp_eutt [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body_equiv [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iter_eq_start_index [in ITree.Extra.IForest]
iter_succ_dinatural [in ITree.Extra.IForest]
iter_codiagonal_ktree [in ITree.Core.KTreeFacts]
iter_dinatural_ktree [in ITree.Core.KTreeFacts]
iter_monot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iter_dinatural_helper [in ITree.Basics.MonadState]
iter_wf_converge_state [in ITree.Extra.Dijkstra.StateSpecT]
iter_inl_spin_state [in ITree.Extra.Dijkstra.StateSpecT]
iter_bind_aux [in ITree.Extra.Secure.SecureEqBind]
iter_bind_shalt_aux2 [in ITree.Extra.Secure.SecureEqBind]
iter_bind_shalt_aux1 [in ITree.Extra.Secure.SecureEqBind]
iter_wf_converge [in ITree.Extra.Dijkstra.DelaySpecMonad]
iter_inl_spin [in ITree.Extra.Dijkstra.DelaySpecMonad]
itree_eta_ [in ITree.Eq.EqAxiom]
itree_refine_nonempty [in ITree.Extra.ITrace.ITraceFacts]
itree_eta' [in ITree.Eq.Eqit]
itree_eta [in ITree.Eq.Eqit]
itree_eta_ [in ITree.Eq.Eqit]

L

Leaf_non_interactive_singleton [in ITree.Props.Finite]
Leaf_finite [in ITree.Props.Finite]
Leaf_bind_inv [in ITree.Props.Leaf]
Leaf_bind [in ITree.Props.Leaf]
Leaf_eutt_r [in ITree.Props.Leaf]
Leaf_eutt_l [in ITree.Props.Leaf]
Leaf_Vis_inv [in ITree.Props.Leaf]
Leaf_Tau_inv [in ITree.Props.Leaf]
Leaf_Ret_inv [in ITree.Props.Leaf]
Leaf_Vis [in ITree.Props.Leaf]
Leaf_Tau [in ITree.Props.Leaf]
Leaf_Ret [in ITree.Props.Leaf]
local_rewrite2 [in ITree.Basics.CategoryFacts]
local_rewrite1 [in ITree.Basics.CategoryFacts]
lookup_neq [in ITree.Extra.Dijkstra.StateIOTrace]
lookup_nin [in ITree.Extra.Dijkstra.StateIOTrace]
lookup_eq [in ITree.Extra.Dijkstra.StateIOTrace]
lookup_remove_neq [in ITree.Events.MapDefaultFacts]
lookup_remove_eq [in ITree.Events.MapDefaultFacts]
lookup_add_neq [in ITree.Events.MapDefaultFacts]
lookup_add_eq [in ITree.Events.MapDefaultFacts]
loop_invar_state [in ITree.Extra.Dijkstra.StateSpecT]
loop_superposing_2 [in ITree.Basics.CategoryFacts]
loop_dinatural' [in ITree.Basics.CategoryFacts]
loop_yanking [in ITree.Basics.CategoryFacts]
loop_superposing [in ITree.Basics.CategoryFacts]
loop_vanishing_2 [in ITree.Basics.CategoryFacts]
loop_vanishing_1 [in ITree.Basics.CategoryFacts]
loop_dinatural [in ITree.Basics.CategoryFacts]
loop_natural_right [in ITree.Basics.CategoryFacts]
loop_natural_left [in ITree.Basics.CategoryFacts]
loop_invar [in ITree.Extra.Dijkstra.DelaySpecMonad]

M

map_inr_case_kleisli [in ITree.Basics.CategoryKleisliFacts]
map_inl_case_kleisli [in ITree.Basics.CategoryKleisliFacts]
map_tau [in ITree.Eq.Eqit]
map_ret [in ITree.Eq.Eqit]
map_bind [in ITree.Eq.Eqit]
map_map [in ITree.Eq.Eqit]
may_converge_Ret_inv [in ITree.Props.Infinite]
may_converge_two_list [in ITree.Extra.ITrace.ITraceFacts]
may_converge_append [in ITree.Extra.ITrace.ITraceFacts]
may_converge_trace [in ITree.Extra.ITrace.ITraceFacts]
monotone_suttF [in ITree.Eq.SimUpToTaus]
monotone_state_machine [in ITree.Extra.ITrace.ITracePreds]
monot_imp_dmonot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
mono_diverges_with [in ITree.Extra.Secure.SecureStateHandler]
mrec_as_interp [in ITree.Interp.RecursionFacts]

N

neg_wf_from_not_wf_from [in ITree.Extra.Dijkstra.IterRel]
neg_wf_from_not_wf_from_r [in ITree.Extra.Dijkstra.IterRel]
neg_wf_from_not_wf_from_l [in ITree.Extra.Dijkstra.IterRel]
noret_cast_cast [in ITree.Props.EuttNoRet]
noret_cast_nop [in ITree.Props.EuttNoRet]
noret_bind_nop [in ITree.Props.EuttNoRet]
not_peel_vis_ret [in ITree.Extra.ITrace.ITraceBind]
not_spin_eutt_ret [in ITree.Extra.ITrace.ITraceBind]
not_Returns [in ITree.Extra.IForest]
not_converge_to_all_infinite [in ITree.Props.Infinite]
not_wf_F_mono' [in ITree.Extra.Dijkstra.IterRel]
not_wf_F_mono [in ITree.Extra.Dijkstra.IterRel]
not_any_infinite_all_finite [in ITree.Props.Cofinite]
not_all_infinite_any_finite [in ITree.Props.Cofinite]
not_ret_eutt_spin [in ITree.Extra.Dijkstra.PureITreeBasics]
no_infinite_ret [in ITree.Props.Infinite]
no_inf_dec_seq_aux [in ITree.Extra.Dijkstra.IterRel]

O

observe_bind [in ITree.Eq.Shallow]
observing_going [in ITree.Eq.Shallow]
obsip_eutt [in ITree.Extra.Dijkstra.PureITreeDijkstra]
obsip_pres_bind [in ITree.Extra.Dijkstra.PureITreeDijkstra]
obsip_pres_ret [in ITree.Extra.Dijkstra.PureITreeDijkstra]
obsip_monot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
option_rel_eq [in ITree.Basics.HeterogeneousRelations]

P

paco2_eqit_refl [in ITree.Eq.EuttExtras]
paco2_accF [in ITree.Eq.Paco2]
pair_bimap [in ITree.Basics.CategoryFacts]
pair_split [in ITree.Basics.CategoryFacts]
pair_eta' [in ITree.Basics.CategoryFacts]
pair_eta [in ITree.Basics.CategoryFacts]
pair_cat [in ITree.Basics.CategoryFacts]
pair_snd' [in ITree.Basics.CategoryFacts]
pair_fst' [in ITree.Basics.CategoryFacts]
peel_lemma [in ITree.Extra.ITrace.ITraceBind]
peel_bind [in ITree.Extra.ITrace.ITraceBind]
peel_cont_refine_t [in ITree.Extra.ITrace.ITraceBind]
peel_cont_vis_eutt [in ITree.Extra.ITrace.ITraceBind]
peel_vis_empty_contra [in ITree.Extra.ITrace.ITraceBind]
peel_cont_ret_inv [in ITree.Extra.ITrace.ITraceBind]
peel_ret_inv [in ITree.Extra.ITrace.ITraceBind]
peel_refine_t [in ITree.Extra.ITrace.ITraceBind]
peel_t_ret [in ITree.Extra.ITrace.ITraceBind]
PER_reflexivityH2 [in ITree.Basics.HeterogeneousRelations]
PER_reflexivityH1 [in ITree.Basics.HeterogeneousRelations]
pi_eqit_secure_iter_bind_aux [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_bind [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_ret [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secureC_wcompat_id [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_RR_imp [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_mixed_trans [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_mixed_trans_aux1 [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_private_halt [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_spin [in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_mon [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_sym [in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_mono [in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqitF_mono [in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_bind' [in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_priv_visr [in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_priv_visl [in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_priv_vislr [in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_pub_vis [in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_trans_ret [in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_iter_ret [in ITree.Extra.Secure.SecureEqProgInsensFacts]
pi_eqit_secure_silent_diverger [in ITree.Extra.Secure.SecureStateHandlerPi]
pi_eqit_secure_silent_divergel [in ITree.Extra.Secure.SecureStateHandlerPi]
prefix_vis [in ITree.Extra.ITrace.ITracePrefix]
print_mults_sats_spec [in ITree.Extra.Dijkstra.StateIOTrace]
prod_compose [in ITree.Basics.HeterogeneousRelations]
prod_inv [in ITree.Basics.HeterogeneousRelations]
prod_rel_eq [in ITree.Basics.HeterogeneousRelations]
prod_rel_monotone [in ITree.Basics.HeterogeneousRelations]
proper_peel_cont_eutt_r [in ITree.Extra.ITrace.ITraceBind]
proper_peel_cont_eutt_l [in ITree.Extra.ITrace.ITraceBind]
proper_peel_eutt_r [in ITree.Extra.ITrace.ITraceBind]
proper_peel_eutt_l [in ITree.Extra.ITrace.ITraceBind]
pure_inr [in ITree.Basics.CategoryKleisliFacts]
pure_inl [in ITree.Basics.CategoryKleisliFacts]
pure_swap [in ITree.Basics.CategoryKleisliFacts]
pure_cat [in ITree.Basics.CategoryKleisliFacts]
pure_id [in ITree.Basics.CategoryKleisliFacts]
pure_assoc_r [in ITree.Basics.CategoryKleisliFacts]
pure_assoc_l [in ITree.Basics.CategoryKleisliFacts]
pweqeq_mon [in ITree.Eq.Shallow]

R

rclo_flip [in ITree.Eq.UpToTaus]
rclo_transD [in ITree.Eq.UpToTaus]
rec_as_interp [in ITree.Interp.RecursionFacts]
refine_ret_vis_contra [in ITree.Extra.ITrace.ITraceBind]
refine_set_eq_to_eutt [in ITree.Extra.ITrace.ITraceFacts]
refine_set_eq_to_eutt_vis_aux [in ITree.Extra.ITrace.ITraceFacts]
ReflexiveH_Reflexive [in ITree.Basics.HeterogeneousRelations]
reflexive_suttF [in ITree.Eq.SimUpToTaus]
remove_events_eqitE [in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_events_eventless [in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_events_eventless_equivE [in ITree.Extra.Dijkstra.ITreeDijkstra]
rer_inv [in ITree.Extra.ITrace.ITraceFacts]
resp_eutt_or [in ITree.Extra.Dijkstra.PureITreeDijkstra]
resum_to_subevent [in ITree.Core.Subevent]
retpi_bindpi [in ITree.Extra.Dijkstra.PureITreeDijkstra]
retpi_amonot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
retpi_monot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
Returns_divergent [in ITree.Extra.IForest]
Returns_vis_inversion [in ITree.Extra.IForest]
Returns_vis_inversion_ [in ITree.Extra.IForest]
Returns_bind_inversion [in ITree.Extra.IForest]
Returns_bind_inversion_ [in ITree.Extra.IForest]
Returns_bind [in ITree.Extra.IForest]
Returns_Ret [in ITree.Extra.IForest]
Returns_Ret_ [in ITree.Extra.IForest]
Returns_ret_inv [in ITree.Extra.IForest]
Returns_ret_inv_ [in ITree.Extra.IForest]
Returns_Vis_sub [in ITree.Extra.IForest]
ret_bind [in ITree.Extra.IForest]
ret_not_div [in ITree.Extra.Dijkstra.PureITreeBasics]
REvRef_inv [in ITree.Extra.ITrace.ITraceFacts]
rutt_inv_Tau [in ITree.Eq.Rutt]
rutt_add_Tau_r [in ITree.Eq.Rutt]
rutt_inv_Tau_r [in ITree.Eq.Rutt]
rutt_add_Tau_l [in ITree.Eq.Rutt]
rutt_inv_Tau_l [in ITree.Eq.Rutt]
rutt_monot [in ITree.Eq.Rutt]

S

secret_halt_trans_3 [in ITree.Extra.Secure.SecureEqEuttHalt]
secret_halt_trans_2 [in ITree.Extra.Secure.SecureEqEuttHalt]
secret_halt_trans_1 [in ITree.Extra.Secure.SecureEqEuttHalt]
secure_eqit_iter [in ITree.Extra.Secure.SecureEqProgInsens]
secure_eqit_mon [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqit_mono [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqitF_mono [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqit_mon [in ITree.Extra.Secure.SecureEqHalt]
secure_eqit_mono [in ITree.Extra.Secure.SecureEqHalt]
secure_eqitF_mono [in ITree.Extra.Secure.SecureEqHalt]
secure_eqit_ret [in ITree.Extra.Secure.SecureEqBind]
secure_eqit_iter [in ITree.Extra.Secure.SecureEqBind]
secure_eqit_bind [in ITree.Extra.Secure.SecureEqBind]
secure_eqit_bind' [in ITree.Extra.Secure.SecureEqBind]
silent_terminates_eqit_secure_ret [in ITree.Extra.Secure.SecureStateHandler]
silent_diverges_eqit_secure_spin [in ITree.Extra.Secure.SecureStateHandler]
silent_terminates_eqit_secure_ret [in ITree.Extra.Secure.SecureStateHandlerPi]
Simple.bind_bind [in ITree.Simple]
Simple.bind_ret_r [in ITree.Simple]
Simple.bind_vis [in ITree.Simple]
Simple.bind_tau [in ITree.Simple]
Simple.bind_ret [in ITree.Simple]
Simple.eutt_inv_vis [in ITree.Simple]
Simple.eutt_inv_ret [in ITree.Simple]
Simple.eutt_vis [in ITree.Simple]
Simple.eutt_ret [in ITree.Simple]
Simple.interp_mrecursive [in ITree.Simple]
Simple.interp_recursive_call [in ITree.Simple]
Simple.interp_bind [in ITree.Simple]
Simple.interp_trigger [in ITree.Simple]
Simple.interp_vis [in ITree.Simple]
Simple.interp_ret [in ITree.Simple]
Simple.itree_eta [in ITree.Simple]
Simple.mrec_as_interp [in ITree.Simple]
Simple.rec_as_interp [in ITree.Simple]
Simple.tau_eutt [in ITree.Simple]
Simple.unfold_interp [in ITree.Simple]
simpobs [in ITree.Eq.Eqit]
simulates_trace_incl [in ITree.Interp.Traces]
spin_not_vis [in ITree.Extra.ITrace.ITraceBind]
spin_empty_Leaf [in ITree.Props.Finite]
spin_not_any_finite [in ITree.Props.Finite]
spin_not_all_finite [in ITree.Props.Finite]
spin_infinite [in ITree.Props.Infinite]
spin_bind [in ITree.Extra.Dijkstra.PureITreeBasics]
state_machine_proper_aux [in ITree.Extra.ITrace.ITracePreds]
subevent_subevent [in ITree.Core.Subevent]
subevent_subevent' [in ITree.Core.Subevent]
subrelationH_refl_eq [in ITree.Basics.HeterogeneousRelations]
subrelationH_trans [in ITree.Basics.HeterogeneousRelations]
subrelationH_antisym [in ITree.Basics.HeterogeneousRelations]
subrelationH_Reflexive [in ITree.Basics.HeterogeneousRelations]
sum_compose [in ITree.Basics.HeterogeneousRelations]
sum_rel_eq [in ITree.Basics.HeterogeneousRelations]
sum_rel_monotone [in ITree.Basics.HeterogeneousRelations]
suttF_inv_tau_left [in ITree.Eq.SimUpToTaus]
suttF_inv_vis [in ITree.Eq.SimUpToTaus]
sutt_bind' [in ITree.Eq.SimUpToTaus]
sutt_eutt [in ITree.Eq.SimUpToTaus]
sutt_inv_tau_left [in ITree.Eq.SimUpToTaus]
sutt_elim_tau_right [in ITree.Eq.SimUpToTaus]
sutt_tau_left [in ITree.Eq.SimUpToTaus]
sutt_tau_right [in ITree.Eq.SimUpToTaus]
sutt_inv_vis [in ITree.Eq.SimUpToTaus]
sutt_trace_incl [in ITree.Interp.Traces]
swap_bimap_prod' [in ITree.Basics.CategoryFacts]
swap_bimap_prod [in ITree.Basics.CategoryFacts]
swap_fst [in ITree.Basics.CategoryFacts]
swap_snd [in ITree.Basics.CategoryFacts]
swap_pair [in ITree.Basics.CategoryFacts]
swap_bimap' [in ITree.Basics.CategoryFacts]
swap_bimap [in ITree.Basics.CategoryFacts]
swap_case [in ITree.Basics.CategoryFacts]
swap_involutive [in ITree.Basics.CategoryTheory]
SymmetricH_Symmetric [in ITree.Basics.HeterogeneousRelations]
Symmteric_EQ_REL [in ITree.Extra.IForest]

T

tau_eqit_secure [in ITree.Extra.Secure.SecureEqEuttHalt]
tau_invar_resp_eutt1 [in ITree.Extra.Dijkstra.PureITreeBasics]
tau_eutt_RR_r [in ITree.Eq.Eqit]
tau_eqit_RR_l [in ITree.Eq.Eqit]
tau_eutt_RR_l [in ITree.Eq.Eqit]
tau_eutt [in ITree.Eq.Eqit]
tau_euttge [in ITree.Eq.Eqit]
terminal_unique [in ITree.Basics.CategoryFacts]
term_b_pred_resp_eutt [in ITree.Extra.Dijkstra.PureITreeDijkstra]
throw_prefix_iter [in ITree.Events.ExceptionFacts]
throw_prefix_bind [in ITree.Events.ExceptionFacts]
throw_prefix_of_try_catch [in ITree.Events.ExceptionFacts]
throw_prefix_bind_decomp [in ITree.Events.ExceptionFacts]
trace_prefix_peel [in ITree.Extra.ITrace.ITraceBind]
trace_prefix_peel_ret_vis_empty [in ITree.Extra.ITrace.ITraceBind]
trace_prefix_peel_ret_vis [in ITree.Extra.ITrace.ITraceBind]
trace_prefix_vis_evempty [in ITree.Extra.ITrace.ITraceBind]
trace_prefix_vis_evans [in ITree.Extra.ITrace.ITraceBind]
trace_prefix_tau_ret [in ITree.Extra.ITrace.ITraceBind]
trace_prefix_bind [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_div [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ind_bind [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ind_comb [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_proper_r [in ITree.Extra.ITrace.ITracePrefix]
trace_prefixF_vis_l [in ITree.Extra.ITrace.ITracePrefix]
trace_prefixF_tau_inv_r [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_proper_l [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_tau_inv [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_proper_aux_vis [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ret [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_monot [in ITree.Extra.ITrace.ITracePrefix]
trace_eq_iff_eutt [in ITree.Interp.Traces]
trace_eq_eutt [in ITree.Interp.Traces]
trace_incl_iff_sutt [in ITree.Interp.Traces]
trace_incl_sutt [in ITree.Interp.Traces]
trace_refine_bind_cont_inv [in ITree.Extra.ITrace.ITraceFacts]
trace_set_complete [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_diverge_bind [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_converge_bind [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_all_infinite [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_may_converge [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_may_converge_ex [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis_l [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis_add [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_vis_inv [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_ret_inv_l [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_ret_inv_r [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_ret [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_proper_right' [in ITree.Extra.ITrace.ITraceFacts]
trace_refine_proper_left' [in ITree.Extra.ITrace.ITraceFacts]
trace_inf_often_monot [in ITree.Extra.ITrace.ITracePreds]
trace_forall_proper_aux [in ITree.Extra.ITrace.ITracePreds]
trace_forall_monot [in ITree.Extra.ITrace.ITracePreds]
transDleU [in ITree.Eq.UpToTaus]
transD_transL [in ITree.Eq.UpToTaus]
transD_dist [in ITree.Eq.UpToTaus]
transD_flip [in ITree.Eq.UpToTaus]
transD_id [in ITree.Eq.UpToTaus]
transD_compose [in ITree.Eq.UpToTaus]
transD_mon [in ITree.Eq.UpToTaus]
TransitiveH_Transitive [in ITree.Basics.HeterogeneousRelations]
Transitive_EQ_REL [in ITree.Extra.IForest]
translate_to_interp [in ITree.Interp.InterpFacts]
translate_trigger [in ITree.Interp.TranslateFacts]
translate_cmpE [in ITree.Interp.TranslateFacts]
translate_id [in ITree.Interp.TranslateFacts]
translate_bind [in ITree.Interp.TranslateFacts]
translate_vis [in ITree.Interp.TranslateFacts]
translate_tau [in ITree.Interp.TranslateFacts]
translate_ret [in ITree.Interp.TranslateFacts]
transLleU [in ITree.Eq.UpToTaus]
transL_closed [in ITree.Eq.UpToTaus]
transpose_sum [in ITree.Basics.HeterogeneousRelations]
transpose_prod [in ITree.Basics.HeterogeneousRelations]
transpose_monotone [in ITree.Basics.HeterogeneousRelations]
transpose_sym_eq_rel [in ITree.Basics.HeterogeneousRelations]
transpose_inclusion [in ITree.Basics.HeterogeneousRelations]
transpose_involution [in ITree.Basics.HeterogeneousRelations]
transpose_compose [in ITree.Basics.HeterogeneousRelations]
transpose_sym [in ITree.Basics.HeterogeneousRelations]
transpose_eq [in ITree.Basics.HeterogeneousRelations]
transU_dist_rev [in ITree.Eq.UpToTaus]
transU_dist [in ITree.Eq.UpToTaus]
transU_flip [in ITree.Eq.UpToTaus]
transU_id [in ITree.Eq.UpToTaus]
transU_compose [in ITree.Eq.UpToTaus]
transU_mon [in ITree.Eq.UpToTaus]
trans_rcompose [in ITree.Eq.Eqit]
try_catch_to_throw_prefix [in ITree.Events.ExceptionFacts]
try_catch_throw_prefix_nop [in ITree.Events.ExceptionFacts]
try_catch_ev [in ITree.Events.ExceptionFacts]
try_catch_exc [in ITree.Events.ExceptionFacts]
try_catch_tau [in ITree.Events.ExceptionFacts]
try_catch_ret [in ITree.Events.ExceptionFacts]

U

unfold_interp_fail [in ITree.Events.FailFacts]
unfold_interp_state [in ITree.Events.StateFacts]
unfold_iter_ktree [in ITree.Core.KTreeFacts]
unfold_forever_ [in ITree.Eq.Shallow]
unfold_aloop_ [in ITree.Eq.Shallow]
unfold_interp [in ITree.Interp.InterpFacts]
unfold_translate [in ITree.Interp.TranslateFacts]
unfold_translate_ [in ITree.Interp.TranslateFacts]
unfold_spin [in ITree.Extra.Dijkstra.PureITreeBasics]
unfold_interp_mrec_h [in ITree.Interp.RecursionFacts]
unfold_interp_mrec [in ITree.Interp.RecursionFacts]
unfold_forever [in ITree.Eq.Eqit]
unfold_iter [in ITree.Eq.Eqit]
unfold_bind [in ITree.Eq.Eqit]
unit_r'_pure [in ITree.Basics.CategoryKleisliFacts]
unit_r_pure [in ITree.Basics.CategoryKleisliFacts]
unit_l'_pure [in ITree.Basics.CategoryKleisliFacts]
unit_l_pure [in ITree.Basics.CategoryKleisliFacts]
unit_r'_fst [in ITree.Basics.CategoryFacts]
unit_l'_snd [in ITree.Basics.CategoryFacts]
unit_r_epi [in ITree.Basics.CategoryTheory]
unit_r_mono [in ITree.Basics.CategoryTheory]
unit_l_epi [in ITree.Basics.CategoryTheory]
unit_l_mono [in ITree.Basics.CategoryTheory]
unpriv_e_eqit_secure [in ITree.Extra.Secure.SecureEqEuttHalt]

V

vis_peel_r [in ITree.Extra.ITrace.ITraceBind]
vis_peel_l [in ITree.Extra.ITrace.ITraceBind]
vis_refine_peel_cont [in ITree.Extra.ITrace.ITraceBind]
vis_refine_peel [in ITree.Extra.ITrace.ITraceBind]

W

well_found_wf_from [in ITree.Extra.Dijkstra.IterRel]
wf_intro_gt [in ITree.Extra.Dijkstra.IterRel]
wf_from_gt [in ITree.Extra.Dijkstra.IterRel]
wf_from_sub_rel [in ITree.Extra.Dijkstra.IterRel]

---

Constructor Index

A

all_finiteVis [in ITree.Props.Finite]
all_finiteTau [in ITree.Props.Finite]
all_finiteRet [in ITree.Props.Finite]
any_finiteVis [in ITree.Props.Finite]
any_finiteTau [in ITree.Props.Finite]
any_finiteRet [in ITree.Props.Finite]
apply_ [in ITree.Basics.CategoryOps]
Ask [in ITree.Events.Reader]
assoc_l [in ITree.Basics.CategoryOps]
assoc_r [in ITree.Basics.CategoryOps]
assoc_l_assoc_l [in ITree.Basics.CategoryTheory]
assoc_l_unit [in ITree.Basics.CategoryTheory]
assoc_r_assoc_r [in ITree.Basics.CategoryTheory]
assoc_r_unit [in ITree.Basics.CategoryTheory]

B

base [in ITree.Extra.Dijkstra.IterRel]
bimap [in ITree.Basics.CategoryOps]
bimap_cat [in ITree.Basics.CategoryTheory]
bimap_id [in ITree.Basics.CategoryTheory]
BIND_BIND_COUNTEREXAMPLE.Pick [in ITree.Extra.IForest]
bisimConsF [in ITree.Extra.Dijkstra.ITreeDijkstra]
bisimNil [in ITree.Extra.Dijkstra.ITreeDijkstra]

C

Call [in ITree.Interp.Recursion]
can_return_Vis [in ITree.Events.State]
can_return_Tau [in ITree.Events.State]
can_return_Ret [in ITree.Events.State]
case_ [in ITree.Basics.CategoryOps]
case_universal [in ITree.Basics.CategoryTheory]
case_inr [in ITree.Basics.CategoryTheory]
case_inl [in ITree.Basics.CategoryTheory]
cat [in ITree.Basics.CategoryOps]
cat_assoc [in ITree.Basics.CategoryTheory]
cat_id_r [in ITree.Basics.CategoryTheory]
cat_id_l [in ITree.Basics.CategoryTheory]
ConsF [in ITree.Extra.Dijkstra.ITreeDijkstra]
cons_found [in ITree.Extra.Dijkstra.ITreeDijkstra]
cons_search [in ITree.Extra.Dijkstra.ITreeDijkstra]
cont_a [in ITree.Extra.Dijkstra.PureITreeDijkstra]
cont_visF [in ITree.Extra.Dijkstra.ITreeDijkstra]
cont_vis [in ITree.Extra.Dijkstra.ITreeDijkstra]
conv_vis [in ITree.Props.Infinite]
conv_ret [in ITree.Props.Infinite]
crl [in ITree.Extra.Secure.SecureEqProgInsensFacts]
crr [in ITree.Extra.Secure.SecureEqProgInsensFacts]
curry_ [in ITree.Basics.CategoryOps]
curry_apply [in ITree.Basics.CategoryTheory]

D

dagger [in ITree.Basics.CategoryOps]
dagger_invol [in ITree.Basics.CategoryTheory]
Decide [in ITree.Extra.Dijkstra.TracesIT]
Dep [in ITree.Events.Dependent]
diverges_vis [in ITree.Extra.Secure.SecureStateHandler]
diverges_tau [in ITree.Extra.Secure.SecureStateHandler]
DivTau [in ITree.Props.Infinite]
DivVis [in ITree.Props.Infinite]

E

embed [in ITree.Core.Subevent]
emp [in ITree.Extra.Secure.Labels]
empty [in ITree.Basics.CategoryOps]
EqERet [in ITree.Extra.Dijkstra.ITreeDijkstra]
EqETau [in ITree.Extra.Dijkstra.ITreeDijkstra]
EqETauL [in ITree.Extra.Dijkstra.ITreeDijkstra]
EqETauR [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqit_secure_trans_clo_intro [in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure_trans_clo_intro [in ITree.Extra.Secure.SecureEqHalt]
eqit_trans_clo_intro [in ITree.Eq.Rutt]
eqit_trans_clo_intro [in ITree.Eq.Eqit]
EqRet [in ITree.Eq.Rutt]
EqRet [in ITree.Eq.Eqit]
EqTau [in ITree.Eq.Rutt]
EqTau [in ITree.Eq.Eqit]
EqTauL [in ITree.Eq.Rutt]
EqTauL [in ITree.Eq.Eqit]
EqTauR [in ITree.Eq.Rutt]
EqTauR [in ITree.Eq.Eqit]
EqVis [in ITree.Eq.Rutt]
EqVis [in ITree.Eq.Eqit]
EqVisPriv [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisPriv [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltLTauR [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltLTauR [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltLVisR [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltLVisR [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltRTauL [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltRTauL [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnprivHaltRVisL [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnprivHaltRVisL [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivLInd [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivLInd [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivRInd [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivRInd [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivTauLCo [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivTauLCo [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivTauRCo [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivTauRCo [in ITree.Extra.Secure.SecureEqHalt]
EqVisUnPrivVisCo [in ITree.Extra.Secure.SecureEqHaltProgInsens]
EqVisUnPrivVisCo [in ITree.Extra.Secure.SecureEqHalt]
eq1 [in ITree.Basics.Monad]
eq1_equiv [in ITree.Basics.Monad]
eq2 [in ITree.Basics.CategoryOps]
euttG_intro [in ITree.Eq.UpToTaus]
ev [in ITree.Extra.Dijkstra.ITreeDijkstra]
evans [in ITree.Extra.ITrace.ITraceDefinition]
evempty [in ITree.Extra.ITrace.ITraceDefinition]
Event [in ITree.Interp.Traces]
eventlessRet [in ITree.Extra.Dijkstra.ITreeDijkstra]
eventlessTau [in ITree.Extra.Dijkstra.ITreeDijkstra]

F

forall_cons [in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_nil [in ITree.Extra.Dijkstra.ITreeDijkstra]
from_bif [in ITree.Basics.CategorySub]
front_and_last_cons [in ITree.Extra.ITrace.ITracePreds]
front_and_last_base [in ITree.Extra.ITrace.ITracePreds]
fst_ [in ITree.Basics.CategoryOps]

G

Get [in ITree.Events.State]
GetE [in ITree.Extra.Dijkstra.StateIOTrace]
go [in ITree.Extra.Dijkstra.ITreeDijkstra]
go [in ITree.Core.ITreeDefinition]
going_intros [in ITree.Eq.Shallow]

I

id_ [in ITree.Basics.CategoryOps]
includes_baseF [in ITree.Extra.Dijkstra.ITreeDijkstra]
includes_base [in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_tau [in ITree.Extra.Dijkstra.PureITreeDijkstra]
initial_object [in ITree.Basics.CategoryTheory]
inl_ [in ITree.Basics.CategoryOps]
inl_morphism [in ITree.Basics.HeterogeneousRelations]
inl1 [in ITree.Indexed.Sum]
inr_ [in ITree.Basics.CategoryOps]
inr_morphism [in ITree.Basics.HeterogeneousRelations]
inr1 [in ITree.Indexed.Sum]
Insert [in ITree.Events.Map]
Insert [in ITree.Events.MapDefault]
interleaved_Right [in ITree.Interp.HandlerFacts]
interleaved_Left [in ITree.Interp.HandlerFacts]
interleaved_Ret [in ITree.Interp.HandlerFacts]
Interp_iforest_Vis [in ITree.Extra.IForest]
Interp_iforest_Tau [in ITree.Extra.IForest]
Interp_iforest_Ret [in ITree.Extra.IForest]
ipDelay [in ITree.Events.State]
ipRet [in ITree.Events.State]
ipVis [in ITree.Events.State]
is_bool_matches [in ITree.Extra.Dijkstra.TracesIT]
is_inf_cons [in ITree.Extra.Dijkstra.ITreeDijkstra]
iter [in ITree.Basics.CategoryOps]
iter [in ITree.Basics.Basics]
iterF_con [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iter_step [in ITree.Basics.Basics]
iter_done [in ITree.Basics.Basics]
iter_codiagonal [in ITree.Basics.CategoryTheory]
iter_dinatural [in ITree.Basics.CategoryTheory]
iter_natural [in ITree.Basics.CategoryTheory]
iter_unfold [in ITree.Basics.CategoryTheory]

L

LeafRet [in ITree.Props.Leaf]
LeafTau [in ITree.Props.Leaf]
LeafVis [in ITree.Props.Leaf]
left_vis_bp [in ITree.Extra.ITrace.ITracePrefix]
left_ret_bp [in ITree.Extra.ITrace.ITracePrefix]
left_vis_comb [in ITree.Extra.ITrace.ITracePrefix]
left_ret_comb [in ITree.Extra.ITrace.ITracePrefix]
lem [in ITree.Extra.Dijkstra.DijkstraMonad]
Lookup [in ITree.Events.Map]
LookupDef [in ITree.Events.MapDefault]

M

MDivTau [in ITree.Props.Infinite]
MDivVis [in ITree.Props.Infinite]

N

natural_unit_l' [in ITree.Basics.CategoryTheory]
natural_unit_l [in ITree.Basics.CategoryTheory]
ne [in ITree.Extra.Secure.Labels]
NilF [in ITree.Extra.Dijkstra.ITreeDijkstra]
NoChoice [in ITree.Events.Nondeterminism]
not_wf [in ITree.Extra.Dijkstra.IterRel]
NoWitness [in ITree.Axioms]

O

obs [in ITree.Extra.Dijkstra.DijkstraMonad]
observing_intros [in ITree.Eq.Shallow]
one [in ITree.Basics.CategoryOps]
Or [in ITree.Events.Nondeterminism]

P

pair_ [in ITree.Basics.CategoryOps]
pair_universal [in ITree.Basics.CategoryTheory]
pair_snd [in ITree.Basics.CategoryTheory]
pair_fst [in ITree.Basics.CategoryTheory]
pbc_intro_h [in ITree.Extra.IForest]
pbc_intro_h [in ITree.Props.Leaf]
pbc_intro_h [in ITree.Eq.Eqit]
piEqVisPriv [in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivLInd [in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivRInd [in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivTauLCo [in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivTauRCo [in ITree.Extra.Secure.SecureEqProgInsens]
piEqVisUnPrivVisCo [in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqRet [in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqTau [in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqTauL [in ITree.Extra.Secure.SecureEqProgInsens]
pisecEqTauR [in ITree.Extra.Secure.SecureEqProgInsens]
prod_morphism [in ITree.Basics.HeterogeneousRelations]
Put [in ITree.Events.State]
PutE [in ITree.Extra.Dijkstra.StateIOTrace]

R

rar [in ITree.Extra.ITrace.ITraceDefinition]
rcompose_intro [in ITree.Eq.Eqit]
Read [in ITree.Extra.Dijkstra.StateIOTrace]
ree [in ITree.Extra.ITrace.ITraceDefinition]
reflexive [in ITree.Basics.HeterogeneousRelations]
Remove [in ITree.Events.Map]
Remove [in ITree.Events.MapDefault]
rer [in ITree.Extra.ITrace.ITraceDefinition]
respect_public' [in ITree.Extra.Secure.SecureStateHandler]
respect_private_e [in ITree.Extra.Secure.SecureStateHandler]
respect_private_ne [in ITree.Extra.Secure.SecureStateHandler]
respect_public [in ITree.Extra.Secure.SecureStateHandler]
respect_private [in ITree.Extra.Secure.SecureStateHandler]
respect_public'' [in ITree.Extra.Secure.SecureStateHandlerPi]
respect_private' [in ITree.Extra.Secure.SecureStateHandlerPi]
resum [in ITree.Basics.CategoryOps]
RetF [in ITree.Core.ITreeDefinition]
ReturnsRet [in ITree.Extra.IForest]
ReturnsTau [in ITree.Extra.IForest]
ReturnsVis [in ITree.Extra.IForest]
ret_prefix [in ITree.Extra.ITrace.ITracePrefix]
Ring [in ITree.Extra.Dijkstra.ITreeDijkstra]

S

secEqRet [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqRet [in ITree.Extra.Secure.SecureEqHalt]
secEqTau [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqTau [in ITree.Extra.Secure.SecureEqHalt]
secEqTauL [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqTauL [in ITree.Extra.Secure.SecureEqHalt]
secEqTauR [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secEqTauR [in ITree.Extra.Secure.SecureEqHalt]
semi_iso [in ITree.Basics.CategoryTheory]
SimStep [in ITree.Interp.Traces]
smRet [in ITree.Extra.ITrace.ITracePreds]
smTau [in ITree.Extra.ITrace.ITracePreds]
smVis [in ITree.Extra.ITrace.ITracePreds]
snd_ [in ITree.Basics.CategoryOps]
Spawn [in ITree.Events.Concurrency]
step [in ITree.Extra.Dijkstra.IterRel]
StepTau [in ITree.Interp.Traces]
StepVis [in ITree.Interp.Traces]
suttF_tau_left [in ITree.Eq.SimUpToTaus]
suttF_tau_right [in ITree.Eq.SimUpToTaus]
suttF_vis [in ITree.Eq.SimUpToTaus]
suttF_ret [in ITree.Eq.SimUpToTaus]
swap [in ITree.Basics.CategoryOps]
swap_assoc_l [in ITree.Basics.CategoryTheory]
swap_assoc_r [in ITree.Basics.CategoryTheory]
swap_unit_l [in ITree.Basics.CategoryTheory]
symmetric [in ITree.Basics.HeterogeneousRelations]

T

TauF [in ITree.Core.ITreeDefinition]
tau_vis_ans [in ITree.Extra.ITrace.ITracePrefix]
tau_vis_empty [in ITree.Extra.ITrace.ITracePrefix]
tau_l_prefix [in ITree.Extra.ITrace.ITracePrefix]
tau_r_prefix [in ITree.Extra.ITrace.ITracePrefix]
tau_prefix [in ITree.Extra.ITrace.ITracePrefix]
Tell [in ITree.Events.Writer]
TEnd [in ITree.Interp.Traces]
terminal_object [in ITree.Basics.CategoryTheory]
terminates_vis [in ITree.Extra.Secure.SecureStateHandler]
terminates_tau [in ITree.Extra.Secure.SecureStateHandler]
terminates_ret [in ITree.Extra.Secure.SecureStateHandler]
term_b [in ITree.Extra.Dijkstra.PureITreeDijkstra]
TEventEnd [in ITree.Interp.Traces]
TEventResponse [in ITree.Interp.Traces]
Throw [in ITree.Events.Exception]
to_bif [in ITree.Basics.CategorySub]
TraceEmpty [in ITree.Interp.Traces]
TraceRet [in ITree.Interp.Traces]
TraceTau [in ITree.Interp.Traces]
TraceVisContinue [in ITree.Interp.Traces]
TraceVisEnd [in ITree.Interp.Traces]
trace_inf_often_vis_pos [in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_vis_neg [in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_tau [in ITree.Extra.ITrace.ITracePreds]
trace_forall_vis [in ITree.Extra.ITrace.ITracePreds]
trace_forall_tau [in ITree.Extra.ITrace.ITracePreds]
trace_forall_ret [in ITree.Extra.ITrace.ITracePreds]
transitive [in ITree.Basics.HeterogeneousRelations]
transL_intro [in ITree.Eq.UpToTaus]
TRet [in ITree.Interp.Traces]

U

unit_r' [in ITree.Basics.CategoryOps]
unit_r [in ITree.Basics.CategoryOps]
unit_l' [in ITree.Basics.CategoryOps]
unit_l [in ITree.Basics.CategoryOps]

V

VisF [in ITree.Core.ITreeDefinition]

W

Witness [in ITree.Axioms]
wn [in ITree.Extra.Dijkstra.StateIOTrace]
wnm [in ITree.Extra.Dijkstra.StateIOTrace]
Write [in ITree.Extra.Dijkstra.StateIOTrace]

---

Axiom Index

B

bisimulation_is_eq [in ITree.Eq.EqAxiom]

G

guarded_choice [in ITree.Axioms]

S

SimpleTheory.bind_bind [in ITree.Simple]
SimpleTheory.bind_ret_r [in ITree.Simple]
SimpleTheory.bind_vis [in ITree.Simple]
SimpleTheory.bind_ret [in ITree.Simple]
SimpleTheory.eutt [in ITree.Simple]
SimpleTheory.eutt_inv_vis [in ITree.Simple]
SimpleTheory.eutt_inv_ret [in ITree.Simple]
SimpleTheory.eutt_vis [in ITree.Simple]
SimpleTheory.eutt_ret [in ITree.Simple]
SimpleTheory.interp_mrecursive [in ITree.Simple]
SimpleTheory.interp_recursive_call [in ITree.Simple]
SimpleTheory.interp_bind [in ITree.Simple]
SimpleTheory.interp_trigger [in ITree.Simple]
SimpleTheory.interp_vis [in ITree.Simple]
SimpleTheory.interp_ret [in ITree.Simple]
SimpleTheory.itree_eta [in ITree.Simple]
SimpleTheory.mrec_as_interp [in ITree.Simple]
SimpleTheory.rec_as_interp [in ITree.Simple]
SimpleTheory.tau_eutt [in ITree.Simple]
SimpleTheory.unfold_interp [in ITree.Simple]

---

Inductive Index

A

all_finite [in ITree.Props.Finite]
all_infiniteF [in ITree.Props.Infinite]
any_finite [in ITree.Props.Finite]
any_infiniteF [in ITree.Props.Infinite]
Apply [in ITree.Basics.CategoryOps]
AssocL [in ITree.Basics.CategoryOps]
AssocLAssocL [in ITree.Basics.CategoryTheory]
AssocLUnit [in ITree.Basics.CategoryTheory]
AssocR [in ITree.Basics.CategoryOps]
AssocRAssocR [in ITree.Basics.CategoryTheory]
AssocRUnit [in ITree.Basics.CategoryTheory]

B

Bimap [in ITree.Basics.CategoryOps]
BimapCat [in ITree.Basics.CategoryTheory]
BimapId [in ITree.Basics.CategoryTheory]
BIND_BIND_COUNTEREXAMPLE.ND [in ITree.Extra.IForest]
bisimF [in ITree.Extra.Dijkstra.ITreeDijkstra]

C

callE [in ITree.Interp.Recursion]
can_return [in ITree.Events.State]
Case [in ITree.Basics.CategoryOps]
CaseInl [in ITree.Basics.CategoryTheory]
CaseInr [in ITree.Basics.CategoryTheory]
CaseUniversal [in ITree.Basics.CategoryTheory]
case_rel [in ITree.Extra.Secure.SecureEqProgInsensFacts]
Cat [in ITree.Basics.CategoryOps]
CatAssoc [in ITree.Basics.CategoryTheory]
CatIdL [in ITree.Basics.CategoryTheory]
CatIdR [in ITree.Basics.CategoryTheory]
Curry [in ITree.Basics.CategoryOps]
CurryApply [in ITree.Basics.CategoryTheory]

D

Dagger [in ITree.Basics.CategoryOps]
DaggerInvolution [in ITree.Basics.CategoryTheory]
depE [in ITree.Events.Dependent]
diverges_with' [in ITree.Extra.Secure.SecureStateHandler]

E

EffectObs [in ITree.Extra.Dijkstra.DijkstraMonad]
Embeddable [in ITree.Core.Subevent]
empty [in ITree.Extra.Secure.Labels]
eqitEF [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitF [in ITree.Eq.Eqit]
eqit_secure_trans_clo [in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure_trans_clo [in ITree.Extra.Secure.SecureEqHalt]
eqit_Returns_bind_clo [in ITree.Extra.IForest]
eqit_Leaf_bind_clo [in ITree.Props.Leaf]
eqit_bind_clo [in ITree.Eq.Eqit]
eqit_trans_clo [in ITree.Eq.Eqit]
Eq1 [in ITree.Basics.Monad]
Eq1Equivalence [in ITree.Basics.Monad]
Eq2 [in ITree.Basics.CategoryOps]
euttG [in ITree.Eq.UpToTaus]
euttge_trans_clo [in ITree.Eq.Rutt]
Ev [in ITree.Extra.Dijkstra.ITreeDijkstra]
EvAns [in ITree.Extra.ITrace.ITraceDefinition]
event [in ITree.Interp.Traces]
eventlessF [in ITree.Extra.Dijkstra.ITreeDijkstra]
exceptE [in ITree.Events.Exception]

F

forall_streamF [in ITree.Extra.Dijkstra.ITreeDijkstra]
FromBifunctor [in ITree.Basics.CategorySub]
front_and_last [in ITree.Extra.ITrace.ITracePreds]
Fst [in ITree.Basics.CategoryOps]

G

going [in ITree.Eq.Shallow]

H

handler_respects_priv' [in ITree.Extra.Secure.SecureStateHandler]
handler_respects_priv [in ITree.Extra.Secure.SecureStateHandler]
handler_respects_priv [in ITree.Extra.Secure.SecureStateHandlerPi]

I

Id_ [in ITree.Basics.CategoryOps]
ind_comb [in ITree.Extra.ITrace.ITracePrefix]
inf_manyF [in ITree.Extra.Dijkstra.ITreeDijkstra]
Initial [in ITree.Basics.CategoryOps]
InitialObject [in ITree.Basics.CategoryTheory]
Inl [in ITree.Basics.CategoryOps]
Inr [in ITree.Basics.CategoryOps]
interleaved [in ITree.Interp.HandlerFacts]
interp_iforestF [in ITree.Extra.IForest]
interp_prop [in ITree.Events.State]
IO [in ITree.Extra.Dijkstra.StateIOTrace]
is_bool [in ITree.Extra.Dijkstra.TracesIT]
is_infF [in ITree.Extra.Dijkstra.ITreeDijkstra]
is_traceF [in ITree.Interp.Traces]
Iter [in ITree.Basics.CategoryOps]
IterCodiagonal [in ITree.Basics.CategoryTheory]
IterDinatural [in ITree.Basics.CategoryTheory]
iterF [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterF_body [in ITree.Extra.Dijkstra.PureITreeDijkstra]
IterNatural [in ITree.Basics.CategoryTheory]
IterUnfold [in ITree.Basics.CategoryTheory]
iter_Prop [in ITree.Basics.Basics]
itreeF [in ITree.Core.ITreeDefinition]
itree_includesF [in ITree.Extra.Dijkstra.ITreeDijkstra]
itree_includes' [in ITree.Extra.Dijkstra.ITreeDijkstra]

L

Leaf [in ITree.Props.Leaf]

M

mapE [in ITree.Events.Map]
mapE [in ITree.Events.MapDefault]
may_converge [in ITree.Props.Infinite]
MonadIter [in ITree.Basics.Basics]
mwitness [in ITree.Axioms]

N

NonDet [in ITree.Extra.Dijkstra.TracesIT]
nondetE [in ITree.Events.Nondeterminism]
nonempty [in ITree.Extra.Secure.Labels]
not_wf_F [in ITree.Extra.Dijkstra.IterRel]
no_choice [in ITree.Events.Nondeterminism]

O

OrderM [in ITree.Extra.Dijkstra.DijkstraMonad]

P

Pair [in ITree.Basics.CategoryOps]
PairFst [in ITree.Basics.CategoryTheory]
PairSnd [in ITree.Basics.CategoryTheory]
PairUniversal [in ITree.Basics.CategoryTheory]
pi_secure_eqitF [in ITree.Extra.Secure.SecureEqProgInsens]

R

RAnsRef [in ITree.Extra.ITrace.ITraceDefinition]
rcompose [in ITree.Eq.Eqit]
readerE [in ITree.Events.Reader]
ReflexiveH [in ITree.Basics.HeterogeneousRelations]
ReSum [in ITree.Basics.CategoryOps]
Returns [in ITree.Extra.IForest]
REvRef [in ITree.Extra.ITrace.ITraceDefinition]
ruttF [in ITree.Eq.Rutt]

S

secure_eqitF [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqitF [in ITree.Extra.Secure.SecureEqHalt]
SemiIso [in ITree.Basics.CategoryTheory]
simulates [in ITree.Interp.Traces]
Snd [in ITree.Basics.CategoryOps]
Sound [in ITree.Extra.Dijkstra.ITreeDijkstra]
spawnE [in ITree.Events.Concurrency]
StateE [in ITree.Extra.Dijkstra.StateIOTrace]
stateE [in ITree.Events.State]
state_machineF [in ITree.Extra.ITrace.ITracePreds]
step_ [in ITree.Interp.Traces]
streamF [in ITree.Extra.Dijkstra.ITreeDijkstra]
sum_rel [in ITree.Basics.HeterogeneousRelations]
sum1 [in ITree.Indexed.Sum]
suttF [in ITree.Eq.SimUpToTaus]
Swap [in ITree.Basics.CategoryOps]
SwapAssocL [in ITree.Basics.CategoryTheory]
SwapAssocR [in ITree.Basics.CategoryTheory]
SwapUnitL [in ITree.Basics.CategoryTheory]
SymmetricH [in ITree.Basics.HeterogeneousRelations]

T

Terminal [in ITree.Basics.CategoryOps]
TerminalObject [in ITree.Basics.CategoryTheory]
terminates [in ITree.Extra.Secure.SecureStateHandler]
ToBifunctor [in ITree.Basics.CategorySub]
trace [in ITree.Interp.Traces]
trace_prefix_ind [in ITree.Extra.ITrace.ITracePrefix]
trace_prefixF [in ITree.Extra.ITrace.ITracePrefix]
trace_inf_oftenF [in ITree.Extra.ITrace.ITracePreds]
trace_forallF [in ITree.Extra.ITrace.ITracePreds]
TransitiveH [in ITree.Basics.HeterogeneousRelations]
transL [in ITree.Eq.UpToTaus]

U

UnitL [in ITree.Basics.CategoryOps]
UnitLNatural [in ITree.Basics.CategoryTheory]
UnitL' [in ITree.Basics.CategoryOps]
UnitL'Natural [in ITree.Basics.CategoryTheory]
UnitR [in ITree.Basics.CategoryOps]
UnitR' [in ITree.Basics.CategoryOps]

V

void1 [in ITree.Indexed.Sum]

W

wf_from [in ITree.Extra.Dijkstra.IterRel]
writerE [in ITree.Events.Writer]
writes_n [in ITree.Extra.Dijkstra.StateIOTrace]
write_next_mult [in ITree.Extra.Dijkstra.StateIOTrace]

---

Projection Index

A

apply_ [in ITree.Basics.CategoryOps]
assoc_l [in ITree.Basics.CategoryOps]
assoc_r [in ITree.Basics.CategoryOps]
assoc_l_assoc_l [in ITree.Basics.CategoryTheory]
assoc_l_unit [in ITree.Basics.CategoryTheory]
assoc_r_assoc_r [in ITree.Basics.CategoryTheory]
assoc_r_unit [in ITree.Basics.CategoryTheory]

B

bifunctor_proper_bimap [in ITree.Basics.CategoryTheory]
bifunctor_bimap_cat [in ITree.Basics.CategoryTheory]
bifunctor_bimap_id [in ITree.Basics.CategoryTheory]
bimap [in ITree.Basics.CategoryOps]
bimap_cat [in ITree.Basics.CategoryTheory]
bimap_id [in ITree.Basics.CategoryTheory]
bind_bind [in ITree.Basics.Monad]
bind_ret_r [in ITree.Basics.Monad]
bind_ret_l [in ITree.Basics.Monad]
bind_pres [in ITree.Extra.Dijkstra.DijkstraMonad]

C

cartesian_proper_curry_ [in ITree.Basics.CategoryTheory]
cartesian_curry_apply [in ITree.Basics.CategoryTheory]
cartesian_product [in ITree.Basics.CategoryTheory]
cartesian_terminal [in ITree.Basics.CategoryTheory]
case_ [in ITree.Basics.CategoryOps]
case_universal [in ITree.Basics.CategoryTheory]
case_inr [in ITree.Basics.CategoryTheory]
case_inl [in ITree.Basics.CategoryTheory]
cat [in ITree.Basics.CategoryOps]
category_proper_cat [in ITree.Basics.CategoryTheory]
category_cat_assoc [in ITree.Basics.CategoryTheory]
category_cat_id_r [in ITree.Basics.CategoryTheory]
category_cat_id_l [in ITree.Basics.CategoryTheory]
cat_assoc [in ITree.Basics.CategoryTheory]
cat_id_r [in ITree.Basics.CategoryTheory]
cat_id_l [in ITree.Basics.CategoryTheory]
coproduct_proper_case [in ITree.Basics.CategoryTheory]
coproduct_case_universal [in ITree.Basics.CategoryTheory]
coproduct_case_inr [in ITree.Basics.CategoryTheory]
coproduct_case_inl [in ITree.Basics.CategoryTheory]
curry_ [in ITree.Basics.CategoryOps]
curry_apply [in ITree.Basics.CategoryTheory]

D

dagger [in ITree.Basics.CategoryOps]
dagger_functor [in ITree.Basics.CategoryTheory]
dagger_involution [in ITree.Basics.CategoryTheory]
dagger_invol [in ITree.Basics.CategoryTheory]

E

embed [in ITree.Core.Subevent]
empty [in ITree.Basics.CategoryOps]
equiv_trans [in ITree.Basics.HeterogeneousRelations]
equiv_symm [in ITree.Basics.HeterogeneousRelations]
equiv_refl [in ITree.Basics.HeterogeneousRelations]
eq1 [in ITree.Basics.Monad]
eq1_equiv [in ITree.Basics.Monad]
eq2 [in ITree.Basics.CategoryOps]
eval [in ITree.Events.State]

F

fmap_proper [in ITree.Basics.CategoryFunctor]
fmap_cat [in ITree.Basics.CategoryFunctor]
fmap_id [in ITree.Basics.CategoryFunctor]
from_bif [in ITree.Basics.CategorySub]
fst_ [in ITree.Basics.CategoryOps]
fst_rel [in ITree.Basics.HeterogeneousRelations]

I

id_ [in ITree.Basics.CategoryOps]
In [in ITree.Extra.Dijkstra.DijkstraMonad]
initial_object [in ITree.Basics.CategoryTheory]
inl_ [in ITree.Basics.CategoryOps]
Input [in ITree.Extra.Dijkstra.DijkstraMonad]
inr_ [in ITree.Basics.CategoryOps]
iso_epi [in ITree.Basics.CategoryTheory]
iso_mono [in ITree.Basics.CategoryTheory]
iter [in ITree.Basics.CategoryOps]
iter [in ITree.Basics.Basics]
iterative_proper_iter [in ITree.Basics.CategoryTheory]
iterative_codiagonal [in ITree.Basics.CategoryTheory]
iterative_dinatural [in ITree.Basics.CategoryTheory]
iterative_natural [in ITree.Basics.CategoryTheory]
iterative_unfold [in ITree.Basics.CategoryTheory]
iter_codiagonal [in ITree.Basics.CategoryTheory]
iter_dinatural [in ITree.Basics.CategoryTheory]
iter_natural [in ITree.Basics.CategoryTheory]
iter_unfold [in ITree.Basics.CategoryTheory]

L

L [in ITree.Extra.Secure.Labels]
lem [in ITree.Extra.Dijkstra.DijkstraMonad]
leq [in ITree.Extra.Secure.Labels]

M

monoidal_assoc_r_assoc_r [in ITree.Basics.CategoryTheory]
monoidal_assoc_r_unit [in ITree.Basics.CategoryTheory]
monoidal_unit_l'_natural [in ITree.Basics.CategoryTheory]
monoidal_unit_l_natural [in ITree.Basics.CategoryTheory]
monoidal_unit_r_iso [in ITree.Basics.CategoryTheory]
monoidal_unit_l_iso [in ITree.Basics.CategoryTheory]
monoidal_assoc_iso [in ITree.Basics.CategoryTheory]
monoidal_bifunctor [in ITree.Basics.CategoryTheory]
monot [in ITree.Extra.Dijkstra.DijkstraMonad]

N

natural_unit_l' [in ITree.Basics.CategoryTheory]
natural_unit_l [in ITree.Basics.CategoryTheory]

O

obs [in ITree.Extra.Dijkstra.DijkstraMonad]
observing_observe [in ITree.Eq.Shallow]
one [in ITree.Basics.CategoryOps]

P

pair_ [in ITree.Basics.CategoryOps]
pair_universal [in ITree.Basics.CategoryTheory]
pair_snd [in ITree.Basics.CategoryTheory]
pair_fst [in ITree.Basics.CategoryTheory]
per_trans [in ITree.Basics.HeterogeneousRelations]
per_symm [in ITree.Basics.HeterogeneousRelations]
pre_trans [in ITree.Basics.HeterogeneousRelations]
pre_refl [in ITree.Basics.HeterogeneousRelations]
product_proper_pair [in ITree.Basics.CategoryTheory]
product_pair_universal [in ITree.Basics.CategoryTheory]
product_pair_snd [in ITree.Basics.CategoryTheory]
product_pair_fst [in ITree.Basics.CategoryTheory]
Proper_bind [in ITree.Basics.Monad]

R

reflex [in ITree.Extra.Dijkstra.DijkstraMonad]
reflexive [in ITree.Basics.HeterogeneousRelations]
resum [in ITree.Basics.CategoryOps]
ret_pres [in ITree.Extra.Dijkstra.DijkstraMonad]

S

semi_iso [in ITree.Basics.CategoryTheory]
snd_ [in ITree.Basics.CategoryOps]
snd_rel [in ITree.Basics.HeterogeneousRelations]
swap [in ITree.Basics.CategoryOps]
swap_assoc_l [in ITree.Basics.CategoryTheory]
swap_assoc_r [in ITree.Basics.CategoryTheory]
swap_unit_l [in ITree.Basics.CategoryTheory]
symmetric [in ITree.Basics.HeterogeneousRelations]
symmetric_swap_assoc_r [in ITree.Basics.CategoryTheory]
symmetric_swap_unit_l [in ITree.Basics.CategoryTheory]
symmetric_swap_involutive [in ITree.Basics.CategoryTheory]
symmetric_monoidal [in ITree.Basics.CategoryTheory]

T

terminal_object [in ITree.Basics.CategoryTheory]
to_bif [in ITree.Basics.CategorySub]
trans [in ITree.Extra.Dijkstra.DijkstraMonad]
transitive [in ITree.Basics.HeterogeneousRelations]

U

unit_r' [in ITree.Basics.CategoryOps]
unit_r [in ITree.Basics.CategoryOps]
unit_l' [in ITree.Basics.CategoryOps]
unit_l [in ITree.Basics.CategoryOps]

_

_observe [in ITree.Extra.Dijkstra.ITreeDijkstra]
_observe [in ITree.Core.ITreeDefinition]

---

Instance Index

A

all_finite_eutt [in ITree.Props.Finite]
any_finite_eutt [in ITree.Props.Finite]
any_infinite_proper_eutt [in ITree.Props.Infinite]
Applicative_itree [in ITree.Core.ITreeDefinition]
Apply_Fun [in ITree.Basics.Function]
AssocLAssocL_Product [in ITree.Basics.CategoryFacts]
AssocLAssocL_Coproduct [in ITree.Basics.CategoryFacts]
AssocLMono_Product [in ITree.Basics.CategoryFacts]
AssocLMono_Coproduct [in ITree.Basics.CategoryFacts]
AssocL_Product [in ITree.Basics.CategoryOps]
AssocL_Coproduct [in ITree.Basics.CategoryOps]
AssocL_prod [in ITree.Basics.CategoryRelations]
AssocL_sum [in ITree.Basics.CategoryRelations]
AssocRAssocR_Product [in ITree.Basics.CategoryFacts]
AssocRAssocR_Coproduct [in ITree.Basics.CategoryFacts]
AssocRAssocR_sum_rel [in ITree.Basics.CategoryRelations]
AssocRAssocR_prod_rel [in ITree.Basics.CategoryRelations]
AssocRMono_Product [in ITree.Basics.CategoryFacts]
AssocRMono_Coproduct [in ITree.Basics.CategoryFacts]
AssocRUnit_Product [in ITree.Basics.CategoryFacts]
AssocRUnit_Coproduct [in ITree.Basics.CategoryFacts]
AssocRUnit_sum_rel [in ITree.Basics.CategoryRelations]
AssocRUnit_prod_rel [in ITree.Basics.CategoryRelations]
AssocR_Product [in ITree.Basics.CategoryOps]
AssocR_Coproduct [in ITree.Basics.CategoryOps]
AssocR_prod [in ITree.Basics.CategoryRelations]
AssocR_sum [in ITree.Basics.CategoryRelations]

B

Bifunctor_Kleisli [in ITree.Basics.CategoryKleisliFacts]
Bifunctor_Fun_prod [in ITree.Basics.FunctionFacts]
Bifunctor_Product [in ITree.Basics.CategoryFacts]
Bifunctor_Coproduct [in ITree.Basics.CategoryFacts]
Bifunctor_sum_rel [in ITree.Basics.CategoryRelations]
Bifunctor_prod_rel [in ITree.Basics.CategoryRelations]
BimapCat_Fun_prod [in ITree.Basics.FunctionFacts]
BimapCat_Product [in ITree.Basics.CategoryFacts]
BimapCat_Coproduct [in ITree.Basics.CategoryFacts]
BimapCat_sum_rel [in ITree.Basics.CategoryRelations]
BimapCat_prod_rel [in ITree.Basics.CategoryRelations]
BimapId_Fun_prod [in ITree.Basics.FunctionFacts]
BimapId_Product [in ITree.Basics.CategoryFacts]
BimapId_Coproduct [in ITree.Basics.CategoryFacts]
BimapId_sum_rel [in ITree.Basics.CategoryRelations]
BimapId_prod_rel [in ITree.Basics.CategoryRelations]
BimapProper_Fun_prod [in ITree.Basics.FunctionFacts]
Bimap_Product [in ITree.Basics.CategoryOps]
Bimap_Coproduct [in ITree.Basics.CategoryOps]
bimap_cat_kleisli [in ITree.Basics.CategoryKleisliFacts]
bimap_id_kleisli [in ITree.Basics.CategoryKleisliFacts]
Bimap_prod_rel [in ITree.Basics.CategoryRelations]
Bimap_sum_rel [in ITree.Basics.CategoryRelations]
bind_Propt_Proper2 [in ITree.Extra.IForest]
bind_iforest_Proper [in ITree.Extra.IForest]
bisim_equiv [in ITree.Extra.Dijkstra.ITreeDijkstra]

C

CartesianClosed_Fun [in ITree.Basics.FunctionFacts]
CaseInl_Handler [in ITree.Interp.HandlerFacts]
CaseInl_rel [in ITree.Basics.CategoryRelations]
CaseInr_Handler [in ITree.Interp.HandlerFacts]
CaseInr_rel [in ITree.Basics.CategoryRelations]
CaseUniversal_Handler [in ITree.Interp.HandlerFacts]
CaseUniversal_rel [in ITree.Basics.CategoryRelations]
case_sum [in ITree.Basics.Function]
Case_Kleisli [in ITree.Basics.CategoryKleisli]
Case_sum1_Handler [in ITree.Interp.Handler]
Case_sum1 [in ITree.Indexed.Function]
Case_rel [in ITree.Basics.CategoryRelations]
Case_sub [in ITree.Basics.CategorySub]
CatAssoc_Kleisli [in ITree.Basics.CategoryKleisliFacts]
CatAssoc_Handler [in ITree.Interp.HandlerFacts]
CatAssoc_rel [in ITree.Basics.CategoryRelations]
Category_Kleisli [in ITree.Basics.CategoryKleisliFacts]
Category_Handler [in ITree.Interp.HandlerFacts]
Category_Fun [in ITree.Basics.FunctionFacts]
Category_rel [in ITree.Basics.CategoryRelations]
Category_sub [in ITree.Basics.CategorySub]
CatIdL_Kleisli [in ITree.Basics.CategoryKleisliFacts]
CatIdL_Handler [in ITree.Interp.HandlerFacts]
CatIdL_rel [in ITree.Basics.CategoryRelations]
CatIdR_Kleisli [in ITree.Basics.CategoryKleisliFacts]
CatIdR_Handler [in ITree.Interp.HandlerFacts]
CatIdR_rel [in ITree.Basics.CategoryRelations]
Cat_Fun [in ITree.Basics.Function]
Cat_Kleisli [in ITree.Basics.CategoryKleisli]
Cat_Handler [in ITree.Interp.Handler]
Cat_IFun [in ITree.Indexed.Function]
cat_Fun_assoc [in ITree.Basics.FunctionFacts]
cat_Fun_CatIdR [in ITree.Basics.FunctionFacts]
cat_Fun_CatIdL [in ITree.Basics.FunctionFacts]
Cat_rel [in ITree.Basics.CategoryRelations]
Cat_Op [in ITree.Basics.CategoryTheory]
Cat_sub [in ITree.Basics.CategorySub]
Coproduct_Kleisli [in ITree.Basics.CategoryKleisliFacts]
Coproduct_Handler [in ITree.Interp.HandlerFacts]
Coproduct_Fun [in ITree.Basics.FunctionFacts]
Coproduct_rel [in ITree.Basics.CategoryRelations]
Coproduct_sub [in ITree.Basics.CategorySub]
CurryApply_Fun [in ITree.Basics.FunctionFacts]
Curry_Fun [in ITree.Basics.Function]

D

DaggerFunctor_rel [in ITree.Basics.CategoryRelations]
DaggerInvolution_rel [in ITree.Basics.CategoryRelations]
DaggerLaws_rel [in ITree.Basics.CategoryRelations]
Dagger_rel [in ITree.Basics.CategoryRelations]
Dagger_Op [in ITree.Basics.CategoryTheory]
DelaySpecEq [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecEqEquiv [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecMonad [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecMonadLaws [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecMonadMorph [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecObs [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecOrder [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecOrderM [in ITree.Extra.Dijkstra.DelaySpecMonad]

E

eeq [in ITree.Basics.Function]
eeq_case_sum [in ITree.Basics.FunctionFacts]
EffectObsStateT [in ITree.Extra.Dijkstra.StateSpecT]
Embeddable_itree [in ITree.Core.Subevent]
Embeddable_forall [in ITree.Core.Subevent]
eqitF_Proper_R2 [in ITree.Eq.Eqit]
eqitF_Proper_R [in ITree.Eq.Eqit]
eqitgen_cong_eqit_eq [in ITree.Eq.Eqit]
eqitgen_cong_eqit [in ITree.Eq.Eqit]
eqit_eq_map [in ITree.Eq.Eqit]
eqit_bind [in ITree.Eq.Eqit]
eqit_subst [in ITree.Eq.Eqit]
eqit_VisF [in ITree.Eq.Eqit]
eqit_tauF [in ITree.Eq.Eqit]
eqit_observe [in ITree.Eq.Eqit]
eqit_Proper_R [in ITree.Eq.Eqit]
EqMDelay [in ITree.Extra.Dijkstra.DelaySpecMonad]
EqMTS_equiv [in ITree.Extra.Dijkstra.TracesIT]
EqM_TraceSpec [in ITree.Extra.Dijkstra.TracesIT]
Equivalence_failT_eq1 [in ITree.Events.FailFacts]
Equivalence_Kleisli_eq2 [in ITree.Basics.CategoryKleisliFacts]
Equivalence_i_pointwise [in ITree.Indexed.Relation]
Equivalence_eeq [in ITree.Basics.FunctionFacts]
Equivalence_going [in ITree.Eq.Shallow]
Equivalence_observing [in ITree.Eq.Shallow]
Equivalence_eutt_Handler [in ITree.Interp.InterpFacts]
Equivalence_eq_Handler [in ITree.Interp.InterpFacts]
Equivalence_eutt [in ITree.Eq.Eqit]
Equivalence_eqit_eq [in ITree.Eq.Eqit]
Equivalence_eqit [in ITree.Eq.Eqit]
Equivalence_sub [in ITree.Basics.CategorySub]
equiv_pred_equiv [in ITree.Basics.Basics]
equiv_pred_trans [in ITree.Basics.Basics]
equiv_pred_symm [in ITree.Basics.Basics]
equiv_pred_refl [in ITree.Basics.Basics]
eq_itree_Proper_R [in ITree.Eq.UpToTaus]
EQ_REL_Proper [in ITree.Extra.IForest]
eq_itree_interp_state [in ITree.Events.StateFacts]
eq_itree_iter [in ITree.Core.KTreeFacts]
eq_itree_interp' [in ITree.Interp.InterpFacts]
eq_itree_interp [in ITree.Interp.InterpFacts]
eq_rel_Proper [in ITree.Basics.HeterogeneousRelations]
eq_rel_Equiv [in ITree.Basics.HeterogeneousRelations]
eq_rel_Transitive [in ITree.Basics.HeterogeneousRelations]
eq_rel_Symmetric [in ITree.Basics.HeterogeneousRelations]
eq_rel_Reflexive [in ITree.Basics.HeterogeneousRelations]
eq_itree_translate [in ITree.Interp.TranslateFacts]
eq_itree_apply_IFun [in ITree.Interp.TranslateFacts]
eq_itree_translateF [in ITree.Interp.TranslateFacts]
eq_itree_translate' [in ITree.Interp.TranslateFacts]
eq_map_trans [in ITree.Events.MapDefaultFacts]
eq_map_sym [in ITree.Events.MapDefaultFacts]
eq_map_refl [in ITree.Events.MapDefaultFacts]
eq_itree_mrec [in ITree.Interp.RecursionFacts]
eq_sub_eutt [in ITree.Eq.Eqit]
eq_sub_euttge [in ITree.Eq.Eqit]
Eq1Equivalence_stateTM [in ITree.Basics.MonadState]
Eq1Equivalence_ITree [in ITree.Core.ITreeMonad]
Eq1Equivalence_Prop [in ITree.Basics.MonadProp]
Eq1_iforest [in ITree.Extra.IForest]
Eq1_stateTM [in ITree.Basics.MonadState]
Eq1_ITree [in ITree.Core.ITreeMonad]
Eq1_Prop [in ITree.Basics.MonadProp]
eq2_ktree_iter [in ITree.Core.KTreeFacts]
Eq2_Kleisli [in ITree.Basics.CategoryKleisli]
Eq2_Handler [in ITree.Interp.Handler]
Eq2_IFun [in ITree.Indexed.Function]
Eq2_rel [in ITree.Basics.CategoryRelations]
Eq2_Op [in ITree.Basics.CategoryTheory]
Eq2_sub [in ITree.Basics.CategorySub]
euttge_interp' [in ITree.Interp.InterpFacts]
euttge_interp [in ITree.Interp.InterpFacts]
euttge_interp_mrec' [in ITree.Interp.RecursionFacts]
euttge_interp_mrec [in ITree.Interp.RecursionFacts]
euttge_cong_euttge_eq [in ITree.Eq.Eqit]
euttge_cong_euttge [in ITree.Eq.Eqit]
euttge_sub_eutt [in ITree.Eq.Eqit]
euttG_cong_eq [in ITree.Eq.UpToTaus]
euttG_cong_euttge [in ITree.Eq.UpToTaus]
euttG_cong_eutt [in ITree.Eq.UpToTaus]
euttG_reflexive [in ITree.Eq.UpToTaus]
eutt_Proper_R [in ITree.Eq.UpToTaus]
eutt_cong_eutt' [in ITree.Eq.UpToTaus]
eutt_cong_eq [in ITree.Eq.UpToTaus]
eutt_cong_euttge [in ITree.Eq.UpToTaus]
eutt_cong_eutt [in ITree.Eq.UpToTaus]
eutt_EQ_REL_Proper [in ITree.Extra.IForest]
eutt_interp_state_eq [in ITree.Events.StateFacts]
eutt_interp_state [in ITree.Events.StateFacts]
eutt_iter [in ITree.Core.KTreeFacts]
eutt_proper_all_infinite [in ITree.Props.Infinite]
eutt_proper_con_converge [in ITree.Props.Infinite]
eutt_interp' [in ITree.Interp.InterpFacts]
eutt_interp [in ITree.Interp.InterpFacts]
eutt_translate' [in ITree.Interp.TranslateFacts]
eutt_translate [in ITree.Interp.TranslateFacts]
eutt_apply_IFun [in ITree.Interp.TranslateFacts]
eutt_Proper_R [in ITree.Eq.Eqit]

F

failT_Eq1 [in ITree.Events.FailFacts]
failT_iter [in ITree.Events.FailFacts]
failT_monad [in ITree.Events.FailFacts]
failT_fun [in ITree.Events.FailFacts]
front_and_last_proper_eutt [in ITree.Extra.ITrace.ITracePreds]
Fst_Fun [in ITree.Basics.Function]
Fst_rel [in ITree.Basics.CategoryRelations]
Functor_iforest [in ITree.Extra.IForest]
Functor_pure [in ITree.Basics.CategoryKleisliFacts]
Functor_itree [in ITree.Core.ITreeDefinition]
Functor_unsubm [in ITree.Basics.CategorySub]

G

geuttgen_cong_eq_secure_eqit [in ITree.Extra.Secure.SecureEqProgInsens]
geuttgen_cong_secure_eqit [in ITree.Extra.Secure.SecureEqProgInsens]
geuttgen_cong_secure_eqit' [in ITree.Extra.Secure.SecureEqWcompat]
geuttgen_cong_secure_eqit [in ITree.Extra.Secure.SecureEqWcompat]
geuttgen_cong_eqit_eq [in ITree.Eq.Eqit]
geuttgen_cong_eqit [in ITree.Eq.Eqit]
geuttge_cong_euttge_eq [in ITree.Eq.Eqit]
geuttge_cong_euttge [in ITree.Eq.Eqit]
geuttG_cong_eq [in ITree.Eq.UpToTaus]
geuttG_cong_euttge [in ITree.Eq.UpToTaus]
geutt_eq_cong_euttge [in ITree.Extra.Secure.SecureEqWcompat]
geutt_cong_euttge [in ITree.Extra.Secure.SecureEqWcompat]
geutt_cong_euttge_eq [in ITree.Eq.Eqit]
geutt_cong_euttge [in ITree.Eq.Eqit]
going_go [in ITree.Eq.Shallow]
grutt_cong_euttge [in ITree.Eq.Rutt]
grutt_cong_eqit [in ITree.Eq.Rutt]

H

has_post_eutt [in ITree.Props.HasPost]
has_post_eq_itree [in ITree.Props.HasPost]

I

Id_Fun [in ITree.Basics.Function]
Id_Kleisli [in ITree.Basics.CategoryKleisli]
Id_Handler [in ITree.Interp.Handler]
Id_IFun [in ITree.Indexed.Function]
Id_rel [in ITree.Basics.CategoryRelations]
Id_Op [in ITree.Basics.CategoryTheory]
Id_sub [in ITree.Basics.CategorySub]
InitialObject_Kleisli [in ITree.Basics.CategoryKleisliFacts]
InitialObject_Handler [in ITree.Interp.HandlerFacts]
InitialObject_void [in ITree.Basics.FunctionFacts]
InitialObject_rel [in ITree.Basics.CategoryRelations]
Initial_void [in ITree.Basics.Function]
Initial_Kleisli [in ITree.Basics.CategoryKleisli]
Initial_void1_Handler [in ITree.Interp.Handler]
Initial_void1 [in ITree.Indexed.Function]
Initial_rel [in ITree.Basics.CategoryRelations]
Inl_Kleisli [in ITree.Basics.CategoryKleisli]
Inl_sum1_Handler [in ITree.Interp.Handler]
Inl_sum1 [in ITree.Indexed.Function]
Inl_rel [in ITree.Basics.CategoryRelations]
Inl_sub [in ITree.Basics.CategorySub]
Inr_Kleisli [in ITree.Basics.CategoryKleisli]
Inr_sum1_Handler [in ITree.Interp.Handler]
Inr_sum1 [in ITree.Indexed.Function]
Inr_rel [in ITree.Basics.CategoryRelations]
Inr_sub [in ITree.Basics.CategorySub]
interp_fail_eutt_eq [in ITree.Events.FailFacts]
interp_fail_eutt [in ITree.Events.FailFacts]
interp_fail_eq_itree_eq [in ITree.Events.FailFacts]
interp_fail_eq_itree [in ITree.Events.FailFacts]
interp_iforest_Proper_eq [in ITree.Extra.IForest]
interp_iforest_Proper3 [in ITree.Extra.IForest]
interp_iforest_Proper2 [in ITree.Extra.IForest]
interp_iforest_Proper [in ITree.Extra.IForest]
interp_iforestF_Proper [in ITree.Extra.IForest]
interp_map_proper [in ITree.Events.MapDefaultFacts]
Iso_UnitR_sum_rel [in ITree.Basics.CategoryRelations]
Iso_UnitL_sum_rel [in ITree.Basics.CategoryRelations]
Iso_Assoc_sum_rel [in ITree.Basics.CategoryRelations]
Iso_UnitR_prod_rel [in ITree.Basics.CategoryRelations]
Iso_UnitL_prod_rel [in ITree.Basics.CategoryRelations]
Iso_Assoc_prod_rel [in ITree.Basics.CategoryRelations]
Iterative_ktree [in ITree.Core.KTreeFacts]
Iterative_Handler [in ITree.Interp.HandlerFacts]
Iterative_stateTM [in ITree.Basics.MonadState]
Iterative_Prop [in ITree.Basics.MonadProp]
Iterative_sub [in ITree.Basics.CategorySub]
IterCodiagonal_ktree [in ITree.Core.KTreeFacts]
IterCodiagonal_Handler [in ITree.Interp.HandlerFacts]
IterCodiagonal_stateTM [in ITree.Basics.MonadState]
IterCodiagonal_stateTM [in ITree.Basics.MonadProp]
IterDinatural_ktree [in ITree.Core.KTreeFacts]
IterDinatural_Handler [in ITree.Interp.HandlerFacts]
IterDinatural_stateTM [in ITree.Basics.MonadState]
IterDinatural_Prop [in ITree.Basics.MonadProp]
IterNatural_ktree [in ITree.Core.KTreeFacts]
IterNatural_Handler [in ITree.Interp.HandlerFacts]
IterNatural_stateTM [in ITree.Basics.MonadState]
IterNatural_Prop [in ITree.Basics.MonadProp]
IterUnfold_ktree [in ITree.Core.KTreeFacts]
IterUnfold_Handler [in ITree.Interp.HandlerFacts]
IterUnfold_stateTM [in ITree.Basics.MonadState]
IterUnfold_Prop [in ITree.Basics.MonadProp]
Iter_Kleisli [in ITree.Basics.CategoryKleisli]
Iter_Handler [in ITree.Interp.Handler]
Iter_stateTM [in ITree.Basics.MonadState]
Iter_sub [in ITree.Basics.CategorySub]
itrace_eq [in ITree.Extra.ITrace.ITraceDefinition]
ItreeSpecEq [in ITree.Extra.Dijkstra.ITreeDijkstra]
ItreeSpecEquiv [in ITree.Extra.Dijkstra.ITreeDijkstra]
ItreeSpecMonad [in ITree.Extra.Dijkstra.ITreeDijkstra]

L

Leaf_eutt [in ITree.Props.Leaf]

M

MonadDelay [in ITree.Extra.Dijkstra.DelaySpecMonad]
MonadIterDelay [in ITree.Extra.Dijkstra.DelaySpecMonad]
MonadIter_iforest [in ITree.Extra.IForest]
MonadIter_Prop [in ITree.Basics.Basics]
MonadIter_eitherT [in ITree.Basics.Basics]
MonadIter_optionT [in ITree.Basics.Basics]
MonadIter_readerT [in ITree.Basics.Basics]
MonadIter_stateT0 [in ITree.Basics.Basics]
MonadIter_stateT [in ITree.Basics.Basics]
MonadIter_itree [in ITree.Core.ITreeDefinition]
MonadLawsE_stateTM [in ITree.Basics.MonadState]
MonadLawsE_ITree [in ITree.Core.ITreeMonad]
MonadLawsE_Prop [in ITree.Basics.MonadProp]
MonadLaws_failE [in ITree.Events.FailFacts]
MonadMorphimStateT [in ITree.Extra.Dijkstra.StateSpecT]
Monads.Functor_stateT [in ITree.Basics.Basics]
Monads.Monad_stateT [in ITree.Basics.Basics]
Monad_iforest [in ITree.Extra.IForest]
Monad_Prop [in ITree.Basics.MonadProp]
Monad_itree [in ITree.Core.ITreeDefinition]
Monoidal_Product [in ITree.Basics.CategoryFacts]
Monoidal_Coproduct [in ITree.Basics.CategoryFacts]
Monoidal_sum_rel [in ITree.Basics.CategoryRelations]
Monoidal_prod_rel [in ITree.Basics.CategoryRelations]
monotonic_going [in ITree.Eq.Shallow]
monotonic_observing [in ITree.Eq.Shallow]

O

observing_bind [in ITree.Eq.Shallow]
observing_go [in ITree.Eq.Shallow]
observing_observe_ [in ITree.Eq.Shallow]
observing_sub_eqit [in ITree.Eq.Eqit]

P

PairFst_Fun [in ITree.Basics.FunctionFacts]
PairFst_rel [in ITree.Basics.CategoryRelations]
PairSnd_Fun [in ITree.Basics.FunctionFacts]
PairSnd_rel [in ITree.Basics.CategoryRelations]
PairUniversal_Fun [in ITree.Basics.FunctionFacts]
PairUniversal_rel [in ITree.Basics.CategoryRelations]
Pair_Fun [in ITree.Basics.Function]
Pair_rel [in ITree.Basics.CategoryRelations]
pi_eqit_secure_eutt_proper [in ITree.Extra.Secure.SecureEqProgInsens]
pi_eqit_secure_eq_itree_proper [in ITree.Extra.Secure.SecureEqProgInsens]
Product_Fun [in ITree.Basics.FunctionFacts]
Product_rel [in ITree.Basics.CategoryRelations]
prod_rel_PER [in ITree.Basics.HeterogeneousRelations]
prod_rel_eqv [in ITree.Basics.HeterogeneousRelations]
prod_rel_trans [in ITree.Basics.HeterogeneousRelations]
prod_rel_sym [in ITree.Basics.HeterogeneousRelations]
prod_rel_refl [in ITree.Basics.HeterogeneousRelations]
ProperCat_rel [in ITree.Basics.CategoryRelations]
proper_eutt_spec_in [in ITree.Extra.Dijkstra.TracesIT]
proper_eutt_peel_cont [in ITree.Extra.ITrace.ITraceBind]
proper_eutt_peel [in ITree.Extra.ITrace.ITraceBind]
proper_eqitree_throw_prefix [in ITree.Events.ExceptionFacts]
proper_eutt_try_catch [in ITree.Events.ExceptionFacts]
proper_eqitree_try_catch [in ITree.Events.ExceptionFacts]
proper_bimap_kleisli [in ITree.Basics.CategoryKleisliFacts]
Proper_pure [in ITree.Basics.CategoryKleisliFacts]
Proper_case_Kleisli [in ITree.Basics.CategoryKleisliFacts]
Proper_cat_Kleisli [in ITree.Basics.CategoryKleisliFacts]
Proper_Kleisli_apply [in ITree.Basics.CategoryKleisliFacts]
Proper_sutt [in ITree.Eq.SimUpToTaus]
proper_eutt_equivE [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_eutt_equivE_imp [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_eventless [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_eventless_imp [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_bisim_inf [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_bisim_inf_imp [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_bisim_app [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_itree_spec [in ITree.Extra.Dijkstra.ITreeDijkstra]
proper_noret_cast [in ITree.Props.EuttNoRet]
proper_euttNoRet [in ITree.Props.EuttNoRet]
Proper_Iter_Handler [in ITree.Interp.HandlerFacts]
Proper_Case_Handler [in ITree.Interp.HandlerFacts]
Proper_Cat_Handler [in ITree.Interp.HandlerFacts]
Proper_Iter_stateTM [in ITree.Basics.MonadState]
Proper_pair_Fun [in ITree.Basics.FunctionFacts]
Proper_cat [in ITree.Basics.FunctionFacts]
proper_terminate [in ITree.Extra.Secure.SecureStateHandler]
proper_diverges_with_r [in ITree.Extra.Secure.SecureStateHandler]
proper_diverges_with [in ITree.Extra.Secure.SecureStateHandler]
proper_append [in ITree.Extra.ITrace.ITraceFacts]
Proper_loop [in ITree.Basics.CategoryFacts]
Proper_Bimap_Product [in ITree.Basics.CategoryFacts]
Proper_Bimap_Coproduct [in ITree.Basics.CategoryFacts]
Proper_pair_rel [in ITree.Basics.CategoryRelations]
Proper_Case_rel [in ITree.Basics.CategoryRelations]
Proper_sum_rel [in ITree.Basics.HeterogeneousRelations]
Proper_prod_rel [in ITree.Basics.HeterogeneousRelations]
Proper_transpose [in ITree.Basics.HeterogeneousRelations]
Proper_compose [in ITree.Basics.HeterogeneousRelations]
Proper_relation [in ITree.Basics.HeterogeneousRelations]
proper_eqit_secure_eqit_secure [in ITree.Extra.Secure.SecureEqEuttHalt]
proper_eqit_secure_eqit [in ITree.Extra.Secure.SecureEqEuttHalt]
Proper_handle_map [in ITree.Events.MapDefaultFacts]
Proper_apply_IFun [in ITree.Indexed.FunctionFacts]
Proper_Iter_stateTM [in ITree.Basics.MonadProp]
Proper_interp_mrec [in ITree.Interp.RecursionFacts]
Proper_unsubm [in ITree.Basics.CategorySub]
Proper_subm [in ITree.Basics.CategorySub]
PureITreeEffectObs [in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeMorph [in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureItreeOrder [in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeOrderM [in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeSpecEq [in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureItreeSpecLaws [in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureItreeSpecMonad [in ITree.Extra.Dijkstra.PureITreeDijkstra]

R

Reflexive_failT_eq1 [in ITree.Events.FailFacts]
Reflexive_i_pointwise [in ITree.Indexed.Relation]
Reflexive_eqit_eq [in ITree.Eq.Eqit]
Reflexive_eqit_gen_eq [in ITree.Eq.Eqit]
Reflexive_eqit__eq [in ITree.Eq.Eqit]
Reflexive_eqitF_eq [in ITree.Eq.Eqit]
Reflexive_eqit [in ITree.Eq.Eqit]
Reflexive_eqit_gen [in ITree.Eq.Eqit]
Reflexive_eqit_ [in ITree.Eq.Eqit]
Reflexive_eqitF [in ITree.Eq.Eqit]
relationH_Equiv [in ITree.Basics.HeterogeneousRelations]
relationH_Preorder [in ITree.Basics.HeterogeneousRelations]
relationH_PER [in ITree.Basics.HeterogeneousRelations]
relationH_transitive [in ITree.Basics.HeterogeneousRelations]
relationH_symmetric [in ITree.Basics.HeterogeneousRelations]
relationH_reflexive [in ITree.Basics.HeterogeneousRelations]
RelDec_string_Correct [in ITree.Extra.Dijkstra.StateIOTrace]
RelDec_string [in ITree.Extra.Dijkstra.StateIOTrace]
ReSum_empty [in ITree.Basics.CategoryOps]
ReSum_inr [in ITree.Basics.CategoryOps]
ReSum_inl [in ITree.Basics.CategoryOps]
ReSum_sum [in ITree.Basics.CategoryOps]
ReSum_id [in ITree.Basics.CategoryOps]
Returns_eutt [in ITree.Extra.IForest]

S

SemiIso_Bimap [in ITree.Basics.CategoryFacts]
SemiIso_Cat [in ITree.Basics.CategoryFacts]
SemiIso_Id [in ITree.Basics.CategoryFacts]
SimpleTheory.Equivalence_eutt [in ITree.Simple]
SimpleTheory.eutt_interp [in ITree.Simple]
SimpleTheory.eutt_map [in ITree.Simple]
SimpleTheory.eutt_bind [in ITree.Simple]
SimpleTheory.eutt_VisF [in ITree.Simple]
SimpleTheory.eutt_TauF [in ITree.Simple]
SimpleTheory.eutt_observe [in ITree.Simple]
SimpleTheory.eutt_go [in ITree.Simple]
Simple.Equivalence_eutt [in ITree.Simple]
Simple.eutt_interp [in ITree.Simple]
Simple.eutt_map [in ITree.Simple]
Simple.eutt_bind [in ITree.Simple]
Simple.eutt_VisF [in ITree.Simple]
Simple.eutt_TauF [in ITree.Simple]
Simple.eutt_observe [in ITree.Simple]
Simple.eutt_go [in ITree.Simple]
Snd_Fun [in ITree.Basics.Function]
Snd_rel [in ITree.Basics.CategoryRelations]
StateIter [in ITree.Extra.Dijkstra.StateSpecT]
StateSpecTEq [in ITree.Extra.Dijkstra.StateSpecT]
StateSpecTMonadLaws [in ITree.Extra.Dijkstra.StateSpecT]
StateSpecTOrder [in ITree.Extra.Dijkstra.StateSpecT]
StateSpecTOrderedLaws [in ITree.Extra.Dijkstra.StateSpecT]
state_machine_proper_eutt [in ITree.Extra.ITrace.ITracePreds]
strong_bisim_proper_paco [in ITree.Extra.Secure.StrongBisimProper]
subrelation_i_pointwise_i_respectful [in ITree.Indexed.Relation]
subrelation_eeq_eqeq [in ITree.Basics.FunctionFacts]
sum_inr [in ITree.Basics.Function]
sum_inl [in ITree.Basics.Function]
sum_rel_eqv [in ITree.Basics.HeterogeneousRelations]
sum_rel_trans [in ITree.Basics.HeterogeneousRelations]
sum_rel_sym [in ITree.Basics.HeterogeneousRelations]
sum_rel_refl [in ITree.Basics.HeterogeneousRelations]
SwapAssocL_Product [in ITree.Basics.CategoryFacts]
SwapAssocL_Coproduct [in ITree.Basics.CategoryFacts]
SwapAssocR_Product [in ITree.Basics.CategoryFacts]
SwapAssocR_Coproduct [in ITree.Basics.CategoryFacts]
SwapInvolutive_Product [in ITree.Basics.CategoryFacts]
SwapInvolutive_Coproduct [in ITree.Basics.CategoryFacts]
SwapUnitL_Product [in ITree.Basics.CategoryFacts]
SwapUnitL_Coproduct [in ITree.Basics.CategoryFacts]
Swap_Product [in ITree.Basics.CategoryOps]
Swap_Coproduct [in ITree.Basics.CategoryOps]
Symmetric_failT_eq1 [in ITree.Events.FailFacts]
Symmetric_i_pointwise [in ITree.Indexed.Relation]
Symmetric_eqit_eq [in ITree.Eq.Eqit]
Symmetric_eqit__eq [in ITree.Eq.Eqit]
Symmetric_eqitF_eq [in ITree.Eq.Eqit]
Symmetric_eqit [in ITree.Eq.Eqit]
Symmetric_eqit_ [in ITree.Eq.Eqit]
Symmetric_eqitF [in ITree.Eq.Eqit]
Symmetric_bot2 [in ITree.Eq.Eqit]
SymMonoidal_Product [in ITree.Basics.CategoryFacts]
SymMonoidal_Coproduct [in ITree.Basics.CategoryFacts]

T

TerminalObject_unit [in ITree.Basics.FunctionFacts]
Terminal_unit [in ITree.Basics.Function]
TraceSpecMonad [in ITree.Extra.Dijkstra.TracesIT]
TraceSpecMonadLaws [in ITree.Extra.Dijkstra.TracesIT]
TraceSpecMorph [in ITree.Extra.Dijkstra.TracesIT]
TraceSpecObs [in ITree.Extra.Dijkstra.TracesIT]
TraceSpecOrder [in ITree.Extra.Dijkstra.TracesIT]
TraceSpecOrderLaws [in ITree.Extra.Dijkstra.TracesIT]
trace_prefix_proper [in ITree.Extra.ITrace.ITracePrefix]
trace_refine_proper [in ITree.Extra.ITrace.ITraceFacts]
trace_forall_proper_eutt [in ITree.Extra.ITrace.ITracePreds]
Transitive_failT_eq1 [in ITree.Events.FailFacts]
Transitive_i_pointwise [in ITree.Indexed.Relation]
Transitive_eutt [in ITree.Eq.Eqit]
Transitive_eqit_eq [in ITree.Eq.Eqit]
Transitive_eqit [in ITree.Eq.Eqit]
Transitive_bot2 [in ITree.Eq.Eqit]
transpose_Proper [in ITree.Basics.HeterogeneousRelations]
transpose_Transitive [in ITree.Basics.HeterogeneousRelations]
transpose_Symmetric [in ITree.Basics.HeterogeneousRelations]
transpose_Reflexive [in ITree.Basics.HeterogeneousRelations]

U

UnitLEpi_Product [in ITree.Basics.CategoryFacts]
UnitLEpi_Coproduct [in ITree.Basics.CategoryFacts]
UnitLMono_Product [in ITree.Basics.CategoryFacts]
UnitLMono_Coproduct [in ITree.Basics.CategoryFacts]
UnitLNatural_Product [in ITree.Basics.CategoryFacts]
UnitLNatural_Coproduct [in ITree.Basics.CategoryFacts]
UnitLNatural_sum_rel [in ITree.Basics.CategoryRelations]
UnitLNatural_prod_rel [in ITree.Basics.CategoryRelations]
UnitL_Product [in ITree.Basics.CategoryOps]
UnitL_Coproduct [in ITree.Basics.CategoryOps]
UnitL_prod [in ITree.Basics.CategoryRelations]
UnitL_sum [in ITree.Basics.CategoryRelations]
UnitL'Natural_Product [in ITree.Basics.CategoryFacts]
UnitL'Natural_Coproduct [in ITree.Basics.CategoryFacts]
UnitL'Natural_sum_rel [in ITree.Basics.CategoryRelations]
UnitL'Natural_prod_rel [in ITree.Basics.CategoryRelations]
UnitL'_Product [in ITree.Basics.CategoryOps]
UnitL'_Coproduct [in ITree.Basics.CategoryOps]
UnitL'_prod [in ITree.Basics.CategoryRelations]
UnitL'_sum [in ITree.Basics.CategoryRelations]
UnitREpi_Product [in ITree.Basics.CategoryFacts]
UnitREpi_Coproduct [in ITree.Basics.CategoryFacts]
UnitRMono_Product [in ITree.Basics.CategoryFacts]
UnitRMono_Coproduct [in ITree.Basics.CategoryFacts]
UnitR_Product [in ITree.Basics.CategoryOps]
UnitR_Coproduct [in ITree.Basics.CategoryOps]
UnitR_prod [in ITree.Basics.CategoryRelations]
UnitR_sum [in ITree.Basics.CategoryRelations]
UnitR'_Product [in ITree.Basics.CategoryOps]
UnitR'_Coproduct [in ITree.Basics.CategoryOps]
UnitR'_prod [in ITree.Basics.CategoryRelations]
UnitR'_sum [in ITree.Basics.CategoryRelations]

---

Section Index

B

BasicFacts [in ITree.Basics.CategoryKleisliFacts]
BifunctorFacts [in ITree.Basics.CategoryFacts]
BifunctorLaws [in ITree.Basics.CategoryTheory]

C

CartesianClosed [in ITree.Basics.CategoryOps]
CartesianClosure [in ITree.Basics.FunctionFacts]
CartesianClosureLaws [in ITree.Basics.CategoryTheory]
CartesianConstruct [in ITree.Basics.CategoryOps]
CategoryFacts [in ITree.Basics.CategoryFacts]
CatLaws [in ITree.Basics.CategoryTheory]
CatOps [in ITree.Basics.CategoryOps]
CocartesianConstruct [in ITree.Basics.CategoryOps]
CocartesianOps [in ITree.Basics.CategoryOps]
CoproductFacts [in ITree.Basics.CategoryFacts]
CoproductLaws [in ITree.Basics.CategoryTheory]

D

Dagger [in ITree.Basics.CategoryOps]
DaggerLaws [in ITree.Basics.CategoryTheory]
Determinize [in ITree.Extra.ITrace.ITraceFacts]
DijkstraMonad [in ITree.Extra.Dijkstra.DijkstraMonad]

E

EffectObservation [in ITree.Extra.Dijkstra.DijkstraMonad]
eff_hom_e [in ITree.Events.State]
eqit [in ITree.Eq.Eqit]
eqit_h [in ITree.Eq.Eqit]
eqit_inv [in ITree.Eq.Eqit]
eqit_eq [in ITree.Eq.Eqit]
eqit_gen [in ITree.Eq.Eqit]
eqit_closure [in ITree.Eq.Eqit]
EUTTG [in ITree.Eq.UpToTaus]
euttge_trans_clo [in ITree.Eq.Rutt]
EUTTG_principles [in ITree.Eq.UpToTaus]
EUTTG_Properties2 [in ITree.Eq.UpToTaus]
EUTTG_Properties1 [in ITree.Eq.UpToTaus]

F

Facts [in ITree.Basics.CategoryRelations]
Facts [in ITree.Interp.RecursionFacts]
Facts.BifunctorProd [in ITree.Basics.CategoryRelations]
Facts.BifunctorSum [in ITree.Basics.CategoryRelations]
Facts.CategoryRel [in ITree.Basics.CategoryRelations]
Facts.CoproductRel [in ITree.Basics.CategoryRelations]
Facts.DaggerRel [in ITree.Basics.CategoryRelations]
Facts.ProductRel [in ITree.Basics.CategoryRelations]
FailT [in ITree.Events.FailFacts]
FailTLaws [in ITree.Events.FailFacts]
Functor [in ITree.Basics.CategoryFunctor]
FunctorId [in ITree.Basics.CategoryFunctor]

G

GeneralStateHandler [in ITree.Extra.Secure.SecureStateHandler]
GeneralStateHandler [in ITree.Extra.Secure.SecureStateHandlerPi]
going_relations [in ITree.Eq.Shallow]

H

HandlerCategory [in ITree.Interp.HandlerFacts]
HandlerCategory.DinatSimulation [in ITree.Interp.HandlerFacts]

I

Instances [in ITree.Basics.CategoryKleisli]
interp_prop [in ITree.Events.State]
IsoFacts [in ITree.Basics.CategoryFacts]
IsoFacts.IsoBimap [in ITree.Basics.CategoryFacts]
IsoFacts.IsoCat [in ITree.Basics.CategoryFacts]
Iteration [in ITree.Basics.CategoryOps]
IterationLaws [in ITree.Basics.CategoryTheory]
IterRel [in ITree.Extra.Dijkstra.IterRel]
itree [in ITree.Core.ITreeDefinition]
ITreeDijkstra [in ITree.Extra.Dijkstra.ITreeDijkstra]

K

KTreeIterative [in ITree.Core.KTreeFacts]

L

Laws [in ITree.Basics.Monad]
LeafBind [in ITree.Props.Leaf]
LoopInvarSpecific [in ITree.Extra.Dijkstra.StateSpecT]

M

Map [in ITree.Events.Map]
Map [in ITree.Events.MapDefault]
MapFacts [in ITree.Events.MapDefaultFacts]
MapFacts.Relations [in ITree.Events.MapDefaultFacts]
MonoidalLaws [in ITree.Basics.CategoryTheory]

N

NonDetExample [in ITree.Extra.Dijkstra.TracesIT]

O

observing_relations [in ITree.Eq.Shallow]
Operations [in ITree.Core.KTree]
Operations [in ITree.Basics.CategoryRelations]
OppositeCat [in ITree.Basics.CategoryTheory]
OrderedMonad [in ITree.Extra.Dijkstra.DijkstraMonad]

P

Peel [in ITree.Extra.ITrace.ITraceBind]
PrintMults [in ITree.Extra.Dijkstra.StateIOTrace]
ProdRelFacts [in ITree.Basics.HeterogeneousRelations]
ProdRelFacts.Equivalence [in ITree.Basics.HeterogeneousRelations]
ProductFacts [in ITree.Basics.CategoryFacts]
ProductLaws [in ITree.Basics.CategoryTheory]
Products [in ITree.Basics.FunctionFacts]
prop [in ITree.Basics.MonadProp]
PureITree [in ITree.Extra.Dijkstra.PureITreeDijkstra]

R

Reader [in ITree.Events.Reader]
RelationCompose [in ITree.Basics.HeterogeneousRelations]
RelationEqRel [in ITree.Basics.HeterogeneousRelations]
RelationH_Operations [in ITree.Basics.HeterogeneousRelations]
RESUM [in ITree.Basics.CategoryOps]
RetBindCounter [in ITree.Extra.Dijkstra.ITreeDijkstra]
ReturnsBind [in ITree.Extra.IForest]
RuttF [in ITree.Eq.Rutt]

S

SecureProgInsens [in ITree.Extra.Secure.SecureEqProgInsens]
SecureUntimed [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SecureUntimed [in ITree.Extra.Secure.SecureEqHalt]
SecureUntimedUnReflexive [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SecureUntimedUnReflexive [in ITree.Extra.Secure.SecureEqHalt]
SecureUntimedUnReflexive.eqit_secureC [in ITree.Extra.Secure.SecureEqHaltProgInsens]
SecureUntimedUnReflexive.eqit_secureC [in ITree.Extra.Secure.SecureEqHalt]
SemiIso [in ITree.Basics.CategoryTheory]
SimpleTheory.EquivalenceUpToTaus [in ITree.Simple]
Simple.EquivalenceUpToTaus [in ITree.Simple]
SpecMonad [in ITree.Extra.Dijkstra.DijkstraMonad]
State [in ITree.Basics.MonadState]
State [in ITree.Events.State]
StateDelaySpec [in ITree.Extra.Dijkstra.StateDelaySpec]
StateMachine [in ITree.Extra.ITrace.ITracePreds]
StateSpecT [in ITree.Extra.Dijkstra.StateSpecT]
StateSpecT.Observation [in ITree.Extra.Dijkstra.StateSpecT]
Subcategory [in ITree.Basics.CategorySub]
Subcategory.Bimap [in ITree.Basics.CategorySub]
Subcategory.CatLaws [in ITree.Basics.CategorySub]
Subcategory.CoproductLaws [in ITree.Basics.CategorySub]
SubRelationH [in ITree.Basics.HeterogeneousRelations]
SumRelFacts [in ITree.Basics.HeterogeneousRelations]
SumRelFacts.Equivalence [in ITree.Basics.HeterogeneousRelations]
SUTT [in ITree.Eq.SimUpToTaus]
SUTT_facts [in ITree.Eq.SimUpToTaus]
SUTT_rel [in ITree.Eq.SimUpToTaus]
SymmetricLaws [in ITree.Basics.CategoryTheory]

T

TracedIterativeFacts [in ITree.Basics.CategoryFacts]
TraceSpec [in ITree.Extra.Dijkstra.TracesIT]
TranslateFacts [in ITree.Interp.TranslateFacts]
TransposeFacts [in ITree.Basics.HeterogeneousRelations]

---

Abbreviation Index

A

AssocIso [in ITree.Basics.CategoryTheory]
assoc_l_ [in ITree.Basics.CategoryOps]
assoc_r_ [in ITree.Basics.CategoryOps]

B

bind_ [in ITree.Eq.Eqit]

C

Carrier.binop [in ITree.Basics.CategoryOps]
Carrier.Hom [in ITree.Basics.CategoryOps]
case__ [in ITree.Basics.CategoryOps]
Counterexamples.fail [in ITree.Props.Finite]

E

endo [in ITree.Interp.Recursion]
eqit [in ITree.Eq.Eqit]
eqit__ [in ITree.Eq.Eqit]
euttG [in ITree.Eq.UpToTaus]
euttG [in ITree.Eq.UpToTaus]
euttG [in ITree.Eq.UpToTaus]

I

inl_case [in ITree.Basics.CategoryTheory]
inr_case [in ITree.Basics.CategoryTheory]
itree' [in ITree.Core.ITreeDefinition]
ITree.on_left [in ITree.Core.ITreeDefinition]

K

ktree [in ITree.Core.KTree]
ktree [in ITree.Core.KTree]
ktree_apply [in ITree.Core.KTree]

L

lift_ktree_ [in ITree.Core.KTree]
lift_ktree [in ITree.Core.KTree]

P

pair__ [in ITree.Basics.CategoryOps]
Proper_iter [in ITree.Basics.CategoryKleisliFacts]

R

resp_eutt [in ITree.Extra.Dijkstra.PureITreeBasics]
Ret [in ITree.Core.ITreeDefinition]

S

spin [in ITree.Extra.Dijkstra.PureITreeBasics]
stateiotree [in ITree.Extra.Dijkstra.StateIOTrace]
stream' [in ITree.Extra.Dijkstra.ITreeDijkstra]
Subevent [in ITree.Core.Subevent]
SwapInvolutive [in ITree.Basics.CategoryTheory]
swap_ [in ITree.Basics.CategoryOps]

T

Tau [in ITree.Core.ITreeDefinition]
trigger [in ITree.Core.Subevent]

U

unique_terminal [in ITree.Basics.CategoryTheory]
unique_initial [in ITree.Basics.CategoryTheory]
UnitLIso [in ITree.Basics.CategoryTheory]
UnitRIso [in ITree.Basics.CategoryTheory]
unit_r'_ [in ITree.Basics.CategoryOps]
unit_r_ [in ITree.Basics.CategoryOps]
unit_l'_ [in ITree.Basics.CategoryOps]
unit_l_ [in ITree.Basics.CategoryOps]

V

vis [in ITree.Core.Subevent]
Vis [in ITree.Core.ITreeDefinition]
void [in ITree.Basics.Basics]

---

Definition Index

A

add [in ITree.Extra.Dijkstra.StateIOTrace]
agrees_itree [in ITree.Extra.IForest]
all_infinite [in ITree.Props.Infinite]
all_infinite_ [in ITree.Props.Infinite]
amonot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
any_infinite [in ITree.Props.Infinite]
any_infinite_ [in ITree.Props.Infinite]
app [in ITree.Extra.Dijkstra.ITreeDijkstra]
append [in ITree.Extra.ITrace.ITraceDefinition]
apply_Fun [in ITree.Basics.Function]
apply_IFun' [in ITree.Indexed.Function]
apply_IFun [in ITree.Indexed.Function]
app_trace [in ITree.Interp.Traces]
app' [in ITree.Extra.Dijkstra.ITreeDijkstra]
ask [in ITree.Events.Reader]
as_IFun [in ITree.Indexed.Function]

B

Bimap_sub [in ITree.Basics.CategorySub]
bindC [in ITree.Eq.UpToTaus]
bindpi [in ITree.Extra.Dijkstra.PureITreeDijkstra]
bind_ts1 [in ITree.Extra.Dijkstra.TracesIT]
bind_ts1_all [in ITree.Extra.Dijkstra.TracesIT]
BIND_BIND_COUNTEREXAMPLE.t [in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.KC [in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.KB [in ITree.Extra.IForest]
BIND_BIND_COUNTEREXAMPLE.PA [in ITree.Extra.IForest]
bind_stronger [in ITree.Extra.IForest]
bind_iforest' [in ITree.Extra.IForest]
bind_iforest_stronger [in ITree.Extra.IForest]
bind_iforest [in ITree.Extra.IForest]
bind_ex [in ITree.Extra.Dijkstra.ITreeDijkstra]
bind_traces [in ITree.Interp.Traces]
bind_del [in ITree.Extra.Dijkstra.DelaySpecMonad]
bisim [in ITree.Extra.Dijkstra.ITreeDijkstra]
bisim_ [in ITree.Extra.Dijkstra.ITreeDijkstra]
burn [in ITree.Core.ITreeDefinition]

C

call [in ITree.Interp.Recursion]
calling [in ITree.Interp.Recursion]
calling' [in ITree.Interp.Recursion]
case_sum1 [in ITree.Indexed.Function]
choice [in ITree.Axioms]
choose [in ITree.Events.Nondeterminism]
choose1 [in ITree.Events.Nondeterminism]
classic [in ITree.Axioms]
classic_empty [in ITree.Extra.Secure.SecureEqEuttHalt]
Cons [in ITree.Extra.Dijkstra.ITreeDijkstra]
Counterexamples.k [in ITree.Props.Finite]
Counterexamples.t [in ITree.Props.Finite]

D

decide_ex_post [in ITree.Extra.Dijkstra.TracesIT]
decide_ex_pre [in ITree.Extra.Dijkstra.TracesIT]
decide_ex [in ITree.Extra.Dijkstra.TracesIT]
decurry_flip [in ITree.Extra.Dijkstra.StateSpecT]
Delay [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelayIn [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpec [in ITree.Extra.Dijkstra.DelaySpecMonad]
DelaySpecInput [in ITree.Extra.Dijkstra.DelaySpecMonad]
dep [in ITree.Events.Dependent]
determinize [in ITree.Extra.ITrace.ITraceFacts]
determinize_ [in ITree.Extra.ITrace.ITraceFacts]
diagonal_prop [in ITree.Basics.HeterogeneousRelations]
DijkstraMonad [in ITree.Extra.Dijkstra.DijkstraMonad]
DijkstraProp [in ITree.Extra.Dijkstra.DijkstraMonad]
divergent [in ITree.Extra.IForest]
divergent_cont [in ITree.Extra.IForest]
diverges_with [in ITree.Extra.Secure.SecureStateHandler]
diverges_with_ [in ITree.Extra.Secure.SecureStateHandler]
div_spec [in ITree.Extra.Dijkstra.PureITreeDijkstra]
dmonot [in ITree.Extra.Dijkstra.PureITreeDijkstra]
DynPrePost [in ITree.Extra.Dijkstra.StateDelaySpec]
DynPrePostListRef [in ITree.Extra.Dijkstra.StateDelaySpec]
DynPrePostRef [in ITree.Extra.Dijkstra.StateDelaySpec]

E

eff_hom_prop [in ITree.Events.State]
elim_void1 [in ITree.Indexed.Sum]
encode [in ITree.Extra.Dijkstra.TracesIT]
encode [in ITree.Extra.Dijkstra.StateDelaySpec]
encode [in ITree.Extra.Dijkstra.StateIOTrace]
encode_dyn [in ITree.Extra.Dijkstra.TracesIT]
encode_list_dyn [in ITree.Extra.Dijkstra.StateDelaySpec]
encode_dyn [in ITree.Extra.Dijkstra.StateDelaySpec]
encode_list [in ITree.Extra.Dijkstra.StateDelaySpec]
encode_pair [in ITree.Extra.Dijkstra.StateDelaySpec]
env [in ITree.Extra.Dijkstra.StateIOTrace]
eqeq [in ITree.Eq.Shallow]
eqit [in ITree.Eq.Eqit]
eqitC [in ITree.Eq.Eqit]
eqitE [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqitE_ [in ITree.Extra.Dijkstra.ITreeDijkstra]
eqit_secureC [in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secure [in ITree.Extra.Secure.SecureEqHaltProgInsens]
eqit_secureC [in ITree.Extra.Secure.SecureEqHalt]
eqit_secure [in ITree.Extra.Secure.SecureEqHalt]
eqit_ [in ITree.Eq.Eqit]
Equivalence_eq2_Handler [in ITree.Interp.InterpFacts]
equivE [in ITree.Extra.Dijkstra.ITreeDijkstra]
equiv_pred [in ITree.Basics.Basics]
eq_relation [in ITree.Extra.IForest]
EQ_REL [in ITree.Extra.IForest]
eq_rect_eq [in ITree.Axioms]
eq_Handler [in ITree.Interp.Handler]
eq_map [in ITree.Events.MapDefault]
eq_rel [in ITree.Basics.HeterogeneousRelations]
eq_itree [in ITree.Eq.Eqit]
Eq1_iforest' [in ITree.Extra.IForest]
eutt [in ITree.Eq.Eqit]
euttge [in ITree.Eq.Eqit]
euttNoRet [in ITree.Props.EuttNoRet]
euttVC [in ITree.Eq.UpToTaus]
eutt_closed [in ITree.Extra.IForest]
eutt_iter_gen [in ITree.Core.KTreeFacts]
eutt_iter_gen' [in ITree.Core.KTreeFacts]
eutt_Handler [in ITree.Interp.Handler]
eval_reader [in ITree.Events.Reader]
eventless [in ITree.Extra.Dijkstra.ITreeDijkstra]
eventless_ [in ITree.Extra.Dijkstra.ITreeDijkstra]
ev_list_to_stream [in ITree.Extra.ITrace.ITraceDefinition]
ev_list [in ITree.Extra.ITrace.ITraceDefinition]
ev_stream [in ITree.Extra.ITrace.ITraceDefinition]

F

f [in ITree.Extra.IForest]
failT [in ITree.Events.FailFacts]
fal_decide_ex [in ITree.Extra.Dijkstra.TracesIT]
finite [in ITree.Extra.ITrace.ITraceDefinition]
flip_clo [in ITree.Eq.Eqit]
forall_stream [in ITree.Extra.Dijkstra.ITreeDijkstra]
forall_stream_ [in ITree.Extra.Dijkstra.ITreeDijkstra]
Fun [in ITree.Basics.Function]
functional_extensionality [in ITree.Axioms]
fun_rel [in ITree.Basics.HeterogeneousRelations]

G

g [in ITree.Extra.IForest]
get [in ITree.Events.State]
GuardedFunctionalChoice_on [in ITree.Axioms]

H

handle [in ITree.Interp.Handler]
handleIOStateE [in ITree.Extra.Dijkstra.StateIOTrace]
Handler [in ITree.Interp.Handler]
handler_correct_iforest [in ITree.Extra.IForest]
handler_correct [in ITree.Extra.IForest]
Handler.bimap [in ITree.Interp.Handler]
Handler.case_ [in ITree.Interp.Handler]
Handler.cat [in ITree.Interp.Handler]
Handler.empty [in ITree.Interp.Handler]
Handler.htrigger [in ITree.Interp.Handler]
Handler.id_ [in ITree.Interp.Handler]
Handler.inl_ [in ITree.Interp.Handler]
Handler.inr_ [in ITree.Interp.Handler]
handle_map [in ITree.Events.Map]
handle_map [in ITree.Events.MapDefault]
handle_writer [in ITree.Events.Writer]
handle_writer_list [in ITree.Events.Writer]
handling [in ITree.Interp.Handler]
has_post_strong [in ITree.Props.HasPost]
has_post [in ITree.Props.HasPost]
h_state [in ITree.Events.State]

I

idM [in ITree.Basics.Basics]
iforest [in ITree.Extra.IForest]
iforest_compose [in ITree.Extra.IForest]
IFun [in ITree.Indexed.Function]
inf_many [in ITree.Extra.Dijkstra.ITreeDijkstra]
inf_many_ [in ITree.Extra.Dijkstra.ITreeDijkstra]
insert [in ITree.Events.Map]
insert [in ITree.Events.MapDefault]
internalize [in ITree.Basics.MonadState]
interp [in ITree.Interp.Interp]
interp_fail [in ITree.Events.FailFacts]
interp_iforest [in ITree.Extra.IForest]
interp_iforest_ [in ITree.Extra.IForest]
interp_mrec [in ITree.Interp.Recursion]
interp_map [in ITree.Events.MapDefault]
interp_e [in ITree.Events.State]
interp_state [in ITree.Events.State]
iso [in ITree.Basics.MonadState]
iso_inv [in ITree.Basics.MonadState]
iso_destatify_arrow [in ITree.Extra.Dijkstra.StateSpecT]
iso_arrow [in ITree.Extra.Dijkstra.StateSpecT]
is_inf [in ITree.Extra.Dijkstra.ITreeDijkstra]
is_inf_ [in ITree.Extra.Dijkstra.ITreeDijkstra]
is_trace [in ITree.Interp.Traces]
ITDInput [in ITree.Extra.Dijkstra.ITreeDijkstra]
iterF_body' [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iterp [in ITree.Extra.Dijkstra.PureITreeDijkstra]
IterPairing [in ITree.Basics.CategoryTheory]
iter_cont [in ITree.Extra.IForest]
iter_ [in ITree.Extra.Dijkstra.PureITreeDijkstra]
iter_lift [in ITree.Extra.Dijkstra.DelaySpecMonad]
iter_arrow_rel [in ITree.Extra.Dijkstra.DelaySpecMonad]
itrace [in ITree.Extra.ITrace.ITraceDefinition]
itrace' [in ITree.Extra.ITrace.ITraceDefinition]
ITreeSpec [in ITree.Extra.Dijkstra.ITreeDijkstra]
itree_includes [in ITree.Extra.Dijkstra.ITreeDijkstra]
ITree.bind [in ITree.Core.ITreeDefinition]
ITree.cat [in ITree.Core.ITreeDefinition]
ITree.forever [in ITree.Core.ITreeDefinition]
ITree.ignore [in ITree.Core.ITreeDefinition]
ITree.iter [in ITree.Core.ITreeDefinition]
ITree.map [in ITree.Core.ITreeDefinition]
ITree.spin [in ITree.Core.ITreeDefinition]
ITree.subst [in ITree.Core.ITreeDefinition]
ITree.trigger [in ITree.Core.ITreeDefinition]
i_pointwise [in ITree.Indexed.Relation]
i_respectful [in ITree.Indexed.Relation]

K

Kleisli [in ITree.Basics.CategoryKleisli]
Kleisli_apply [in ITree.Basics.CategoryKleisli]
Kleisli_arrow [in ITree.Basics.CategoryKleisli]

L

lookup [in ITree.Events.Map]
lookup_def [in ITree.Events.Map]
lookup_default [in ITree.Events.MapDefault]
lookup_def [in ITree.Events.MapDefault]
loop [in ITree.Basics.CategoryOps]
loop_invar_imp [in ITree.Extra.Dijkstra.DelaySpecMonad]

M

map [in ITree.Basics.CategoryKleisli]
map_default_eq [in ITree.Events.MapDefaultFacts]
merge [in ITree.Basics.CategoryOps]
Monads.identity [in ITree.Basics.Basics]
Monads.liftState [in ITree.Basics.Basics]
Monads.reader [in ITree.Basics.Basics]
Monads.readerT [in ITree.Basics.Basics]
Monads.run_stateT [in ITree.Basics.Basics]
Monads.state [in ITree.Basics.Basics]
Monads.stateT [in ITree.Basics.Basics]
Monads.writer [in ITree.Basics.Basics]
Monads.writerT [in ITree.Basics.Basics]
monotonici [in ITree.Extra.Dijkstra.PureITreeDijkstra]
mrec [in ITree.Interp.Recursion]
mrecursive [in ITree.Interp.RecursionFacts]
mrec_fix [in ITree.Interp.Recursion]
mults_of_n [in ITree.Extra.Dijkstra.StateIOTrace]
mults_of_n_from_m [in ITree.Extra.Dijkstra.StateIOTrace]
mults_n [in ITree.Extra.Dijkstra.StateIOTrace]

N

NatPreorder [in ITree.Extra.Secure.SecureEqHaltProgInsens]
NatPreorder [in ITree.Extra.Secure.SecureEqHalt]
Nil [in ITree.Extra.ITrace.ITraceDefinition]
Nil [in ITree.Extra.Dijkstra.ITreeDijkstra]
noret_cast [in ITree.Props.EuttNoRet]
not_wf_from [in ITree.Extra.Dijkstra.IterRel]

O

observe [in ITree.Core.ITreeDefinition]
observe_stream [in ITree.Extra.Dijkstra.ITreeDijkstra]
obsip [in ITree.Extra.Dijkstra.PureITreeDijkstra]
obs_trace [in ITree.Extra.Dijkstra.TracesIT]
obs_del [in ITree.Extra.Dijkstra.DelaySpecMonad]
op [in ITree.Basics.CategoryOps]
option_rel [in ITree.Basics.HeterogeneousRelations]
or [in ITree.Events.Nondeterminism]

P

p [in ITree.Extra.Dijkstra.ITreeDijkstra]
peel [in ITree.Extra.ITrace.ITraceBind]
peel_cont [in ITree.Extra.ITrace.ITraceBind]
peel_cont_ [in ITree.Extra.ITrace.ITraceBind]
peel_cont_vis [in ITree.Extra.ITrace.ITraceBind]
peel_ [in ITree.Extra.ITrace.ITraceBind]
peel_vis [in ITree.Extra.ITrace.ITraceBind]
pi_eqit_secure [in ITree.Extra.Secure.SecureEqProgInsens]
pi_secure_eqit_ [in ITree.Extra.Secure.SecureEqProgInsens]
PrePost [in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostList [in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostListRef [in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostPair [in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostPairRef [in ITree.Extra.Dijkstra.StateDelaySpec]
PrePostRef [in ITree.Extra.Dijkstra.StateDelaySpec]
print_mults [in ITree.Extra.Dijkstra.StateIOTrace]
print_mults_post [in ITree.Extra.Dijkstra.StateIOTrace]
print_mults_pre [in ITree.Extra.Dijkstra.StateIOTrace]
prod_pred [in ITree.Basics.Basics]
prod_snd_rel [in ITree.Basics.HeterogeneousRelations]
prod_fst_rel [in ITree.Basics.HeterogeneousRelations]
pure [in ITree.Basics.CategoryKleisli]
PureITree [in ITree.Extra.Dijkstra.PureITreeDijkstra]
PureITreeSpec [in ITree.Extra.Dijkstra.PureITreeDijkstra]
pure_state [in ITree.Events.State]
put [in ITree.Events.State]
pweqeq [in ITree.Eq.Shallow]

R

reassoc [in ITree.Extra.Dijkstra.StateSpecT]
rec [in ITree.Interp.Recursion]
recursive [in ITree.Interp.RecursionFacts]
rec_fix [in ITree.Interp.Recursion]
relationH [in ITree.Basics.HeterogeneousRelations]
relationH_of_Type [in ITree.Basics.HeterogeneousRelations]
rel_eventless [in ITree.Extra.Dijkstra.ITreeDijkstra]
rel_rev [in ITree.Extra.Dijkstra.IterRel]
rel_compose [in ITree.Basics.HeterogeneousRelations]
remove [in ITree.Events.Map]
remove [in ITree.Events.MapDefault]
remove_events [in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_events' [in ITree.Extra.Dijkstra.ITreeDijkstra]
remove_from [in ITree.Events.Nondeterminism]
respectful_eutt [in ITree.Interp.TranslateFacts]
respectful_eq_itree [in ITree.Interp.TranslateFacts]
retpi [in ITree.Extra.Dijkstra.PureITreeDijkstra]
ret_ts2 [in ITree.Extra.Dijkstra.TracesIT]
ret_ts1 [in ITree.Extra.Dijkstra.TracesIT]
RET_EQ [in ITree.Extra.IForest]
ret_itree [in ITree.Extra.Dijkstra.ITreeDijkstra]
ret_traces [in ITree.Interp.Traces]
ret_del [in ITree.Extra.Dijkstra.DelaySpecMonad]
round_robin [in ITree.Events.Concurrency]
rr_match [in ITree.Events.Concurrency]
run_map [in ITree.Events.Map]
run_reader [in ITree.Events.Reader]
run_writer [in ITree.Events.Writer]
run_writer_list [in ITree.Events.Writer]
run_writer_list_state [in ITree.Events.Writer]
run_spawn [in ITree.Events.Concurrency]
run_state [in ITree.Events.State]
rutt [in ITree.Eq.Rutt]
rutt_ [in ITree.Eq.Rutt]

S

secure_eqit_ [in ITree.Extra.Secure.SecureEqHaltProgInsens]
secure_eqit_ [in ITree.Extra.Secure.SecureEqHalt]
secure_in_empty_context [in ITree.Extra.Secure.SecureStateHandler]
secure_in_nonempty_context [in ITree.Extra.Secure.SecureStateHandler]
secure_in_empty_context [in ITree.Extra.Secure.SecureStateHandlerPi]
secure_in_nonempty_context [in ITree.Extra.Secure.SecureStateHandlerPi]
SimpleTheory.mrecursive [in ITree.Simple]
SimpleTheory.recursive [in ITree.Simple]
SimpleTheory._interp [in ITree.Simple]
Simple.eutt [in ITree.Simple]
Simple.mrecursive [in ITree.Simple]
Simple.recursive [in ITree.Simple]
Simple._interp [in ITree.Simple]
singletonT [in ITree.Extra.IForest]
SIOMorph [in ITree.Extra.Dijkstra.StateIOTrace]
SIOObs [in ITree.Extra.Dijkstra.StateIOTrace]
SIOSpecEq [in ITree.Extra.Dijkstra.StateIOTrace]
SIOSpecOrder [in ITree.Extra.Dijkstra.StateIOTrace]
SIOSpecOrderLaws [in ITree.Extra.Dijkstra.StateIOTrace]
spawn [in ITree.Events.Concurrency]
State [in ITree.Extra.Dijkstra.StateSpecT]
StateDelay [in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelayMonadMorph [in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelayObs [in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpec [in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpecEq [in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpecMonadLaws [in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpecOrder [in ITree.Extra.Dijkstra.StateDelaySpec]
StateDelaySpecOrderedLaws [in ITree.Extra.Dijkstra.StateDelaySpec]
StateIOSpec [in ITree.Extra.Dijkstra.StateIOTrace]
StateIOSpecPost [in ITree.Extra.Dijkstra.StateIOTrace]
StateIOSpecPre [in ITree.Extra.Dijkstra.StateIOTrace]
StateSpec [in ITree.Extra.Dijkstra.StateSpecT]
StateSpecT [in ITree.Extra.Dijkstra.StateSpecT]
state_eq [in ITree.Events.StateFacts]
state_iter_arrow_rel [in ITree.Extra.Dijkstra.StateSpecT]
state_eqit_secure [in ITree.Extra.Secure.SecureStateHandler]
state_machine [in ITree.Extra.ITrace.ITracePreds]
state_machine_ [in ITree.Extra.ITrace.ITracePreds]
state_pi_eqit_secure [in ITree.Extra.Secure.SecureStateHandlerPi]
step [in ITree.Interp.Traces]
sub [in ITree.Basics.CategorySub]
subevent [in ITree.Core.Subevent]
subm [in ITree.Basics.CategorySub]
subrelationH [in ITree.Basics.HeterogeneousRelations]
subrelation_i_respectful_i_pointwise [in ITree.Indexed.Relation]
subtree [in ITree.Extra.IForest]
sum_pred [in ITree.Basics.Basics]
sutt [in ITree.Eq.SimUpToTaus]

T

tau_invar [in ITree.Extra.Dijkstra.PureITreeBasics]
tell [in ITree.Events.Writer]
throw [in ITree.Events.Exception]
throw_prefix_ev [in ITree.Events.ExceptionFacts]
throw_prefix_exc [in ITree.Events.ExceptionFacts]
throw_prefix_tau [in ITree.Events.ExceptionFacts]
throw_prefix_ret [in ITree.Events.ExceptionFacts]
throw_prefix [in ITree.Events.Exception]
top2 [in ITree.Extra.Secure.SecureStateHandler]
top2 [in ITree.Extra.Secure.SecureStateHandlerPi]
traces [in ITree.Interp.Traces]
TraceSpec [in ITree.Extra.Dijkstra.TracesIT]
TraceSpecInput [in ITree.Extra.Dijkstra.TracesIT]
trace_refine [in ITree.Extra.ITrace.ITraceDefinition]
trace_prefix [in ITree.Extra.ITrace.ITracePrefix]
trace_prefix_ [in ITree.Extra.ITrace.ITracePrefix]
trace_eq [in ITree.Interp.Traces]
trace_incl [in ITree.Interp.Traces]
trace_ret [in ITree.Interp.Traces]
trace_inf_often [in ITree.Extra.ITrace.ITracePreds]
trace_inf_often_ [in ITree.Extra.ITrace.ITracePreds]
trace_forall [in ITree.Extra.ITrace.ITracePreds]
trace_forall_ [in ITree.Extra.ITrace.ITracePreds]
transD [in ITree.Eq.UpToTaus]
translate [in ITree.Interp.Interp]
translateF [in ITree.Interp.Interp]
transpose [in ITree.Basics.HeterogeneousRelations]
transU [in ITree.Eq.UpToTaus]
trigger_inl1 [in ITree.Interp.Recursion]
try_catch [in ITree.Events.Exception]
TT [in ITree.Basics.Basics]

U

unCall [in ITree.Interp.Recursion]
undep [in ITree.Events.Dependent]
unsubm [in ITree.Basics.CategorySub]

V

verify_cond [in ITree.Extra.Dijkstra.TracesIT]
verify_cond [in ITree.Extra.Dijkstra.StateDelaySpec]
verify_cond [in ITree.Extra.Dijkstra.StateIOTrace]

W

w [in ITree.Extra.Dijkstra.ITreeDijkstra]
wnm_ev [in ITree.Extra.Dijkstra.StateIOTrace]

_

_interp_fail [in ITree.Events.FailFacts]
_interp_state [in ITree.Events.StateFacts]
_obsip [in ITree.Extra.Dijkstra.PureITreeDijkstra]
_iter [in ITree.Extra.Dijkstra.PureITreeDijkstra]
_bindpi [in ITree.Extra.Dijkstra.PureITreeDijkstra]
_retpi [in ITree.Extra.Dijkstra.PureITreeDijkstra]
_div_spec [in ITree.Extra.Dijkstra.PureITreeDijkstra]
_PureITreeSpec [in ITree.Extra.Dijkstra.PureITreeDijkstra]
_interp [in ITree.Interp.InterpFacts]
_bind_del [in ITree.Extra.Dijkstra.DelaySpecMonad]
_interp_mrec [in ITree.Interp.RecursionFacts]

---

Record Index

A

Apply [in ITree.Basics.CategoryOps]
AssocL [in ITree.Basics.CategoryOps]
AssocLAssocL [in ITree.Basics.CategoryTheory]
AssocLUnit [in ITree.Basics.CategoryTheory]
AssocR [in ITree.Basics.CategoryOps]
AssocRAssocR [in ITree.Basics.CategoryTheory]
AssocRUnit [in ITree.Basics.CategoryTheory]

B

Bifunctor [in ITree.Basics.CategoryTheory]
Bimap [in ITree.Basics.CategoryOps]
BimapCat [in ITree.Basics.CategoryTheory]
BimapId [in ITree.Basics.CategoryTheory]

C

CartesianClosed [in ITree.Basics.CategoryTheory]
Case [in ITree.Basics.CategoryOps]
CaseInl [in ITree.Basics.CategoryTheory]
CaseInr [in ITree.Basics.CategoryTheory]
CaseUniversal [in ITree.Basics.CategoryTheory]
Cat [in ITree.Basics.CategoryOps]
CatAssoc [in ITree.Basics.CategoryTheory]
Category [in ITree.Basics.CategoryTheory]
CatIdL [in ITree.Basics.CategoryTheory]
CatIdR [in ITree.Basics.CategoryTheory]
Coproduct [in ITree.Basics.CategoryTheory]
Curry [in ITree.Basics.CategoryOps]
CurryApply [in ITree.Basics.CategoryTheory]

D

Dagger [in ITree.Basics.CategoryOps]
DaggerInvolution [in ITree.Basics.CategoryTheory]
DaggerLaws [in ITree.Basics.CategoryTheory]

E

EffectObs [in ITree.Extra.Dijkstra.DijkstraMonad]
eff_hom_e [in ITree.Events.State]
Embeddable [in ITree.Core.Subevent]
EquivalenceH [in ITree.Basics.HeterogeneousRelations]
Eq1 [in ITree.Basics.Monad]
Eq1Equivalence [in ITree.Basics.Monad]
Eq2 [in ITree.Basics.CategoryOps]

F

FromBifunctor [in ITree.Basics.CategorySub]
Fst [in ITree.Basics.CategoryOps]
Functor [in ITree.Basics.CategoryFunctor]

I

Id_ [in ITree.Basics.CategoryOps]
Initial [in ITree.Basics.CategoryOps]
InitialObject [in ITree.Basics.CategoryTheory]
Inl [in ITree.Basics.CategoryOps]
Inr [in ITree.Basics.CategoryOps]
Iso [in ITree.Basics.CategoryTheory]
Iter [in ITree.Basics.CategoryOps]
Iterative [in ITree.Basics.CategoryTheory]
IterCodiagonal [in ITree.Basics.CategoryTheory]
IterDinatural [in ITree.Basics.CategoryTheory]
IterNatural [in ITree.Basics.CategoryTheory]
IterUnfold [in ITree.Basics.CategoryTheory]
itree [in ITree.Core.ITreeDefinition]

M

MonadIter [in ITree.Basics.Basics]
MonadLawsE [in ITree.Basics.Monad]
MonadMorphism [in ITree.Extra.Dijkstra.DijkstraMonad]
Monoidal [in ITree.Basics.CategoryTheory]

O

observing [in ITree.Eq.Shallow]
OrderedMonad [in ITree.Extra.Dijkstra.DijkstraMonad]
OrderM [in ITree.Extra.Dijkstra.DijkstraMonad]

P

Pair [in ITree.Basics.CategoryOps]
PairFst [in ITree.Basics.CategoryTheory]
PairSnd [in ITree.Basics.CategoryTheory]
PairUniversal [in ITree.Basics.CategoryTheory]
PER [in ITree.Basics.HeterogeneousRelations]
Preorder [in ITree.Basics.HeterogeneousRelations]
Preorder [in ITree.Extra.Secure.Labels]
Product [in ITree.Basics.CategoryTheory]
prod_rel [in ITree.Basics.HeterogeneousRelations]

R

ReflexiveH [in ITree.Basics.HeterogeneousRelations]
ReSum [in ITree.Basics.CategoryOps]

S

SemiIso [in ITree.Basics.CategoryTheory]
Snd [in ITree.Basics.CategoryOps]
SpecMonad [in ITree.Extra.Dijkstra.DijkstraMonad]
stream [in ITree.Extra.Dijkstra.ITreeDijkstra]
Swap [in ITree.Basics.CategoryOps]
SwapAssocL [in ITree.Basics.CategoryTheory]
SwapAssocR [in ITree.Basics.CategoryTheory]
SwapUnitL [in ITree.Basics.CategoryTheory]
SymmetricH [in ITree.Basics.HeterogeneousRelations]
SymMonoidal [in ITree.Basics.CategoryTheory]

T

Terminal [in ITree.Basics.CategoryOps]
TerminalObject [in ITree.Basics.CategoryTheory]
ToBifunctor [in ITree.Basics.CategorySub]
TransitiveH [in ITree.Basics.HeterogeneousRelations]

U

UnitL [in ITree.Basics.CategoryOps]
UnitLNatural [in ITree.Basics.CategoryTheory]
UnitL' [in ITree.Basics.CategoryOps]
UnitL'Natural [in ITree.Basics.CategoryTheory]
UnitR [in ITree.Basics.CategoryOps]
UnitR' [in ITree.Basics.CategoryOps]

---

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

(13103 entries)

Notation Index

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R

S

T

U

V

W

X

Y

Z

_

other

(51 entries)

Binder 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

(10298 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

(14 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

(32 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

(95 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

(820 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

(280 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

(22 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

(154 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

(133 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

(549 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

(122 entries)

Abbreviation 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

(46 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

(399 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

(88 entries)