 The class \(\mathbf{CL}\) of functions representable in  Combinatory Logic  (a formal system related to the lambda calculus) is such that \(\mathbf{CL} = \mathbf{GR}\). (See  computable functions and arithmetic in the entry on combinatory logic  and Bimbó (2012, ch. 5.3).)