The Promises of Functional Programming

Computer Science development has been changing though the computing history, so is very difficult to understand this kind of absatract problems, evenmore if you have been coding in the same way for years.

Computing and mathematical advantages allow us to create better hardware that help us to develop more sofisticated software. In the 1950s John McCarthy designed a  complete new coding method: functional programming, based on Alonso Church’s mathematical theory.

Functional programming has advantages for parallel programming. In this article the author tries to explain what functional programming is and its differences with imperative programming, for this he used Clojure to give examples about functional programming.

There are huge differences between both programming methods, but that doesn’t mean that one is better than the other. Each one has its pros and cons, and you should be able to determine when to use one over the other.

The principal funcionality  of functional programming is that you compute by composing functions. A function in a mathematical is something that always return the same output to the same input without any change.  To solve these we cant use variable in our functions instead we use loops that evaluate a function with different parameters over each turn or lap.

References

K. Hinsen. (2009). The Promises of Functional Programming. Scientific Programming. available at: http://webcem01.cem.itesm.mx:8005/s201713/tc2006/the_promises_of_functional_programming.pdf

Comentarios

Entradas populares de este blog

Triumph of the Nerds Part II

The Semicolon Wars