{"type":"rich","blog_url":"https://impsbl.hatenablog.jp/","author_url":"https://blog.hatena.ne.jp/espio999/","categories":["English post","F#","IT"],"title":"Memoization in F# - closures, thread-safety, and handling Multiple Arguments","image_url":"https://cdn-ak.f.st-hatena.com/images/fotolife/e/espio999/20240724/20240724000147.png","author_name":"espio999","width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fimpsbl.hatenablog.jp%2Fentry%2FMemoizationInFsharp_en\" title=\"Memoization in F# - closures, thread-safety, and handling Multiple Arguments - Technically Impossible\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","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\u2026","height":"190","version":"1.0","provider_name":"Hatena Blog","provider_url":"https://hatena.blog","url":"https://impsbl.hatenablog.jp/entry/MemoizationInFsharp_en","published":"2025-03-04 00:00:00","blog_title":"Technically Impossible"}