tbh FP is so heavily modularized that even the concept of "looping" is modularized away from the logical operation itself. In haskell it looks like this: f

tbh FP is so heavily modularized that even the concept of "looping" is modularized away from the logical operation itself. In haskell it looks like this: f = a . b . c . d a1 = map a b1 = map b c1 = map c d1 = map d f2 = a1 . b1 . c1 . d1 Where f is the composition of operations on a single value and f2 operates on a list of values and returns the mapped list.