Journal of Symbolic Logic 47 (1):67-83 (1982)
|Abstract||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 ω-URS's 1 which both act like the same closed lambda-term, then there is an isomorphism of the two ω-URS's which carries e 1 to e 2|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
R. A. G. Seely (1987). Categorical Semantics for Higher Order Polymorphic Lambda Calculus. Journal of Symbolic Logic 52 (4):969-989.
William J. Mitchell (2003). A Gitik Iteration with Nearly Easton Factoring. Journal of Symbolic Logic 68 (2):481-502.
Harold Simmons (2000). Derivation and Computation: Taking the Curry-Howard Correspondence Seriously. Cambridge University Press.
György E. Révész (1988). Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press.
Maía Manzano (1997). Alonzo Church:His Life, His Work and Some of His Miracles. History and Philosophy of Logic 18 (4):211-232.
Kevin C. Klement (2003). Russell's 1903 - 1905 Anticipation of the Lambda Calculus. History and Philosophy of Logic 24 (1):15-37.
J. Roger Hindley (1986). Introduction to Combinators and [Lambda]-Calculus. Cambridge University Press.
Chris Hankin (1994). Lambda Calculi: A Guide for the Perplexed. Oxford University Press.
H. P. Barendregt (1984). The Lambda Calculus: Its Syntax and Semantics. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
Added to index2009-01-28
Total downloads2 ( #245,680 of 722,744 )
Recent downloads (6 months)1 ( #60,247 of 722,744 )
How can I increase my downloads?