What is an FFP machine?

Question

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? Thanks.

Answer 1

Formal FP. Similar to FP, but with regular sugarless syntax, for machine execution is all I can offer you.

See Wikis Fp page.

Answer 2

Have you come across this yet?: Compiling APL for parallel execution on an FFP machine