$52.00 (20% off) Lambda-Calculus and $38.70 (10% off) Lambda-calculus, Combinators $16.47 (34% off) An Introduction to Functional $30.99 Introduction to Combinators $48.31 (19% off) Comprehensive Mathematics $99.00 The Parametric Lambda $99.00 Abstract Computing Machines $63.53 (36% off) Pattern Calculus [Lambda]-calculus and $188.65 The Lambda Calculus,

1. Lambda-Calculus and Combinators: An Introduction by J. Roger Hindley, Jonathan P. Seldin List Price: Price: You Save: US$65.00 US$52.00 US$13 (20%) Category: Hardcover (2008-08-11) Publisher: Cambridge University Press ISBN: 0521898854 Sales Rank: 580466 Lowest New Price: $48.25 Lowest Used Price: $48.25 (9 Used Items) Canada | United Kingdom | Germany | France | Japan Product Description 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. ... Read more Similar Items: 1. Types and Programming Languages 2. The Haskell Road to Logic, Maths and Programming (Texts in Computing) 3. Purely Functional Data Structures 4. Lambda-calculus, Combinators and Functional Programming (Cambridge Tracts in Theoretical Computer Science) 5. Programming in Scala: A Comprehensive Step-by-step Guide .

2. Lambda-calculus, Combinators and Functional Programming (Cambridge Tracts in Theoretical Computer Science) by G. E. Revesz List Price: Price: You Save: US$43.00 US$38.70 US$4.3 (10%) Category: Paperback (2009-06-25) Publisher: Cambridge University Press ISBN: 0521114292 Sales Rank: 715113 Lowest New Price: $34.23 Lowest Used Price: $29.99 (5 Used Items) Canada | United Kingdom | Germany | France | Japan Product Description Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. The main purpose of the book is to provide computer science students and researchers with a firm background in lambda-calculus and combinators and show the applicabillity of these theories to functional programming. The presentation of the material is self-contained. It can be used as a primary text for a course on functional programming. It can also be used as a supplementary text for courses on the structure and implementation of programming languages, theory of computing, or semantics of programming languages. ... Read more Customer Reviews Average Customer Review: Based on 1 reviews. Great introduction, but can feel dated This is an excellent and approachable introduction to the Lambda Calculus and its relevance to computer science. It introduces the calculus as a means of describing computer programs, and not merely as a mathematical construct. In the space of just over a eighty pages it develops the mathematical foundation for the calculus without the all too common cycle of theorem statements and proofs that can exhaust many readers. It also develops enough syntactic sugar for the calculus that the result should look familiar to any functional programmer. The remainder of the book defines the semantics of the calculus, and then shows how to implement these semantics on traditional computer systems (including shared memory multiprocessors) using graph reduction. Oh, and while at it, it also includes a proof of the Church Rosser theorem and an overview of the typed lambda calculus in appendices. That so much material is covered so succinctly, while remaining comprehensible, is what recommends this book. Readers should remember that this book was published nearly a quarter century ago. Functional programming is now more widely accepted (consider Scala, Erlang, Haskell, F#, ML, and so on) and so this book often feels dated. Most noticeably the syntax chosen for lambda application requires far too many parenthesis. Apparently this was chosen to make predictive parsing easy, but I sorely missed the curried, left associative style for function application that is favored today. I also have to say, that with all due respect to John Backus and his Turing Award lecture, that the references to FP do feel like an anachronism. The extensive discussion of incremental garbage collection near the end of the book also seems out of place. Even the typeface and code formatting conventions hark back to an earlier age of computing (I'm not suggesting this is for the worse, rather that it is just different: imagine reading ALGOL-60 or MIX code today). In the end though the dated feel of the text is a relatively minor annoyance. Readers just need to remember that all really good mathematics is timeless, even when it is expressed in programming terms that are not! ... Read more Similar Items: 1. Lambda-Calculus and Combinators: An Introduction 2. Real World Haskell 3. Types and Programming Languages 4. Basic Simple Type Theory (Cambridge Tracts in Theoretical Computer Science) 5. Conceptual Mathematics: A First Introduction to Categories .

3. An Introduction to Functional Programming Through Lambda Calculus by Greg Michaelson List Price: Price: You Save: US$24.95 US$16.47 US$8.48 (34%) Category: Paperback (2011-01-20) Publisher: Dover Publications ISBN: 0486478831 Sales Rank: 2049421 Lowest New Price: $16.47 Canada | United Kingdom | Germany | France | Japan Customer Reviews Average Customer Review: Based on 1 reviews. Gentlest Possible introduction to Lambda Calculus Very easy to understand. Has the added bonus of solutions to all the questions. Unlike Hankins book you really can teach yourself Lambda Calculus with this. If you see a copy available grab it. ... Read more

4. Introduction to Combinators and (lambda) Calculus (London Mathematical Society Student Texts) by J. R. Hindley, J. P. Seldin List Price: $30.99 Category: Paperback (1986-05-31) Publisher: Cambridge University Press ISBN: 0521318394 Sales Rank: 1999455 Lowest Used Price: $14.76 (13 Used Items) Canada | United Kingdom | Germany | France | Japan Product Description 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. ... Read more Customer Reviews Average Customer Review: Based on 1 reviews. A MUST for programmers using Haskell and/or ML! This book is a very well-written introductory textbook on combinatory logic and lambda-calculus, both of which are the most essntial core of modern functional programming languages such as Haskell, Standard ML, CAML, etc. This book covers typed lambda-calculi/combinatory logic as well as type-free ones. Many useful and understandable examples/counter-examples are given when theorems or definitions of notions must be rather abstract and general. Those (especially counter-)examples avoid readers from falling into pitfalls of abstract notions for novices of math logic. It is often the case that several distinct notions seem to be equivalent for novices. This is a typical pitfall of abstractness, but clear counter-examples are carefully given just at such pitfalls so that novices of lambda-calculus/combinatory logic can prevent to fall down into confusion. Proofs in this charming textbook are very easily followable. Owing to various helpful examples and/or counter-examples, readers will not lose their intuition even in front of such logical exactness and/or very dry abstractness. Needless to say, this book is imperative for students of lambda-calculus, combinatory logic, type theory, or constructive math (all of these are fields of math logic), because this book gives very self-contained accounts on core parts of those fields. The value of this beautiful book is not limitted within such purely academic math logic fields, though. This beautiful book is also a must for practical programmers of functional languages as listed above, because this book very well tells practitioners about the scientific theory behind their working tools, i.e. functional programming languages. Then, programmers can become to believe that science is really useful in software development, which is often regarded as an engineering field where academic pure science does not give any help. If you are a functional programmer, you should have a copy! (If you are a students on topics of this book, you MUST, too, of course!) ... Read more Similar Items: 1. To Mock a Mockingbird: And Other Logic Puzzles .

5. Comprehensive Mathematics for Computer Scientists 2: Calculus and ODEs, Splines, Probability, Fourier and Wavelet Theory, Fractals and Neural Networks, ... and Lambda Calculus (Universitext) (v. 2) by Guerino B. Mazzola, Gérard Milmeister, Jody Weissmann List Price: Price: You Save: US$59.95 US$48.31 US$11.64 (19%) Category: Paperback (2004-11-23) Publisher: Springer ISBN: 3540208615 Sales Rank: 1314243 Lowest New Price: $36.43 Lowest Used Price: $36.43 (7 Used Items) Canada | United Kingdom | Germany | France | Japan Product Description   This two-volume textbook Comprehensive Mathematics for the Working Computer Scientist is a self-contained comprehensive presentation of mathematics including sets, numbers, graphs, algebra, logic, grammars, machines, linear geometry, calculus, ODEs, and special themes such as neural networks, Fourier theory, wavelets, numerical issues, statistics, categories, and manifolds. The concept framework is streamlined but defining and proving virtually everything. The style implicitly follows the spirit of recent topos-oriented theoretical computer science. Despite the theoretical soundness, the material stresses a large number of core computer science subjects, such as, for example, a discussion of floating point arithmetic, Backus-Naur normal forms, L-systems, Chomsky hierarchies, algorithms for data encoding, e.g., the Reed-Solomon code. The numerous course examples are motivated by computer science and bear a generic scientific meaning. This text is complemented by an online university course which covers the same theoretical content, however, in a totally different presentation. The student or working scientist who once gets involved in this text may at any time consult the online interface which comprises applets and other interactive tools. ... Read more Features: ISBN13: 9783540208617 Condition: New Notes: BUY WITH CONFIDENCE, Over one million books sold! 98% Positive feedback. Compare our books, prices and service to the competition. 100% Satisfaction Guaranteed Similar Items: 1. Comprehensive Mathematics for Computer Scientists 1: Sets and Numbers, Graphs and Algebra, Logic and Machines, Linear Geometry (Universitext) (v. 1) 2. Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science) 3. The Symmetries of Things .

