Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
iTasks: executable specifications of interactive work flow systems for the web
ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Declarative Ajax and client side evaluation of workflows using iTasks
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
| Hi-index | 0.00 |
In this paper we sketch some experiments with the construction of a simple compiler for a high level intermediate lazy functional language, with C++ as a target language. Because the compiler is intended for educational and experimental use, simplicity and clearness of construction are considered to be more important than efficiency. Starting point for the construction is a simple interpreter. In a first step this interpreter is turned into a simple compiler in a straightforward manner. The performance of a number of compiled benchmarks is analysed in a comparison with the interpreter and the Clean and GHC compilers. This analysis leads to some suggestions for optimisations. Of these optimisations tail recursion optimisation and optimisation of numerical functions and numerical (sub)expressions in functions are implemented. It turns out that in many cases these optimisations suffice to obtain a competitive performance.