Differences between current version and predecessor to the previous major change of FunctionalLanguages.
Other diffs: Previous Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 7 | Last edited on Sunday, October 26, 2003 6:34:25 am | by AristotlePagaltzis | |
| Older page: | version 6 | Last edited on Friday, October 24, 2003 2:05:43 pm | by StuartYeates | Revert |
@@ -1,9 +1 @@
-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
].
+Describe
[FunctionalLanguages] here
.
