Unifying Math Ontologies: A Tale of Two Standards
Calculemus '09/MKM '09 Proceedings of the 16th Symposium, 8th International Conference. Held as Part of CICM '09 on Intelligent Computer Mathematics
The Functional Interpretation of Direct Computations
Electronic Notes in Theoretical Computer Science (ENTCS)
The search for a reduction in combinatory logic equivalent to λβ-reduction
Theoretical Computer Science
ECAL'09 Proceedings of the 10th European conference on Advances in artificial life: Darwin meets von Neumann - Volume Part I
Term rewriting in logics of partial functions
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Combinatory categorial grammar as a substructural logic: preliminary remarks
JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
PNL to HOL: From the logic of nominal sets to the logic of higher-order functions
Theoretical Computer Science
Extractability as the deduction theorem in subdirectional combinatory logic
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
A short introduction to implicit computational complexity
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design
A decidable theory of type assignment
Archive for Mathematical Logic
A Simplified Proof of the Church---Rosser Theorem
Studia Logica
| Hi-index | 0.00 |
Combinatory logic and lambda-calculus, originally devised in the 1920's, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this long-awaited new version is thoroughly revised and offers a fully up-to-date account of the subject, with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.