TRANSLATION OF HOPE INTO LAMBDA EXPRESSIONS

Abstract

In recent years a number of scientists have advocated the use of functional programming as a means of increasing programmer productivity, enhancing the clarity of programs and reducing the difficulty of program verification. New architectural implementations have made it possible to execute functional languages not only for taking advantage of the inherent parallelism, but also for efficient serial execution. The present work deals with the translation of a functional language HOPE into lambda expressions. The translator has been developed for IBM-PC/compatibles using Turbo 'C as the source language. Translation action starts with the separation of function name, arguments and definitions. Bound variables are extracted from argument expression and brackets inserted at proper places in the definition. Recursive definitions as well as multiple definitions have been taken care of. In addition letrec and fatbar operators have also been incorporated. Dynamic and automatic memory management is employed so that the interpreter makes efficient utilization of memory space. Several examples have been run successfully on the translator