flow-graph(S;T;F;G) ==
i,j:Id.
((i 
S)
(j S)
(s:{s:T List| 0 < ||s||} . ((
can-apply(F i j;s)) (i
j)G)))
Definitions :
l_member: (x l),
Id: Id,
all: x:A. B[x],
set: {x:A| B[x]} ,
list: type List,
less_than: a < b,
natural_number: $n,
length: ||as||,
implies: P Q,
assert: b,
can-apply: can-apply(f;x),
apply: f a,
id-graph-edge: (ij)G
FDL editor aliases :
flow-graph
flow-graph(S;T;F;G) ==
\mforall{}i,j:Id. ((i \mmember{} S) {}\mRightarrow{} (j \mmember{} S) {}\mRightarrow{} (\mforall{}s:\{s:T List| 0 < ||s||\} . ((\muparrow{}can-apply(F i j;s)) {}\mRightarrow{} (i{}\mrightarrow{}j)\mmember{}G)))
Date html generated:
2010_08_27-AM-09_36_15
Last ObjectModification:
2009_12_16-AM-08_21_52
Home
Index