Cambridge University Press (1986)

Abstract
Combinatory logic and lambda-conversion were originally devised in the 1920s for investigating the foundations of mathematics using the basic concept of 'operation' instead of 'set'. They have now developed into linguistic tools, useful in several branches of logic and computer science, especially in the study of programming languages. These notes form a simple introduction to the two topics, suitable for a reader who has no previous knowledge of combinatory logic, but has taken an undergraduate course in predicate calculus and recursive functions. The key ideas and basic results are presented, as well as a number of more specialised topics, and man), exercises are included to provide manipulative practice.
Keywords Combinatory logic  Lambda calculus
Categories (categorize this paper)
Buy this book Find it on Amazon.com
Call number QA9.5.H56 1986
ISBN(s) 0521268966   9780521268967
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 64,159
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Demonstratives as Individual Concepts.Paul Elbourne - 2008 - Linguistics and Philosophy 31 (4):409-466.
Term-Labeled Categorial Type Systems.Richard T. Oehrle - 1994 - Linguistics and Philosophy 17 (6):633 - 678.

View all 15 citations / Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
41 ( #263,886 of 2,454,913 )

Recent downloads (6 months)
2 ( #303,322 of 2,454,913 )

How can I increase my downloads?

Downloads

My notes