How to Circumvent Church Numerals
暂无分享,去创建一个
In this work we consider a standard numeral system in the lambda-calculus, and the elementary arithmetic and Boolean functions and predicates defined on this numeral system, and show how to construct terms that "circumvent" or "defeat" these functions: The equality predicate is satisfied when comparing these special terms to any numeral, the zero predicate is satisfied for these terms, etc. We believe this exercise offers an instructive look at what definability means in the untyped lambda-calculus.
[1] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[2] Joseph E. Stoy,et al. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory , 1981 .
[3] Mayer Goldberg,et al. Recursive application-survival in the lambda calculus , 1996 .
[4] A. Church. The Calculi of Lambda Conversion. (AM-6) (Annals of Mathematics Studies) , 1985 .
[5] R. Kent Dybvig,et al. Revised5 Report on the Algorithmic Language Scheme , 1986, SIGP.