<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Ocaml on Home</title>
    <link>https://blog.rafaelfernandez.dev/tags/ocaml/</link>
    <description>Recent content in Ocaml on Home</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <copyright>© 2026 Rafael Fernandez</copyright>
    <lastBuildDate>Mon, 16 Mar 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.rafaelfernandez.dev/tags/ocaml/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Making Invalid States Unrepresentable 2: The algebra behind your types</title>
      <link>https://blog.rafaelfernandez.dev/posts/making-invalid-states-unrepresentable-2-algebra-behind-types/</link>
      <pubDate>Mon, 16 Mar 2026 00:00:00 +0000</pubDate>
      
      <guid>https://blog.rafaelfernandez.dev/posts/making-invalid-states-unrepresentable-2-algebra-behind-types/</guid>
      <description>Types are called algebraic because they obey arithmetic. Product types multiply, sum types add. Understanding this arithmetic explains why an enum with 5 variants is infinitely more precise than 4 boolean flags.</description>
      
    </item>
    
  </channel>
</rss>
