Nuprl Lemma : hdf-sqequal8-4
∀[C,a,b,F:Top].
(case C of inl(x1) => let x ⟵ a in F[x] | inr(y1) => let x ⟵ b in F[x] ~ let x ⟵ case C
of inl(x1) =>
a
| inr(y1) =>
b
in F[x])
Proof
Definitions occuring in Statement :
callbyvalueall: callbyvalueall,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
decide: case b of inl(x) => s[x] | inr(y) => t[y],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
member: t ∈ T,
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,
prop: ℙ,
callbyvalueall: callbyvalueall,
evalall: evalall(t),
guard: {T},
or: P ∨ Q,
has-value: (a)↓,
squash: ↓T
Latex:
\mforall{}[C,a,b,F:Top].
(case C of inl(x1) => let x \mleftarrow{}{} a in F[x] | inr(y1) => let x \mleftarrow{}{} b in F[x] \msim{} let x \mleftarrow{}{} case C
of inl(x1) =>
a
| inr(y1) =>
b
in F[x])
Date html generated:
2016_05_16-AM-10_45_15
Last ObjectModification:
2016_01_17-AM-11_11_35
Theory : halting!dataflow
Home
Index