Science and Technology Studies Commons^™

Some Improvements To Turner's Algorithm For Bracket Abstraction, Martin W. Bunder

Faculty of Engineering and Information Sciences - Papers: Part A

A computer handles A-terms more easily if these are translated into combinatory terms. This translation process is called bracket abstraction. The simplest abstraction algorithm-the (fab) algorithm of Curry (see Curry and Feys [6])-is lengthy to implement and produces combinatory terms that increase rapidly in length as the number of variables to be abstracted increases.