Tech Tips

  1. 未分類
  2. 34 view

[Haskell]Banana-Split Law part1

What I want to do

I want to implement an example of banana-split law.


I didn’t know how to ouptut tuple with foldr, I quited to implement it.
After following implementation, collecting foldr for only one makes the script be an example of banana-split law.
-- Before
sum' = foldr (\x xs -> x + xs) 0
length' = foldr (\x n -> 1 + n) 0
average ls = sum' ls / length' ls

-- After
average' ls = s / l
        (s, l) = ((foldr (\x xs -> x + xs) 0) ls, (foldr (\x n -> 1 + n) 0) ls)


After all, I’ll run the script.
Prelude> :load banana-strip.hs
Main> average' [1,2,3,4,5]

未分類 recent post

  1. Install sbt 1.0.0 and run sample template

  2. Visualization of Neural Network and its Train…

  3. [Machine Learning]Created docker image includ…

  4. [Node.js]How to write batch script with Node.…

  5. Web Server Contribution by Vagrant and Ansibl…