本文主要是介绍The Lambda Calculus and Combinators,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages.
- The λ-calculus
- Combinatory logic
- The power of λ and CL
- Computable functions
- Undecidability
- Formal theories
- Extensionality in λ-calculus
- Extensionality in CL
- Correspondence between λ and CL
- Simple typing, Church-style
- Simple typing, Curry-style in CL
- Simple typing, Curry-style in λ
- Generalizations of typing
- Models of CL
- Models of λ
- Scott’s D∞ and other models
不动点定理
这篇关于The Lambda Calculus and Combinators的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!