Program transformation in functional languages
Noorul Islam · 1982
In this thesis several aspects of functional languages in general, and FFP languages in particular, are investigated. Interpreters are described which are based on the algebras of functional programs. Extensions are proposed for improving the readability of functional programs and algorithms are given for transforming programs in the extended language into the base language. The concept of assertion functions is introduced for use in automatic specialization of functional programs. Finally, a functional language for animation which makes use of a stream of time values is described.