{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreien3rfqnk5ktlbvc5b2xua76umhtp3vv35lfwgvuqmyyrh6ixcx2q",
    "uri": "at://did:plc:pi6woz4d47bkuws673w2il2r/app.bsky.feed.post/3mkuzx6yglt22"
  },
  "path": "/t/why-microhs-uses-combinators/13992#post_11",
  "publishedAt": "2026-05-02T15:53:51.000Z",
  "site": "https://discourse.haskell.org",
  "textContent": "The combinator reduction code fits on a screen. The other 7000 lines are primitives you need no matter what.\n\nIf you want to experiment, you can get the lambda expressions from the compiler, before the bracket abstraction has run. You only need to implement lambda calculus + int arithmetic to run simple programs.",
  "title": "Why microhs uses combinators?"
}