Supercombinator based implementation of lazy functional programming languages

Abstract

Functional languages are becoming popular for the ease of programming that they facilitate. The implementation of a class of these languages is described. A method for compile-time detection of potential garbage in one such implementation is presented. The runtime mechanism to free this garbage and the necessary compile-time analysis are described along with the results of the implementation.