GRAPHICAL REPRESENTATION OF FUNCTIONAL PROGRAMS AS ARBITRARY TREE STRUCTURES

Abstract

The functional languages due to their fundamental properties have been found to be suitable for parallel processing. Attempts are being- made to implement different aspects of the functional languages for some time. The hot topics of implementation are coarse grain and fine grain representation of a functional program, different interconnection strategies of multiprocessors for mapping functional tree of a problem on it. Since this field is in initial stages of development and most of the work is done through simulation on a single processor system. These simulators are used to show speed—up achieved in multiprocessor environment, time spend in communication between processors, memory requirement and so on. But how actually these things happen and how the reduction steps take place, are not very clear because every thing is put into and results are shown as output i.e no internal processing is visible to user. So user do not get any feel of the actual happenings inside. So the main idea of developing the package for graphical representation of functional program as arbitrary tree structure is to give visual output of different reduction steps inside a multiprocessor graph reduction machine. Our program takes input as functional definition and expression to be evaluated and gives output as visual representation of the problem as binary tree structure. This graphical representation can be made to work in parallel with reduction machine to show the snapshots of reduction steps in,a multiprocessor environment. Finally, various suggestions for improvement in this work and for future work have been included.