🚀 go-pugleaf

In article <47380@yale-celray.yale.UUCP> wald-david@CS.YALE.EDU (david wald) writes:
 Essentially, the generator would be given a description of a common
> function (say, min() or max() or some such), and would then attempt to
> generate the shortest-length sequence of assembly language instructions
> (or perhaps, shortest sequence with fewest branch instructions) that
> would compute the function.

> Does any one recognize this work?  I'll try to dig up the reference.

the super-optimizer.  from the asplos 2 conference, summer 87 i think.
proceedings published as an issue of sigplan notices.