The systematic construction of a one-combinator basis for Lambda-Terms
暂无分享,去创建一个
A single closed λ-expression that generates all λ-expressions is constructed. The derivation is carried out with simplicity as driving force. The result is simpler than single-combinator bases known in the literature.
[1] Simon L. Peyton Jones,et al. The Implementation of Functional Programming Languages , 1987 .
[2] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[3] M. Schönfinkel. Über die Bausteine der mathematischen Logik , 1924 .
[4] Simon Peyton Jones,et al. The Implementation of Functional Programming Languages (Prentice-hall International Series in Computer Science) , 1987 .