@screwtape@brokenix The term "functional programming language" is so overloaded that it is almost useless nowadays.
Lambda calculus influenced the functional language paradigm but CL certainly is a procedural language. Also because it doesn't care about functional purity and statelessness.
@louis@screwtape look this is how I d see the difference and correct me if I am wrong is here , the difference is start with is the one between concatentive langs and applicative Lang's (Applicative is Church's- a program is function application, and Concatenative is Turing's- a program is a list of instructions) , but that happens with function application like every thing else there ,so far as \ calculus is concerned it starts with one need currying to get a ( higher order) function to accept > 1 arcs
So why can't I call a purely applicative lang fp and not FP when its not that?
@louis@screwtape earliest versions of Common Lisp attempted to implement lexical scoping, but inadvertently wound up with dynamic scoping. They actually managed to change the language to use lexical scoping.
Other languages may achieve similar effects via implicit parameters. Implicit Parameters: Dynamic Scoping with Static Types shows how to add this to Haskell (Hugs implements something based on this). https://yz.mit.edu/wp/lisp-scoping/
Add comment