<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>zehnpaard</author_name>
  <author_url>https://blog.hatena.ne.jp/zehnpaard/</author_url>
  <blog_title>Arantium Maestum</blog_title>
  <blog_url>https://zehnpaard.hatenablog.com/</blog_url>
  <categories>
    <anon>Haskell</anon>
    <anon>Thinking Functionally with Haskell</anon>
  </categories>
  <description>Exercise F 第一部 任意の有限リストxsについて、以下の等式が成り立つことを証明せよ： foldl f e xs = foldr (flip f) e (reverse xs) 帰納法で解く。 Case [] 左辺 foldl f e [] = {foldlの定義} e Case [] 右辺 foldr (flip f) e (reverse []) = {reverse [] = []} foldr (flip f) e [] = {foldrの定義} e Case []は証明できた。 Case x:xs 左辺 foldl f e (x:xs) = {foldlの定義} foldl…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fzehnpaard.hatenablog.com%2Fentry%2F2018%2F03%2F28%2F210425&quot; title=&quot;Thinking Functionally with Haskell勉強メモ: 第６章問題２ - Arantium Maestum&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>https://chart.apis.google.com/chart?cht=tx&amp;chl=%7B%5Csum_%7Bn%3D0%7D%5E%7B%5Cinfty%7D%20%5Cfrac%7B1%7D%7Bn%21%7D%20%3D%20e%7D</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2018-03-28 21:04:25</published>
  <title>Thinking Functionally with Haskell勉強メモ: 第６章問題２</title>
  <type>rich</type>
  <url>https://zehnpaard.hatenablog.com/entry/2018/03/28/210425</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
