Home/ Questions/Q 90577
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-05-10T22:53:42+00:00

Being relatively new to functional programming, I expend lots of energy wondering is this

  • 0

Being relatively new to functional programming, I expend lots of energy wondering “is this the functional way to do things?” Obviously recursion vs. iteration is pretty straightforward and it’s obvious that recursion is the functional way of doing things. But take closures for instance. I’ve learned about closures using Lisp and I understand that closures are a combination of a function and an environment (sounds a lot like state and behavior). For instance:

(let ((x 1))            (defun doubleX()               (setf x (* x 2))))

Here we have a function doubleX that has been defined within the environment of the x variable. We could pass this function around to other functions and then invoke it and it will still be able to reference the x variable. The function can continue to refer to that variable, even if it is invoked outside of the environment where the variable has been defined. Many of the examples I’ve seen of closures look like this. Where setf is used to change the value of the lexical variable. This confuses me because:

1.) I thought setf was evil. Mostly because it causes side-effects and apparently they are also evil.

2.) Is this really “functional”? Seems like just a way of keeping global state and I thought functional languages were stateless.

Maybe I just don’t understand closures. Can someone help me out?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. You’re right, using closures to manipulate state is not purely functional. Lisp allows you to program in a functional style, but it doesn’t force you to. I actually prefer this approach because it allows me to strike a pragmatic balance between purely functional and the convenience of modifying state.

    What you might try is to write something that seems functional from the outside but keeps an internal mutable state for efficiency. A great example of this is memoization where you keep a record of all the previous invocations to speed up functions like fibonacci, but since the function always returns the same output for the same input and doesn’t modify any external state, it can be considered to be functional from the outside.

    • 0