首页 / 词典 / good

haskell

  • 网络哈斯克尔;哈斯凯尔
haskellhaskell
  1. Haskell did not live to discover the deception

    哈斯克尔至死都没识破那个骗局。

  2. You can combine functions in many different ways within Haskell programs .

    在Haskell程序中,可以用许多不同的方式组合函数。

  3. This important capability lets many Haskell functions take a function as a parameter .

    这项重要的功能让众多的Haskell函数可以接受函数作为参数。

  4. Haskell : Learn more about this pure functional programming language .

    Haskell:学习关于这种纯函数性编程语言的更多知识。

  5. Haskell computes only the first two elements of the list .

    Haskell只计算列表的头两个元素。

  6. Haskell deals with data structures very well .

    Haskell能够很好地处理数据结构。

  7. The Features of Lazy Evaluation of Haskell and their Applications

    Haskell语言的惰性计算特性及其应用

  8. This article explores functional programming by giving you an introduction to Haskell .

    这篇文章通过介绍Haskell来研究函数性编程。

  9. You 'll notice Haskell programs frequently use recursion to solve a problem .

    可以注意到:Haskell程序频繁地用递归来解决问题。

  10. This is how a Haskell programmer works around using destructive updates .

    Haskell程序员就是这样避免了使用破坏性更新。

  11. If your problem set is a good fit for Haskell , that higher abstraction will work for you .

    如果您的问题集恰好适合Haskell,那么更高级别的抽象就适合您。

  12. The international boundary is marked on the floor of the reading room of the Haskell Library .

    国际边界被标记在Haskell图书馆的阅览室的地板上。

  13. Haskell envisioned a private community built around a park , each home enveloped by nature .

    卢埃林当初设想在公园的基础上建造一个私人社区,其中的每所住宅都由绿化环绕。

  14. Haskell has a powerful typing model .

    Haskell拥有强大的类型模型。

  15. The functional programming language known as Haskell features a program for symbolic mathematics known as DoCon .

    称作Haskell的函数式编程语言展示了一个用于符号数学的程序,名为DoCon。

  16. The three most prominent data structures in Haskell are tuples , lists , and user-defined types .

    Haskell中最突出的三种数据结构是:tuple、列表(list)和用户定义的类型。

  17. Another central notion in Haskell is laziness .

    惰性(laziness)是Haskell的中心概念之一。

  18. You 'll see later ( in Writing functions ) how these functions form the backbone of many recursive functions in Haskell .

    稍后还会看到(在编写函数中)这些函数如何构成了Haskell中众多递归函数的基础。

  19. Because Haskell strings are just lists of characters , you get the " HELLO " string back .

    因为Haskell的字符串就是字符列表,所以得到的是“HELLO”字符串。

  20. This is notable as GHC used to use Darcs , a distributed version control system written in Haskell .

    值得一提的是GHC曾经使用的是Darcs,一个由Haskell编写的分布式版本控制系统。

  21. Ask Haskell or Scheme programmers , and they 'll tell you that functions are the most important feature of any serious programming language .

    Haskell或Scheme程序员会告诉您,函数对于任何严肃的编程语言来说都是最重要的特性。

  22. Blair and Haskell say the training threshold concept may be misleading , because smaller doses of exercise can produce some improvement .

    布莱尔和哈斯卡尔则说:这种训练门坎的观念可能有错误。因为少量的运动也能增进健康。

  23. Haskell complains if you use a type ambiguously or if you try to use an unsupported type with a function .

    如果使用类型模糊不清或者在函数中使用不支持的类型,Haskell会报错。

  24. In this paper an automatic Monad generator from other style of Monad is designed and implemented in Haskell .

    鉴于这种思想,用支持Monad程序设计的高阶函数语言Haskell实现了一个Monad的自动生成系统。

  25. Blair and Haskell agree that the highest-risk men are those who do virtually nothing .

    布莱尔和哈斯卡尔都同意所谓高危险群就是那些从不运动的人。

  26. If you 're new to Haskell , the Hugs interpreter is a good choice because it 's easy to install and understand .

    如果刚接触Haskell,那么Hugs解释器是个不错的选择,因为它安装和理解起来都比较容易。

  27. Haskell is statically typed , so once you assign a variable to a value , the variable always holds the same type .

    Haskell是静态类型化的,所以一旦给变量分配了值,那么变量就会一直维持相同的类型。

  28. Ronald Haskell , 33 , has been charged with capital murder in connection to the massacre .

    33岁的罗纳德已被指控在这个惨案中犯有谋杀罪。

  29. This paper introduces the features of list comprehensions of Haskell and explains how to design powerful but concise programs through several examples by using these features .

    该文介绍Haskell语言的列表内涵特性,并通过几个相关的例子,阐述如何利用Haskell语言的列表内涵特性来编写功能强大但却简短优美的程序。

  30. You 're telling Haskell that a tree is made up of nothing or of a tree , followed by a value , followed by another tree .

    它告诉Haskell:树可以可以什么都不包含,也可以是由树构成的,树后面跟着值,后面又跟着另一个树。