I have some background in set theory and automata and I am looking for a good place to start with lambda calculus.
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
3
5
|
|
|
|
|
4
|
There is, of course, the very famous book by Barendregt, which doesn't require much background except for the usual mathematical maturity. He also has some introductory notes here. |
||
|
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
2
|
Another excellent book is "Lambda-calculus, types and models" Ellis Horwood (1993) by Jean-Louis Krivine http://www.pps.jussieu.fr/~krivine/articles/Lambda.pdf |
||
|
|
|
0
|
Stoy's book: Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Semantics. MIT Press, Cambridge, Massachusetts, 1977 Is a classic, and highly recommended. |
||
|
|
|
0
|
An introductory book that seems very nice to me is Lambda-Calculus and Combinators. An introduction by J. Roger Hindley and Jonathan P. Seldin. |
||
|
|
|
0
|
I really enjoy Types and Programming Languages by Benjamin C. Pierce. We used this for a course on the lambda calculus, and I felt this was a great way for a mathematician to learn the subject |
||
|
|
|
0
|
The best books that I've found are:
|
||
|
|
|
0
|
Proof and Types is a good place to learn about the Curry-Howard isomorphism. |
||
|
|

