Combinatory Programming and Combinatorial Analysis
William H. Burge · IBM Journal of Research and Development · 1972
The principal purpose of this paper is to illustrate by means of simple examples a technique for deriving programs and generating functions from set descriptions. The paper discusses certain interesting correspondences among types of trees, which follow from the use of the technique, and it demonstrates close connections between programming techniques and some aspects of combinatorial theory.