Nuprl Lemma : strictness-callbyvalue
∀[F:Top]. (eval x = ⊥ in F[x] ~ ⊥)
Proof
Definitions occuring in Statement :
bottom: ⊥,
callbyvalue: callbyvalue,
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
has-value: (a)↓,
not: ¬A,
implies: P ⇒ Q,
false: False,
top: Top
Lemmas referenced :
top_wf,
bottom-sqle,
is-exception_wf,
has-value_wf_base,
exception-not-bottom,
bottom_diverge
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalSqle,
sqleRule,
thin,
divergentSqle,
callbyvalueCallbyvalue,
sqequalHypSubstitution,
hypothesis,
sqequalRule,
callbyvalueReduce,
lemma_by_obid,
independent_functionElimination,
voidElimination,
callbyvalueExceptionCases,
axiomSqleEquality,
baseClosed,
isectElimination,
baseApply,
closedConclusion,
hypothesisEquality,
sqleReflexivity,
isect_memberEquality,
voidEquality,
sqequalAxiom
Latex:
\mforall{}[F:Top]. (eval x = \mbot{} in F[x] \msim{} \mbot{})
Date html generated:
2016_05_13-PM-03_43_33
Last ObjectModification:
2016_01_14-PM-07_07_35
Theory : computation
Home
Index