Resultado de búsqueda
16 de jul. de 2011 · A Y-combinator is a "functional" (a function that operates on other functions) that enables recursion, when you can't refer to the function from within itself. In computer-science theory, it generalizes recursion, abstracting its implementation, and thereby separating it from the actual work of the function in question.
5 de ago. de 2015 · If the Y combinator is possible in C#, how would I make my solution to the substrings problem (the AllSubstrings function) a one-liner? Whether or not the Y combinator is not possible in C#, are there any other methods of programming that would allow for one-lining AllSubstrings ?
fix2 is a y-combinator (specifically, it is a combinator for functions with two arguments; the first argument is the function (for the purpose of recursion), the second argument is a "proper" function argument). It creates recursive functions. bll::ret(...) appears to create some form of a function object, the body of which is
I've recently come across this proposal that wants to add a Y Combinator to the Standard Library, and after reading it, it seems extremely similar to what I am doing here. Unfortunately, the concept of the Y Combinator still doesn't "click" for me - I am missing something and I cannot visualize how to generalize what I did with the self parameter for any function, avoiding the step boilerplate.
18 de may. de 2011 · EDIT: While chessweb or anyone else corroborates his answer, temporarily consider his answer correct and this one wrong. It seems the answer is yes. Apparently the exact same combinator appears here, midway down the page: (define Y. (lambda (f) (f (lambda (x) ((Y f) x))))) edited May 18, 2011 at 8:38. answered Jan 14, 2011 at 1:41.
29 de nov. de 2011 · Thankfully the fathers of computing solved this problem ages ago by discovering Fixed-Point Combinators, with the most popular being the Y Combinator. I've made various attempts to get a Y combinator set up, but they can't get past the compiler.
6. A combinator is function with no free variables. That means, amongst other things, that the combinator does not have dependencies on things outside of the function, only on the function parameters. Using F# this is my understanding of combinators: let sum a b = a + b;; //sum function (lambda)
25 de nov. de 2010 · 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 ...
所以就在现在，扪心自问，如果你还没有做好这样的准备，不具备这样的决心，就不要申请 YC 了。. 如果你能肯定地回答这个问题，毅然决然，那申请对于你应该得心应手，你只需要把用来说服自己的那一套说给 YC 就行了。. 申请 YC. YC 每年都会收到几万封申请 ...
19 de jun. de 2023 · Questions tagged [y-combinator] The Y combinator is a higher-order function that allows a function that does not know its own name to call itself. It is the fundamental basis of recursion. Learn more…. Top users. Synonyms. Stack Overflow. Questions. Help.
