Detecting static algorithms by partial evaluation
Björn Lisper · 1991
Static algorithmsare such algorithms whose behaviour is independent of indata.Regardless of the input, the same computations will always be carried out.Because of this property, static algorithms can be scheduled once and for all, and very efficient hardware with a minimum of control can be designed to support the schedule.Machinery.