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
不动点定理
转载：https://blog.csdn.net/universsky2015/article/details/100981151
查看评论