6. The Parametric Lambda Calculus: A Metamodel for Computation by Simona Ronchi Della Rocca List Price: Price: US$99.00 US$99.00 Category: Paperback (2010-02-19) Publisher: Springer Berlin Heidelberg ISBN: 3642057462 Lowest New Price: $99.00 Canada | United Kingdom | Germany | France | Japan Product Description The Parametric Lambda Calculus is a meta-model for computation, in the sense that it can be specialized in order to obtain paradigmatic languages (in particular lambda-calculi) for modelling different kinds of computation. The book considers in particular the call-by-name computation, in both its lazy and not lazy version, and the call-by-value one. The book is a completely new presentation of some classical results in the Lambda Calculus field, together with some new results. The originality is that a new calculus is presented, the Parametric Lambda Calculus, that can be instantiated in order to obtain some already known lambda-calculi. Some properties, that in the literature have been proved separately for different calculi, can be proved once for the Parametric one. The lambda calculi are presented from a Computer Science point of view, so with a particular emphasis on their semantics, both operational and denotational. ... Read more

7. Abstract Computing Machines: A Lambda Calculus Perspective by Werner Kluge List Price: Price: US$99.00 US$99.00 Category: Paperback (2010-01-14) Publisher: Springer Berlin Heidelberg ISBN: 3642059384 Lowest New Price: $99.00 Canada | United Kingdom | Germany | France | Japan Product Description This book takes a Lambda-calculus approach to organizing computations. It sets out with a brief introduction to Lambda-calculus, describes a variant of the classical secd-machine as a basic interpreter for the Lambda-calculus, and in the main part continues with strongly normalizing abstract Lambda-calculus machines, of which some are interpreting and some execute compiled code. The classical functional abstract machines are introduced as their weakly normalizing counterparts, and abstract machines for classical imperative languages are shown to derive from them by admitting side-effecting operations. ... Read more Similar Items: 1. Types and Programming Languages 2. Pattern Calculus: Computing with Functions and Structures 3. Real World Haskell 4. Language Implementation Patterns: Create Your Own Domain-Specific and General Programming Languages (Pragmatic Programmers) 5. Solving Higher-Order Equations : From Logic to Programming (Progress in Theoretical Computer Science) .

