|
- 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 Lisp be defined in terms of y combinator? - Stack Overflow
The y combinator uses lexical closures to perform recursion Thus you can implement a Scheme interpreter with global variables and letrec in a host scheme that doesn't have them as long as it has lexical closures
- 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
- Understanding the implementation of Y-Combinator - Stack Overflow
I would like to understand in mint detail please how we managed to get from the lambda calculus expression of Y-combinator : Y = λf (λx f (x x)) (λx f (x x)) to the following implementation (in Sc
|
|
|