Primitive recursion

[WhiteBlackGoose]

For recursion for anonymous functions:

var fact = Prec((int i, Func<int, int> fact)
        => i == 0 ? 1 : i * fact(i - 1)
);

PoC implementation:

static Func<TIn, TOut> Prec<TIn, TOut>(Func<TIn, Func<TIn, TOut>, TOut> rec)
{
    TOut Hehe(TIn input)
    {
        return rec(input, static i => Hehe(i)); // do not eta reduce!
    }
    
    return Hehe;
}

Together with memoization, we could anonymously define, say, fibonacci:

var fib = Mem(Prec(int i, Func<int, int> fib) => i switch
    0 or 1 => 1,
    var n => fib(i - 1) + fib(i - 2)
}));

[WhiteBlackGoose]

Full impl of both

[WhiteBlackGoose]

(it doesn't work btw, we will have to merge mem and prec into ... mrec?)

[WhiteBlackGoose]

Basically dup of #23