<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>iriya_ufo</author_name>
  <author_url>https://blog.hatena.ne.jp/iriya_ufo/</author_url>
  <blog_title>iriya_ufo’s blog</blog_title>
  <blog_url>https://iriya-ufo.hateblo.jp/</blog_url>
  <categories>
    <anon>問題</anon>
  </categories>
  <description>「プログラミング言語 SCHEME」より以下4つのプロシージャーにおいて，どれが末尾再帰でどれがそうでないかを説明せよ． factorial1 (define factorial1 (lambda (n) (let fact ((i n)) (if (= i 0) 1 (* i (fact (- i 1))))))) factorial2 (define factorial2 (lambda (n) (let fact ((i n) (a 1)) (if (= i 0) a (fact (- i 1) (* a i)))))) fibonacci1 (define fibonacci1 (la…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Firiya-ufo.hateblo.jp%2Fentry%2F20070921%2F1190348475&quot; title=&quot; 末尾再帰 - iriya_ufo’s blog&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2007-09-21 13:21:15</published>
  <title> 末尾再帰</title>
  <type>rich</type>
  <url>https://iriya-ufo.hateblo.jp/entry/20070921/1190348475</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
