Nuprl Lemma : Memory1-locally-programmable
[A:
']
B:{B:'| valueall-type(B)} . init:Id 
bag(B). tr:Id A B B.
[X:EClass'(A)]. (NormalLProgrammable'(A;X) 
NormalLProgrammable'(B;Memory1(init;tr;X)))
Proof not projected
Definitions occuring in Statement :
Memory1: Memory1(init;tr;X),
Message: Message,
normal-locally-programmable: NormalLProgrammable(A;X),
eclass: EClass(A[eo; e]),
Id: Id,
uall: [x:A]. B[x],
all: x:A. B[x],
implies: P Q,
set: {x:A| B[x]} ,
function: x:A B[x],
universe: Type,
bag: bag(T),
valueall-type: valueall-type(T)
Definitions :
uall: [x:A]. B[x],
all: x:A. B[x],
eclass: EClass(A[eo; e]),
implies: P Q,
Memory1: Memory1(init;tr;X),
Memory-loc-class: Memory-loc-class(f;init;X),
Accum-loc-class: Accum-loc-class(f;init;X),
member: t 
T,
lifting-loc-2: lifting-loc-2(f),
empty-bag: {},
lifting-gen-list-rev: lifting-gen-list-rev(n;bags),
select: l[i],
lifting2-loc: lifting2-loc(f;loc;abag;bbag),
lifting-loc-gen-rev: lifting-loc-gen-rev(n;bags;loc;f),
lifting-gen-rev: lifting-gen-rev(n;f;bags),
ifthenelse: if b then t else f fi ,
eq_int: (i =
j),
bag-combine: 
xbs.f[x],
ycomb: Y,
map: map(f;as),
bfalse: ff,
bag-union: bag-union(bbs),
concat: concat(ll),
reduce: reduce(f;k;as),
bag-map: bag-map(f;bs),
le_int: i 
z j,
bnot: 
b,
lt_int: i <z j,
btrue: tt,
uimplies: b supposing a,
prop: 
,
subtype: S 
T
Lemmas :
primed-class-opt-nlp,
Accum-loc-class_wf,
Message_wf,
rec-combined-loc-class-opt-1-nlp,
lifting-loc-2_wf,
empty-bag_wf,
bag_wf,
Id_wf,
normal-locally-programmable_wf,
event-ordering+_wf,
es-E_wf,
event-ordering+_inc,
valueall-type_wf
\mforall{}[A:\mBbbU{}']
\mforall{}B:\{B:\mBbbU{}'| valueall-type(B)\} . \mforall{}init:Id {}\mrightarrow{} bag(B). \mforall{}tr:Id {}\mrightarrow{} A {}\mrightarrow{} B {}\mrightarrow{} B.
\mforall{}[X:EClass'(A)]. (NormalLProgrammable'(A;X) {}\mRightarrow{} NormalLProgrammable'(B;Memory1(init;tr;X)))
Date html generated:
2012_01_23-PM-01_27_24
Last ObjectModification:
2012_01_12-AM-10_26_45
Home
Index