{ [L:Type List]. [B:Type]. [G:tuple-type(map(T.bag(T);L))
                                  bag(B)
                                  bag(B)].
  [halt:tuple-type(map(dfp.(Top?);L))  ].
    (feedback-df-halt(G;L;B;halt)  ) }

{ Proof }



Definitions occuring in Statement :  feedback-df-halt: feedback-df-halt(G;L;B;halt) map: map(f;as) bool: uall: [x:A]. B[x] top: Top prop: unit: Unit member: t  T lambda: x.A[x] function: x:A  B[x] union: left + right list: type List universe: Type bag: bag(T) tuple-type: tuple-type(L)
Definitions :  void: Void sqequal: s ~ t real: rationals: subtype: S  T nat: btrue: tt bfalse: ff pair: <a, b> intensional-universe: IType strong-subtype: strong-subtype(A;B) ge: i  j  less_than: a < b uiff: uiff(P;Q) subtype_rel: A r B fpf: a:A fp-B[a] decide: case b of inl(x) =s[x] | inr(y) =t[y] ifthenelse: if b then t else f fi  list_ind: list_ind def false: False not: A le: A  B lelt: i  j < k int: select: l[i] l_member: (x  l) set: {x:A| B[x]}  select-tuple: x.n isl: isl(x) bnot: b so_lambda: x.t[x] l_all: (xL.P[x]) strict-bag-function: strict-bag-function(G;L;B;S) cand: A c B and: P  Q length: ||as|| natural_number: $n int_seg: {i..j} product: x:A  B[x] exists: x:A. B[x] apply: f a assert: b implies: P  Q listp: A List combination: Combination(n;T) uimplies: b supposing a all: x:A. B[x] lambda: x.A[x] axiom: Ax feedback-df-halt: feedback-df-halt(G;L;B;halt) prop: list: type List equal: s = t bag: bag(T) uall: [x:A]. B[x] bool: tuple-type: tuple-type(L) map: map(f;as) union: left + right top: Top unit: Unit universe: Type function: x:A  B[x] member: t  T isect: x:A. B[x] Auto: Error :Auto,  CollapseTHEN: Error :CollapseTHEN
Lemmas :  bag_wf strict-bag-function_wf length_wf1 int_seg_wf assert_wf unit_wf top_wf map_wf tuple-type_wf bool_wf l_all_wf2 l_member_wf bnot_wf select-tuple_wf member_wf isl_wf l_all_wf intensional-universe_wf subtype_rel_wf length_wf_nat select_wf le_wf length-map select-map

\mforall{}[L:Type  List].  \mforall{}[B:Type].  \mforall{}[G:tuple-type(map(\mlambda{}T.bag(T);L))  {}\mrightarrow{}  bag(B)  {}\mrightarrow{}  bag(B)].
\mforall{}[halt:tuple-type(map(\mlambda{}dfp.(Top?);L))  {}\mrightarrow{}  \mBbbB{}].
    (feedback-df-halt(G;L;B;halt)  \mmember{}  \mBbbP{})


Date html generated: 2011_08_16-AM-09_41_00
Last ObjectModification: 2011_06_09-PM-05_31_27

Home Index