Haskell has a powerful typing model.
Haskell拥有强大的类型模型。
A text editor and a Haskell compiler.
一个编辑器和一个编译器。
Haskell lets you treat functions as data.
Haskell允许把函数当成数据。
Haskell deals with data structures very well.
Haskell能够很好地处理数据结构。
Haskell computes only the first two elements of the list.
Haskell只计算列表的头两个元素。
Haskell explained the couple has been saving for almost 21 years.
Haskell解释两人已经存了近21年。
As you'd expect, Haskell has many functions that operate on lists.
如您所料，Haskell有许多在列表上操作的函数。
So, Scala requires more type annotations than languages like Haskell.
所以，scala比haskell这样的语言需要更多的类型注解。
This is how a Haskell programmer works around using destructive updates.
Haskell程序员就是这样避免了使用破坏性更新。
You can combine functions in many different ways within Haskell programs.
在Haskell程序中，可以用许多不同的方式组合函数。
You'll notice Haskell programs frequently use recursion to solve a problem.
可以注意到：Haskell程序频繁地用递归来解决问题。
This important capability lets many Haskell functions take a function as a parameter.
这项重要的功能让众多的Haskell函数可以接受函数作为参数。
If your problem set is a good fit for Haskell, that higher abstraction will work for you.
如果您的问题集恰好适合Haskell，那么更高级别的抽象就适合您。
The three most prominent data structures in Haskell are tuples, lists, and user-defined types.
Haskell中最突出的三种数据结构是：tuple、列表(list)和用户定义的类型。
This is notable as GHC used to use Darcs, a distributed version control system written in Haskell.
值得一提的是GHC曾经使用的是Darcs，一个由Haskell编写的分布式版本控制系统。
It's a really awesome Haskell search engine, you can search by name, module name or even type signature.
你可以用函数名，模块名甚至类型声明来作为检索的条件。
Haskell complains if you use a type ambiguously or if you try to use an unsupported type with a function.
如果使用类型模糊不清或者在函数中使用不支持的类型，Haskell会报错。
If you're new to Haskell, the Hugs interpreter is a good choice because it's easy to install and understand.
如果刚接触Haskell，那么Hugs解释器是个不错的选择，因为它安装和理解起来都比较容易。
Haskell is statically typed, so once you assign a variable to a value, the variable always holds the same type.
Haskell是静态类型化的，所以一旦给变量分配了值，那么变量就会一直维持相同的类型。
Though generate represents an infinite list of 1s, Haskell computes only the portion of the list that it needs.
虽然generate代表1的无穷列表，但Haskell只计算列表中自己需要的部分。
The functional programming language known as Haskell features a program for symbolic mathematics known as DoCon.
称作Haskell的函数式编程语言展示了一个用于符号数学的程序，名为DoCon。
They both have day jobs, Mr. Haskell as an editor at New York magazine and Mr. Spoelman in an architecture firm.
他们白天都有工作，哈斯克尔先生是纽约杂志的编辑，而斯波曼先生在一家建筑公司工作。
You'll see later (in Writing functions) how these functions form the backbone of many recursive functions in Haskell.
稍后还会看到(在编写函数中)这些函数如何构成了Haskell中众多递归函数的基础。
Haskell has two primary advantages when dealing with recursion: Haskell optimizes tail recursion, and Haskell is lazy.
在处理递归时，Haskell有两大优势：Haskell优化了尾部递归，Haskell是惰性的。
Common examples of declarative programming include spreadsheets, SQL, XSLT, and programming languages such as Haskell.
声明性编程的常见例子包括电子表格、SQL、XSLT和诸如Haskell这样的编程语言。
Dozens of other Haskell compilers and interpreters exist, including offshoots of Hugs and the GHC, but they are the main two.
还有许多其他Haskell编译器和解释器，包括Hugs和GHC的分支，但是它们是主要的两个。
The kind of syntactic sugar you'll find with strings and lists is common in Haskell, but just remember: Everything is a function.
在Haskell中，您会发现在字符串和列表中这种语法代称非常普遍。但是只要记住：一切都是函数。
That's why there are no while loops or for loops in Haskell and instead we many times have to use recursion to declare what something is.
这便是haskell没有while或for循环的原因，我们的替代方案是使用递归。
The classic Haskell functions that you'll find in most tutorials are recursive math functions, such as Fibonacci functions and factorials.
在大多数教程中可以发现的大多数经典Haskell函数都是递归的数学函数，例如fibonacci函数和阶乘。
Ask Haskell or Scheme programmers, and they'll tell you that functions are the most important feature of any serious programming language.
Haskell或Scheme程序员会告诉您，函数对于任何严肃的编程语言来说都是最重要的特性。
应用推荐