Abstract
J.Backus, in CACM 21/8, defined a class of applicative programming systems called FP (functional programming) systems in which users have: (1) objects built recursively from atoms, ⊥ (an undefined element) and objects by a ⊥-preserving “list” operator, (2) elementary functions over objects, (3) tools for building functions out of already existing functions. It is an important feature of FP systems that these tools use no variables in the sense of programming languages. In fact Backus also avoided the use of variables while building the algebra of FP systems which is supposed to be a calculus to express and prove facts about the defined functions in the system.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
