One thing that comes to my mind is this factorial implementation using only lambda calculus. In JavaScript. I took the idea from this talk and implemented it in JS.
// Y Combinator// makes the recursion(function(improver){return(function(gen){returngen(gen)})(function(gen){returnimprover(function(v){returngen(gen)(v)})})})(// this part is the condition for the factorialfunction(partial){returnfunction(n){returnn===0?1:n*partial(n-1)}}// pass any number here to get its factorial)(5)
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
One thing that comes to my mind is this factorial implementation using only lambda calculus. In JavaScript. I took the idea from this talk and implemented it in JS.