{"title":"Programing in Haskell Chapter6 / Recursive Functions","author_url":"https://blog.hatena.ne.jp/yokotaso/","height":"190","width":"100%","image_url":null,"author_name":"yokotaso","url":"https://yokotaso.hatenadiary.org/entry/20120503/1336033567","categories":["Haskell"],"published":"2012-05-03 17:26:07","blog_title":"(\u30ab\u30c1\u30e3\u30ab\u30c1\u30e3\u30ab\u30c1\u30e3\u2026)\u3000(\u30c3\u30bf\u30fc\u30f3\uff01)","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyokotaso.hatenadiary.org%2Fentry%2F20120503%2F1336033567\" title=\"Programing in Haskell Chapter6 / Recursive Functions - (\u30ab\u30c1\u30e3\u30ab\u30c1\u30e3\u30ab\u30c1\u30e3\u2026)\u3000(\u30c3\u30bf\u30fc\u30f3\uff01)\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","provider_url":"https://hatena.blog","blog_url":"https://yokotaso.hatenadiary.org/","description":"\u518d\u8d77\u95a2\u6570 Programing in Haskell(http://www.amazon.co.jp/dp/0521692695) P.48-60 \u74b0\u5883\u304cHaskell98\u3067\u306f\u306a\u304fHaskell2010\u306a\u306e\u3067\u3001\u3061\u3087\u3063\u3068\u9055\u3046\u3068\u3053\u308d\u3082\u3042\u308a\u307e\u3059\u3002 (n+K) matching\u3068\u3044\u3046\u6a5f\u80fd\u304cHaskell2010\u3060\u3068\u629c\u3051\u3066\u3044\u307e\u3059\u3002*1 \u3046\u307e\u304f\u3044\u304b\u306a\u3044\u3068\u3053\u308d\u306f\u3001guard\u3059\u308b\u306a\u308amatching\u3059\u308b\u306a\u308a\u3067\u5bfe\u5fdc\u3057\u3066\u307e\u3059 -- ** \u306e\u518d\u5b9a\u7fa9 1 pow :: Int -> Int -> Int pow n m | m > 0 = n * (pow n (m - 1)) | otherwise = 1 -- \u2026","version":"1.0"}