Journal of Symbolic Logic 47 (1):67-83 (1982)
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)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Categorical Semantics for Higher Order Polymorphic Lambda Calculus.R. A. G. Seely - 1987 - Journal of Symbolic Logic 52 (4):969-989.
Introduction to Combinators and [Lambda]-Calculus.J. Roger Hindley - 1986 - Cambridge University Press.
Russell's 1903 - 1905 Anticipation of the Lambda Calculus.Kevin C. Klement - 2003 - History and Philosophy of Logic 24 (1):15-37.
Alonzo Church:His Life, His Work and Some of His Miracles.Maía Manzano - 1997 - History and Philosophy of Logic 18 (4):211-232.
Lambda-Calculus, Combinators, and Functional Programming.György E. Révész - 1988 - Cambridge University Press.
Derivation and Computation: Taking the Curry-Howard Correspondence Seriously.Harold Simmons - 2000 - Cambridge University Press.
A Gitik Iteration with Nearly Easton Factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.
Topological Representation of the Lambda-Calculus.Steve Awodey - 2000 - Mathematical Structures in Computer Science 10 (1):81-96.
Added to index2009-01-28
Total downloads13 ( #357,550 of 2,177,988 )
Recent downloads (6 months)1 ( #317,698 of 2,177,988 )
How can I increase my downloads?