From Wikibooks, the open-content textbooks collection
[edit] Introduction
Lambda Calculus is a formal language which helped define the notion of a computable funcion. The languages lisp, scheme and haskell are very closely related to lamda calculus. The language defines means for abstraction and invocation, which are its axioms. All other programming constructs are derived from these basic axioms.
[edit] Contents
- Cover · Noted contributors · External links · Full table of contents
Basic Definitions- Lambda Reduction
- Building Blocks
 |
A reader has identified this book as an inactive stub. You are encouraged to reorganize and expand it.
Books at Wikibooks are in various stages of development. Stubs are undeveloped starts to a book that need to be expanded. Inactive stubs are those with no active contributors. You can adopt and improve this book at any time!
To discuss the development of this book please use the associated discussion page. Once the book has been expanded, remove this template or replace it with other cleanup templates as necessary. As for help at WB:PROJECTS.
|
