Constructive Proofs of the Range Property in lambda-Calculus
暂无分享,去创建一个
[1] Henk Barendregt,et al. Theoretical Pearls: Self-interpretation in lambda calculus , 1991, Journal of Functional Programming.
[2] Hendrik Pieter Barendregt. Representing 'undefined' in lambda Calculus , 1992, J. Funct. Program..
[3] H. Barendregt. Lambda Calculus kHV its Hovels , 1984 .
[4] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[5] J. Roger Hindley,et al. To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism , 1980 .
[6] Mariangiola Dezani-Ciancaglini,et al. (Semi)-separability of Finite Sets of Terms in Scott's D_infty-Models of the lambda-Calculus , 1978, ICALP.
[7] Gordon D. Plotkin. The lambda-Calculus is omega-Incomplete , 1974, J. Symb. Log..
[8] J. Ersov. Theorie der Numerierungen II , 1973 .
[9] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .