|
- Y Combinator in Haskell - Stack Overflow
The Y combinator can't be typed using Hindley-Milner types, the polymorphic lambda calculus on which Haskell's type system is based You can prove this by appeal to the rules of the type system I don't know if it's possible to type the Y combinator by giving it a higher-rank type It would surprise me, but I don't have a proof that it's not
- How can I implement Y-Combinator with FnMut in Rust?
In that case the Y combinator is a way to solve that, but I'd recommend to go for the alternative approaches that you're already aware of The Y combinator is impractical in most languages without lazy evaluation, and especially so in Rust, where it also runs afoul of the ownership model
- bind - Fixed point combinators in C++ - Stack Overflow
I'm interested in actual examples of using fixed point combinators (such as the y-combinator in C++ Have you ever used a fixed point combinator with egg or bind in real live code?
- haskell - How to use Y- Combinator; why does this infinite recursion . . .
The Y combinator is a particular fixed-point combinator that does not need syntactic recursion so it accomplished the same thing as fix but in a different way If you're curious, you can look at how to implement the Y combinator in Haskell here on SO
- lisp - Y combinator in elisp - Stack Overflow
Y: f -> ( (x -> f(y -> x x y)) (x -> f(y -> x x y)) ) And you should see that this is the same as the working one Thus, in a pure math lambda-calculus world, your definition and the working one are the same This leads to the conclusion that yours didn't work because Lisp doesn't live in a pure math lambda-calculus world
|
|
|