Nuprl Lemma : base-process-class-program-ap
∀[f:Name ─→ Type]. ∀[Info,T:Type]. ∀[loc:Id]. ∀[hdr:Name].
∀[P:Id ─→ hdataflow(Info;T)]. ∀[a:Message(f)]. ∀[i:Top].
(base-process-class-program(P;loc;hdr) i(a) ~ if hdf-halted(P loc) then <hdf-halt(), {}>
if test-msg-header-and-loc(a;hdr;loc)
then let P',b = P loc(snd(msg-body(a)))
in <base-process-class-program(λi.P';loc;hdr) i, b>
else <base-process-class-program(P;loc;hdr) i, {}>
fi )
supposing hdr encodes Id × Top
Proof
Definitions occuring in Statement :
base-process-class-program: base-process-class-program(X;loc;hdr),
test-msg-header-and-loc: test-msg-header-and-loc(msg;hdr;loc),
encodes-msg-type: hdr encodes T,
msg-body: msg-body(msg),
Message: Message(f),
Id: Id,
name: Name,
ifthenelse: if b then t else f fi ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
pi2: snd(t),
apply: f a,
lambda: λx.A[x],
function: x:A ─→ B[x],
spread: spread def,
pair: <a, b>,
product: x:A × B[x],
universe: Type,
sqequal: s ~ t,
empty-bag: {},
hdf-halt: hdf-halt(),
hdf-halted: hdf-halted(P),
hdf-ap: X(a),
hdataflow: hdataflow(A;B)
Lemmas :
eqtt_to_assert,
eqff_to_assert,
equal_wf,
bool_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
test-msg-header-and-loc_wf,
top_wf,
Message_wf,
Id_wf,
hdataflow_wf,
encodes-msg-type_wf,
name_wf
Latex:
\mforall{}[f:Name {}\mrightarrow{} Type]. \mforall{}[Info,T:Type]. \mforall{}[loc:Id]. \mforall{}[hdr:Name].
\mforall{}[P:Id {}\mrightarrow{} hdataflow(Info;T)]. \mforall{}[a:Message(f)]. \mforall{}[i:Top].
(base-process-class-program(P;loc;hdr) i(a) \msim{} if hdf-halted(P loc) then <hdf-halt(), \{\}>
if test-msg-header-and-loc(a;hdr;loc)
then let P',b = P loc(snd(msg-body(a)))
in <base-process-class-program(\mlambda{}i.P';loc;hdr) i, b>
else <base-process-class-program(P;loc;hdr) i, \{\}>
fi )
supposing hdr encodes Id \mtimes{} Top
Date html generated:
2015_07_22-PM-00_03_41
Last ObjectModification:
2015_01_28-AM-09_53_29
Home
Index