{"provider_url":"https://hatena.blog","url":"https://mzp.hatenadiary.org/entry/20080806/list","categories":["Ocaml","30\u5206\u30d7\u30ed\u30b0\u30e9\u30e0"],"author_name":"mzp","image_url":"https://cdn-ak.d.st-hatena.com/diary/mzp/2008-08-06.jpg","description":"30\u5206\u30d7\u30ed\u30b0\u30e9\u30e0\u3001\u305d\u306e344\u3002\u6628\u65e5\u306b\u5f15\u304d\u7d9a\u304d\u3001http://www.haskell.org/ghc/docs/latest/html/libraries/base/Prelude.html\u306e\u95a2\u6570\u3092Ocaml\u306b\u79fb\u690d\u3002\u3053\u308c\u3067\u6700\u5f8c\u3002 \u4f7f\u3044\u65b9 # unzip [(1,2);(3,4)];; - : int list * int list = ([1; 3], [2; 4]) \u30bd\u30fc\u30b9\u30b3\u30fc\u30c9 let rec splitAt n xs = match n,xs with 0,_ | _,[] -> [],xs | _,y::ys -> let p,q = splitAt (n-1) ys in y::p,q\u2026","blog_title":"\u307f\u305a\u3074\u30fc\u65e5\u8a18","title":"Haskell\u306e\u30ea\u30b9\u30c8\u64cd\u4f5c\u3092OCaml\u306b\u79fb\u690d(3)","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmzp.hatenadiary.org%2Fentry%2F20080806%2Flist\" title=\"Haskell\u306e\u30ea\u30b9\u30c8\u64cd\u4f5c\u3092OCaml\u306b\u79fb\u690d(3) - \u307f\u305a\u3074\u30fc\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","type":"rich","version":"1.0","author_url":"https://blog.hatena.ne.jp/mzp/","blog_url":"https://mzp.hatenadiary.org/","provider_name":"Hatena Blog","published":"2008-08-06 00:00:00"}