Introduction to Combinators and [Lambda]-Calculus

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 the book $54.50 new   $311.94 used    Amazon page
Call number QA9.5.H56 1986
ISBN(s) 0521268966   9780521268967
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,351
External links
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA
    Richard T. Oehrle (1994). Term-Labeled Categorial Type Systems. Linguistics and Philosophy 17 (6):633 - 678.
    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    13 ( #100,521 of 1,088,380 )

    Recent downloads (6 months)

    1 ( #69,601 of 1,088,380 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.