10. A non-transitory machine-readable medium having instructions stored thereon, which when executed by a computer system, execute a method of program compilation to improve parallelism during the linking of the program by a compiler, the method comprising: converting statements of the program to canonical form; constructing abstract syntax tree (AST) for each procedure in the program; traversing the program to construct a functional dataflow graph, in which an assignment statement or function call is represented as a node, a control flow decision is represented by a first set of nodes, or an array or set is represented as a second set of nodes and in which edges of the functional dataflow graph represent typed data; identifying at least one loop in the functional dataflow graph that can be executed in parallel; transforming the at least one loop to a set operation by retyping connections between nodes of the functional dataflow graph; parsing code of the program to identify control structures that govern alternative statements; and converting each control structure into a sub-graph with conditioning function and with alternative statements represented as separate paths in the graph that later merge and loop.
10. A non-transitory machine-readable medium having instructions stored thereon, which when executed by a computer system, execute a method of program compilation to improve parallelism during the linking of the program by a compiler, the method comprising: converting statements of the program to canonical form; constructing abstract syntax tree (AST) for each procedure in the program; traversing the program to construct a functional dataflow graph, in which an assignment statement or function call is represented as a node, a control flow decision is represented by a first set of nodes, or an array or set is represented as a second set of nodes and in which edges of the functional dataflow graph represent typed data; identifying at least one loop in the functional dataflow graph that can be executed in parallel; transforming the at least one loop to a set operation by retyping connections between nodes of the functional dataflow graph; parsing code of the program to identify control structures that govern alternative statements; and converting each control structure into a sub-graph with conditioning function and with alternative statements represented as separate paths in the graph that later merge and loop. 18. The non-transitory machine-readable medium of claim 10 , further comprising: outputting the functional dataflow graph of the program to a compiler to guide parallelized compilation of the program.