Abstract
This note presents a practical algorithm for carrying out abstraction on combinatory terms. The well-known abstraction algorithms [1, pp. 188ff.] defining abstracts in terms of the combinator sets {S, K}, {B, C, K, W}, etc. operate on one variable at a time, and result in rather long abstracts when several variables are involved. These algorithms are not practical for the applications of the combinatory logic to the theory of computing which make much use of multi-variable abstraction (e.g., [2], [3]). The present algorithm performs the abstraction with respect to all specified variables in a single step, and yields abstracts in a concise form (with sizes proportional to those of given combinatory terms).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
