Get the latest tech news
Anonymous recursive functions in Racket
Anonymous recursive functions in Racket. Contribute to shriram/anonymous-recursive-function development by creating an account on GitHub.
But “anonymous recursion” means the language has some special mechanism by which the function can refer to itself without having to explicitly introduce a name. This specifically binds the name$MyInvocation, to mimic the syntax of PowerShell, though the$ here does not mean anything special. So lucas-or-fib is essentially a glorified version of the Fibonacci function, but the same body (which recurs using$MyInvocation) can also be used for the Lucas sequence given different initial values.
Or read this on Hacker News