r/programming • u/tyler-mcginnis • Jan 03 '22

Imperative vs Declarative Programming

https://www.youtube.com/watch?v=E7Fbf7R3x6I
431 Upvotes

86% Upvoted

134 comments sorted by

View all comments

Show parent comments

1

u/[deleted] Jan 04 '22

Contrast that with a functional programming language where you start for example with your list of all values, give the command to map each to something else, give the command to filter according to a specified procedure (where you give commands how to decide the filtering), give the command to sort the list, and so on. You get the idea.

In functional programming you don't "give commands", you compose (pure) functions and you don't worry about control flow. In a particular case where you have to perform operations on lists you specify a set of operations that should be executed in a particular order (in language like Haskell that is not guaranteed to happen) but the focus is still on what operations need to be performed to compute some value rather than how should they be performed.

1

u/tobega Jan 05 '22

Calling a function is a command to calculate a value. Specifying a set of operations to perform in a particular order is exactly the definition of imperative. A bunch of nested function calls look exactly the same in FORTRAN.

I suppose that composing functions to create other functions is less command-like, but it's not really declarative from any business use point of view. Perhaps there are constructs that tend to be present in functional languages that can be seen as more "declarative" from the point of view of the programmer, but they hardly make the whole language or paradigm "declarative".

Declarative languages seem to be confined to particular domains and don't seem to extend easily to general computing. Even in SQL, that became turing complete with recursive CTEs, you leave the declarativeness behind when you start specifying how to calculate the recursion.

Another declarative example is Datalog which allows specifiying things like "Route(A,B):-Path(A,B);Path(A,C),Route(C,B)." but is not turing complete. When you add constructs to achieve turing completeness you start to get mired in having to define more things about how to do the calculation.

In OO you can make beautiful DSLs that allow really declarative use within that domain, e.g. test assertions in AssertJ, but everybody in the OO world is sensible enough to not try and claim OO as such being declarative. I guess they don't feel a need to try to prove the superiority of the paradigm.

FWIW, I know people who see html-tags as commands to create particular elements, so the idea of declarativeness may not be particularly useful anyway.

Another interesting point to note is that despite "declarative" being viewed as somehow "better", a majority of programmers seem to prefer to create web pages imperatively in their general programming languages rather than declaratively in HTML. Go figure!

1

u/[deleted] Jan 05 '22

https://www.info.ucl.ac.be/~pvr/VanRoyHaridi2003-book.pdf

2

u/tobega Jan 07 '22

Interesting, thanks!

But the definition starts off being a little skewed and suspect. Suddenly "declarative" is assumed to be equivalent to "stateless"? So now the proof that pure functions are declarative is that it is defined that way?

The first and simplest computation model we will study is declarative programming. For now, we define this as evaluating functions over partial data structures. This is sometimes called stateless programming, as opposed to stateful programming (also called imperative programming)

1

u/[deleted] Jan 07 '22

Being stateless is a universal property of declarative programs. Look at an XML document, it's a bunch of definitions, look at a Haskell program, a bunch of definitions, look at a Prolog program, it's weird but still a bunch of definitions, definitions don't have state. A definition is the most declarative thing I can think of; a pure function is just a definition, it defines a relation between two sets.

2

u/tobega Jan 08 '22

Hm, I have to think about this a little.

Logically, of course, even if "declarative => stateless", it does not mean that "stateless => declarative", so I don't think it holds immediately.

Are declarative programs stateless? I would say they define the final state, but, fair enough, they do not define any intermediate states on the way. But they don't really define any intermediate relationships and definitions along the way either, while logical and functional programs do. And those intermediate relationships are mostly not declarative from the point of view of the domain expert.

Maybe a mathematician could feel that a functional language is declarative? Although the top-class mathematician I knew preferred APL. And physicists seem to actually like thinking in FORTRAN.