is mentioned by

Thm* as:(LabelT) List, d:T, x:Label. (x 1of(unzip(as))) apply_alist(as;x;d) = d	[apply_alist_non_member]
Thm* as:(LabelT) List, d1,d2:T, x:Label. (x 1of(unzip(as))) apply_alist(as;x;d1) = apply_alist(as;x;d2)	[apply_alist_member2]
Thm* as:(LabelT) List, d:T, x:Label. (x 1of(unzip(as))) ( < x,apply_alist(as;x;d) > as)	[apply_alist_member]
Thm* as:(LabelT) List, p:(LabelT), l:Label, d:T. apply_alist([p / as];l;d) ~ if 1of(p) = l 2of(p) else apply_alist(as;l;d) fi	[apply_alist_cons]
Def apply_alist(as;l;d) == 2of((first p as s.t. 1of(p) = l else < l,d > ))	[apply_alist]
Def t.trace == 1of(t)	[trace_env_trace]
Def t.eff == 1of(2of(2of(2of(2of(t)))))	[ioa_eff]
Def t.pre == 1of(2of(2of(2of(t))))	[ioa_pre]
Def t.init == 1of(2of(2of(t)))	[ioa_init]
Def t.da == 1of(2of(t))	[ioa_da]
Def t.ds == 1of(t)	[ioa_ds]
Def t.kind == 1of(t)	[pre_kind]
Def t.typ == 1of(2of(t))	[frame_typ]
Def t.var == 1of(t)	[frame_var]
Def t.typ == 1of(2of(2of(t)))	[eff_typ]
Def t.kind == 1of(t)	[eff_kind]
Def t.name == 1of(t)	[rel_name]
Def t.term == 1of(2of(t))	[smt_term]
Def t.lbl == 1of(t)	[smt_lbl]
Def t.lbl == 1of(t)	[dec_lbl]
Def t.fun == 1of(t)	[sig_fun]

In prior sections: core mb list 1 prog 1 mb record

Try larger context: GenAutomata