Research indexJournal article
Combinatory Programming and Combinatorial Analysis
Burge
IBM Journal of Research and Development1 Sep 1972
NobleIDark:/48914/w1/20260525/23509651DOI10.1147/rd.165.0450
Combinatory Programming and Combinatorial Analysis
Burge · IBM Journal of Research and Development · 1972 · Subscription
NobleIDark:/48914/w1/20260525/23509651DOI10.1147/rd.165.0450
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
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.