Nuprl Lemma : hdf-sqequal9
∀[mk-hdf,a,s:Top].
(let b ⟵ a
in case null(b) of inl(x1) => let s' ⟵ s in <mk-hdf s', s'> | inr(y1) => <mk-hdf b, b> ~ let b ⟵ a
in let s' ⟵ case null(b)
of inl(x1) =>
s
| inr(y1) =>
b
in <mk-hdf s', s'>)
Proof
Definitions occuring in Statement :
null: null(as),
callbyvalueall: callbyvalueall,
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
pair: <a, b>,
decide: case b of inl(x) => s[x] | inr(y) => t[y],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
null: null(as),
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
so_lambda: λ2x.t[x],
top: Top,
so_apply: x[s],
uimplies: b supposing a,
strict4: strict4(F),
and: P ∧ Q,
all: ∀x:A. B[x],
implies: P ⇒ Q,
has-value: (a)↓,
prop: ℙ,
guard: {T},
or: P ∨ Q,
squash: ↓T,
bfalse: ff,
btrue: tt,
callbyvalueall: callbyvalueall,
evalall: evalall(t),
has-valueall: has-valueall(a)
Latex:
\mforall{}[mk-hdf,a,s:Top].
(let b \mleftarrow{}{} a
in case null(b) of inl(x1) => let s' \mleftarrow{}{} s in <mk-hdf s', s'> | inr(y1) => <mk-hdf b, b> \msim{} let b \mleftarrow{}\000C{} a
in let s' \mleftarrow{}{}
case null(b)
of inl(x1) =>
s
| inr(y1) =>
b
in <mk-hdf s', s'>)
Date html generated:
2016_05_16-AM-10_51_37
Last ObjectModification:
2016_01_17-AM-11_08_57
Theory : halting!dataflow
Home
Index