RIS ID
87120
Abstract
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.
COinS
Publication Details
Bunder, M. W. (1990). Some improvements to Turner's algorithm for bracket abstraction. The Journal of Symbolic Logic, 55 (2), 656-669.