{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreigp2vyn3ehaajpiepujqge2twrb36bn5whvw4jghphmsfa3szzyni",
    "uri": "at://did:plc:pi6woz4d47bkuws673w2il2r/app.bsky.feed.post/3mjucsh6iync2"
  },
  "path": "/t/lawvere-theories/13944#post_12",
  "publishedAt": "2026-04-19T15:41:33.000Z",
  "site": "https://discourse.haskell.org",
  "textContent": "While you can write the `Infinity` with undecidable instances, I’m pretty sure that using it anywhere in your code will throw the type checker into an infinite loop. One comment I recall, which showed how data families can be used to the same effect as my `Stuck` said\n\n> That’s a good reminder that pattern matching on types is never total.\n\nSorry, I’m on my phone so this comment might be a bit unreadable.",
  "title": "Lawvere theories"
}