Nuprl Lemma : cbva-seq_seq
∀[L,F:Top]. ∀[m:ℕ]. (cbva-seq(L;F;m) ~ callbyvalueall_seq(L;λx.x;λf.(f F);0;m))
Proof
Definitions occuring in Statement :
cbva-seq: cbva-seq(L;F;m),
callbyvalueall_seq: callbyvalueall_seq(L;G;F;n;m),
nat: ℕ,
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
lambda: λx.A[x],
natural_number: $n,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
cbva-seq: cbva-seq(L;F;m),
top: Top,
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ
Lemmas referenced :
callbyvalueall_seq-seq,
false_wf,
le_wf,
nat_wf,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
isect_memberEquality,
voidElimination,
voidEquality,
dependent_set_memberEquality,
natural_numberEquality,
independent_pairFormation,
lambdaFormation,
hypothesis,
sqequalAxiom,
because_Cache
Latex:
\mforall{}[L,F:Top]. \mforall{}[m:\mBbbN{}]. (cbva-seq(L;F;m) \msim{} callbyvalueall\_seq(L;\mlambda{}x.x;\mlambda{}f.(f F);0;m))
Date html generated:
2016_05_15-PM-02_09_35
Last ObjectModification:
2015_12_27-AM-00_35_53
Theory : untyped!computation
Home
Index