[net.lang] Need info on Backus' FP language

kissell@flairvax.UUCP (Kevin D. Kissell) (03/21/84)

As the header indicates, I'm looking for information or pointers
to information on Backus' FP,  which is/was allegedly an early model
of a zero-assignment language.  Even vague recollections would help.

Kevin D. Kissell
Fairchild Research Center
Advanced Processor Development
uucp: {ihnp4 decvax}!decwrl!\
                             >flairvax!kissell
    {ucbvax sdcrdcf}!hplabs!/

mark@umcp-cs.UUCP (03/22/84)

Backus' FP was described in his Turing award lecture, which was
printed in the Communications of the ACM. 1978 or 79 (?)
-- 
Spoken: Mark Weiser 	ARPA:	mark@maryland
CSNet:	mark@umcp-cs 	UUCP:	{seismo,allegra,brl-bmd}!umcp-cs!mark

grunwald@uiuccsb.UUCP (04/03/84)

#R:flairvax:-41000:uiuccsb:8900006:000:347
uiuccsb!grunwald    Apr  2 17:20:00 1984

The article is:

John Backus, Can Programming Be Liberated from the von Neumann Style?
A Functional style and Its Algebra of Programs
    CACM August 1978, Vol. 21, #8

Additional references can be found in the FP implementation distributed
with UNIX 4.2 BSD. See /usr/doc/fp for the manual. I believe that FP is
implemented in Franz Lisp on 4.2.