Re: [stack] Meta-combinators?

John Cowan <[email protected]> wrote:
> > The more general problem is how to construct a combinator which can
> > curry all arguments for any given function. Stated differently the
> > challenge is to write a function which can compute the number of
> > arguments or number of results of any given function.

> I think that can be done in Joy provided that the program doesn't
> use any of the small number of Joy words with variable stack effects.

And is very careful with loops, conditionals, and recursion, OR is
written in a way that allows the parser to determine when it halts and
that it always halts. The latter condition makes me shudder.

> A mosquito cried out in his pain,               John Cowan

-Billy