FPr (Function-level Programming right-associative) is a programming language that is an implementation of an FP-System. FP was invented by John Backus and described in his Turing Award lecture.^[1] FPr features the list-techniques of Lisp and some technics of object-oriented programming especially the use of the infix notation. FPr offers an alternative for the usage of local variables.

Example

len == lenrec ° id , (0 &) , nil
lenrec == (nilp ° 1) -> 2 ; lenrec ° (tail ° 1) , (2 + 1 &) , nil

Defines the function len for counting the elements of a list-object and the recursive function lenrec which is doing the loop.

len : (list :: aa bb cc dd ee)

Applicates the function len to a list-object with 5 elements.

See also

• FP (programming language)
• Function-level programming

References

External links

• Archive of the Implementation for Download (german)