1. A computer implemented 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 system tree (AST) for each procedure in the program; and traversing the program to construct 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; identifying at least one loop in the functional dataflow graph that can be executed in parallel; and transforming the at least one loop to as set operation by retyping connections between nodes of the functional dataflow graph.