> Ok, I now see what you are saying. > > And, I've updated the rosettacode explicit implementation of the combinator. > > Thanks,
You are welcome. I also added my non-tacit version(s) of the Y combinator there. I would suggest for the explicit version to leave only the form, Y=:2 :0(0 :0) NB. this block will be n in the second part : g=. x&(x`:6) (5!:1<'g') u y ) f=. u (1 :n) (5!:1<'f') f y ) and forget about Defer; otherwise, Defer could be regarded as a "free variable" and Y would no longer be considered to be a combinator (actually, that was my original point). I, being picky, would also modify Y such that its products do not contain any "free variables"; for example, almost_fibonacci in (almost_fibonacci Y), t=. almost_fibonacci Y t 10 55 erase'almost_fibonacci' 1 t 10 |value error: almost_fibonacci | (5!:1<'g') u y On Fri, Nov 30, 2018 at 2:27 PM Raul Miller <[email protected]> wrote: > Ok, I now see what you are saying. > > And, I've updated the rosettacode explicit implementation of the > combinator. > > Thanks, > > -- > Raul > On Thu, Nov 29, 2018 at 5:57 PM Jose Mario Quintana > <[email protected]> wrote: > > > > I am afraid there must be a misunderstanding somewhere. Tacit entities > are > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
