Recursion Theory and the Lambda-Calculus
Byerly, Robert E.
J. Symbolic Logic, Tome 47 (1982) no. 1, p. 67-83 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
A semantics for the lambda-calculus due to Friedman is used to describe a large and natural class of categorical recursion-theoretic notions. It is shown that if $e_1$ and $e_2$ are godel numbers for partial recursive functions in two standard $\omega-\mathrm{URS's}^1$ which both act like the same closed lambda-term, then there is an isomorphism of the two $\omega$-URS's which carries $e_1$ to $e_2$.
Publié le : 1982-03-14
Classification:  
@article{1183740941,
     author = {Byerly, Robert E.},
     title = {Recursion Theory and the Lambda-Calculus},
     journal = {J. Symbolic Logic},
     volume = {47},
     number = {1},
     year = {1982},
     pages = { 67-83},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183740941}
}

Byerly, Robert E. Recursion Theory and the Lambda-Calculus. J. Symbolic Logic, Tome 47 (1982) no. 1, pp.  67-83. http://gdmltest.u-ga.fr/item/1183740941/