Differences between version 10 and previous revision of LambdaCalculus.
Other diffs: Previous Major Revision, Previous Author, or view the Annotated Edit History
| Newer page: | version 10 | Last edited on Sunday, October 26, 2003 7:35:05 am | by AristotlePagaltzis | Revert |
| Older page: | version 9 | Last edited on Friday, October 24, 2003 7:02:11 pm | by CarstenKlapp | Revert |
@@ -1,5 +1,5 @@
-A conceptual model of computers based on defining and evaluating functions. Of the current ProgrammingLanguages
, [LISP], [Scheme], [Haskell] and other FunctionalLanguages
best expose this conceptual model.
+A conceptual model of computers based on defining and evaluating functions. Of the current [ProgrammingLanguage]s
, [LISP], [Scheme], [Haskell] and other Category:FunctionalProgrammingLanguages
best expose this conceptual model.
One of the fundamental proofs in ComputerScience is that any result calculable in LambdaCalculus is calculable on a FiniteStateMachine.
(From memory:)
