Abstract
AbstractA closed λ-termEis called anenumeratorifHere ⋀0is the set of closed λ-terms,. is the set of natural numbers and the ⌜n⌝ are the Church's numerals λfx.fnx. Such anEis calledreducingif, moreoverAn ingenious recursion theoretic proof by Statman will be presented, showing that every enumerator is reducing. I do not know any direct proof.
Publisher
Cambridge University Press (CUP)
Reference5 articles.
1. Mulder J. C. 1990. Case studies in process specification and verification. PhD thesis, University of Amsterdam.
2. λ-definability and recursiveness
3. Barendregt H. P. 1971. Some extensional term models for lambda calculi and combinatory logics. PhD thesis, Utrecht University.
4. Theoretical pearls: Self-interpretation in lambda calculus;Barendregt;J. Functional Programming,1991
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献