Lambda Calculus

From PKC
Revision as of 03:25, 5 January 2022 by Benkoo (talk | contribs)
Jump to navigation Jump to search

Lambda calculus is a universal/Turing-complete language specification, 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].


References

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

Related Pages