Differences between version 6 and revision by previous author of LambdaCalculus.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 6 | Last edited on Friday, October 24, 2003 2:04:52 pm | by StuartYeates | Revert |
| Older page: | version 5 | Last edited on Friday, October 24, 2003 12:59:56 pm | by PerryLorier | Revert |
@@ -1,5 +1,5 @@
-A conceptual model of computers based on defining and evaluating functions. Of current ProgrammingLanguages, [LISP], [Scheme] and
[Haskell] best expose this conceptual model.
+A conceptual model of computers based on defining and evaluating functions. Of current ProgrammingLanguages, [LISP], [Scheme],
[Haskell] and other FunctionalLanguages
best expose this conceptual model.
One of the fundamental proofs in ComputerScience is that any result calculatable in LambdaCalculus is calculatable on a FiniteStateMachine.
(From memory:)
