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 · #11540

M

Michid's Weblog

Personal blog · michid.wordpress.comprogramming

Michid's Weblog is a personal blog at michid.wordpress.com about programming. Since 2008, 7 different Hacker News readers have linked it 7 times, most often “Scala type level encoding of the SKI calculus”. The last post was in 2011, but the archive is still widely read.

Visit the blog
7mentions?
7HN people?
2008–2021first – last linked?
Links on Hacker News per year · peak 2 in 2013

Too few sampled comments (5) to say how often HN recommends it.?

Why HN links it

HN readers link this blog's post on type-level encoding in Scala, which commenters cite as proof that Scala's type system is Turing complete. Comments cite it as a source rather than judging the writing.

Summarised by Claude from a sample of 5 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.

Hacking Scala

Most-linked posts?

  1. Scala type level encoding of the SKI calculus
    3 people · 3 mentions · first linked 2013-01-22
  2. /2010/01/29/scala-type-level-encoding-of-the-ski-calculus/
    3 people · 3 mentions · first linked 2015-03-17

What Hacker News says?

  1. > There are exceptions of course for a definition of "exceptions" being "virtually all languages with a non-trivial static type system and non-zero userbase" as shown in your link. Java ( https://arxiv.org/abs/1605.05274 ), C# ( https://blog.hediet.de/post/how-to-stress-the-csharp-compile... ), Scala ( https://michid.wordpress.com/2010/01/29/scala-type-level-enc... ), Haskell, Rust ( https://sdleffler.github.io/Rust…

    Comment linking /2010/01/29/scala-type-level-encoding-of-the-ski-calculus/

    on “Compiling Rust is NP-hard”
  2. Submitted Scala type level encoding of the SKI calculus as a story · 1 points

    HN discussion
  3. > but it's not true of generics in most languages not sure how true that is. * TypeScript: https://github.com/microsoft/TypeScript/issues/14833 * Rust: https://sdleffler.github.io/RustTypeSystemTuringComplete/ * Haskell (GHC): https://mail.haskell.org/pipermail/haskell/2006-August/01835... * Scala: https://michid.wordpress.com/2010/01/29/scala-type-level-enc... * Java: https://arxiv.org/abs/1605.05274

    Comment linking /2010/01/29/scala-type-level-encoding-of-the-ski-calculus/

    on “A Review of the Zig Programming Language (Using Advent of Code 2021)”
  4. Submitted Meta-Programming with Scala: Conditional Compilation and Loop Unrolling as a story · 1 points

    HN discussion
  5. Here is a proof that the Scala type system is actually Turing complete: https://michid.wordpress.com/2010/01/29/scala-type-level-enc... I can't comment on the details, I'm more of of Clojure guy.

    Comment linking /2010/01/29/scala-type-level-encoding-of-the-ski-calculus/

    on “Scala: Where it came from, Where it's going”
  6. Also: * Little Big Planet [1] * Scala's type system [2] [1] http://forums.xkcd.com/viewtopic.php?f=12&t=57034#p2029587 [2] http://michid.wordpress.com/2010/01/29/scala-type-level-enco...

    Comment linking /2010/01/29/scala-type-level-encoding-of-the-ski-calculus/

    on “Accidentally Turing-Complete”
  7. It's not the only one by any means. E.g. scala's type system is turing complete - http://michid.wordpress.com/2010/01/29/scala-type-level-enco...

    Comment linking /2010/01/29/scala-type-level-encoding-of-the-ski-calculus/

    on “Extension Points, or how OCaml is becoming more like Lisp”

Search all of HN for michid.wordpress.com

Linked by the same people?