Turing Combinator

Fixed-point combinator alternative to Y. Another approach to enabling recursion through self-application. Provides fixed-point recursion for strict/eager languages. However, it’s difficult to use. It’s better to stick with the Sage/Z-Combinator.

export const Turing = (x: Fn) => (y: Fn) => y(x(x)(y));
export const U = Turing;