{"published":"2013-09-05 18:49:37","author_url":"https://blog.hatena.ne.jp/Kureduki_Maari/","description":"Clojure\u306eloop-recur\u3092\u3001Ruby\u3067\u3084\u3063\u305f\u3002Elixir\u306e\u53e4\u3044version\u306b\u3082\u6709\u3063\u305f\u3089\u3057\u3044\u3002 \u672b\u5c3e\u518d\u5e30\u306e\u6700\u9069\u5316 (TCO, tail call optimization) \u304c\u51fa\u6765\u306a\u3044system\u3060\u3068\u3001\u52a9\u304b\u308b\u307f\u305f\u3044\u3002Ruby 2.0.0\u3068\u304bClojure\u307f\u305f\u3044\u306a\u3002 def factorial n cloop n, 1 do |n, acc| if n == 0 acc else recur n - 1, acc * n end end end \u307f\u305f\u3044\u306b\u4f7f\u3075\u3002 instance_eval\u3057\u304b\u77e5\u3089\u306a\u304f\u3066\u3001instance_exec\u3092\u898b\u9644\u3051\u51fa\u3059\u306e\u306b\u4e00\u756a\u6642\u9593\u304c\u639b\u3063\u305f\u3002\u30a2\u30db\u3060\u3002Ruby\u3060\u3068\u2026","categories":["Programming","Ruby","Clojure"],"provider_name":"Hatena Blog","blog_url":"https://c4se.hatenablog.com/","blog_title":"c4se\u8a18\uff1a\u3055\u3063\u3061\u3083\u3093\u3067\u3059\u3088\u2606","height":"190","author_name":"Kureduki_Maari","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fc4se.hatenablog.com%2Fentry%2F2013%2F09%2F05%2F184937\" title=\"Ruby\u3067Clojure\u98a8loop-recur (\u672b\u5c3e\u518d\u5e30) - c4se\u8a18\uff1a\u3055\u3063\u3061\u3083\u3093\u3067\u3059\u3088\u2606\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","url":"https://c4se.hatenablog.com/entry/2013/09/05/184937","width":"100%","type":"rich","provider_url":"https://hatena.blog","version":"1.0","title":"Ruby\u3067Clojure\u98a8loop-recur (\u672b\u5c3e\u518d\u5e30)","image_url":null}