《The Little Schemer：递归与函数式的奥妙》是一本久负盛名的经典之作，两位作者Daniel P. Friedman、Matthias Felleisen在程序语言界名声显赫。《The Little Schemer：递归与函数式的奥妙》介绍了Scheme的基本结构及其应用、Scheme的五法十诫、Continuation-Passing-Style、Partial Function、Y-Combinator、Interpreter等内容，并通过这些内容阐述了计算的一般本质。《The Little Schemer：递归与函数式的奥妙》没有什么理论性描述，所有概念都蕴含在独特的引导式一问一答过程中，这种方式让读者对程序大师运用熟稔的程序方法来驾驭概念的能力叹为观止。
通过阅读《The Little Schemer：递归与函数式的奥妙》，可以让读者领略递归的奥妙、函数式编程风格的魅力。阅读完毕会有一种意犹未尽的感觉。
《The Little Schemer：递归与函数式的奥妙》适合所有程序员阅读，特别是函数式编程爱好者。好好享用！

《haskell趣学指南》是一本讲解haskell这门函数式编程语言的入门指南，语言通俗易懂，插图生动幽默，示例短小清晰，结构安排合理。书中从haskell的基础知识讲起，涵盖了所有的基本概念和语法，内容涉及基本语法、递归、类型和类型类、函子、applicative 函子、monad、zipper及所有haskell重要特性和强大功能。
《haskell趣学指南》适合对函数式编程及haskell语言感兴趣的开发人员阅读。

本书由Erlang之父Joe Armstrong编写，是毋庸置疑的经典著作。书中兼顾了顺序编程、并发编程和分布式编程，重点介绍如何编写并发和分布式的Erlang程序以及如何在多核CPU上自动加速程序，并深入地讨论了开发Erlang应用中至关重要的文件和网络编程、OTP、ETS和DETS等主题。第2版全新改写，反应了自第1版面世以来Erlang历经的所有变化，添加了大量针对初学者的内容，并在每章后都附上了练习题。

Functional programming (FP) is a programming style emphasizing functions that return consistent and predictable results regardless of a program's state. As a result, functional code is easier to test and reuse, simpler to parallelize, and less prone to bugs. Scala is an emerging JVM language that offers strong support for FP. Its familiar syntax and transparent interoperability with existing Java libraries make Scala a great place to start learning FP.
Functional Programming in Scala is a serious tutorial for programmers looking to learn FP and apply it to the everyday business of coding. The book guides readers from basic techniques to advanced topics in a logical, concise, and clear progression. In it, you'll find concrete examples and exercises that open up the world of functional programming.
You'll discover simple but powerful ideas and techniques that cut through the complexity of modern software engineering, including writing multi-core and distributed programs. You'll learn how FP gives you high confidence in the correctness of your code and helps you design software at high levels of abstraction so that even very large systems become comprehensible at a glance.
WHAT'S INSIDE:
Functional programming from square one in clear, readable language
No prior Scala experience needed
Learn both the hows and whys of FP
No prior experience with FP or Scala is required. Perfect for programmers familiar with FP in other languages wishing to apply their knowledge in Scala.

An introduction to dependent types, demonstrating the most beautiful aspects, one step at a time. A program's type describes its behavior. Dependent types are a first-class part of a language, and are much more powerful than other kinds of types; using just one language for types and programs allows program descriptions to be as powerful as the programs they describe. The Little Typer explains dependent types, beginning with a very small language that looks very much like Scheme and extending it to cover both programming with dependent types and using dependent types for mathematical reasoning. Readers should be familiar with the basics of a Lisp-like programming language, as presented in the first four chapters of The Little Schemer. The first five chapters of The Little Typer provide the needed tools to understand dependent types; the remaining chapters use these tools to build a bridge between mathematics and programming. Readers will learn that tools they know from programming-pairs, lists, functions, and recursions-can also capture patterns of reasoning. The Little Typer does not attempt to teach either practical programming skills or a fully rigorous approach to type. Instead, it demonstrates the most beautiful aspects as simply as possible, one step at a time.

[FROM www.amazon.com]:
The Little Prover introduces inductive proofs as a way to determine facts about computer programs. It is written in an approachable, engaging style of question-and-answer, with the characteristic humor of The Little Schemer (fourth edition, MIT Press). Sometimes the best way to learn something is to sit down and do it; the book takes readers through step-by-step examples showing how to write inductive proofs. The Little Prover assumes only knowledge of recursive programs and lists (as presented in the first three chapters of The Little Schemer) and uses only a few terms beyond what novice programmers already know. The book comes with a simple proof assistant to help readers work through the book and complete solutions to every example.