8. Pattern Calculus: Computing with Functions and Structures by Barry Jay List Price: Price: You Save: US$99.00 US$63.53 US$35.47 (36%) Category: Hardcover (2009-08-12) Publisher: Springer ISBN: 3540891846 Sales Rank: 1173807 Lowest New Price: $61.19 Lowest Used Price: $61.18 (9 Used Items) Canada | United Kingdom | Germany | France | Japan Product Description The pattern calculus is a new foundation for computation, in which the expressive power of functions and of data structures are combined within pattern-matching functions. The best existing foundations focus on either functions, as in the lambda-calculus, or on data structures, as in Turing machines, or on compromises involving both, as in object-orientation. By contrast, a small typed pattern calculus is able to support all the main programming styles, including functional, imperative, object-oriented and query-based styles, and there is evidence that it can support a language for Web services, able to exploit data structures about which almost nothing is known. The book is divided into three parts, on terms, types and programs, and contains many new results. Part I introduces static and then dynamic pattern calculus. The former supports path polymorphic functions, able to traverse arbitrary paths through data structures. It also shows how Lisp is more than just lambda-calculus. The dynamic calculus allows any term to be a pattern, so that patterns can be discovered, combined and simplified on the fly. Part II supports a family of type systems for pattern calculi that build on novel typings of lambda-calculus. The type system for query calculus allows database queries to be applied uniformly to arbitrary data structures, while still guaranteeing that evaluation terminates. Subtyping and type parameters combine to produce type inequalities, whose solutions provide an expressive account of object-orientation. Also, typing can be made implicit, which simplifies implementation. Part III realises all these ideas in a new programming language, bondi, where the various programming styles can be combined, including algebraic data types and object-oriented classes. This book is useful for researchers with an interest in the foundations of computing, programming language design, the integration of existing programming styles, or the development of new programming styles. The reader is supported throughout with proofs and examples, both in text and in bondi, the source code of which is freely available online. ... Read more Customer Reviews Average Customer Review: Based on 2 reviews. Next step in theory of computations Software developers know the painful truth that it takes very high caliber people to produce an average to poor quality product. The reason : software developers do not have a set of tools that construction engineers have, by which they repeatedly check their work before, during and after construction. Pattern calculus is the next step in filling that void, next step for those who have understood Turing machines, Lambda Calculus and other forms of discrete mathematics, i.e., the state of art of computer theory. It has taken many decades for someone to come up with the next step of computation theory because this is not an easy step. To comprehend the next step requires an ability jumping from concrete to abstract thinking, the kind of jump that was required to understand Lambda calculus by arithematicians. The author has used an easy to understand style with simple examples to help us towards that. The success of the book and the next revolution in theoretical computer science depends on the ability of a critical mass of computer scientists, understanding the concepts and realizing their significance. It is bound to happen. Tour de force but a hard read You will buy this book as a faithful if you have been writing software for more than thirty years and are confronted with the tear and wear in its current theoretical and practical foundations. The eternal question is "how to blend data and functions together so as be rigorously expressive but also to allow later growth of design"? This book presents one of the strongest answers this question in the form of a theoretical presentation of pattern calculus and its implementation as a programming language. Conceptually that would deserve five stars. But... style wise the book is terse and it takes sheer will power to read it carefully because the writing is linear and it does become a bit monotonous. Thus the four stars only score! You need at least notions of type theory to read the book. ... Read more Similar Items: 1. Let Over Lambda 2. Elements of Programming 3. Communicating and Mobile Systems: the Pi-Calculus 4. Topoi: The Categorial Analysis of Logic (Dover Books on Mathematics) 5. Purely Functional Data Structures .

