Software developer focused mainly on F#, with a passion for functional programming, problem solving, efficient algorithms and programming languages.
I have a strong computer science background, focused mainly in graph theory and graph algorithms; also was intrigued by data structures, complexity, and computability theory. Experienced with backend F# programming.
I worked with mathematical optimization (mixed integer programming) and use of statistical methods as well.
I contributed to several open source F# projects, mostly around developer tooling.
Nothing here yet.
May 30, 2024 · 3 min read · Caching the results of asynchronous functions is a common task. Can we use memoize for it? Let's find out! Memoized Task Surprisingly, task works great with the basic memoize function from Tip #14. If we use a function that returns Task<_>, we get a ...
BRuben commented
May 16, 2024 · 3 min read · I recently encountered a bug that was caused by a special equality definition on a NaN value. NaN means not-a-number, and it's special floating-point number value, representing result of impossible operation. This issue shows how NaN can introduce ha...
Join discussion
May 9, 2024 · 3 min read · Memoization of a recursive function can be often useful, but has some pitfalls compared to memoization of a simple function. Let's take a detailed look. Standard Memoization Let's use the classical example of computing the n-th item in the Fibonacci ...
Join discussion
Apr 25, 2024 · 4 min read · The memoize function is my favorite method for solving performance problems. Its significant advantage is that it requires only a slight change in code, which doesn't increase the complexity of the original code. Despite its short implementation, it ...
Join discussion
Apr 18, 2024 · 3 min read · Using operators like =, +, && or |> is daily bread of writing F#. Let's look at how they work under the hood. Operator is a function Every operator can be used as standard function by enclosing it in parentheses, for example (+) 1 2 is the same as 1...
Join discussion
