{ 
[A,B:Type]. [X:dataflow(A;bag(B))].
(programmable-dataflow{i:l}(A;B;X) 
') }
{ Proof }
Definitions occuring in Statement :
programmable-dataflow: programmable-dataflow{i:l}(A;B;X),
dataflow: dataflow(A;B),
uall: [x:A]. B[x],
prop: ,
member: t T,
universe: Type
Definitions :
fpf: a:A fp-> B[a],
corec: corec(T.F[T]),
strong-subtype: strong-subtype(A;B),
le: A 
B,
ge: i 
j ,
not: 
A,
less_than: a < b,
uiff: uiff(P;Q),
subtype_rel: A 
r B,
inl: inl x ,
pair: <a, b>,
empty-bag: Error :empty-bag,
lambda: 
x.A[x],
decide: case b of inl(x) => s[x] | inr(y) => t[y],
so_lambda: 
x y.t[x; y],
apply: f a,
let: let,
uimplies: b supposing a,
rec-dataflow: rec-dataflow(s0;s,m.next[s; m]),
valueall-type: valueall-type(T),
and: P 
Q,
set: {x:A| B[x]} ,
sq_exists: 
x:{A| B[x]},
product: x:A 
B[x],
exists: x:A. B[x],
function: x:A 
B[x],
all: x:A. B[x],
bag: Error :bag,
prop: ,
programmable-dataflow: programmable-dataflow{i:l}(A;B;X),
dataflow: dataflow(A;B),
equal: s = t,
axiom: Ax,
universe: Type,
uall: [x:A]. B[x],
isect: 
x:A. B[x],
member: t T,
Auto: Error :Auto,
unit: Unit,
union: left + right,
CollapseTHEN: Error :CollapseTHEN
Lemmas :
valueall-type_wf,
member_wf,
dataflow_wf,
Error :bag_wf,
rec-dataflow_wf,
unit_wf,
Error :empty-bag_wf
\mforall{}[A,B:Type]. \mforall{}[X:dataflow(A;bag(B))]. (programmable-dataflow\{i:l\}(A;B;X) \mmember{} \mBbbP{}')
Date html generated:
2011_08_10-AM-08_24_22
Last ObjectModification:
2011_06_02-PM-03_13_00
Home
Index