R – an FFP machine


In R. Kent Dybvig's paper "Three Implementation Models for Scheme" he speaks of "FFP languages" and "FFP machines". Apparently there is some correlation between FFP machines, and string-reduction on multiple processors.

Googling doesn't really uncover much in terms of explanations or examples.

Can anyone shed some light on this topic?

Best Solution

Kent Dybvig's advisor, Gyula A. Mago, published a detailed description in "The FFP Machine: Technical Report 87-014" in 1987 by Mago and Stanat.

As of this writing, the PDF is freely available at: http://www.cs.unc.edu/techreports/87-014.pdf