Penguin
Note: You are viewing an old revision of this page. View the current version.

A type of ProgrammingLanguage, based loosely on the LambdaCalculus approach to ComputerScience. FunctionalLanguage?s make the distinction that everything (or near everything) is a function. They often lend to recursion more than iteration. Some examples of FunctionalLanguages? are:

Programmers generally choose to code in ImperativeLanguage?s as they find these easier to make practical applications. It has been theorised that this is because most people learn languages such as C++, BASIC, Java etc. first and only learn FunctionalLanguage?s later, never really learning to think like a functional programmer. Perhaps if more programmers were taught to think in a functional style from their infancy we would see more applications written in FunctionalLanguage?s. Then again, maybe it is just easier to write a useful program in Python.