Differences between version 6 and predecessor to the previous major change of FunctionalLanguages.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 6 | Last edited on Friday, October 24, 2003 2:05:43 pm | by StuartYeates | Revert |
| Older page: | version 1 | Last edited on Wednesday, February 26, 2003 12:28:15 pm | by SamJansen | Revert |
@@ -1,7 +1,9 @@
-A type of ProgrammingLanguage. FunctionalLanguages make the distinction that everything (or near everything) is a function. They often lend to recursion more than iteration. Some examples of FunctionalLanguages are:
+A type of ProgrammingLanguage, based loosely on the LambdaCalculus approach to computer science
. FunctionalLanguages make the distinction that everything (or near everything) is a function. They often lend to recursion more than iteration. Some examples of FunctionalLanguages are:
* [Haskell]
+* [Erlang]
* [ML]
* [LISP]
+* [XSLT]
Programmers generally choose to code in ImperativeLanguages 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 FunctionalLanguages 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 FunctionalLanguages. Then again, maybe it is just easier to write a useful program in [Python].
