An Abstract Parallel Graph Reduction Machine for CD-FFP2

The basis of the proposed graph reduction machine is Curry's combinatory logic.However using the definition of combinators in combinatory logic as reduction rules seems toosimple We propose an abstract parallel graph reduction machine for CD-FFP2(a dialect of FFP)Its basis is FFP high-level combinatory logic.It has many advantages to use the definition ofcombinators in FFP high-level combinatory logic as reduction rules.It lays a good foundationfor implementing architecture of FFP language.