tangtong

1.1 略 1.2 略 1.3 sumSLT :: (Num a,Ord a) => a -> a -> a -> a sumSLT a b c | (a<b && a<c) = b*b + c*c | (b<a && b<c) = a*a + c*c | otherwise = a*a +...

1.9 略 1.10 略 1.11 {- recursive style f3' n | n<3 = n | otherwise = f3(n-1) + 2*f3(n-2) + 3*f3(n-3) -} getBegin n = n-(fromIntegral t)-1 where t = floor (n-3) ::Integer f3 n |...

 1.29 cube :: Double -> Double cube x = x*x*x getSum term a next b = if a>b then 0 else term a + getSum term (next a) next b simpsonIntegral :: (Double -> Double) -> Double -> Double...

－－包括一些摘录和感言，和零碎的代码 1、要素   写道 Every powerful language has three mechanisms for accomplishing this: * primitive expressions , which represent the simplest entities the language is concerned with,...

2.1 {-data Ration x = R Integer Integer instance (Show a) => Show (Ration a) where showsPrec _ (R n d) = shows (n `div` g).showString " % ". shows (d `div` g) where g = gcd' n d ...

2.17 {- Prelude.last -- | Extract the last element of a list, which must be finite and non-empty. last :: [a] -&...