9. [Lambda]-calculus and computer science theory: Proceedings of the symposium held in Rome, March 25-27, 1975 (Lecture notes in computer science) Category: Unknown Binding (1975) Publisher: Springer-Verlag ISBN: 0387074163 Sales Rank: 8929654 Lowest Used Price: $24.00 (2 Used Items) Canada | United Kingdom | Germany | France | Japan

10. The Lambda Calculus, Its Syntax and Semantics (Studies in Logic and the Foundations of Mathematics, Volume 103). Revised Edition by H.P. Barendregt List Price: $137.00 Category: Paperback (1985-11-15) Publisher: North Holland ISBN: 0444875085 Sales Rank: 960307 Lowest New Price: $188.65 Lowest Used Price: $79.85 (12 Used Items) Canada | United Kingdom | Germany | France | Japan Product Description The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course. ... Read more Customer Reviews Average Customer Review: Based on 4 reviews. great book, but not available here I have this book checked out from a university library, and it is quite wonderful. Despite the fact that Amazon continues to list it for sale, it is not currently available. Self-contained Encyclopedia! All you need is your patience! This encyclopedic monograph is now a classic of this field, lambda-calculus, which is the theoretical basis of practical functional programming languages such as Standard ML, CAML, Haskell etc. This book itself is purely theoretical and principally aimed for researchers/students of its field. This book is very comprehensive. In fact, this book successfully compiles almost all results on type-free lambda-calculus up to the time of its publication (early 1980's). Surprisingly enough!, however, this very technical encyclopedic monograph is self-contained. Proofs of all theorems/lemmata are given up to details except for cases that they are intentionally left for excercises. Therefore, even a novice of its field can follow all of the proofs. The only one thing that such a novice must have is patience. His/her patience will surely be rewarded. Backgrounds assumed in this encyclopedic monograph is the very beginning level understanding of mathematical logic. If you are not familiar with math logic, you can learn the necessary backgrounds with any introductory textbooks on math logic. All more technical notions and notations are defined/explained in this book. Many interesting examples are given. Exercises at the end of each charpter are very helpful and also are very interesting. The author clearly paid much attention and took care on the arrangement of exercises so that readers can tackle easier one at first. Moreover such carefully arranged exercises tell readers more. Readers will understand very delicate but important points during solving exercises by themselves. In other words, the last sentence means the following fact: imagine there are two intuitively similar notions (it is often the case that very abstract theory has many such pairs of notions) that novices can confuse each other. Solving one exercise tell the novice that one notion is not implied from the other. Also solving another exercise tell vice-versa. Indices and references are very useful. In fact, indices are carefully designed. Not only the index of technical terms, there are indices for symbols and authors (of references refered in the main text). References are very comprehensive. There are very few typos (another surprising points! Math books almost always handreds of typos) except for misuses of type-faces which are clearly due to typesetting by the publisher. This book, as I pointed before, is on pure math logic and its readership is clearly researchers/students of its field. But, as a computer scientist, I recommend this book to all of the functional programmers, who, at least, are serious about the background of their profession. If you read this book, you will understand that there is a very beautiful (though abstract) world of theories behind ML/Haskell programming. If you are a student who wants study lambda-calculus, combinatory logic, type theory, constructive math, etc., then, this book is for you, too, of course. This encyclopedia doubtlessly will give you the basis to become the researcher on such fields. It's online This is a great book. A must buy for all graduate students in computer science. Because the book is out of print, you can obtain it online at...... Not a classic, but all in all very informative I accidently bought this book thinking I was buying a traditional calculus book in order to prepare for a standardized test I had to take. After a few chapters I realized this was no ordinary Calculus book. None-the-less I got much out of it. It is the kind of book where the author builds up the advanced topics from most basic concepts, so it is pretty much accessible to anyone who is reasonably intelligent. It also has a very nice graphical lay-out with regards to the symbols and such which makes it much easier to read and learn from. Although it didn't help me do well on the AP Calculus test, I would suggest buying it to anyone who has a good reason to. It is the kind of book that you can use to learn from and use it as a reference book. ... Read more Similar Items: 1. Lambda-Calculus and Combinators: An Introduction 2. Elements of Programming 3. Types and Programming Languages 4. Introduction to Algorithms, Third Edition 5. Java Concurrency in Practice . Favourite Lists: 1. A Few Good Books on Theoretical Computer Science. 2. Some mathematics for Software Technology. 3. The Programmer's Canon. 4. A Greek guide to the Amazon catalog, part 1.