Nuprl Lemma : callbyvalue-then-apply
∀[f,x:Top]. (eval g = f in g x ~ f x)
Proof
Definitions occuring in Statement :
callbyvalue: callbyvalue,
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
has-value: (a)↓
Lemmas referenced :
top_wf,
is-exception_wf,
has-value_wf_base
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
thin,
sqequalSqle,
divergentSqle,
callbyvalueCallbyvalue,
sqequalHypSubstitution,
hypothesis,
callbyvalueReduce,
sqleReflexivity,
callbyvalueExceptionCases,
axiomSqleEquality,
lemma_by_obid,
isectElimination,
baseApply,
closedConclusion,
baseClosed,
hypothesisEquality,
exceptionSqequal,
callbyvalueApply,
applyExceptionCases,
sqequalAxiom,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[f,x:Top]. (eval g = f in g x \msim{} f x)
Date html generated:
2016_05_13-PM-03_45_52
Last ObjectModification:
2016_01_14-PM-07_06_29
Theory : computation
Home
Index