2

我正在尝试实现阶乘的尾递归版本:

let{factorial 0 n = n; factorial x n =  factorial (x-1, n * x)}

我明白了:

<interactive>:1:41:
Occurs check: cannot construct the infinite type: t1 = t1 -> t1
In the return type of a call of `factorial'
In the expression: factorial (x - 1, n * x)
In an equation for `factorial':
    factorial x n = factorial (x - 1, n * x)

<interactive>:1:52:
Occurs check: cannot construct the infinite type: t0 = (t0, t1)
In the first argument of `(-)', namely `x'
In the expression: x - 1
In the first argument of `factorial', namely `(x - 1, n * x)'

<interactive>:1:61:
Occurs check: cannot construct the infinite type: t1 = (t0, t1)
In the second argument of `(*)', namely `x'
In the expression: n * x
In the first argument of `factorial', namely `(x - 1, n * x)'

我如何在这里构造一个无限类型?(使用 GHCi 7.0.1)

4

1 回答 1

7

我不是一个强大的 Haskell 程序员,但我认为你想重写

factorial x n =  factorial (x-1, n * x)

作为

factorial x n =  factorial (x-1) (n * x)

因为(x-1, n * x)是一对类型,这不是你想要的。

希望这可以帮助!

于 2012-07-24T19:37:30.570 回答