\(\gamma\) \(\omega\)-calculus semantics of functional programming language FFP (Q749201)

It seems hopeful that \(\gamma\omega\)-calculus would become the most general theoretical foundation of semantics for functional programming languages (at least for the ones without types). In this note, for the formal functional programming language FFP [\textit{J. Backus}, Commun. ACM 21, 613-641 (1978; Zbl 0383.68013)], the \(\gamma\omega\)-calculus semantics is settled, and thus an application of \(\gamma\omega\)-calculus is developed. We emphatically discuss the metacomposition rule in FFP language, and present a general metacomposition rule which is distinct from the generalized metacomposition rule [\textit{M. Jiang}, Kexue Tongbao, Sci. Bull. 33, No.17, 1405-1408 (1988; Zbl 0681.68021)].