<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Fsharp on Scholion</title><link>https://scholion.thluiz.com/tags/fsharp/</link><description>Recent content in Fsharp on Scholion</description><generator>Hugo -- gohugo.io</generator><language>pt-BR</language><copyright>© 2026</copyright><lastBuildDate>Wed, 23 Sep 2026 20:10:34 +0100</lastBuildDate><atom:link href="https://scholion.thluiz.com/tags/fsharp/index.xml" rel="self" type="application/rss+xml"/><item><title>Domain-Driven Design meets Functional Programming</title><link>https://scholion.thluiz.com/notes/domain-driven-design-meets-functional-programming-scott-wlaschin/</link><pubDate>Wed, 23 Sep 2026 18:41:21 +0100</pubDate><guid>https://scholion.thluiz.com/notes/domain-driven-design-meets-functional-programming-scott-wlaschin/</guid><description>Interview with Scott Wlaschin on why DDD&amp;rsquo;s demand for composable, autonomous subsystems fits functional programming better than OO does in practice.</description></item><item><title>O(n) Solution to the Multiply Others Problem in F#</title><link>https://scholion.thluiz.com/notes/o-n-solution-multiply-others-problem-fsharp/</link><pubDate>Wed, 23 Sep 2026 17:11:13 +0100</pubDate><guid>https://scholion.thluiz.com/notes/o-n-solution-multiply-others-problem-fsharp/</guid><description>Yan Cui walks through a division-free, O(n) F# solution to the classic interview question of multiplying every array element except itself.</description></item></channel></rss>