{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiad3hciduhl562js4ucbzimemp776ha6kakooycf7gv4p2yuzzelq",
    "uri": "at://did:plc:pi6woz4d47bkuws673w2il2r/app.bsky.feed.post/3mknoiiiz3tu2"
  },
  "path": "/t/why-microhs-uses-combinators/13992#post_7",
  "publishedAt": "2026-04-29T16:05:49.000Z",
  "site": "https://discourse.haskell.org",
  "tags": [
    "a paper"
  ],
  "textContent": "Not exponential but quadratic if you do it well. But yeah, that is still a disadvantage.\n\nOleg Kiselyov wrote a paper showing how to do it linearly by using bulk combinators but those are not technically a finite set of combinators and he compares to de bruijn indices using unary numbers which is also a bit sketchy. And I don’t think MicroHs uses this approach.",
  "title": "Why microhs uses combinators?"
}