🚀 go-pugleaf

In article <1991Feb15.230112.2902@csrd.uiuc.edu>, bliss@sp64.csrd.uiuc.edu (Brian Bliss) writes:
> >the question was:  how do I write a function
> 	typedef int i2ifn(int);
> 	i2ifn compose(i2ifn f, i2ifn g) { /* fill this in */ }
> >so that compose(f,g)(x) == f(g(x)).

> you say

> int (*f1)(), (*f2)();

> int retval (x) { (*f1)((*f2)(x));}

> int (*compose (f, g))()
>    int (*f)(), (*g)();
>    { f1 = f; f2 = g; return retval; }

Spare me days!  This completely (almost definitively) misses the
point.  If I do
	fg = compose(f, g);
	hk = compose(h, k);
the later call to compose() should not invalidate the earlier result!
This atrociously buggy pseudo-implementation *guarantees* that
	compose(compose(f,g),h)(x)
will not work, which it would in a language with first-class functions.
 
-- 
Professional programming is paranoid programming