<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>espio999</author_name>
  <author_url>https://blog.hatena.ne.jp/espio999/</author_url>
  <blog_title>Technically Impossible</blog_title>
  <blog_url>https://impsbl.hatenablog.jp/</blog_url>
  <categories>
    <anon>English post</anon>
    <anon>F#</anon>
    <anon>IT</anon>
  </categories>
  <description>A classic topic often mentioned along with recursive processing in F# is memoization. A common discussion is about memoizing the function itself, rather than the process of calculating Fibonacci numbers. Yesterday's topic *1 referred to the former. Today's topic is about the latter.If you write code…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fimpsbl.hatenablog.jp%2Fentry%2FMemoizationInFsharp_en&quot; title=&quot;Memoization in F# - closures, thread-safety, and handling Multiple Arguments - Technically Impossible&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://cdn-ak.f.st-hatena.com/images/fotolife/e/espio999/20240724/20240724000147.png</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2025-03-04 00:00:00</published>
  <title>Memoization in F# - closures, thread-safety, and handling Multiple Arguments</title>
  <type>rich</type>
  <url>https://impsbl.hatenablog.jp/entry/MemoizationInFsharp_en</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
