Lambda Calculus

From PKC
Revision as of 14:50, 18 January 2022 by Benkoo (talk | contribs)
Jump to navigation Jump to search

Lambda calculus is a universal/Turing-complete language specification invented by Alonzo Church, that is considered to be mathematically elegant, due to its small size. Almost all text-based formal languages are defined using Lambda calculus. To learn about its history, it is recommended to watch this video by Dana Scott[1].

Lambda Calculus and Abstract Syntax Tree

All decision making procedures can be represented into three major kinds of branching:

  1. Naming
  2. Typing
  3. Applying


References

  1. Scott, Dana (Aug 24, 2012). Dana S. Scott Lambda Calculus, Then and Now. local page: princetonacademics. 

Related Pages