<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>hindley-milner on Sparse Notes</title>
    <link>https://sparsenotes.com/tags/hindley-milner/</link>
    <description>Recent content in hindley-milner on Sparse Notes</description>
    <image>
      <url>https://sparsenotes.com/images/og-default.png</url>
      <link>https://sparsenotes.com/images/og-default.png</link>
    </image>
    <generator>Hugo -- gohugo.io</generator>
    <lastBuildDate>Sat, 31 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sparsenotes.com/tags/hindley-milner/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>A Theory of Type Polymorphism in Programming (Milner, 1978)</title>
      <link>https://sparsenotes.com/posts/2026/10/papers/milner-theory-of-type-polymorphism-1978/</link>
      <pubDate>Sat, 31 Oct 2026 00:00:00 +0000</pubDate>
      
      <guid>https://sparsenotes.com/posts/2026/10/papers/milner-theory-of-type-polymorphism-1978/</guid>
      <description>Seminal paper of the week: Robin Milner gave ML a type system in which programmers write no type annotations, the compiler infers the most general type for every expression, and well-typed programs provably cannot go wrong. Algorithm W and let-polymorphism are still the core of OCaml, Haskell and F#, and the template for inference in Rust and Swift.</description>
    </item>
    
  </channel>
</rss>
