Topological Representation of the Lambda-Calculus
| Abstract | The [lambda]-calculus can be represented topologically by assigning certain spaces to the types and certain continuous maps to the terms. Using a recent result from category theory, the usual calculus of [lambda]-conversion is shown to be deductively complete with respect to such topological semantics. It is also shown to be functionally complete, in the sense that there is always a ‘minimal’ topological model in which every continuous function is [lambda]-definable. These results subsume earlier ones using cartesian closed categories, as well as those employing so-called Henkin and Kripke [lambda]-models | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
|
| Through your library | Only published papers are available at libraries |
H. P. Barendregt (1984). The Lambda Calculus: Its Syntax and Semantics. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
Robert E. Byerly (1982). Recursion Theory and the Lambda-Calculus. Journal of Symbolic Logic 47 (1):67-83.
Chris Hankin (1994). Lambda Calculi: A Guide for the Perplexed. Oxford University Press.
Henk Barendregt (1997). The Impact of the Lambda Calculus in Logic and Computer Science. Bulletin of Symbolic Logic 3 (2):181-215.
William J. Mitchell (2003). A Gitik Iteration with Nearly Easton Factoring. Journal of Symbolic Logic 68 (2):481-502.
J. Roger Hindley (1986). Introduction to Combinators and [Lambda]-Calculus. Cambridge University Press.
Saharon Shelah (1984). A Pair of Nonisomorphic $\Equiv{\Infty \Lambda}$ Models of Power $\Lambda$ for $\Lambda$ Singular with $\Lambda\Omega=\Lambda$. Notre Dame Journal of Formal Logic 25 (2):97-104.
R. A. G. Seely (1987). Categorical Semantics for Higher Order Polymorphic Lambda Calculus. Journal of Symbolic Logic 52 (4):969-989.
György E. Révész (1988). Lambda-Calculus, Combinators, and Functional Programming. Cambridge University Press.
A. R. D. Mathias (2001). Slim Models of Zermelo Set Theory. Journal of Symbolic Logic 66 (2):487-496.
Don Pigozzi & Antonino Salibra (1995). The Abstract Variable-Binding Calculus. Studia Logica 55 (1):129 - 179.
Roberto M. Amadio (1998). Domains and Lambda-Calculi. Cambridge University Press.
Kevin C. Klement (2003). Russell's 1903 - 1905 Anticipation of the Lambda Calculus. History and Philosophy of Logic 24 (1):15-37.
Monthly downloads |
Added to index2010-09-14Total downloads10 ( #106,438 of 549,518 )Recent downloads (6 months)1 ( #63,397 of 549,518 )How can I increase my downloads? |

