Work in progress: 181,232 of 181,233 sites checked so far, more every week · updated 2 Nov 2026Missing a blog? Tell us

Top all-time · #23049

S

Shuang Rimu

Personal blog · shuangrimu.com/postsmathprogramming

Shuang Rimu's personal blog at shuangrimu.com covers math and programming. Since 2020, 3 different Hacker News readers have linked it 8 times, most often “A Language Agnostic Introduction to Dependent Types”. The last post was in 2021, but the archive is still widely read.

Visit the blog
8mentions?
3HN people?
2020–2022first – last linked?
Links on Hacker News per year · peak 4 in 2021

Most-linked posts?

  1. A Language Agnostic Introduction to Dependent Types
    2 people · 3 mentions · first linked 2021-10-02

What Hacker News says?

  1. Dependent types are not totally orthogonal of FP. They generally require immutability and function purity to work well and become extremely difficult to work with in the absence of those features. See e.g. https://shuangrimu.com/posts/language-agnostic-intro-to-depe...

    Comment linking /posts/language-agnostic-intro-to-dependent-types.html

    on “Functional programming is not popular because it is weird (2016)”
  2. Submitted A language agnostic introduction to dependent types as a story · 3 points

    HN discussion
  3. Dependent types aren't terribly complicated intrinsically, see e.g. https://shuangrimu.com/posts/language-agnostic-intro-to-depe... for one explanation of dependent pairs. Nor do I think the value of dependent types comes from proofs, which I agree are still too cumbersome to really use at a large scale for most codebases. My hypothesis for the sweet spot for dependent types is to express invariants, and then use ot…

    Comment linking /posts/language-agnostic-intro-to-dependent-types.html

    on “The λ-Cube”
  4. Submitted Extensible Unions Types in Elm as a story · 3 points

    HN discussion
  5. If Scala syntax is more up your alley, here's an intro to dependent types that has more Scala-esque syntax: https://shuangrimu.com/posts/language-agnostic-intro-to-depe... Scala has only a very limited version of dependent types. Even its "dependent function types" are a more restricted version of general dependent function types. Full dependent types can in a certain sense be even simpler than non-dependently-typed…

    Comment linking /posts/language-agnostic-intro-to-dependent-types.html

    on “Idris 2: Quantitative Type Theory in Practice”
  6. Submitted A Language Agnostic Introduction to Dependent Types as a story · 2 points

    HN discussion
  7. I find the often ML-inspired syntax too high of a bar for most programmers to clear when being introduced to a language. I think a syntax more similar to something like what is introduced here: https://shuangrimu.com/posts/language-agnostic-intro-to-depe... more accessible for a lot of programmers. I separately think that proofs are actually a bit overblown when it comes to dependent types and that dependent types a…

    Comment linking /posts/language-agnostic-intro-to-dependent-types.html

    on “A dependently typed language for proofs that you can implement in one day”
  8. Submitted Defining definable real numbers is hard (maybe every real number is definable) as a story · 1 points

    HN discussion

Search all of HN for shuangrimu.com

Linked by the same people?