Nuprl Lemma : hdf-parallel-halt-left
∀[A,B:Type]. ∀[X:hdataflow(A;B)]. hdf-halt() || X = X ∈ hdataflow(A;B) supposing valueall-type(B)
Proof
Definitions occuring in Statement :
hdf-parallel: X || Y,
hdf-halt: hdf-halt(),
hdataflow: hdataflow(A;B),
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
uiff: uiff(P;Q),
and: P ∧ Q,
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
implies: P ⇒ Q,
all: ∀x:A. B[x],
top: Top,
hdf-parallel: X || Y,
mk-hdf: mk-hdf(s,m.G[s; m];st.H[st];s0),
band: p ∧b q,
ifthenelse: if b then t else f fi ,
btrue: tt,
bool: 𝔹,
unit: Unit,
it: ⋅,
cand: A c∧ B,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
subtype_rel: A ⊆r B,
ext-eq: A ≡ B,
callbyvalueall: callbyvalueall,
has-value: (a)↓,
has-valueall: has-valueall(a),
pi2: snd(t),
hdf-halt: hdf-halt(),
hdf-ap: X(a),
evalall: evalall(t),
empty-bag: {},
nil: [],
not: ¬A,
true: True,
pi1: fst(t),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}[A,B:Type]. \mforall{}[X:hdataflow(A;B)]. hdf-halt() || X = X supposing valueall-type(B)
Date html generated:
2016_05_16-AM-10_41_37
Last ObjectModification:
2015_12_28-PM-07_45_56
Theory : halting!dataflow
Home
Index